/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 20:31:17,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 20:31:17,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 20:31:17,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 20:31:17,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 20:31:17,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 20:31:17,396 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 20:31:17,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 20:31:17,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 20:31:17,423 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 20:31:17,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 20:31:17,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 20:31:17,435 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 20:31:17,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 20:31:17,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 20:31:17,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 20:31:17,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 20:31:17,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 20:31:17,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 20:31:17,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 20:31:17,458 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 20:31:17,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 20:31:17,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 20:31:17,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 20:31:17,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 20:31:17,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 20:31:17,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 20:31:17,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 20:31:17,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 20:31:17,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 20:31:17,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 20:31:17,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 20:31:17,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 20:31:17,471 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 20:31:17,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 20:31:17,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 20:31:17,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 20:31:17,474 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 20:31:17,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 20:31:17,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 20:31:17,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 20:31:17,477 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-23 20:31:17,490 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 20:31:17,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 20:31:17,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 20:31:17,492 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 20:31:17,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 20:31:17,492 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 20:31:17,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 20:31:17,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 20:31:17,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 20:31:17,493 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 20:31:17,493 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 20:31:17,493 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 20:31:17,494 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 20:31:17,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 20:31:17,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 20:31:17,494 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-23 20:31:17,494 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 20:31:17,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 20:31:17,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:31:17,498 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 20:31:17,498 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-23 20:31:17,498 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 20:31:17,499 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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 [2020-10-23 20:31:17,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 20:31:17,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 20:31:17,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 20:31:17,948 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 20:31:17,948 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 20:31:17,949 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2020-10-23 20:31:18,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea780cafa/c4116b819fba474e9b17f44839943039/FLAG3b303e15e [2020-10-23 20:31:18,666 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 20:31:18,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2020-10-23 20:31:18,678 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea780cafa/c4116b819fba474e9b17f44839943039/FLAG3b303e15e [2020-10-23 20:31:19,042 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea780cafa/c4116b819fba474e9b17f44839943039 [2020-10-23 20:31:19,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 20:31:19,070 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 20:31:19,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 20:31:19,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 20:31:19,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 20:31:19,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:31:19" (1/1) ... [2020-10-23 20:31:19,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bdeba37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:19, skipping insertion in model container [2020-10-23 20:31:19,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:31:19" (1/1) ... [2020-10-23 20:31:19,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 20:31:19,117 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 20:31:19,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:31:19,346 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 20:31:19,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:31:19,388 INFO L208 MainTranslator]: Completed translation [2020-10-23 20:31:19,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:19 WrapperNode [2020-10-23 20:31:19,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 20:31:19,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 20:31:19,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 20:31:19,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 20:31:19,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:19" (1/1) ... [2020-10-23 20:31:19,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:19" (1/1) ... [2020-10-23 20:31:19,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:19" (1/1) ... [2020-10-23 20:31:19,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:19" (1/1) ... [2020-10-23 20:31:19,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:19" (1/1) ... [2020-10-23 20:31:19,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:19" (1/1) ... [2020-10-23 20:31:19,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:19" (1/1) ... [2020-10-23 20:31:19,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 20:31:19,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 20:31:19,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 20:31:19,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 20:31:19,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:31:19,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 20:31:19,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 20:31:19,559 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 20:31:19,559 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 20:31:19,559 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 20:31:19,559 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 20:31:19,559 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 20:31:19,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 20:31:19,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 20:31:19,560 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 20:31:19,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 20:31:19,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 20:31:19,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 20:31:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 20:31:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 20:31:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 20:31:19,903 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 20:31:19,904 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-23 20:31:19,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:31:19 BoogieIcfgContainer [2020-10-23 20:31:19,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 20:31:19,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 20:31:19,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 20:31:19,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 20:31:19,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:31:19" (1/3) ... [2020-10-23 20:31:19,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e94fa7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:31:19, skipping insertion in model container [2020-10-23 20:31:19,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:19" (2/3) ... [2020-10-23 20:31:19,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e94fa7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:31:19, skipping insertion in model container [2020-10-23 20:31:19,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:31:19" (3/3) ... [2020-10-23 20:31:19,916 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2020-10-23 20:31:19,931 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-23 20:31:19,936 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 20:31:19,951 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 20:31:19,982 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 20:31:19,982 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 20:31:19,982 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-10-23 20:31:19,983 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 20:31:19,985 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 20:31:19,985 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 20:31:19,985 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 20:31:19,986 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 20:31:20,031 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-10-23 20:31:20,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-10-23 20:31:20,060 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:20,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:20,065 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:20,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:20,080 INFO L82 PathProgramCache]: Analyzing trace with hash 561928489, now seen corresponding path program 1 times [2020-10-23 20:31:20,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:20,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [385377036] [2020-10-23 20:31:20,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:20,195 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:20,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:20,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [385377036] [2020-10-23 20:31:20,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:20,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:20,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840745948] [2020-10-23 20:31:20,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:20,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:20,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:20,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:20,531 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2020-10-23 20:31:20,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:20,965 INFO L93 Difference]: Finished difference Result 181 states and 243 transitions. [2020-10-23 20:31:20,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:20,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-10-23 20:31:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:20,981 INFO L225 Difference]: With dead ends: 181 [2020-10-23 20:31:20,981 INFO L226 Difference]: Without dead ends: 120 [2020-10-23 20:31:20,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:21,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-10-23 20:31:21,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2020-10-23 20:31:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-23 20:31:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 151 transitions. [2020-10-23 20:31:21,063 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 151 transitions. Word has length 58 [2020-10-23 20:31:21,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:21,064 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 151 transitions. [2020-10-23 20:31:21,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:21,065 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 151 transitions. [2020-10-23 20:31:21,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-23 20:31:21,067 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:21,067 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:21,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 20:31:21,068 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:21,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:21,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1435115152, now seen corresponding path program 1 times [2020-10-23 20:31:21,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:21,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1912899594] [2020-10-23 20:31:21,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:21,074 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:21,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:21,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:21,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1912899594] [2020-10-23 20:31:21,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:21,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:21,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242802041] [2020-10-23 20:31:21,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:21,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:21,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:21,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:21,194 INFO L87 Difference]: Start difference. First operand 119 states and 151 transitions. Second operand 4 states. [2020-10-23 20:31:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:21,457 INFO L93 Difference]: Finished difference Result 144 states and 185 transitions. [2020-10-23 20:31:21,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:21,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-10-23 20:31:21,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:21,460 INFO L225 Difference]: With dead ends: 144 [2020-10-23 20:31:21,460 INFO L226 Difference]: Without dead ends: 141 [2020-10-23 20:31:21,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:21,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-10-23 20:31:21,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2020-10-23 20:31:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-23 20:31:21,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 150 transitions. [2020-10-23 20:31:21,492 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 150 transitions. Word has length 59 [2020-10-23 20:31:21,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:21,493 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 150 transitions. [2020-10-23 20:31:21,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2020-10-23 20:31:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-23 20:31:21,494 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:21,495 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:21,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 20:31:21,495 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:21,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:21,496 INFO L82 PathProgramCache]: Analyzing trace with hash 247511734, now seen corresponding path program 1 times [2020-10-23 20:31:21,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:21,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1418066868] [2020-10-23 20:31:21,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:21,500 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:21,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:21,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1418066868] [2020-10-23 20:31:21,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:21,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:21,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844541023] [2020-10-23 20:31:21,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:21,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:21,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:21,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:21,617 INFO L87 Difference]: Start difference. First operand 119 states and 150 transitions. Second operand 4 states. [2020-10-23 20:31:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:21,950 INFO L93 Difference]: Finished difference Result 275 states and 367 transitions. [2020-10-23 20:31:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:21,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-10-23 20:31:21,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:21,955 INFO L225 Difference]: With dead ends: 275 [2020-10-23 20:31:21,956 INFO L226 Difference]: Without dead ends: 193 [2020-10-23 20:31:21,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:21,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-10-23 20:31:22,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2020-10-23 20:31:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-10-23 20:31:22,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 249 transitions. [2020-10-23 20:31:22,039 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 249 transitions. Word has length 59 [2020-10-23 20:31:22,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:22,040 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 249 transitions. [2020-10-23 20:31:22,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:22,040 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 249 transitions. [2020-10-23 20:31:22,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-23 20:31:22,047 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:22,048 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:22,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 20:31:22,048 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:22,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:22,049 INFO L82 PathProgramCache]: Analyzing trace with hash 134996116, now seen corresponding path program 1 times [2020-10-23 20:31:22,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:22,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [815851417] [2020-10-23 20:31:22,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:22,053 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:22,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:22,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [815851417] [2020-10-23 20:31:22,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:22,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:22,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879693582] [2020-10-23 20:31:22,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:22,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:22,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:22,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:22,136 INFO L87 Difference]: Start difference. First operand 192 states and 249 transitions. Second operand 4 states. [2020-10-23 20:31:22,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:22,365 INFO L93 Difference]: Finished difference Result 234 states and 306 transitions. [2020-10-23 20:31:22,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:22,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-10-23 20:31:22,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:22,368 INFO L225 Difference]: With dead ends: 234 [2020-10-23 20:31:22,368 INFO L226 Difference]: Without dead ends: 231 [2020-10-23 20:31:22,369 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:22,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-10-23 20:31:22,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 192. [2020-10-23 20:31:22,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-10-23 20:31:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 247 transitions. [2020-10-23 20:31:22,410 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 247 transitions. Word has length 60 [2020-10-23 20:31:22,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:22,411 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 247 transitions. [2020-10-23 20:31:22,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:22,411 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 247 transitions. [2020-10-23 20:31:22,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-23 20:31:22,412 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:22,412 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:22,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 20:31:22,413 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:22,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:22,413 INFO L82 PathProgramCache]: Analyzing trace with hash -909461547, now seen corresponding path program 1 times [2020-10-23 20:31:22,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:22,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [165943079] [2020-10-23 20:31:22,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:22,417 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:22,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:22,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [165943079] [2020-10-23 20:31:22,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:22,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:22,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055873591] [2020-10-23 20:31:22,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:22,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:22,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:22,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:22,494 INFO L87 Difference]: Start difference. First operand 192 states and 247 transitions. Second operand 4 states. [2020-10-23 20:31:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:22,759 INFO L93 Difference]: Finished difference Result 488 states and 650 transitions. [2020-10-23 20:31:22,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:22,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-10-23 20:31:22,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:22,762 INFO L225 Difference]: With dead ends: 488 [2020-10-23 20:31:22,763 INFO L226 Difference]: Without dead ends: 333 [2020-10-23 20:31:22,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-10-23 20:31:22,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 332. [2020-10-23 20:31:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-10-23 20:31:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 431 transitions. [2020-10-23 20:31:22,830 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 431 transitions. Word has length 60 [2020-10-23 20:31:22,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:22,830 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 431 transitions. [2020-10-23 20:31:22,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 431 transitions. [2020-10-23 20:31:22,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-23 20:31:22,832 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:22,832 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:22,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 20:31:22,832 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:22,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:22,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1879083938, now seen corresponding path program 1 times [2020-10-23 20:31:22,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:22,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1981555458] [2020-10-23 20:31:22,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:22,836 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:22,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:22,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1981555458] [2020-10-23 20:31:22,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:22,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:22,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227497630] [2020-10-23 20:31:22,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:22,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:22,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:22,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:22,914 INFO L87 Difference]: Start difference. First operand 332 states and 431 transitions. Second operand 4 states. [2020-10-23 20:31:23,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:23,255 INFO L93 Difference]: Finished difference Result 896 states and 1186 transitions. [2020-10-23 20:31:23,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:23,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-10-23 20:31:23,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:23,259 INFO L225 Difference]: With dead ends: 896 [2020-10-23 20:31:23,259 INFO L226 Difference]: Without dead ends: 601 [2020-10-23 20:31:23,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:23,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-10-23 20:31:23,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 600. [2020-10-23 20:31:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-10-23 20:31:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 775 transitions. [2020-10-23 20:31:23,366 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 775 transitions. Word has length 61 [2020-10-23 20:31:23,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:23,367 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 775 transitions. [2020-10-23 20:31:23,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:23,367 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 775 transitions. [2020-10-23 20:31:23,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-23 20:31:23,368 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:23,368 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:23,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 20:31:23,369 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:23,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:23,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1513976804, now seen corresponding path program 1 times [2020-10-23 20:31:23,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:23,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [551021516] [2020-10-23 20:31:23,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:23,372 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:23,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:23,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:23,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [551021516] [2020-10-23 20:31:23,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:23,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:23,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529400690] [2020-10-23 20:31:23,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:23,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:23,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:23,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:23,434 INFO L87 Difference]: Start difference. First operand 600 states and 775 transitions. Second operand 4 states. [2020-10-23 20:31:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:23,730 INFO L93 Difference]: Finished difference Result 732 states and 946 transitions. [2020-10-23 20:31:23,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:23,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-10-23 20:31:23,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:23,735 INFO L225 Difference]: With dead ends: 732 [2020-10-23 20:31:23,735 INFO L226 Difference]: Without dead ends: 729 [2020-10-23 20:31:23,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2020-10-23 20:31:23,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 600. [2020-10-23 20:31:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-10-23 20:31:23,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 767 transitions. [2020-10-23 20:31:23,831 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 767 transitions. Word has length 61 [2020-10-23 20:31:23,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:23,832 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 767 transitions. [2020-10-23 20:31:23,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:23,832 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 767 transitions. [2020-10-23 20:31:23,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-23 20:31:23,833 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:23,833 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:23,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 20:31:23,834 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:23,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:23,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1092518240, now seen corresponding path program 1 times [2020-10-23 20:31:23,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:23,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2037038192] [2020-10-23 20:31:23,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:23,837 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:23,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:23,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2037038192] [2020-10-23 20:31:23,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:23,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:23,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592064556] [2020-10-23 20:31:23,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:23,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:23,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:23,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:23,916 INFO L87 Difference]: Start difference. First operand 600 states and 767 transitions. Second operand 4 states. [2020-10-23 20:31:24,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:24,246 INFO L93 Difference]: Finished difference Result 724 states and 922 transitions. [2020-10-23 20:31:24,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:24,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-10-23 20:31:24,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:24,251 INFO L225 Difference]: With dead ends: 724 [2020-10-23 20:31:24,251 INFO L226 Difference]: Without dead ends: 721 [2020-10-23 20:31:24,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2020-10-23 20:31:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 600. [2020-10-23 20:31:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-10-23 20:31:24,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 759 transitions. [2020-10-23 20:31:24,348 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 759 transitions. Word has length 62 [2020-10-23 20:31:24,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:24,349 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 759 transitions. [2020-10-23 20:31:24,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:24,349 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 759 transitions. [2020-10-23 20:31:24,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-23 20:31:24,350 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:24,350 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:24,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 20:31:24,351 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:24,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:24,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1870307711, now seen corresponding path program 1 times [2020-10-23 20:31:24,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:24,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1102687816] [2020-10-23 20:31:24,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:24,354 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:24,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:24,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:24,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1102687816] [2020-10-23 20:31:24,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:24,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:24,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137426916] [2020-10-23 20:31:24,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:24,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:24,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:24,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:24,409 INFO L87 Difference]: Start difference. First operand 600 states and 759 transitions. Second operand 4 states. [2020-10-23 20:31:24,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:24,804 INFO L93 Difference]: Finished difference Result 1676 states and 2138 transitions. [2020-10-23 20:31:24,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:24,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-10-23 20:31:24,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:24,810 INFO L225 Difference]: With dead ends: 1676 [2020-10-23 20:31:24,811 INFO L226 Difference]: Without dead ends: 1113 [2020-10-23 20:31:24,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:24,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2020-10-23 20:31:25,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1112. [2020-10-23 20:31:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2020-10-23 20:31:25,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1383 transitions. [2020-10-23 20:31:25,020 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1383 transitions. Word has length 62 [2020-10-23 20:31:25,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:25,020 INFO L481 AbstractCegarLoop]: Abstraction has 1112 states and 1383 transitions. [2020-10-23 20:31:25,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:25,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1383 transitions. [2020-10-23 20:31:25,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-23 20:31:25,023 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:25,023 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:25,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 20:31:25,023 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:25,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:25,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2137320306, now seen corresponding path program 1 times [2020-10-23 20:31:25,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:25,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [25290446] [2020-10-23 20:31:25,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:25,027 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:25,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:25,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:25,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [25290446] [2020-10-23 20:31:25,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:25,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:25,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014030966] [2020-10-23 20:31:25,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:25,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:25,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:25,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:25,100 INFO L87 Difference]: Start difference. First operand 1112 states and 1383 transitions. Second operand 4 states. [2020-10-23 20:31:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:25,636 INFO L93 Difference]: Finished difference Result 3164 states and 3946 transitions. [2020-10-23 20:31:25,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:25,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-10-23 20:31:25,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:25,647 INFO L225 Difference]: With dead ends: 3164 [2020-10-23 20:31:25,648 INFO L226 Difference]: Without dead ends: 1625 [2020-10-23 20:31:25,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:25,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2020-10-23 20:31:25,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1624. [2020-10-23 20:31:25,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1624 states. [2020-10-23 20:31:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 1943 transitions. [2020-10-23 20:31:25,940 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 1943 transitions. Word has length 63 [2020-10-23 20:31:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:25,940 INFO L481 AbstractCegarLoop]: Abstraction has 1624 states and 1943 transitions. [2020-10-23 20:31:25,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:25,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1943 transitions. [2020-10-23 20:31:25,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-23 20:31:25,942 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:25,943 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:25,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 20:31:25,943 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:25,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:25,944 INFO L82 PathProgramCache]: Analyzing trace with hash -912193112, now seen corresponding path program 1 times [2020-10-23 20:31:25,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:25,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [155217654] [2020-10-23 20:31:25,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:25,946 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:25,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:25,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [155217654] [2020-10-23 20:31:25,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:25,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:25,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239400643] [2020-10-23 20:31:25,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:25,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:25,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:25,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:25,997 INFO L87 Difference]: Start difference. First operand 1624 states and 1943 transitions. Second operand 4 states. [2020-10-23 20:31:26,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:26,472 INFO L93 Difference]: Finished difference Result 1836 states and 2170 transitions. [2020-10-23 20:31:26,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:26,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-10-23 20:31:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:26,480 INFO L225 Difference]: With dead ends: 1836 [2020-10-23 20:31:26,481 INFO L226 Difference]: Without dead ends: 1321 [2020-10-23 20:31:26,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:26,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2020-10-23 20:31:26,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1112. [2020-10-23 20:31:26,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2020-10-23 20:31:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1303 transitions. [2020-10-23 20:31:26,664 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1303 transitions. Word has length 63 [2020-10-23 20:31:26,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:26,664 INFO L481 AbstractCegarLoop]: Abstraction has 1112 states and 1303 transitions. [2020-10-23 20:31:26,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:26,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1303 transitions. [2020-10-23 20:31:26,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-23 20:31:26,667 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:26,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:26,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-23 20:31:26,668 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:26,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:26,669 INFO L82 PathProgramCache]: Analyzing trace with hash 382930092, now seen corresponding path program 1 times [2020-10-23 20:31:26,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:26,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1141044878] [2020-10-23 20:31:26,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:26,672 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:26,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:26,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:26,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1141044878] [2020-10-23 20:31:26,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:26,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:26,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001286974] [2020-10-23 20:31:26,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:26,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:26,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:26,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:26,760 INFO L87 Difference]: Start difference. First operand 1112 states and 1303 transitions. Second operand 4 states. [2020-10-23 20:31:27,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:27,100 INFO L93 Difference]: Finished difference Result 1112 states and 1303 transitions. [2020-10-23 20:31:27,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:27,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-10-23 20:31:27,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:27,101 INFO L225 Difference]: With dead ends: 1112 [2020-10-23 20:31:27,101 INFO L226 Difference]: Without dead ends: 0 [2020-10-23 20:31:27,104 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:27,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-23 20:31:27,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-23 20:31:27,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-23 20:31:27,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-23 20:31:27,105 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2020-10-23 20:31:27,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:27,105 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-23 20:31:27,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-23 20:31:27,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-23 20:31:27,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-23 20:31:27,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-23 20:31:27,410 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 31 [2020-10-23 20:31:27,830 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 53 [2020-10-23 20:31:27,984 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 41 [2020-10-23 20:31:28,304 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-10-23 20:31:28,634 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-10-23 20:31:28,774 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-10-23 20:31:28,928 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-10-23 20:31:29,178 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 41 [2020-10-23 20:31:29,340 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-10-23 20:31:29,449 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 45 [2020-10-23 20:31:29,557 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 34 [2020-10-23 20:31:29,880 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 31 [2020-10-23 20:31:29,993 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 85 [2020-10-23 20:31:30,335 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-23 20:31:30,658 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 39 [2020-10-23 20:31:31,187 WARN L193 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-23 20:31:32,397 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-10-23 20:31:33,544 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-10-23 20:31:34,110 WARN L193 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-10-23 20:31:34,230 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-10-23 20:31:34,452 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-23 20:31:35,176 WARN L193 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-10-23 20:31:36,374 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-10-23 20:31:36,621 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-10-23 20:31:36,882 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-23 20:31:37,459 WARN L193 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-23 20:31:38,609 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-10-23 20:31:39,924 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-10-23 20:31:40,175 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-10-23 20:31:42,978 WARN L193 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-10-23 20:31:43,454 WARN L193 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-23 20:31:43,670 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-10-23 20:31:43,941 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-23 20:31:43,955 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-23 20:31:43,956 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-23 20:31:43,956 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-23 20:31:43,956 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-23 20:31:43,956 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-23 20:31:43,956 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-23 20:31:43,956 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:31:43,956 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-23 20:31:43,956 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-23 20:31:43,957 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-10-23 20:31:43,957 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-23 20:31:43,957 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-23 20:31:43,957 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-23 20:31:43,957 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:31:43,957 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:31:43,957 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:31:43,958 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-23 20:31:43,958 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-23 20:31:43,958 INFO L277 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-10-23 20:31:43,958 INFO L270 CegarLoopResult]: At program point L60-1(lines 29 104) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-10-23 20:31:43,958 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 6 109) the Hoare annotation is: true [2020-10-23 20:31:43,958 INFO L270 CegarLoopResult]: At program point L85(line 85) the Hoare annotation is: (let ((.cse3 (= main_~p5~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse2 (= main_~p6~0 0)) (.cse1 (= main_~lk3~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~p4~0 0)) (.cse5 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse4 .cse5) (and .cse1 .cse2 .cse6 .cse5) (and .cse1 .cse2 .cse3 .cse6) (and .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse4 .cse6 .cse5))) [2020-10-23 20:31:43,959 INFO L270 CegarLoopResult]: At program point L52-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-10-23 20:31:43,959 INFO L277 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: true [2020-10-23 20:31:43,959 INFO L277 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-10-23 20:31:43,959 INFO L277 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: true [2020-10-23 20:31:43,959 INFO L277 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: true [2020-10-23 20:31:43,959 INFO L270 CegarLoopResult]: At program point L69(line 69) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse9) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse7 .cse3 .cse9 .cse6) (and .cse7 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2020-10-23 20:31:43,960 INFO L277 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-10-23 20:31:43,960 INFO L270 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-10-23 20:31:43,960 INFO L270 CegarLoopResult]: At program point L94-1(lines 29 104) the Hoare annotation is: (or (= main_~p6~0 0) (= main_~lk6~0 1)) [2020-10-23 20:31:43,960 INFO L270 CegarLoopResult]: At program point L86(line 86) the Hoare annotation is: (let ((.cse3 (= main_~p5~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse2 (= main_~p6~0 0)) (.cse1 (= main_~lk3~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~p4~0 0)) (.cse5 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse4 .cse5) (and .cse1 .cse2 .cse6 .cse5) (and .cse1 .cse2 .cse3 .cse6) (and .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse4 .cse6 .cse5))) [2020-10-23 20:31:43,960 INFO L270 CegarLoopResult]: At program point L53(line 53) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-10-23 20:31:43,960 INFO L277 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-10-23 20:31:43,960 INFO L277 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-10-23 20:31:43,961 INFO L277 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: true [2020-10-23 20:31:43,961 INFO L277 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-10-23 20:31:43,961 INFO L270 CegarLoopResult]: At program point L95(line 95) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1))) (or (and (= main_~lk6~0 1) .cse0) (and (= main_~p6~0 0) .cse0))) [2020-10-23 20:31:43,961 INFO L277 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-10-23 20:31:43,961 INFO L270 CegarLoopResult]: At program point L79-1(lines 29 104) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse4 (= main_~p6~0 0)) (.cse6 (= main_~lk3~0 1)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse5 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5) (and .cse0 .cse6 .cse4 .cse2) (and .cse4 .cse1 .cse2 .cse7) (and .cse6 .cse4 .cse7 .cse5) (and .cse1 .cse2 .cse3 .cse7) (and .cse1 .cse3 .cse7 .cse5) (and .cse0 .cse4 .cse1 .cse2) (and .cse4 .cse1 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3) (and .cse0 .cse6 .cse3 .cse5) (and .cse6 .cse4 .cse2 .cse7) (and .cse6 .cse2 .cse3 .cse7) (and .cse0 .cse6 .cse4 .cse5) (and .cse6 .cse3 .cse7 .cse5) (and .cse0 .cse1 .cse3 .cse5))) [2020-10-23 20:31:43,961 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 6 109) the Hoare annotation is: true [2020-10-23 20:31:43,961 INFO L277 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-10-23 20:31:43,962 INFO L270 CegarLoopResult]: At program point L96(line 96) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1))) (or (and (= main_~lk6~0 1) .cse0) (and (= main_~p6~0 0) .cse0))) [2020-10-23 20:31:43,962 INFO L277 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-10-23 20:31:43,962 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 6 109) the Hoare annotation is: true [2020-10-23 20:31:43,962 INFO L277 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: true [2020-10-23 20:31:43,962 INFO L277 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: true [2020-10-23 20:31:43,962 INFO L270 CegarLoopResult]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse7 (= main_~p6~0 0)) (.cse1 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse5 (= main_~p4~0 0)) (.cse8 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse0 .cse7 .cse1 .cse3 .cse8) (and .cse0 .cse7 .cse1 .cse2 .cse3) (and .cse1 .cse3 .cse4 .cse5 .cse8) (and .cse6 .cse7 .cse3 .cse5 .cse8) (and .cse6 .cse7 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse8) (and .cse6 .cse3 .cse4 .cse5 .cse8) (and .cse0 .cse6 .cse7 .cse3 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse8) (and .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse3) (and .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse3 .cse5 .cse8))) [2020-10-23 20:31:43,962 INFO L277 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-10-23 20:31:43,963 INFO L277 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-10-23 20:31:43,963 INFO L277 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-10-23 20:31:43,963 INFO L277 CegarLoopResult]: At program point L105(lines 7 109) the Hoare annotation is: true [2020-10-23 20:31:43,963 INFO L277 CegarLoopResult]: At program point L31(lines 31 33) the Hoare annotation is: true [2020-10-23 20:31:43,963 INFO L270 CegarLoopResult]: At program point L64-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse9) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse7 .cse3 .cse9 .cse6) (and .cse7 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2020-10-23 20:31:43,963 INFO L270 CegarLoopResult]: At program point L89-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse3 (= main_~p6~0 0)) (.cse2 (= main_~p5~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-10-23 20:31:43,964 INFO L277 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-10-23 20:31:43,964 INFO L270 CegarLoopResult]: At program point L56-1(lines 29 104) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-10-23 20:31:43,964 INFO L277 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: true [2020-10-23 20:31:43,964 INFO L277 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: true [2020-10-23 20:31:43,964 INFO L270 CegarLoopResult]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse7 (= main_~p6~0 0)) (.cse1 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse5 (= main_~p4~0 0)) (.cse8 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse0 .cse7 .cse1 .cse3 .cse8) (and .cse0 .cse7 .cse1 .cse2 .cse3) (and .cse1 .cse3 .cse4 .cse5 .cse8) (and .cse6 .cse7 .cse3 .cse5 .cse8) (and .cse6 .cse7 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse8) (and .cse6 .cse3 .cse4 .cse5 .cse8) (and .cse0 .cse6 .cse7 .cse3 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse8) (and .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse3) (and .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse3 .cse5 .cse8))) [2020-10-23 20:31:43,964 INFO L277 CegarLoopResult]: At program point L48(lines 48 50) the Hoare annotation is: true [2020-10-23 20:31:43,965 INFO L277 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-10-23 20:31:43,965 INFO L270 CegarLoopResult]: At program point L48-2(lines 29 104) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-10-23 20:31:43,965 INFO L277 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-10-23 20:31:43,965 INFO L270 CegarLoopResult]: At program point L65(line 65) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-10-23 20:31:43,965 INFO L270 CegarLoopResult]: At program point L90(line 90) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~p6~0 0)) (.cse4 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse2 .cse3) (and .cse0 .cse1 .cse4))) [2020-10-23 20:31:43,965 INFO L270 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-10-23 20:31:43,965 INFO L277 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-10-23 20:31:43,966 INFO L277 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: true [2020-10-23 20:31:43,966 INFO L270 CegarLoopResult]: At program point L107(line 107) the Hoare annotation is: false [2020-10-23 20:31:43,966 INFO L270 CegarLoopResult]: At program point L74-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse8 (= main_~p2~0 0)) (.cse5 (= main_~p6~0 0)) (.cse6 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse9 (= main_~p4~0 0)) (.cse7 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse3 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse8) (and .cse1 .cse4 .cse9 .cse7 .cse8) (and .cse6 .cse3 .cse4 .cse9 .cse7) (and .cse0 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse4 .cse7 .cse8) (and .cse6 .cse2 .cse4 .cse9 .cse8) (and .cse0 .cse6 .cse4 .cse7 .cse8) (and .cse1 .cse3 .cse4 .cse9 .cse7) (and .cse0 .cse1 .cse5 .cse3 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse6 .cse4 .cse9 .cse7 .cse8) (and .cse5 .cse6 .cse9 .cse7 .cse8) (and .cse0 .cse5 .cse6 .cse2 .cse8) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse2 .cse4 .cse8) (and .cse6 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse5 .cse6 .cse2 .cse3) (and .cse1 .cse5 .cse3 .cse9 .cse7) (and .cse1 .cse5 .cse2 .cse3 .cse9) (and .cse0 .cse6 .cse3 .cse4 .cse7) (and .cse1 .cse5 .cse2 .cse9 .cse8) (and .cse5 .cse6 .cse2 .cse9 .cse8) (and .cse1 .cse2 .cse4 .cse9 .cse8) (and .cse1 .cse5 .cse9 .cse7 .cse8) (and .cse0 .cse1 .cse5 .cse7 .cse8) (and .cse5 .cse6 .cse2 .cse3 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse8) (and .cse5 .cse6 .cse3 .cse9 .cse7))) [2020-10-23 20:31:43,966 INFO L277 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-10-23 20:31:43,966 INFO L277 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-10-23 20:31:43,966 INFO L277 CegarLoopResult]: At program point L99-1(lines 29 104) the Hoare annotation is: true [2020-10-23 20:31:43,967 INFO L270 CegarLoopResult]: At program point L91(line 91) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~p6~0 0)) (.cse4 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse2 .cse3) (and .cse0 .cse1 .cse4))) [2020-10-23 20:31:43,967 INFO L277 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-10-23 20:31:43,967 INFO L277 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-10-23 20:31:43,967 INFO L277 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-10-23 20:31:43,967 INFO L270 CegarLoopResult]: At program point L108(line 108) the Hoare annotation is: false [2020-10-23 20:31:43,967 INFO L270 CegarLoopResult]: At program point L75(line 75) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse10 (= main_~lk2~0 1)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse9 (= main_~p5~0 0)) (.cse8 (= main_~lk3~0 1)) (.cse6 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~p2~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse5) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse10 .cse6 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse10 .cse7 .cse3 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse10 .cse7 .cse5) (and .cse8 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse5) (and .cse2 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse2 .cse9 .cse10 .cse6 .cse5) (and .cse2 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse8 .cse1 .cse10 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse5) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5))) [2020-10-23 20:31:43,968 INFO L277 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-10-23 20:31:43,968 INFO L277 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-10-23 20:31:43,968 INFO L270 CegarLoopResult]: At program point L100(line 100) the Hoare annotation is: (= main_~lk6~0 1) [2020-10-23 20:31:43,968 INFO L270 CegarLoopResult]: At program point L100-1(lines 7 109) the Hoare annotation is: false [2020-10-23 20:31:43,968 INFO L277 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-10-23 20:31:43,968 INFO L270 CegarLoopResult]: At program point L84-1(lines 29 104) the Hoare annotation is: (let ((.cse5 (= main_~lk6~0 1)) (.cse4 (= main_~p5~0 0)) (.cse1 (= main_~p4~0 0)) (.cse3 (= main_~lk4~0 1)) (.cse0 (= main_~p6~0 0)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4) (and .cse3 .cse5 .cse2) (and .cse4 .cse5 .cse1) (and .cse5 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse4 .cse1) (and .cse3 .cse0 .cse2))) [2020-10-23 20:31:43,968 INFO L277 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-10-23 20:31:43,969 INFO L270 CegarLoopResult]: At program point L76(line 76) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse10 (= main_~lk2~0 1)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse9 (= main_~p5~0 0)) (.cse8 (= main_~lk3~0 1)) (.cse6 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~p2~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse5) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse10 .cse6 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse10 .cse7 .cse3 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse10 .cse7 .cse5) (and .cse8 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse5) (and .cse2 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse2 .cse9 .cse10 .cse6 .cse5) (and .cse2 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse8 .cse1 .cse10 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse5) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5))) [2020-10-23 20:31:43,969 INFO L270 CegarLoopResult]: At program point L101(line 101) the Hoare annotation is: (= main_~lk6~0 1) [2020-10-23 20:31:43,970 INFO L270 CegarLoopResult]: At program point L68-1(lines 29 104) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse9 (= main_~p1~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse11 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1)) (.cse7 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse9) (and .cse10 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse9 .cse4) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse5) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse9) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse5) (and .cse10 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse1 .cse2 .cse11 .cse7 .cse4 .cse5) (and .cse10 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse9) (and .cse2 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse9) (and .cse0 .cse10 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse9 .cse4) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse10 .cse1 .cse7 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse4 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse9) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse5) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse9) (and .cse0 .cse1 .cse2 .cse11 .cse9 .cse4) (and .cse2 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse9) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse5) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse9) (and .cse1 .cse2 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse5))) [2020-10-23 20:31:43,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:31:43 BoogieIcfgContainer [2020-10-23 20:31:43,987 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 20:31:43,989 INFO L168 Benchmark]: Toolchain (without parser) took 24937.28 ms. Allocated memory was 151.0 MB in the beginning and 553.6 MB in the end (delta: 402.7 MB). Free memory was 107.4 MB in the beginning and 284.2 MB in the end (delta: -176.8 MB). Peak memory consumption was 310.5 MB. Max. memory is 8.0 GB. [2020-10-23 20:31:43,992 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 151.0 MB. Free memory is still 123.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 20:31:43,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.85 ms. Allocated memory is still 151.0 MB. Free memory was 135.0 MB in the beginning and 125.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-23 20:31:43,996 INFO L168 Benchmark]: Boogie Preprocessor took 65.69 ms. Allocated memory is still 151.0 MB. Free memory was 125.2 MB in the beginning and 134.7 MB in the end (delta: -9.6 MB). Peak memory consumption was 4.4 MB. Max. memory is 8.0 GB. [2020-10-23 20:31:43,997 INFO L168 Benchmark]: RCFGBuilder took 449.77 ms. Allocated memory is still 151.0 MB. Free memory was 134.7 MB in the beginning and 114.2 MB in the end (delta: 20.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. [2020-10-23 20:31:43,997 INFO L168 Benchmark]: TraceAbstraction took 24078.60 ms. Allocated memory was 151.0 MB in the beginning and 553.6 MB in the end (delta: 402.7 MB). Free memory was 113.5 MB in the beginning and 284.2 MB in the end (delta: -170.7 MB). Peak memory consumption was 316.9 MB. Max. memory is 8.0 GB. [2020-10-23 20:31:44,000 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.21 ms. Allocated memory is still 151.0 MB. Free memory is still 123.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 314.85 ms. Allocated memory is still 151.0 MB. Free memory was 135.0 MB in the beginning and 125.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 65.69 ms. Allocated memory is still 151.0 MB. Free memory was 125.2 MB in the beginning and 134.7 MB in the end (delta: -9.6 MB). Peak memory consumption was 4.4 MB. Max. memory is 8.0 GB. * RCFGBuilder took 449.77 ms. Allocated memory is still 151.0 MB. Free memory was 134.7 MB in the beginning and 114.2 MB in the end (delta: 20.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 24078.60 ms. Allocated memory was 151.0 MB in the beginning and 553.6 MB in the end (delta: 402.7 MB). Free memory was 113.5 MB in the beginning and 284.2 MB in the end (delta: -170.7 MB). Peak memory consumption was 316.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.1s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1456 SDtfs, 1641 SDslu, 202 SDs, 0 SdLazy, 1044 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1624occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 526 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 90 LocationsWithAnnotation, 134 PreInvPairs, 2190 NumberOfFragments, 5886 HoareAnnotationTreeSize, 134 FomulaSimplifications, 372834 FormulaSimplificationTreeSizeReduction, 3.5s HoareSimplificationTime, 90 FomulaSimplificationsInter, 12518 FormulaSimplificationTreeSizeReductionInter, 13.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...