./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/locks/test_locks_5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d28fd50bd3f7e49bee026aec860ad9015a4fdfba ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:14:22,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:14:22,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:14:22,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:14:22,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:14:22,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:14:22,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:14:22,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:14:22,718 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:14:22,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:14:22,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:14:22,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:14:22,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:14:22,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:14:22,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:14:22,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:14:22,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:14:22,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:14:22,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:14:22,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:14:22,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:14:22,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:14:22,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:14:22,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:14:22,749 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:14:22,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:14:22,749 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:14:22,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:14:22,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:14:22,751 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:14:22,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:14:22,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:14:22,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:14:22,754 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:14:22,755 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:14:22,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:14:22,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:14:22,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:14:22,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:14:22,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:14:22,757 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:14:22,758 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 20:14:22,786 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:14:22,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:14:22,787 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:14:22,787 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:14:22,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:14:22,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:14:22,789 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:14:22,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:14:22,789 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:14:22,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:14:22,790 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:14:22,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:14:22,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:14:22,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:14:22,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:14:22,791 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:14:22,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:14:22,791 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:14:22,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:14:22,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:14:22,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:14:22,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:14:22,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:14:22,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:14:22,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:14:22,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:14:22,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:14:22,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:14:22,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:14:22,793 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:14:22,793 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d28fd50bd3f7e49bee026aec860ad9015a4fdfba [2021-08-25 20:14:23,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:14:23,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:14:23,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:14:23,098 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:14:23,098 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:14:23,099 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_5.c [2021-08-25 20:14:23,162 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27994efb1/fb63e74e38524d31a91ba5dc7576ba04/FLAG0a67693f0 [2021-08-25 20:14:23,534 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:14:23,535 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c [2021-08-25 20:14:23,540 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27994efb1/fb63e74e38524d31a91ba5dc7576ba04/FLAG0a67693f0 [2021-08-25 20:14:23,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27994efb1/fb63e74e38524d31a91ba5dc7576ba04 [2021-08-25 20:14:23,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:14:23,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:14:23,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:14:23,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:14:23,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:14:23,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:14:23" (1/1) ... [2021-08-25 20:14:23,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72f74293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:23, skipping insertion in model container [2021-08-25 20:14:23,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:14:23" (1/1) ... [2021-08-25 20:14:23,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:14:23,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:14:23,702 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c[2207,2220] [2021-08-25 20:14:23,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:14:23,712 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:14:23,726 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c[2207,2220] [2021-08-25 20:14:23,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:14:23,756 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:14:23,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:23 WrapperNode [2021-08-25 20:14:23,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:14:23,774 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:14:23,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:14:23,775 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:14:23,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:23" (1/1) ... [2021-08-25 20:14:23,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:23" (1/1) ... [2021-08-25 20:14:23,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:14:23,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:14:23,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:14:23,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:14:23,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:23" (1/1) ... [2021-08-25 20:14:23,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:23" (1/1) ... [2021-08-25 20:14:23,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:23" (1/1) ... [2021-08-25 20:14:23,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:23" (1/1) ... [2021-08-25 20:14:23,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:23" (1/1) ... [2021-08-25 20:14:23,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:23" (1/1) ... [2021-08-25 20:14:23,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:23" (1/1) ... [2021-08-25 20:14:23,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:14:23,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:14:23,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:14:23,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:14:23,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:23" (1/1) ... [2021-08-25 20:14:23,851 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:14:23,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:14:23,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:14:23,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:14:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:14:23,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:14:23,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:14:23,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:14:24,173 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:14:24,179 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-25 20:14:24,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:14:24 BoogieIcfgContainer [2021-08-25 20:14:24,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:14:24,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:14:24,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:14:24,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:14:24,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:14:23" (1/3) ... [2021-08-25 20:14:24,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c15042b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:14:24, skipping insertion in model container [2021-08-25 20:14:24,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:14:23" (2/3) ... [2021-08-25 20:14:24,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c15042b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:14:24, skipping insertion in model container [2021-08-25 20:14:24,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:14:24" (3/3) ... [2021-08-25 20:14:24,197 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2021-08-25 20:14:24,213 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:14:24,213 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:14:24,256 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:14:24,265 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:14:24,265 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:14:24,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.826086956521739) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:24,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-25 20:14:24,280 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:24,280 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:24,281 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:24,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:24,288 INFO L82 PathProgramCache]: Analyzing trace with hash -161811697, now seen corresponding path program 1 times [2021-08-25 20:14:24,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:24,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915333844] [2021-08-25 20:14:24,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:24,295 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:24,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:24,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915333844] [2021-08-25 20:14:24,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915333844] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:24,466 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:24,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:24,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248760718] [2021-08-25 20:14:24,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:24,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:24,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:24,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:24,498 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.826086956521739) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:24,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:24,530 INFO L93 Difference]: Finished difference Result 53 states and 85 transitions. [2021-08-25 20:14:24,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:24,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-25 20:14:24,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:24,539 INFO L225 Difference]: With dead ends: 53 [2021-08-25 20:14:24,540 INFO L226 Difference]: Without dead ends: 39 [2021-08-25 20:14:24,542 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:24,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-08-25 20:14:24,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2021-08-25 20:14:24,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 26 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2021-08-25 20:14:24,569 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 12 [2021-08-25 20:14:24,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:24,570 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 46 transitions. [2021-08-25 20:14:24,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:24,570 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2021-08-25 20:14:24,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-25 20:14:24,571 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:24,571 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:24,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:14:24,572 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:24,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:24,572 INFO L82 PathProgramCache]: Analyzing trace with hash -971158323, now seen corresponding path program 1 times [2021-08-25 20:14:24,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:24,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155076185] [2021-08-25 20:14:24,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:24,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:24,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:24,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155076185] [2021-08-25 20:14:24,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155076185] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:24,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:24,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:24,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416115508] [2021-08-25 20:14:24,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:24,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:24,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:24,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:24,631 INFO L87 Difference]: Start difference. First operand 27 states and 46 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:24,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:24,655 INFO L93 Difference]: Finished difference Result 64 states and 109 transitions. [2021-08-25 20:14:24,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:24,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-25 20:14:24,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:24,658 INFO L225 Difference]: With dead ends: 64 [2021-08-25 20:14:24,658 INFO L226 Difference]: Without dead ends: 39 [2021-08-25 20:14:24,659 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:24,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-08-25 20:14:24,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2021-08-25 20:14:24,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 36 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 62 transitions. [2021-08-25 20:14:24,668 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 62 transitions. Word has length 12 [2021-08-25 20:14:24,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:24,668 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 62 transitions. [2021-08-25 20:14:24,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:24,669 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 62 transitions. [2021-08-25 20:14:24,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-25 20:14:24,670 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:24,670 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:24,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:14:24,671 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:24,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:24,677 INFO L82 PathProgramCache]: Analyzing trace with hash -720980343, now seen corresponding path program 1 times [2021-08-25 20:14:24,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:24,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329719684] [2021-08-25 20:14:24,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:24,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:24,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:24,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:24,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329719684] [2021-08-25 20:14:24,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329719684] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:24,725 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:24,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:24,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369696361] [2021-08-25 20:14:24,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:24,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:24,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:24,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:24,727 INFO L87 Difference]: Start difference. First operand 37 states and 62 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:24,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:24,746 INFO L93 Difference]: Finished difference Result 60 states and 96 transitions. [2021-08-25 20:14:24,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:24,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-25 20:14:24,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:24,748 INFO L225 Difference]: With dead ends: 60 [2021-08-25 20:14:24,748 INFO L226 Difference]: Without dead ends: 42 [2021-08-25 20:14:24,748 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:24,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-08-25 20:14:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2021-08-25 20:14:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:24,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 64 transitions. [2021-08-25 20:14:24,752 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 64 transitions. Word has length 13 [2021-08-25 20:14:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:24,753 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 64 transitions. [2021-08-25 20:14:24,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:24,753 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 64 transitions. [2021-08-25 20:14:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-25 20:14:24,754 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:24,754 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:24,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:14:24,754 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:24,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:24,755 INFO L82 PathProgramCache]: Analyzing trace with hash -40921973, now seen corresponding path program 1 times [2021-08-25 20:14:24,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:24,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433205589] [2021-08-25 20:14:24,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:24,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:24,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:24,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433205589] [2021-08-25 20:14:24,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433205589] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:24,787 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:24,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:24,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011731523] [2021-08-25 20:14:24,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:24,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:24,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:24,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:24,789 INFO L87 Difference]: Start difference. First operand 40 states and 64 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:24,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:24,804 INFO L93 Difference]: Finished difference Result 73 states and 117 transitions. [2021-08-25 20:14:24,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:24,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-25 20:14:24,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:24,806 INFO L225 Difference]: With dead ends: 73 [2021-08-25 20:14:24,806 INFO L226 Difference]: Without dead ends: 71 [2021-08-25 20:14:24,806 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:24,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-08-25 20:14:24,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2021-08-25 20:14:24,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 52 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:24,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 85 transitions. [2021-08-25 20:14:24,812 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 85 transitions. Word has length 13 [2021-08-25 20:14:24,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:24,813 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 85 transitions. [2021-08-25 20:14:24,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:24,813 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 85 transitions. [2021-08-25 20:14:24,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-25 20:14:24,814 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:24,814 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:24,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:14:24,814 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:24,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:24,815 INFO L82 PathProgramCache]: Analyzing trace with hash -850268599, now seen corresponding path program 1 times [2021-08-25 20:14:24,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:24,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722946122] [2021-08-25 20:14:24,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:24,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:24,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:24,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722946122] [2021-08-25 20:14:24,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722946122] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:24,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:24,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:24,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558940408] [2021-08-25 20:14:24,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:24,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:24,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:24,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:24,847 INFO L87 Difference]: Start difference. First operand 53 states and 85 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:24,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:24,882 INFO L93 Difference]: Finished difference Result 121 states and 195 transitions. [2021-08-25 20:14:24,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:24,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-25 20:14:24,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:24,884 INFO L225 Difference]: With dead ends: 121 [2021-08-25 20:14:24,885 INFO L226 Difference]: Without dead ends: 73 [2021-08-25 20:14:24,885 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:24,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-08-25 20:14:24,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2021-08-25 20:14:24,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 70 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions. [2021-08-25 20:14:24,894 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 13 [2021-08-25 20:14:24,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:24,894 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 111 transitions. [2021-08-25 20:14:24,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 111 transitions. [2021-08-25 20:14:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-25 20:14:24,895 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:24,896 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:24,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:14:24,896 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:24,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:24,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1268365854, now seen corresponding path program 1 times [2021-08-25 20:14:24,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:24,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544365978] [2021-08-25 20:14:24,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:24,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:24,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:24,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:24,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544365978] [2021-08-25 20:14:24,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544365978] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:24,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:24,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:24,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170710743] [2021-08-25 20:14:24,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:24,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:24,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:24,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:24,940 INFO L87 Difference]: Start difference. First operand 71 states and 111 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:24,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:24,951 INFO L93 Difference]: Finished difference Result 108 states and 166 transitions. [2021-08-25 20:14:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:24,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-25 20:14:24,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:24,952 INFO L225 Difference]: With dead ends: 108 [2021-08-25 20:14:24,952 INFO L226 Difference]: Without dead ends: 75 [2021-08-25 20:14:24,952 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-08-25 20:14:24,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2021-08-25 20:14:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 72 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:24,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2021-08-25 20:14:24,965 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 14 [2021-08-25 20:14:24,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:24,965 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2021-08-25 20:14:24,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:24,966 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2021-08-25 20:14:24,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-25 20:14:24,966 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:24,966 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:24,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:14:24,967 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:24,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:24,967 INFO L82 PathProgramCache]: Analyzing trace with hash -588307484, now seen corresponding path program 1 times [2021-08-25 20:14:24,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:24,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602845828] [2021-08-25 20:14:24,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:24,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:25,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:25,018 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602845828] [2021-08-25 20:14:25,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602845828] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:25,018 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:25,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:25,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745323095] [2021-08-25 20:14:25,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:25,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:25,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:25,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:25,020 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:25,049 INFO L93 Difference]: Finished difference Result 201 states and 305 transitions. [2021-08-25 20:14:25,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:25,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-25 20:14:25,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:25,050 INFO L225 Difference]: With dead ends: 201 [2021-08-25 20:14:25,051 INFO L226 Difference]: Without dead ends: 135 [2021-08-25 20:14:25,051 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:25,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-08-25 20:14:25,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2021-08-25 20:14:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.4772727272727273) internal successors, (195), 132 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 195 transitions. [2021-08-25 20:14:25,069 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 195 transitions. Word has length 14 [2021-08-25 20:14:25,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:25,070 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 195 transitions. [2021-08-25 20:14:25,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 195 transitions. [2021-08-25 20:14:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-25 20:14:25,072 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:25,072 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:25,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:14:25,072 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:25,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:25,073 INFO L82 PathProgramCache]: Analyzing trace with hash 221039142, now seen corresponding path program 1 times [2021-08-25 20:14:25,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:25,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582251068] [2021-08-25 20:14:25,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:25,074 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:25,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:25,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:25,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582251068] [2021-08-25 20:14:25,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582251068] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:25,115 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:25,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:25,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108109835] [2021-08-25 20:14:25,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:25,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:25,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:25,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:25,117 INFO L87 Difference]: Start difference. First operand 133 states and 195 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:25,131 INFO L93 Difference]: Finished difference Result 161 states and 237 transitions. [2021-08-25 20:14:25,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:25,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-25 20:14:25,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:25,134 INFO L225 Difference]: With dead ends: 161 [2021-08-25 20:14:25,135 INFO L226 Difference]: Without dead ends: 159 [2021-08-25 20:14:25,135 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:25,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-08-25 20:14:25,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133. [2021-08-25 20:14:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.446969696969697) internal successors, (191), 132 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2021-08-25 20:14:25,147 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 14 [2021-08-25 20:14:25,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:25,148 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2021-08-25 20:14:25,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2021-08-25 20:14:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-25 20:14:25,149 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:25,149 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:25,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:14:25,149 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:25,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:25,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1057447170, now seen corresponding path program 1 times [2021-08-25 20:14:25,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:25,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806938007] [2021-08-25 20:14:25,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:25,151 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:25,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:25,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806938007] [2021-08-25 20:14:25,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806938007] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:25,177 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:25,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:25,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949195226] [2021-08-25 20:14:25,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:25,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:25,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:25,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:25,179 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:25,196 INFO L93 Difference]: Finished difference Result 229 states and 329 transitions. [2021-08-25 20:14:25,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:25,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-25 20:14:25,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:25,198 INFO L225 Difference]: With dead ends: 229 [2021-08-25 20:14:25,198 INFO L226 Difference]: Without dead ends: 227 [2021-08-25 20:14:25,199 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:25,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-08-25 20:14:25,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 193. [2021-08-25 20:14:25,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.4114583333333333) internal successors, (271), 192 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 271 transitions. [2021-08-25 20:14:25,207 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 271 transitions. Word has length 15 [2021-08-25 20:14:25,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:25,208 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 271 transitions. [2021-08-25 20:14:25,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,208 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 271 transitions. [2021-08-25 20:14:25,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-25 20:14:25,209 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:25,209 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:25,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:14:25,210 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:25,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:25,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1866793796, now seen corresponding path program 1 times [2021-08-25 20:14:25,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:25,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847688279] [2021-08-25 20:14:25,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:25,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:25,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:25,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:25,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847688279] [2021-08-25 20:14:25,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847688279] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:25,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:25,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:25,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675715348] [2021-08-25 20:14:25,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:25,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:25,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:25,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:25,244 INFO L87 Difference]: Start difference. First operand 193 states and 271 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:25,261 INFO L93 Difference]: Finished difference Result 437 states and 609 transitions. [2021-08-25 20:14:25,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:25,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-25 20:14:25,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:25,263 INFO L225 Difference]: With dead ends: 437 [2021-08-25 20:14:25,263 INFO L226 Difference]: Without dead ends: 251 [2021-08-25 20:14:25,264 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:25,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-08-25 20:14:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2021-08-25 20:14:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.3346774193548387) internal successors, (331), 248 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 331 transitions. [2021-08-25 20:14:25,274 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 331 transitions. Word has length 15 [2021-08-25 20:14:25,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:25,275 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 331 transitions. [2021-08-25 20:14:25,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 331 transitions. [2021-08-25 20:14:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-25 20:14:25,276 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:25,276 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:25,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:14:25,277 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:25,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1579092089, now seen corresponding path program 1 times [2021-08-25 20:14:25,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:25,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66097032] [2021-08-25 20:14:25,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:25,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:25,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:25,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:25,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66097032] [2021-08-25 20:14:25,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66097032] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:25,306 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:25,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:25,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464423531] [2021-08-25 20:14:25,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:25,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:25,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:25,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:25,308 INFO L87 Difference]: Start difference. First operand 249 states and 331 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:25,324 INFO L93 Difference]: Finished difference Result 381 states and 505 transitions. [2021-08-25 20:14:25,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:25,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-08-25 20:14:25,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:25,326 INFO L225 Difference]: With dead ends: 381 [2021-08-25 20:14:25,326 INFO L226 Difference]: Without dead ends: 263 [2021-08-25 20:14:25,327 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:25,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-08-25 20:14:25,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2021-08-25 20:14:25,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.3038461538461539) internal successors, (339), 260 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 339 transitions. [2021-08-25 20:14:25,336 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 339 transitions. Word has length 16 [2021-08-25 20:14:25,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:25,336 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 339 transitions. [2021-08-25 20:14:25,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,337 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 339 transitions. [2021-08-25 20:14:25,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-25 20:14:25,338 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:25,338 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:25,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:14:25,338 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:25,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:25,339 INFO L82 PathProgramCache]: Analyzing trace with hash -2035816837, now seen corresponding path program 1 times [2021-08-25 20:14:25,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:25,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363311263] [2021-08-25 20:14:25,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:25,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:25,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:25,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363311263] [2021-08-25 20:14:25,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363311263] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:25,364 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:25,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:25,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936031867] [2021-08-25 20:14:25,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:25,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:25,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:25,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:25,366 INFO L87 Difference]: Start difference. First operand 261 states and 339 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:25,384 INFO L93 Difference]: Finished difference Result 423 states and 540 transitions. [2021-08-25 20:14:25,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:25,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-08-25 20:14:25,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:25,386 INFO L225 Difference]: With dead ends: 423 [2021-08-25 20:14:25,386 INFO L226 Difference]: Without dead ends: 421 [2021-08-25 20:14:25,387 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:25,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2021-08-25 20:14:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 389. [2021-08-25 20:14:25,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 1.2654639175257731) internal successors, (491), 388 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 491 transitions. [2021-08-25 20:14:25,405 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 491 transitions. Word has length 16 [2021-08-25 20:14:25,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:25,405 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 491 transitions. [2021-08-25 20:14:25,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,406 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 491 transitions. [2021-08-25 20:14:25,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-25 20:14:25,417 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:14:25,417 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:14:25,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:14:25,417 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:14:25,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:14:25,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1449803833, now seen corresponding path program 1 times [2021-08-25 20:14:25,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:14:25,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397594922] [2021-08-25 20:14:25,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:14:25,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:14:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:14:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:14:25,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:14:25,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397594922] [2021-08-25 20:14:25,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397594922] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:14:25,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:14:25,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:14:25,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837448993] [2021-08-25 20:14:25,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:14:25,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:14:25,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:14:25,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:25,455 INFO L87 Difference]: Start difference. First operand 389 states and 491 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:14:25,492 INFO L93 Difference]: Finished difference Result 853 states and 1051 transitions. [2021-08-25 20:14:25,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:14:25,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-08-25 20:14:25,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:14:25,493 INFO L225 Difference]: With dead ends: 853 [2021-08-25 20:14:25,493 INFO L226 Difference]: Without dead ends: 0 [2021-08-25 20:14:25,495 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:14:25,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-25 20:14:25,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-25 20:14:25,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-25 20:14:25,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2021-08-25 20:14:25,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:14:25,495 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-25 20:14:25,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:14:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-25 20:14:25,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-25 20:14:25,497 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:14:25,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:14:25,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-25 20:14:25,504 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:14:25,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:14:25,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:14:25,507 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:14:25,531 INFO L860 garLoopResultBuilder]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2021-08-25 20:14:25,531 INFO L857 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2021-08-25 20:14:25,532 INFO L857 garLoopResultBuilder]: For program point L65-1(lines 26 90) no Hoare annotation was computed. [2021-08-25 20:14:25,532 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-25 20:14:25,532 INFO L860 garLoopResultBuilder]: At program point L94(lines 6 95) the Hoare annotation is: true [2021-08-25 20:14:25,532 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-25 20:14:25,532 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-25 20:14:25,532 INFO L857 garLoopResultBuilder]: For program point L28(lines 28 30) no Hoare annotation was computed. [2021-08-25 20:14:25,532 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) no Hoare annotation was computed. [2021-08-25 20:14:25,532 INFO L857 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2021-08-25 20:14:25,532 INFO L853 garLoopResultBuilder]: At program point L86-1(lines 7 95) the Hoare annotation is: false [2021-08-25 20:14:25,533 INFO L857 garLoopResultBuilder]: For program point L70-1(lines 26 90) no Hoare annotation was computed. [2021-08-25 20:14:25,533 INFO L857 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2021-08-25 20:14:25,533 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-25 20:14:25,533 INFO L860 garLoopResultBuilder]: At program point L91(lines 7 95) the Hoare annotation is: true [2021-08-25 20:14:25,533 INFO L857 garLoopResultBuilder]: For program point L75-1(lines 26 90) no Hoare annotation was computed. [2021-08-25 20:14:25,533 INFO L857 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2021-08-25 20:14:25,533 INFO L857 garLoopResultBuilder]: For program point L59-1(lines 26 90) no Hoare annotation was computed. [2021-08-25 20:14:25,533 INFO L857 garLoopResultBuilder]: For program point L55-1(lines 26 90) no Hoare annotation was computed. [2021-08-25 20:14:25,533 INFO L857 garLoopResultBuilder]: For program point L51-1(lines 26 90) no Hoare annotation was computed. [2021-08-25 20:14:25,542 INFO L857 garLoopResultBuilder]: For program point L80-1(lines 26 90) no Hoare annotation was computed. [2021-08-25 20:14:25,542 INFO L857 garLoopResultBuilder]: For program point L47-1(lines 26 90) no Hoare annotation was computed. [2021-08-25 20:14:25,542 INFO L857 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2021-08-25 20:14:25,542 INFO L857 garLoopResultBuilder]: For program point L43(lines 43 45) no Hoare annotation was computed. [2021-08-25 20:14:25,542 INFO L857 garLoopResultBuilder]: For program point L43-2(lines 26 90) no Hoare annotation was computed. [2021-08-25 20:14:25,545 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:14:25,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:14:25 BoogieIcfgContainer [2021-08-25 20:14:25,553 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:14:25,554 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:14:25,554 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:14:25,554 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:14:25,554 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:14:24" (3/4) ... [2021-08-25 20:14:25,556 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-25 20:14:25,573 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-25 20:14:25,573 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-25 20:14:25,588 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:14:25,589 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:14:25,626 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:14:25,626 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:14:25,628 INFO L168 Benchmark]: Toolchain (without parser) took 2069.90 ms. Allocated memory was 54.5 MB in the beginning and 81.8 MB in the end (delta: 27.3 MB). Free memory was 32.0 MB in the beginning and 29.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 28.8 MB. Max. memory is 16.1 GB. [2021-08-25 20:14:25,628 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 36.9 MB in the end (delta: 37.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:14:25,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.91 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 31.7 MB in the beginning and 51.3 MB in the end (delta: -19.7 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:14:25,629 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.34 ms. Allocated memory is still 67.1 MB. Free memory was 51.3 MB in the beginning and 49.9 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:14:25,629 INFO L168 Benchmark]: Boogie Preprocessor took 32.81 ms. Allocated memory is still 67.1 MB. Free memory was 49.9 MB in the beginning and 48.8 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:14:25,630 INFO L168 Benchmark]: RCFGBuilder took 346.06 ms. Allocated memory is still 67.1 MB. Free memory was 48.6 MB in the beginning and 49.1 MB in the end (delta: -461.4 kB). Peak memory consumption was 17.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:14:25,630 INFO L168 Benchmark]: TraceAbstraction took 1361.42 ms. Allocated memory was 67.1 MB in the beginning and 81.8 MB in the end (delta: 14.7 MB). Free memory was 48.8 MB in the beginning and 32.2 MB in the end (delta: 16.5 MB). Peak memory consumption was 32.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:14:25,631 INFO L168 Benchmark]: Witness Printer took 72.72 ms. Allocated memory is still 81.8 MB. Free memory was 32.2 MB in the beginning and 29.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:14:25,632 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 36.9 MB in the end (delta: 37.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 214.91 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 31.7 MB in the beginning and 51.3 MB in the end (delta: -19.7 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 36.34 ms. Allocated memory is still 67.1 MB. Free memory was 51.3 MB in the beginning and 49.9 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 32.81 ms. Allocated memory is still 67.1 MB. Free memory was 49.9 MB in the beginning and 48.8 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 346.06 ms. Allocated memory is still 67.1 MB. Free memory was 48.6 MB in the beginning and 49.1 MB in the end (delta: -461.4 kB). Peak memory consumption was 17.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1361.42 ms. Allocated memory was 67.1 MB in the beginning and 81.8 MB in the end (delta: 14.7 MB). Free memory was 48.8 MB in the beginning and 32.2 MB in the end (delta: 16.5 MB). Peak memory consumption was 32.6 MB. Max. memory is 16.1 GB. * Witness Printer took 72.72 ms. Allocated memory is still 81.8 MB. Free memory was 32.2 MB in the beginning and 29.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 93]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1290.3ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 27.2ms, AutomataDifference: 363.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 32.8ms, InitialAbstractionConstructionTime: 8.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 574 SDtfs, 264 SDslu, 358 SDs, 0 SdLazy, 69 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 139.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=389occurred in iteration=12, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 128.9ms AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 41 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 6.4ms HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 21.5ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 22.5ms SsaConstructionTime, 120.6ms SatisfiabilityAnalysisTime, 385.0ms InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 325 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2021-08-25 20:14:25,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...