/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/test25-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:17:00,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:17:00,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:17:00,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:17:00,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:17:00,282 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:17:00,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:17:00,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:17:00,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:17:00,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:17:00,292 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:17:00,294 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:17:00,294 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:17:00,295 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:17:00,297 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:17:00,298 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:17:00,299 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:17:00,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:17:00,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:17:00,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:17:00,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:17:00,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:17:00,309 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:17:00,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:17:00,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:17:00,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:17:00,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:17:00,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:17:00,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:17:00,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:17:00,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:17:00,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:17:00,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:17:00,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:17:00,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:17:00,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:17:00,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:17:00,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:17:00,323 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:17:00,324 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:17:00,325 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:17:00,328 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:17:00,347 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:17:00,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:17:00,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:17:00,352 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:17:00,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:17:00,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:17:00,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:17:00,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:17:00,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:17:00,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:17:00,355 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:17:00,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:17:00,357 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:17:00,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:17:00,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:17:00,358 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:17:00,359 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:17:00,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:17:00,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:17:00,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:17:00,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:17:00,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:17:00,362 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 05:17:00,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:17:00,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:17:00,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:17:00,910 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:17:00,910 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:17:00,911 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test25-2.c [2020-11-07 05:17:01,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d4f6e0d/4a56e2ba20a048c4a2b1ca4dd0df3897/FLAGb1cc3e9a0 [2020-11-07 05:17:01,803 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:17:01,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test25-2.c [2020-11-07 05:17:01,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d4f6e0d/4a56e2ba20a048c4a2b1ca4dd0df3897/FLAGb1cc3e9a0 [2020-11-07 05:17:02,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d4f6e0d/4a56e2ba20a048c4a2b1ca4dd0df3897 [2020-11-07 05:17:02,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:17:02,184 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:17:02,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:17:02,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:17:02,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:17:02,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:17:02" (1/1) ... [2020-11-07 05:17:02,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@481eccad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:02, skipping insertion in model container [2020-11-07 05:17:02,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:17:02" (1/1) ... [2020-11-07 05:17:02,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:17:02,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:17:02,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:17:02,470 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:17:02,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:17:02,516 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:17:02,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:02 WrapperNode [2020-11-07 05:17:02,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:17:02,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:17:02,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:17:02,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:17:02,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:02" (1/1) ... [2020-11-07 05:17:02,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:02" (1/1) ... [2020-11-07 05:17:02,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:02" (1/1) ... [2020-11-07 05:17:02,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:02" (1/1) ... [2020-11-07 05:17:02,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:02" (1/1) ... [2020-11-07 05:17:02,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:02" (1/1) ... [2020-11-07 05:17:02,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:02" (1/1) ... [2020-11-07 05:17:02,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:17:02,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:17:02,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:17:02,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:17:02,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:02" (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-11-07 05:17:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:17:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:17:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:17:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-11-07 05:17:02,654 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:17:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:17:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:17:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:17:02,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:17:02,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:17:02,655 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-11-07 05:17:02,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-07 05:17:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:17:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:17:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:17:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-07 05:17:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:17:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:17:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:17:02,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:17:03,326 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:17:03,327 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-11-07 05:17:03,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:17:03 BoogieIcfgContainer [2020-11-07 05:17:03,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:17:03,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:17:03,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:17:03,344 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:17:03,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:17:02" (1/3) ... [2020-11-07 05:17:03,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60aac93b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:17:03, skipping insertion in model container [2020-11-07 05:17:03,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:02" (2/3) ... [2020-11-07 05:17:03,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60aac93b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:17:03, skipping insertion in model container [2020-11-07 05:17:03,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:17:03" (3/3) ... [2020-11-07 05:17:03,350 INFO L111 eAbstractionObserver]: Analyzing ICFG test25-2.c [2020-11-07 05:17:03,370 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:17:03,374 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:17:03,389 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:17:03,434 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:17:03,435 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:17:03,435 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:17:03,435 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:17:03,436 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:17:03,436 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:17:03,436 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:17:03,436 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:17:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2020-11-07 05:17:03,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-07 05:17:03,481 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:03,482 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] [2020-11-07 05:17:03,483 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:03,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:03,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1065751138, now seen corresponding path program 1 times [2020-11-07 05:17:03,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:03,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1106119869] [2020-11-07 05:17:03,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:03,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:03,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 05:17:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:03,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:03,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1106119869] [2020-11-07 05:17:03,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:17:03,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:17:03,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564900326] [2020-11-07 05:17:03,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:17:03,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:04,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:17:04,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:17:04,012 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 4 states. [2020-11-07 05:17:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:04,313 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2020-11-07 05:17:04,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:17:04,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-11-07 05:17:04,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:04,331 INFO L225 Difference]: With dead ends: 143 [2020-11-07 05:17:04,331 INFO L226 Difference]: Without dead ends: 75 [2020-11-07 05:17:04,336 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:17:04,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-11-07 05:17:04,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2020-11-07 05:17:04,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-07 05:17:04,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-11-07 05:17:04,399 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 50 [2020-11-07 05:17:04,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:04,400 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-11-07 05:17:04,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:17:04,401 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-11-07 05:17:04,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-07 05:17:04,407 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:04,408 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-11-07 05:17:04,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:17:04,408 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:04,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:04,411 INFO L82 PathProgramCache]: Analyzing trace with hash 8480307, now seen corresponding path program 1 times [2020-11-07 05:17:04,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:04,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1907927055] [2020-11-07 05:17:04,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:04,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:04,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-07 05:17:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:04,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1907927055] [2020-11-07 05:17:04,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:04,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 05:17:04,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181056811] [2020-11-07 05:17:04,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:17:04,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:04,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:17:04,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:17:04,577 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 6 states. [2020-11-07 05:17:04,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:04,828 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2020-11-07 05:17:04,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:17:04,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2020-11-07 05:17:04,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:04,830 INFO L225 Difference]: With dead ends: 121 [2020-11-07 05:17:04,831 INFO L226 Difference]: Without dead ends: 85 [2020-11-07 05:17:04,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:17:04,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-11-07 05:17:04,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2020-11-07 05:17:04,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-07 05:17:04,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-11-07 05:17:04,859 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 62 [2020-11-07 05:17:04,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:04,860 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-11-07 05:17:04,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:17:04,860 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-11-07 05:17:04,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-07 05:17:04,867 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:04,867 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 05:17:04,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:17:04,867 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:04,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:04,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1768479399, now seen corresponding path program 2 times [2020-11-07 05:17:04,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:04,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1087400056] [2020-11-07 05:17:04,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:05,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:05,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-07 05:17:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:05,103 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:05,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1087400056] [2020-11-07 05:17:05,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:05,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:17:05,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603725343] [2020-11-07 05:17:05,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:17:05,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:05,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:17:05,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:17:05,107 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 8 states. [2020-11-07 05:17:05,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:05,375 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2020-11-07 05:17:05,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:17:05,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2020-11-07 05:17:05,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:05,378 INFO L225 Difference]: With dead ends: 131 [2020-11-07 05:17:05,378 INFO L226 Difference]: Without dead ends: 95 [2020-11-07 05:17:05,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:17:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-07 05:17:05,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2020-11-07 05:17:05,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-11-07 05:17:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2020-11-07 05:17:05,393 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 72 [2020-11-07 05:17:05,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:05,394 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2020-11-07 05:17:05,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:17:05,394 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2020-11-07 05:17:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-11-07 05:17:05,396 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:05,397 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 05:17:05,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:17:05,397 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:05,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:05,398 INFO L82 PathProgramCache]: Analyzing trace with hash 297577727, now seen corresponding path program 3 times [2020-11-07 05:17:05,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:05,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [777183771] [2020-11-07 05:17:05,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:05,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:05,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-11-07 05:17:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:05,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [777183771] [2020-11-07 05:17:05,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:05,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:17:05,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734403016] [2020-11-07 05:17:05,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:17:05,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:05,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:17:05,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:17:05,675 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 10 states. [2020-11-07 05:17:06,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:06,033 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2020-11-07 05:17:06,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:17:06,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2020-11-07 05:17:06,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:06,035 INFO L225 Difference]: With dead ends: 141 [2020-11-07 05:17:06,036 INFO L226 Difference]: Without dead ends: 105 [2020-11-07 05:17:06,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-11-07 05:17:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-11-07 05:17:06,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2020-11-07 05:17:06,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-07 05:17:06,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2020-11-07 05:17:06,051 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 82 [2020-11-07 05:17:06,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:06,052 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2020-11-07 05:17:06,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:17:06,052 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2020-11-07 05:17:06,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-07 05:17:06,054 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:06,054 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 05:17:06,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:17:06,055 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:06,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash -919511771, now seen corresponding path program 4 times [2020-11-07 05:17:06,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:06,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [960509149] [2020-11-07 05:17:06,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:06,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:06,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-11-07 05:17:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:06,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [960509149] [2020-11-07 05:17:06,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:06,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 05:17:06,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988966635] [2020-11-07 05:17:06,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 05:17:06,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:06,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 05:17:06,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:17:06,405 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 12 states. [2020-11-07 05:17:06,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:06,802 INFO L93 Difference]: Finished difference Result 151 states and 153 transitions. [2020-11-07 05:17:06,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 05:17:06,802 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 92 [2020-11-07 05:17:06,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:06,804 INFO L225 Difference]: With dead ends: 151 [2020-11-07 05:17:06,804 INFO L226 Difference]: Without dead ends: 115 [2020-11-07 05:17:06,805 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:17:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-11-07 05:17:06,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2020-11-07 05:17:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-07 05:17:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2020-11-07 05:17:06,820 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 92 [2020-11-07 05:17:06,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:06,821 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2020-11-07 05:17:06,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 05:17:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2020-11-07 05:17:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-11-07 05:17:06,823 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:06,823 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 05:17:06,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:17:06,824 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:06,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:06,824 INFO L82 PathProgramCache]: Analyzing trace with hash 343709131, now seen corresponding path program 5 times [2020-11-07 05:17:06,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:06,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1205173001] [2020-11-07 05:17:06,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:07,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:07,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-11-07 05:17:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:07,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1205173001] [2020-11-07 05:17:07,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:07,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 05:17:07,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137919806] [2020-11-07 05:17:07,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 05:17:07,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:07,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 05:17:07,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:17:07,086 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 14 states. [2020-11-07 05:17:07,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:07,480 INFO L93 Difference]: Finished difference Result 161 states and 163 transitions. [2020-11-07 05:17:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 05:17:07,481 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 102 [2020-11-07 05:17:07,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:07,483 INFO L225 Difference]: With dead ends: 161 [2020-11-07 05:17:07,483 INFO L226 Difference]: Without dead ends: 125 [2020-11-07 05:17:07,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2020-11-07 05:17:07,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-11-07 05:17:07,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2020-11-07 05:17:07,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-11-07 05:17:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2020-11-07 05:17:07,514 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 102 [2020-11-07 05:17:07,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:07,515 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2020-11-07 05:17:07,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 05:17:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2020-11-07 05:17:07,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-11-07 05:17:07,518 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:07,519 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 05:17:07,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:17:07,531 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:07,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:07,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1855080719, now seen corresponding path program 6 times [2020-11-07 05:17:07,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:07,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1799795778] [2020-11-07 05:17:07,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:07,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:07,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 05:17:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:07,811 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:07,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1799795778] [2020-11-07 05:17:07,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:07,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 05:17:07,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601016926] [2020-11-07 05:17:07,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 05:17:07,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:07,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 05:17:07,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-11-07 05:17:07,815 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 16 states. [2020-11-07 05:17:08,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:08,239 INFO L93 Difference]: Finished difference Result 171 states and 173 transitions. [2020-11-07 05:17:08,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 05:17:08,240 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 112 [2020-11-07 05:17:08,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:08,241 INFO L225 Difference]: With dead ends: 171 [2020-11-07 05:17:08,242 INFO L226 Difference]: Without dead ends: 135 [2020-11-07 05:17:08,244 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=511, Unknown=0, NotChecked=0, Total=756 [2020-11-07 05:17:08,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-11-07 05:17:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 127. [2020-11-07 05:17:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-07 05:17:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2020-11-07 05:17:08,264 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 112 [2020-11-07 05:17:08,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:08,265 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2020-11-07 05:17:08,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 05:17:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2020-11-07 05:17:08,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-11-07 05:17:08,267 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:08,267 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 05:17:08,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:17:08,267 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:08,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:08,268 INFO L82 PathProgramCache]: Analyzing trace with hash -367255401, now seen corresponding path program 7 times [2020-11-07 05:17:08,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:08,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [388833119] [2020-11-07 05:17:08,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:08,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:08,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-11-07 05:17:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:08,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [388833119] [2020-11-07 05:17:08,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:08,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 05:17:08,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536710559] [2020-11-07 05:17:08,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 05:17:08,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:08,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 05:17:08,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2020-11-07 05:17:08,623 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 18 states. [2020-11-07 05:17:09,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:09,293 INFO L93 Difference]: Finished difference Result 181 states and 183 transitions. [2020-11-07 05:17:09,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 05:17:09,294 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 122 [2020-11-07 05:17:09,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:09,296 INFO L225 Difference]: With dead ends: 181 [2020-11-07 05:17:09,297 INFO L226 Difference]: Without dead ends: 145 [2020-11-07 05:17:09,298 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2020-11-07 05:17:09,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-11-07 05:17:09,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 137. [2020-11-07 05:17:09,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-11-07 05:17:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2020-11-07 05:17:09,311 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 122 [2020-11-07 05:17:09,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:09,312 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2020-11-07 05:17:09,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 05:17:09,312 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2020-11-07 05:17:09,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-07 05:17:09,315 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:09,315 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 05:17:09,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:17:09,315 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:09,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:09,316 INFO L82 PathProgramCache]: Analyzing trace with hash 451359421, now seen corresponding path program 8 times [2020-11-07 05:17:09,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:09,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [961434920] [2020-11-07 05:17:09,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:09,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:09,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-11-07 05:17:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:09,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [961434920] [2020-11-07 05:17:09,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:09,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-11-07 05:17:09,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951919240] [2020-11-07 05:17:09,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 05:17:09,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:09,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 05:17:09,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:17:09,795 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 20 states. [2020-11-07 05:17:10,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:10,605 INFO L93 Difference]: Finished difference Result 191 states and 193 transitions. [2020-11-07 05:17:10,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 05:17:10,613 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 132 [2020-11-07 05:17:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:10,614 INFO L225 Difference]: With dead ends: 191 [2020-11-07 05:17:10,614 INFO L226 Difference]: Without dead ends: 155 [2020-11-07 05:17:10,616 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=405, Invalid=855, Unknown=0, NotChecked=0, Total=1260 [2020-11-07 05:17:10,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-11-07 05:17:10,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 147. [2020-11-07 05:17:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-11-07 05:17:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2020-11-07 05:17:10,636 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 132 [2020-11-07 05:17:10,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:10,638 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2020-11-07 05:17:10,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 05:17:10,638 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2020-11-07 05:17:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-11-07 05:17:10,650 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:10,651 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 05:17:10,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:17:10,651 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:10,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:10,652 INFO L82 PathProgramCache]: Analyzing trace with hash 947277155, now seen corresponding path program 9 times [2020-11-07 05:17:10,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:10,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1576641271] [2020-11-07 05:17:10,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:11,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:11,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-11-07 05:17:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:17:11,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1576641271] [2020-11-07 05:17:11,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:11,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-11-07 05:17:11,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115569442] [2020-11-07 05:17:11,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 05:17:11,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:11,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 05:17:11,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2020-11-07 05:17:11,123 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 22 states. [2020-11-07 05:17:11,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:11,800 INFO L93 Difference]: Finished difference Result 193 states and 195 transitions. [2020-11-07 05:17:11,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-11-07 05:17:11,801 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 142 [2020-11-07 05:17:11,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:11,803 INFO L225 Difference]: With dead ends: 193 [2020-11-07 05:17:11,803 INFO L226 Difference]: Without dead ends: 157 [2020-11-07 05:17:11,805 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=500, Invalid=1060, Unknown=0, NotChecked=0, Total=1560 [2020-11-07 05:17:11,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-11-07 05:17:11,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2020-11-07 05:17:11,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-11-07 05:17:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2020-11-07 05:17:11,818 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 142 [2020-11-07 05:17:11,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:11,819 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2020-11-07 05:17:11,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 05:17:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2020-11-07 05:17:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-11-07 05:17:11,821 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:11,822 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 05:17:11,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:17:11,822 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:11,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:11,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1246179191, now seen corresponding path program 10 times [2020-11-07 05:17:11,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:11,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [312903618] [2020-11-07 05:17:11,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:22,319 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 9 [2020-11-07 05:17:25,002 WARN L194 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 795 DAG size of output: 8 [2020-11-07 05:17:27,439 WARN L194 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 797 DAG size of output: 9 [2020-11-07 05:17:32,297 WARN L194 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 1392 DAG size of output: 11 [2020-11-07 05:17:36,932 WARN L194 SmtUtils]: Spent 3.98 s on a formula simplification. DAG size of input: 1399 DAG size of output: 10 [2020-11-07 05:17:41,787 WARN L194 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 687 DAG size of output: 10 [2020-11-07 05:17:42,299 WARN L194 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 36 [2020-11-07 05:17:42,710 WARN L194 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 45 [2020-11-07 05:17:43,110 WARN L194 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 38 [2020-11-07 05:17:43,351 WARN L194 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 33 [2020-11-07 05:17:43,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:43,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-11-07 05:17:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:17:43,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [312903618] [2020-11-07 05:17:43,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:43,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2020-11-07 05:17:43,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857561852] [2020-11-07 05:17:43,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-11-07 05:17:43,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:43,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-11-07 05:17:43,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2020-11-07 05:17:43,683 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 31 states. [2020-11-07 05:17:46,451 WARN L194 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2020-11-07 05:17:47,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:47,064 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2020-11-07 05:17:47,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-11-07 05:17:47,065 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 152 [2020-11-07 05:17:47,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:47,068 INFO L225 Difference]: With dead ends: 179 [2020-11-07 05:17:47,068 INFO L226 Difference]: Without dead ends: 162 [2020-11-07 05:17:47,070 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=248, Invalid=3058, Unknown=0, NotChecked=0, Total=3306 [2020-11-07 05:17:47,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-11-07 05:17:47,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2020-11-07 05:17:47,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-11-07 05:17:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2020-11-07 05:17:47,085 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 152 [2020-11-07 05:17:47,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:47,085 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2020-11-07 05:17:47,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-11-07 05:17:47,086 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2020-11-07 05:17:47,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-11-07 05:17:47,088 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:47,088 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 05:17:47,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:17:47,088 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:47,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:47,089 INFO L82 PathProgramCache]: Analyzing trace with hash 388670129, now seen corresponding path program 1 times [2020-11-07 05:17:47,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:47,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1982969208] [2020-11-07 05:17:47,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:49,853 WARN L194 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 34 [2020-11-07 05:17:50,209 WARN L194 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 41 [2020-11-07 05:17:50,695 WARN L194 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 59 [2020-11-07 05:17:51,177 WARN L194 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 47 [2020-11-07 05:17:51,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:17:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:51,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2020-11-07 05:17:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:17:52,216 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 460 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:17:52,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1982969208] [2020-11-07 05:17:52,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:17:52,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2020-11-07 05:17:52,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071664402] [2020-11-07 05:17:52,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-11-07 05:17:52,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:17:52,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-11-07 05:17:52,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1524, Unknown=0, NotChecked=0, Total=1640 [2020-11-07 05:17:52,220 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 41 states. [2020-11-07 05:17:55,416 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2020-11-07 05:17:57,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:17:57,284 INFO L93 Difference]: Finished difference Result 176 states and 178 transitions. [2020-11-07 05:17:57,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2020-11-07 05:17:57,285 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 158 [2020-11-07 05:17:57,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:17:57,290 INFO L225 Difference]: With dead ends: 176 [2020-11-07 05:17:57,290 INFO L226 Difference]: Without dead ends: 168 [2020-11-07 05:17:57,293 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1454 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=377, Invalid=5785, Unknown=0, NotChecked=0, Total=6162 [2020-11-07 05:17:57,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-11-07 05:17:57,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2020-11-07 05:17:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-11-07 05:17:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2020-11-07 05:17:57,318 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 158 [2020-11-07 05:17:57,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:17:57,319 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2020-11-07 05:17:57,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-11-07 05:17:57,319 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2020-11-07 05:17:57,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-11-07 05:17:57,322 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:17:57,323 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 05:17:57,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:17:57,323 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:17:57,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:17:57,324 INFO L82 PathProgramCache]: Analyzing trace with hash 7354073, now seen corresponding path program 2 times [2020-11-07 05:17:57,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:17:57,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1867963362] [2020-11-07 05:17:57,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:17:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:18:06,539 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 11 [2020-11-07 05:18:06,765 WARN L194 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 8 [2020-11-07 05:18:07,046 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 8 [2020-11-07 05:18:07,568 WARN L194 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 8 [2020-11-07 05:18:07,977 WARN L194 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 8 [2020-11-07 05:18:08,723 WARN L194 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 8 [2020-11-07 05:18:08,991 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 23 [2020-11-07 05:18:09,403 WARN L194 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 28 [2020-11-07 05:18:09,974 WARN L194 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 44 [2020-11-07 05:18:10,442 WARN L194 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 25 [2020-11-07 05:18:10,849 WARN L194 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 31 [2020-11-07 05:18:11,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:18:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:18:11,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-11-07 05:18:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:18:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 468 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:18:11,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1867963362] [2020-11-07 05:18:11,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:18:11,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2020-11-07 05:18:11,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988291496] [2020-11-07 05:18:11,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-11-07 05:18:11,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:18:11,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-11-07 05:18:11,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 05:18:11,364 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 33 states. [2020-11-07 05:18:13,615 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2020-11-07 05:18:13,833 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2020-11-07 05:18:14,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:18:14,614 INFO L93 Difference]: Finished difference Result 191 states and 192 transitions. [2020-11-07 05:18:14,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-11-07 05:18:14,615 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 164 [2020-11-07 05:18:14,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:18:14,618 INFO L225 Difference]: With dead ends: 191 [2020-11-07 05:18:14,618 INFO L226 Difference]: Without dead ends: 174 [2020-11-07 05:18:14,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=263, Invalid=3277, Unknown=0, NotChecked=0, Total=3540 [2020-11-07 05:18:14,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-11-07 05:18:14,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2020-11-07 05:18:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-11-07 05:18:14,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2020-11-07 05:18:14,637 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 164 [2020-11-07 05:18:14,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:18:14,638 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2020-11-07 05:18:14,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-11-07 05:18:14,638 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2020-11-07 05:18:14,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-11-07 05:18:14,640 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:18:14,640 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 05:18:14,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 05:18:14,641 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:18:14,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:18:14,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2144334591, now seen corresponding path program 3 times [2020-11-07 05:18:14,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:18:14,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1890658380] [2020-11-07 05:18:14,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:18:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:18:24,360 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 11 [2020-11-07 05:18:24,920 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 11 [2020-11-07 05:18:25,144 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 8 [2020-11-07 05:18:25,409 WARN L194 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 8 [2020-11-07 05:18:25,913 WARN L194 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 8 [2020-11-07 05:18:26,307 WARN L194 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 8 [2020-11-07 05:18:27,049 WARN L194 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 8 [2020-11-07 05:18:27,651 WARN L194 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 28 [2020-11-07 05:18:28,126 WARN L194 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 31 [2020-11-07 05:18:28,686 WARN L194 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 25 [2020-11-07 05:18:29,158 WARN L194 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 31 [2020-11-07 05:18:29,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:18:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:18:29,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2020-11-07 05:18:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:18:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 482 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:18:29,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1890658380] [2020-11-07 05:18:29,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:18:29,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2020-11-07 05:18:29,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879117619] [2020-11-07 05:18:29,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-11-07 05:18:29,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:18:29,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-11-07 05:18:29,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1018, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 05:18:29,745 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 34 states. [2020-11-07 05:18:33,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:18:33,021 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2020-11-07 05:18:33,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2020-11-07 05:18:33,022 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 170 [2020-11-07 05:18:33,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:18:33,025 INFO L225 Difference]: With dead ends: 197 [2020-11-07 05:18:33,025 INFO L226 Difference]: Without dead ends: 180 [2020-11-07 05:18:33,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=295, Invalid=3611, Unknown=0, NotChecked=0, Total=3906 [2020-11-07 05:18:33,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-11-07 05:18:33,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2020-11-07 05:18:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-11-07 05:18:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2020-11-07 05:18:33,043 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 170 [2020-11-07 05:18:33,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:18:33,044 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2020-11-07 05:18:33,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-11-07 05:18:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2020-11-07 05:18:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-11-07 05:18:33,046 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:18:33,046 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 05:18:33,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 05:18:33,047 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:18:33,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:18:33,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1372543703, now seen corresponding path program 4 times [2020-11-07 05:18:33,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:18:33,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1648562162] [2020-11-07 05:18:33,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:18:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:18:38,586 WARN L194 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 9 [2020-11-07 05:18:39,058 WARN L194 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 8 [2020-11-07 05:18:39,651 WARN L194 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 8 [2020-11-07 05:18:40,272 WARN L194 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 428 DAG size of output: 8 [2020-11-07 05:18:41,187 WARN L194 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 411 DAG size of output: 9 [2020-11-07 05:18:42,383 WARN L194 SmtUtils]: Spent 904.00 ms on a formula simplification. DAG size of input: 583 DAG size of output: 8 [2020-11-07 05:18:43,713 WARN L194 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 563 DAG size of output: 9 [2020-11-07 05:18:45,942 WARN L194 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 746 DAG size of output: 8 [2020-11-07 05:18:46,286 WARN L194 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 33 [2020-11-07 05:18:46,728 WARN L194 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 34 [2020-11-07 05:18:47,327 WARN L194 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 52 [2020-11-07 05:18:48,002 WARN L194 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 59 [2020-11-07 05:18:48,627 WARN L194 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 52 [2020-11-07 05:18:49,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:18:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:18:49,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-11-07 05:18:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:18:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 502 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:18:50,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1648562162] [2020-11-07 05:18:50,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:18:50,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2020-11-07 05:18:50,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001373532] [2020-11-07 05:18:50,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-11-07 05:18:50,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:18:50,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-11-07 05:18:50,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1762, Unknown=0, NotChecked=0, Total=1892 [2020-11-07 05:18:50,302 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 44 states. [2020-11-07 05:18:53,668 WARN L194 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2020-11-07 05:18:53,898 WARN L194 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2020-11-07 05:18:54,247 WARN L194 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2020-11-07 05:18:55,976 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2020-11-07 05:18:56,536 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2020-11-07 05:18:58,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:18:58,159 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2020-11-07 05:18:58,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2020-11-07 05:18:58,160 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 176 [2020-11-07 05:18:58,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:18:58,163 INFO L225 Difference]: With dead ends: 194 [2020-11-07 05:18:58,163 INFO L226 Difference]: Without dead ends: 186 [2020-11-07 05:18:58,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2158 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=590, Invalid=8152, Unknown=0, NotChecked=0, Total=8742 [2020-11-07 05:18:58,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-11-07 05:18:58,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2020-11-07 05:18:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-11-07 05:18:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2020-11-07 05:18:58,184 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 176 [2020-11-07 05:18:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:18:58,185 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2020-11-07 05:18:58,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2020-11-07 05:18:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2020-11-07 05:18:58,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-11-07 05:18:58,188 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:18:58,188 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 05:18:58,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 05:18:58,188 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:18:58,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:18:58,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1398308689, now seen corresponding path program 5 times [2020-11-07 05:18:58,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:18:58,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [576112584] [2020-11-07 05:18:58,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:18:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:19:04,168 WARN L194 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 8 [2020-11-07 05:19:04,656 WARN L194 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 11 [2020-11-07 05:19:06,000 WARN L194 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 650 DAG size of output: 8 [2020-11-07 05:19:06,986 WARN L194 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 624 DAG size of output: 8 [2020-11-07 05:19:09,756 WARN L194 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 1059 DAG size of output: 8 [2020-11-07 05:19:12,388 WARN L194 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 1033 DAG size of output: 9 [2020-11-07 05:19:21,445 WARN L194 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 2086 DAG size of output: 8 [2020-11-07 05:19:21,765 WARN L194 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 25 [2020-11-07 05:19:22,129 WARN L194 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 35 [2020-11-07 05:19:22,656 WARN L194 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 46 [2020-11-07 05:19:23,208 WARN L194 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 38 [2020-11-07 05:19:23,565 WARN L194 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 33 [2020-11-07 05:19:24,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:19:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:19:24,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-11-07 05:19:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:19:24,715 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:19:24,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [576112584] [2020-11-07 05:19:24,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:19:24,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2020-11-07 05:19:24,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112693502] [2020-11-07 05:19:24,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-11-07 05:19:24,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:19:24,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-11-07 05:19:24,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1149, Unknown=0, NotChecked=0, Total=1260 [2020-11-07 05:19:24,726 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 36 states. [2020-11-07 05:19:27,855 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2020-11-07 05:19:28,253 WARN L194 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2020-11-07 05:19:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:19:29,493 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2020-11-07 05:19:29,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-11-07 05:19:29,495 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 182 [2020-11-07 05:19:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:19:29,497 INFO L225 Difference]: With dead ends: 209 [2020-11-07 05:19:29,497 INFO L226 Difference]: Without dead ends: 192 [2020-11-07 05:19:29,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=408, Invalid=4848, Unknown=0, NotChecked=0, Total=5256 [2020-11-07 05:19:29,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-11-07 05:19:29,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2020-11-07 05:19:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-11-07 05:19:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2020-11-07 05:19:29,520 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 182 [2020-11-07 05:19:29,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:19:29,521 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2020-11-07 05:19:29,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-11-07 05:19:29,521 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2020-11-07 05:19:29,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-11-07 05:19:29,524 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:19:29,524 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 05:19:29,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 05:19:29,524 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:19:29,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:19:29,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1850860679, now seen corresponding path program 6 times [2020-11-07 05:19:29,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:19:29,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [632836025] [2020-11-07 05:19:29,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:19:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:19:37,972 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 11 [2020-11-07 05:19:38,320 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 8 [2020-11-07 05:19:38,565 WARN L194 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 11 [2020-11-07 05:19:38,823 WARN L194 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 8 [2020-11-07 05:19:39,127 WARN L194 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 8 [2020-11-07 05:19:39,702 WARN L194 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 8 [2020-11-07 05:19:40,156 WARN L194 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 8 [2020-11-07 05:19:40,971 WARN L194 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 8 [2020-11-07 05:19:41,373 WARN L194 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 22 [2020-11-07 05:19:41,780 WARN L194 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 28 [2020-11-07 05:19:42,350 WARN L194 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 31 [2020-11-07 05:19:42,984 WARN L194 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 25 [2020-11-07 05:19:43,564 WARN L194 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 31 [2020-11-07 05:19:44,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:19:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:19:44,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-11-07 05:19:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:19:44,565 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 560 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:19:44,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [632836025] [2020-11-07 05:19:44,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:19:44,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2020-11-07 05:19:44,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961216650] [2020-11-07 05:19:44,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-11-07 05:19:44,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:19:44,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-11-07 05:19:44,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1207, Unknown=0, NotChecked=0, Total=1332 [2020-11-07 05:19:44,568 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 37 states. [2020-11-07 05:19:49,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:19:49,054 INFO L93 Difference]: Finished difference Result 215 states and 216 transitions. [2020-11-07 05:19:49,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2020-11-07 05:19:49,056 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 188 [2020-11-07 05:19:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:19:49,058 INFO L225 Difference]: With dead ends: 215 [2020-11-07 05:19:49,059 INFO L226 Difference]: Without dead ends: 198 [2020-11-07 05:19:49,061 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=427, Invalid=4685, Unknown=0, NotChecked=0, Total=5112 [2020-11-07 05:19:49,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-11-07 05:19:49,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2020-11-07 05:19:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-11-07 05:19:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2020-11-07 05:19:49,078 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 188 [2020-11-07 05:19:49,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:19:49,079 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2020-11-07 05:19:49,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-11-07 05:19:49,079 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2020-11-07 05:19:49,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-11-07 05:19:49,081 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:19:49,081 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 05:19:49,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 05:19:49,082 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:19:49,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:19:49,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1940391519, now seen corresponding path program 7 times [2020-11-07 05:19:49,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:19:49,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [945124908] [2020-11-07 05:19:49,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:19:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:19:56,962 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 11 [2020-11-07 05:19:57,316 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 8 [2020-11-07 05:19:57,556 WARN L194 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 11 [2020-11-07 05:19:57,807 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 8 [2020-11-07 05:19:58,109 WARN L194 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 8 [2020-11-07 05:19:58,698 WARN L194 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 8 [2020-11-07 05:19:59,136 WARN L194 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 8 [2020-11-07 05:19:59,974 WARN L194 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 8 [2020-11-07 05:20:00,399 WARN L194 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 29 [2020-11-07 05:20:00,907 WARN L194 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 36 [2020-11-07 05:20:01,626 WARN L194 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 44 [2020-11-07 05:20:02,319 WARN L194 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 38 [2020-11-07 05:20:02,767 WARN L194 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 33 [2020-11-07 05:20:03,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:20:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:03,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 05:20:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 598 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:20:03,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [945124908] [2020-11-07 05:20:03,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:20:03,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2020-11-07 05:20:03,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231249670] [2020-11-07 05:20:03,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-11-07 05:20:03,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:20:03,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-11-07 05:20:03,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1278, Unknown=0, NotChecked=0, Total=1406 [2020-11-07 05:20:03,981 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 38 states. [2020-11-07 05:20:07,552 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2020-11-07 05:20:08,001 WARN L194 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2020-11-07 05:20:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:20:09,707 INFO L93 Difference]: Finished difference Result 221 states and 222 transitions. [2020-11-07 05:20:09,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2020-11-07 05:20:09,714 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 194 [2020-11-07 05:20:09,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:20:09,716 INFO L225 Difference]: With dead ends: 221 [2020-11-07 05:20:09,716 INFO L226 Difference]: Without dead ends: 204 [2020-11-07 05:20:09,719 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1412 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=514, Invalid=5648, Unknown=0, NotChecked=0, Total=6162 [2020-11-07 05:20:09,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-11-07 05:20:09,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2020-11-07 05:20:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2020-11-07 05:20:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2020-11-07 05:20:09,741 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 194 [2020-11-07 05:20:09,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:20:09,742 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2020-11-07 05:20:09,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-11-07 05:20:09,742 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2020-11-07 05:20:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2020-11-07 05:20:09,745 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:20:09,745 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 05:20:09,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 05:20:09,746 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:20:09,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:20:09,747 INFO L82 PathProgramCache]: Analyzing trace with hash 261921225, now seen corresponding path program 8 times [2020-11-07 05:20:09,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:20:09,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1022359562] [2020-11-07 05:20:09,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:20:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:13,397 WARN L194 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 8 [2020-11-07 05:20:13,648 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 8 [2020-11-07 05:20:14,075 WARN L194 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 8 [2020-11-07 05:20:14,495 WARN L194 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 8 [2020-11-07 05:20:15,261 WARN L194 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 8 [2020-11-07 05:20:15,783 WARN L194 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 35 [2020-11-07 05:20:16,398 WARN L194 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 44 [2020-11-07 05:20:17,041 WARN L194 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 42 [2020-11-07 05:20:17,347 WARN L194 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 15 [2020-11-07 05:20:18,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:20:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:18,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2020-11-07 05:20:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:18,768 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 642 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:20:18,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1022359562] [2020-11-07 05:20:18,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:20:18,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2020-11-07 05:20:18,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344649716] [2020-11-07 05:20:18,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-11-07 05:20:18,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:20:18,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-11-07 05:20:18,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1342, Unknown=0, NotChecked=0, Total=1482 [2020-11-07 05:20:18,772 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 39 states. [2020-11-07 05:20:22,828 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-11-07 05:20:23,294 WARN L194 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2020-11-07 05:20:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:20:25,606 INFO L93 Difference]: Finished difference Result 233 states and 235 transitions. [2020-11-07 05:20:25,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2020-11-07 05:20:25,607 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 200 [2020-11-07 05:20:25,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:20:25,610 INFO L225 Difference]: With dead ends: 233 [2020-11-07 05:20:25,610 INFO L226 Difference]: Without dead ends: 216 [2020-11-07 05:20:25,613 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=633, Invalid=6339, Unknown=0, NotChecked=0, Total=6972 [2020-11-07 05:20:25,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-11-07 05:20:25,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 213. [2020-11-07 05:20:25,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-11-07 05:20:25,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2020-11-07 05:20:25,632 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 200 [2020-11-07 05:20:25,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:20:25,632 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2020-11-07 05:20:25,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-11-07 05:20:25,633 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2020-11-07 05:20:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-11-07 05:20:25,635 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:20:25,635 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 05:20:25,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 05:20:25,635 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:20:25,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:20:25,636 INFO L82 PathProgramCache]: Analyzing trace with hash 514859033, now seen corresponding path program 9 times [2020-11-07 05:20:25,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:20:25,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [683573354] [2020-11-07 05:20:25,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:20:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:30,153 WARN L194 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 417 DAG size of output: 8 [2020-11-07 05:20:30,612 WARN L194 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 418 DAG size of output: 8 [2020-11-07 05:20:31,665 WARN L194 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 672 DAG size of output: 8 [2020-11-07 05:20:32,773 WARN L194 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 674 DAG size of output: 8 [2020-11-07 05:20:34,986 WARN L194 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 931 DAG size of output: 8 [2020-11-07 05:20:35,404 WARN L194 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2020-11-07 05:20:35,807 WARN L194 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 38 [2020-11-07 05:20:36,176 WARN L194 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2020-11-07 05:20:36,428 WARN L194 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2020-11-07 05:20:38,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:20:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:38,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2020-11-07 05:20:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:39,683 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:20:39,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [683573354] [2020-11-07 05:20:39,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:20:39,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2020-11-07 05:20:39,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606623918] [2020-11-07 05:20:39,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 48 states [2020-11-07 05:20:39,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:20:39,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2020-11-07 05:20:39,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=2136, Unknown=0, NotChecked=0, Total=2256 [2020-11-07 05:20:39,687 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 48 states. [2020-11-07 05:20:44,616 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2020-11-07 05:20:51,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:20:51,503 INFO L93 Difference]: Finished difference Result 230 states and 232 transitions. [2020-11-07 05:20:51,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2020-11-07 05:20:51,505 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 212 [2020-11-07 05:20:51,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:20:51,508 INFO L225 Difference]: With dead ends: 230 [2020-11-07 05:20:51,508 INFO L226 Difference]: Without dead ends: 222 [2020-11-07 05:20:51,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2338 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=457, Invalid=10049, Unknown=0, NotChecked=0, Total=10506 [2020-11-07 05:20:51,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-11-07 05:20:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2020-11-07 05:20:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-11-07 05:20:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2020-11-07 05:20:51,533 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 212 [2020-11-07 05:20:51,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:20:51,533 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2020-11-07 05:20:51,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2020-11-07 05:20:51,534 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2020-11-07 05:20:51,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-11-07 05:20:51,535 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:20:51,535 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 05:20:51,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-07 05:20:51,535 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:20:51,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:20:51,536 INFO L82 PathProgramCache]: Analyzing trace with hash 2024539713, now seen corresponding path program 10 times [2020-11-07 05:20:51,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:20:51,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [583241187] [2020-11-07 05:20:51,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:20:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:59,361 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 11 [2020-11-07 05:20:59,718 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 8 [2020-11-07 05:20:59,977 WARN L194 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 11 [2020-11-07 05:21:00,256 WARN L194 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 8 [2020-11-07 05:21:00,574 WARN L194 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 8 [2020-11-07 05:21:01,161 WARN L194 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 8 [2020-11-07 05:21:01,761 WARN L194 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 8 [2020-11-07 05:21:02,626 WARN L194 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 8 [2020-11-07 05:21:02,916 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 22 [2020-11-07 05:21:03,379 WARN L194 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 27 [2020-11-07 05:21:03,998 WARN L194 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 31 [2020-11-07 05:21:04,719 WARN L194 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 25 [2020-11-07 05:21:05,376 WARN L194 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 31 [2020-11-07 05:21:06,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:06,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2020-11-07 05:21:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 342 proven. 468 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:21:06,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [583241187] [2020-11-07 05:21:06,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:06,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2020-11-07 05:21:06,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895702791] [2020-11-07 05:21:06,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-11-07 05:21:06,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:06,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-11-07 05:21:06,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1473, Unknown=0, NotChecked=0, Total=1640 [2020-11-07 05:21:06,788 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 41 states. [2020-11-07 05:21:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:11,537 INFO L93 Difference]: Finished difference Result 219 states and 220 transitions. [2020-11-07 05:21:11,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-11-07 05:21:11,537 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 218 [2020-11-07 05:21:11,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:11,538 INFO L225 Difference]: With dead ends: 219 [2020-11-07 05:21:11,538 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 05:21:11,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=462, Invalid=4940, Unknown=0, NotChecked=0, Total=5402 [2020-11-07 05:21:11,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 05:21:11,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 05:21:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 05:21:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 05:21:11,541 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 218 [2020-11-07 05:21:11,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:11,541 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 05:21:11,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-11-07 05:21:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 05:21:11,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 05:21:11,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-07 05:21:11,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 05:21:12,472 WARN L194 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-11-07 05:21:13,025 WARN L194 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2020-11-07 05:21:13,605 WARN L194 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 73 [2020-11-07 05:21:14,163 WARN L194 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 73 [2020-11-07 05:21:14,284 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 33 [2020-11-07 05:21:14,539 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 33 [2020-11-07 05:21:14,684 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 33 [2020-11-07 05:21:15,087 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2020-11-07 05:21:15,200 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-11-07 05:21:16,065 WARN L194 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 39 [2020-11-07 05:21:17,554 WARN L194 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 129 DAG size of output: 88 [2020-11-07 05:21:18,929 WARN L194 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 117 DAG size of output: 86 [2020-11-07 05:21:18,940 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 05:21:18,940 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 05:21:18,940 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 05:21:18,941 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 05:21:18,941 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 05:21:18,941 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 05:21:18,941 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:21:18,941 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 05:21:18,941 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 05:21:18,941 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 05:21:18,942 INFO L262 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-11-07 05:21:18,942 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 05:21:18,942 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 05:21:18,942 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:21:18,942 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:21:18,943 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:21:18,943 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 05:21:18,943 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 05:21:18,943 INFO L262 CegarLoopResult]: At program point L39-6(lines 39 41) the Hoare annotation is: (and (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (= |main_~#array~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) [2020-11-07 05:21:18,943 INFO L262 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (<= main_~j~0 9)) [2020-11-07 05:21:18,943 INFO L262 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (<= main_~j~0 9)) [2020-11-07 05:21:18,943 INFO L262 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (<= main_~j~0 9)) [2020-11-07 05:21:18,943 INFO L262 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (= |main_~#array~0.offset| 0) [2020-11-07 05:21:18,944 INFO L262 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (= |main_~#array~0.offset| 0) [2020-11-07 05:21:18,944 INFO L262 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (= |main_~#array~0.offset| 0) [2020-11-07 05:21:18,944 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 22 52) the Hoare annotation is: true [2020-11-07 05:21:18,944 INFO L262 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (.cse7 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)))) (let ((.cse2 (= |main_~#array~0.offset| 0)) (.cse3 (= .cse0 .cse7))) (or (let ((.cse1 (+ main_~i~0 5))) (and (<= .cse0 .cse1) .cse2 (<= .cse1 .cse0) .cse3)) (let ((.cse4 (+ main_~i~0 8))) (and (<= .cse4 .cse0) .cse2 .cse3 (<= .cse0 .cse4))) (let ((.cse5 (+ main_~i~0 6))) (and .cse2 .cse3 (<= .cse5 .cse0) (<= .cse0 .cse5))) (let ((.cse6 (+ main_~i~0 10))) (and (= .cse6 .cse7) (<= .cse6 .cse0) .cse2 (<= .cse0 .cse6))) (let ((.cse8 (+ main_~i~0 3))) (and (<= .cse0 .cse8) (<= .cse8 .cse0) .cse2 .cse3)) (let ((.cse9 (+ main_~i~0 2))) (and (<= .cse9 .cse0) .cse2 .cse3 (<= .cse0 .cse9))) (let ((.cse10 (+ main_~i~0 4))) (and (<= .cse10 .cse0) (<= .cse0 .cse10) .cse2 .cse3)) (let ((.cse11 (+ main_~i~0 9))) (and (<= .cse11 .cse0) (<= .cse0 .cse11) .cse2 .cse3)) (let ((.cse12 (+ main_~i~0 7))) (and (<= .cse12 .cse0) .cse2 (<= .cse0 .cse12) .cse3)) (let ((.cse13 (+ main_~i~0 1))) (and (<= .cse13 .cse0) (<= .cse0 .cse13) .cse2 .cse3))))) [2020-11-07 05:21:18,945 INFO L262 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (.cse7 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)))) (let ((.cse2 (= |main_~#array~0.offset| 0)) (.cse3 (= .cse0 .cse7))) (or (let ((.cse1 (+ main_~i~0 5))) (and (<= .cse0 .cse1) .cse2 (<= .cse1 .cse0) .cse3)) (let ((.cse4 (+ main_~i~0 8))) (and (<= .cse4 .cse0) .cse2 .cse3 (<= .cse0 .cse4))) (let ((.cse5 (+ main_~i~0 6))) (and .cse2 .cse3 (<= .cse5 .cse0) (<= .cse0 .cse5))) (let ((.cse6 (+ main_~i~0 10))) (and (= .cse6 .cse7) (<= .cse6 .cse0) .cse2 (<= .cse0 .cse6))) (let ((.cse8 (+ main_~i~0 3))) (and (<= .cse0 .cse8) (<= .cse8 .cse0) .cse2 .cse3)) (let ((.cse9 (+ main_~i~0 2))) (and (<= .cse9 .cse0) .cse2 .cse3 (<= .cse0 .cse9))) (let ((.cse10 (+ main_~i~0 4))) (and (<= .cse10 .cse0) (<= .cse0 .cse10) .cse2 .cse3)) (let ((.cse11 (+ main_~i~0 9))) (and (<= .cse11 .cse0) (<= .cse0 .cse11) .cse2 .cse3)) (let ((.cse12 (+ main_~i~0 7))) (and (<= .cse12 .cse0) .cse2 (<= .cse0 .cse12) .cse3)) (let ((.cse13 (+ main_~i~0 1))) (and (<= .cse13 .cse0) (<= .cse0 .cse13) .cse2 .cse3))))) [2020-11-07 05:21:18,945 INFO L262 CegarLoopResult]: At program point L40-2(line 40) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (let ((.cse0 (= |main_~#array~0.offset| 0)) (.cse1 (= .cse2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))))) (or (and .cse0 .cse1 (<= main_~i~0 .cse2) (<= .cse2 (+ main_~i~0 8))) (let ((.cse3 (+ main_~i~0 9))) (and (<= .cse3 .cse2) (<= .cse2 .cse3) .cse0 .cse1))))) [2020-11-07 05:21:18,945 INFO L262 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))) (and (= |main_#t~mem13.offset| .cse0) (< 0 (+ (* 8 main_~i~0) |main_~#array~0.offset| 1)) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_#t~mem13.base|) (= |main_~#array~0.offset| 0) (= .cse0 (+ (* main_~i~0 8) |main_~#array~0.offset|)) (= |main_#t~mem13.base| |main_~#array~0.base|))) [2020-11-07 05:21:18,945 INFO L262 CegarLoopResult]: At program point L36-1(line 36) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse2 (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse0 (+ (* main_~i~0 8) |main_~#array~0.offset|))) (and (= |main_#t~mem13.offset| .cse0) (= .cse1 main_~pa~0.base) (= .cse1 |main_#t~mem13.base|) (= |main_~#array~0.offset| 0) (= .cse2 .cse0) (= (+ .cse2 4) main_~pa~0.offset) (or (< 1 main_~i~0) (= .cse0 0) (= 12 main_~pa~0.offset)) (= |main_~#array~0.base| main_~pa~0.base))) [2020-11-07 05:21:18,945 INFO L269 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-11-07 05:21:18,945 INFO L269 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: true [2020-11-07 05:21:18,945 INFO L269 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: true [2020-11-07 05:21:18,945 INFO L262 CegarLoopResult]: At program point L24-3(line 24) the Hoare annotation is: false [2020-11-07 05:21:18,946 INFO L262 CegarLoopResult]: At program point L24-4(line 24) the Hoare annotation is: false [2020-11-07 05:21:18,946 INFO L262 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (+ (* main_~i~0 8) |main_~#array~0.offset|)) (.cse1 (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))) (and (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#array~0.offset| 0) (or (= .cse0 0) (< 11 main_~pa~0.offset)) (= .cse1 .cse0) (= (+ .cse1 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))) [2020-11-07 05:21:18,946 INFO L262 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (let ((.cse0 (+ (* main_~i~0 8) |main_~#array~0.offset|))) (and (= (+ |main_#t~mem14.offset| 4) main_~pa~0.offset) (= .cse0 |main_#t~mem14.offset|) (= |main_#t~mem14.base| main_~pa~0.base) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#array~0.offset| 0) (or (= .cse0 0) (< 11 main_~pa~0.offset)) (= (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) .cse0) (= |main_~#array~0.base| main_~pa~0.base))) [2020-11-07 05:21:18,946 INFO L262 CegarLoopResult]: At program point L37-2(lines 37 45) the Hoare annotation is: (let ((.cse0 (+ (* main_~i~0 8) |main_~#array~0.offset|))) (and (= (+ |main_#t~mem14.offset| 4) main_~pa~0.offset) (= .cse0 |main_#t~mem14.offset|) (= |main_#t~mem14.base| main_~pa~0.base) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#array~0.offset| 0) (or (= .cse0 0) (< 11 main_~pa~0.offset)) (= (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) .cse0) (= |main_~#array~0.base| main_~pa~0.base))) [2020-11-07 05:21:18,946 INFO L262 CegarLoopResult]: At program point L37-3(line 37) the Hoare annotation is: (let ((.cse0 (+ (* main_~i~0 8) |main_~#array~0.offset|))) (and (= (+ |main_#t~mem14.offset| 4) main_~pa~0.offset) (= .cse0 |main_#t~mem14.offset|) (= |main_#t~mem14.base| main_~pa~0.base) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#array~0.offset| 0) (or (= .cse0 0) (< 11 main_~pa~0.offset)) (= (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) .cse0) (= |main_~#array~0.base| main_~pa~0.base))) [2020-11-07 05:21:18,946 INFO L262 CegarLoopResult]: At program point L37-4(line 37) the Hoare annotation is: (let ((.cse0 (+ (* main_~i~0 8) |main_~#array~0.offset|))) (and (= (+ |main_#t~mem14.offset| 4) main_~pa~0.offset) (= .cse0 |main_#t~mem14.offset|) (= |main_#t~mem14.base| main_~pa~0.base) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#array~0.offset| 0) (or (= .cse0 0) (< 11 main_~pa~0.offset)) (= (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) .cse0) (= |main_~#array~0.base| main_~pa~0.base))) [2020-11-07 05:21:18,946 INFO L269 CegarLoopResult]: At program point L37-6(line 37) the Hoare annotation is: true [2020-11-07 05:21:18,946 INFO L269 CegarLoopResult]: At program point L37-7(line 37) the Hoare annotation is: true [2020-11-07 05:21:18,946 INFO L262 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (= |main_~#array~0.offset| 0) [2020-11-07 05:21:18,947 INFO L262 CegarLoopResult]: At program point L29-3(lines 29 32) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (<= main_~j~0 9)) [2020-11-07 05:21:18,947 INFO L262 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (= |main_~#array~0.offset| 0) [2020-11-07 05:21:18,947 INFO L262 CegarLoopResult]: At program point L29-4(line 29) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (<= main_~j~0 9)) [2020-11-07 05:21:18,947 INFO L262 CegarLoopResult]: At program point L29-5(line 29) the Hoare annotation is: (= |main_~#array~0.offset| 0) [2020-11-07 05:21:18,947 INFO L269 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: true [2020-11-07 05:21:18,947 INFO L262 CegarLoopResult]: At program point L29-6(lines 29 32) the Hoare annotation is: (= |main_~#array~0.offset| 0) [2020-11-07 05:21:18,947 INFO L269 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: true [2020-11-07 05:21:18,947 INFO L262 CegarLoopResult]: At program point L29-7(lines 23 52) the Hoare annotation is: (= |main_~#array~0.offset| 0) [2020-11-07 05:21:18,947 INFO L262 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: false [2020-11-07 05:21:18,947 INFO L262 CegarLoopResult]: At program point L25-4(line 25) the Hoare annotation is: false [2020-11-07 05:21:18,947 INFO L262 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: false [2020-11-07 05:21:18,947 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 22 52) the Hoare annotation is: true [2020-11-07 05:21:18,948 INFO L262 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (<= 1 |main_#t~ret19|) (= |main_~#array~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) [2020-11-07 05:21:18,948 INFO L262 CegarLoopResult]: At program point L42-1(lines 42 44) the Hoare annotation is: (and (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (<= 1 |main_#t~ret19|) (= |main_~#array~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) [2020-11-07 05:21:18,948 INFO L262 CegarLoopResult]: At program point L42-2(line 42) the Hoare annotation is: false [2020-11-07 05:21:18,948 INFO L269 CegarLoopResult]: At program point L42-3(line 42) the Hoare annotation is: true [2020-11-07 05:21:18,948 INFO L262 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (+ (* main_~i~0 8) |main_~#array~0.offset|)) (.cse1 (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))) (and (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#array~0.offset| 0) (or (= .cse0 0) (< 11 main_~pa~0.offset)) (= .cse1 .cse0) (= (+ .cse1 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))) [2020-11-07 05:21:18,948 INFO L262 CegarLoopResult]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse1 (+ (* main_~i~0 8) |main_~#array~0.offset|)) (.cse2 (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#array~0.offset| 0) (<= |main_#t~mem16| .cse0) (or (= .cse1 0) (< 11 main_~pa~0.offset)) (= .cse2 .cse1) (= (+ .cse2 4) main_~pa~0.offset) (<= .cse0 |main_#t~mem16|) (= |main_~#array~0.base| main_~pa~0.base))) [2020-11-07 05:21:18,948 INFO L262 CegarLoopResult]: At program point L38-2(line 38) the Hoare annotation is: (let ((.cse0 (+ main_~i~0 10)) (.cse1 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (= .cse0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (<= .cse0 .cse1) (= |main_~#array~0.offset| 0) (<= |main_#t~mem16| .cse1) (<= .cse1 .cse0) (<= .cse1 |main_#t~mem16|))) [2020-11-07 05:21:18,948 INFO L269 CegarLoopResult]: At program point L34(lines 34 46) the Hoare annotation is: true [2020-11-07 05:21:18,949 INFO L262 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (<= main_~j~0 9)) [2020-11-07 05:21:18,949 INFO L262 CegarLoopResult]: At program point mainENTRY(lines 22 52) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2020-11-07 05:21:18,949 INFO L262 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (<= main_~j~0 9)) [2020-11-07 05:21:18,949 INFO L262 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (<= main_~j~0 9)) [2020-11-07 05:21:18,949 INFO L262 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (= |main_~#array~0.offset| 0) [2020-11-07 05:21:18,949 INFO L262 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: false [2020-11-07 05:21:18,949 INFO L262 CegarLoopResult]: At program point L43(lines 23 52) the Hoare annotation is: false [2020-11-07 05:21:18,949 INFO L262 CegarLoopResult]: At program point L39-1(lines 39 41) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (let ((.cse15 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (.cse7 (<= |main_#t~mem17| .cse0)) (.cse12 (+ main_~i~0 7)) (.cse3 (+ main_~i~0 5)) (.cse8 (+ main_~i~0 1))) (let ((.cse6 (<= .cse8 |main_#t~mem17|)) (.cse4 (<= .cse3 |main_#t~mem17|)) (.cse13 (or .cse7 (and (<= .cse12 .cse0) (<= main_~pa~0.offset 4) (< 3 main_~pa~0.offset)))) (.cse2 (= .cse0 .cse15)) (.cse1 (= |main_~#array~0.offset| 0))) (or (and (<= main_~i~0 |main_#t~mem17|) (<= .cse0 main_~i~0) .cse1 (<= |main_#t~mem17| main_~i~0) .cse2 (<= main_~i~0 .cse0)) (and (<= .cse0 .cse3) .cse4 .cse1 (<= .cse3 .cse0) .cse2) (let ((.cse5 (+ main_~i~0 2))) (and (<= .cse5 .cse0) .cse6 .cse1 .cse2 (<= .cse0 .cse5))) (and .cse7 (<= .cse0 .cse8) .cse6 .cse1 .cse2) (let ((.cse9 (+ main_~i~0 4))) (and (<= .cse9 |main_#t~mem17|) (<= .cse9 .cse0) (<= .cse0 .cse9) .cse1 .cse2)) (let ((.cse10 (+ main_~i~0 6))) (and .cse4 .cse1 .cse2 (<= .cse10 .cse0) (<= .cse0 .cse10))) (let ((.cse11 (+ main_~i~0 3))) (and (<= .cse11 |main_#t~mem17|) (<= .cse0 .cse11) (<= .cse11 .cse0) .cse1 .cse2)) (and (<= .cse12 |main_#t~mem17|) .cse13 .cse1 (<= .cse0 .cse12) .cse2) (and (<= (+ main_~i~0 8) |main_#t~mem17|) .cse13 (<= .cse0 (+ main_~i~0 9)) .cse1 .cse2) (let ((.cse14 (+ main_~i~0 10))) (and (= .cse14 .cse15) (= |main_#t~mem17| .cse0) (<= .cse14 .cse0) .cse1 (<= .cse0 .cse14))))))) [2020-11-07 05:21:18,950 INFO L262 CegarLoopResult]: At program point L39-2(line 39) the Hoare annotation is: (and (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (<= main_~i~0 |main_#t~mem17|) (= |main_~#array~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) [2020-11-07 05:21:18,950 INFO L262 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (< 0 (+ (* 8 main_~i~0) |main_~#array~0.offset| 1)) (= |main_~#array~0.offset| 0)) [2020-11-07 05:21:18,950 INFO L262 CegarLoopResult]: At program point L39-4(line 39) the Hoare annotation is: (let ((.cse5 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (let ((.cse17 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (.cse13 (<= |main_#t~mem17| .cse5)) (.cse6 (+ main_~i~0 7)) (.cse15 (+ main_~i~0 5))) (let ((.cse3 (<= .cse15 |main_#t~mem17|)) (.cse9 (+ main_~i~0 3)) (.cse11 (+ main_~i~0 8)) (.cse2 (or .cse13 (and (<= .cse6 .cse5) (<= main_~pa~0.offset 4) (< 3 main_~pa~0.offset)))) (.cse0 (or (= |main_#t~mem17| .cse17) (< main_~i~0 |main_#t~mem17|))) (.cse10 (+ main_~i~0 4)) (.cse1 (<= main_~i~0 |main_#t~mem17|)) (.cse7 (= .cse5 .cse17)) (.cse4 (= |main_~#array~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 .cse6) .cse7) (let ((.cse8 (+ main_~i~0 6))) (and .cse0 .cse1 .cse3 .cse4 .cse7 (<= .cse8 .cse5) (<= .cse5 .cse8))) (and .cse0 .cse1 (<= .cse9 |main_#t~mem17|) (<= .cse10 .cse5) (<= .cse5 .cse10) .cse4 .cse7) (and .cse0 .cse1 (<= .cse6 |main_#t~mem17|) .cse2 .cse4 .cse7 (<= .cse5 .cse11)) (let ((.cse12 (+ main_~i~0 2))) (and .cse0 .cse1 (<= .cse12 .cse5) .cse4 .cse7 (<= .cse5 .cse12))) (and .cse0 .cse1 .cse4 (<= .cse5 .cse9) (<= .cse9 .cse5) .cse7) (let ((.cse14 (+ main_~i~0 1))) (and .cse0 .cse1 .cse13 (<= .cse5 .cse14) (<= .cse14 |main_#t~mem17|) .cse4 .cse7)) (and (<= .cse11 |main_#t~mem17|) .cse2 (<= .cse5 (+ main_~i~0 9)) .cse4 .cse7) (and .cse0 (<= .cse5 .cse15) (<= .cse10 |main_#t~mem17|) .cse1 .cse4 (<= .cse15 .cse5) .cse7) (let ((.cse16 (+ main_~i~0 10))) (and (= .cse16 .cse17) (= |main_#t~mem17| .cse5) (<= .cse16 .cse5) .cse4 (<= .cse5 .cse16))))))) [2020-11-07 05:21:18,950 INFO L262 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (and (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#array~0.base|) (< 0 (+ (* 8 main_~i~0) |main_~#array~0.offset| 1)) (= |main_~#array~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (+ (* main_~i~0 8) |main_~#array~0.offset|))) [2020-11-07 05:21:18,950 INFO L262 CegarLoopResult]: At program point L39-5(lines 39 41) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (.cse1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)))) (let ((.cse3 (= |main_~#array~0.offset| 0)) (.cse4 (= .cse2 .cse1))) (or (let ((.cse0 (+ main_~i~0 10))) (and (= .cse0 .cse1) (<= .cse0 .cse2) .cse3 (<= .cse2 .cse0))) (and .cse3 .cse4 (<= main_~i~0 .cse2) (<= .cse2 (+ main_~i~0 8))) (let ((.cse5 (+ main_~i~0 9))) (and (<= .cse5 .cse2) (<= .cse2 .cse5) .cse3 .cse4))))) [2020-11-07 05:21:18,950 INFO L262 CegarLoopResult]: At program point L17(lines 17 20) the Hoare annotation is: (and (= check_~pc.offset |check_#in~pc.offset|) (= check_~pc.base |check_#in~pc.base|)) [2020-11-07 05:21:18,951 INFO L262 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (.cse0 (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|))) (and (= |check_#t~mem7.offset| .cse0) (= |check_#in~i| check_~i) (= .cse1 |check_#t~mem7.base|) (= check_~pc.offset |check_#in~pc.offset|) (= (select (select |#memory_int| .cse1) (+ .cse0 4)) |check_#t~mem8|) (= check_~pc.base |check_#in~pc.base|))) [2020-11-07 05:21:18,951 INFO L262 CegarLoopResult]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (.cse0 (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|))) (let ((.cse2 (select (select |#memory_int| .cse1) (+ .cse0 4)))) (and (= |check_#t~mem7.offset| .cse0) (= |check_#in~i| check_~i) (= .cse1 |check_#t~mem7.base|) (= check_~pc.offset |check_#in~pc.offset|) (= .cse2 |check_#t~mem8|) (= check_~pc.base |check_#in~pc.base|) (or (not (= .cse2 |check_#in~i|)) (<= 1 |check_#res|))))) [2020-11-07 05:21:18,951 INFO L269 CegarLoopResult]: At program point checkENTRY(lines 17 20) the Hoare annotation is: true [2020-11-07 05:21:18,951 INFO L262 CegarLoopResult]: At program point L19-4(line 19) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (+ (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) 4)))) (and (= |check_#in~i| check_~i) (= check_~pc.offset |check_#in~pc.offset|) (= .cse0 |check_#t~mem8|) (= check_~pc.base |check_#in~pc.base|) (or (not (= .cse0 |check_#in~i|)) (<= 1 |check_#res|)))) [2020-11-07 05:21:18,951 INFO L262 CegarLoopResult]: At program point checkFINAL(lines 17 20) the Hoare annotation is: (and (= |check_#in~i| check_~i) (= check_~pc.offset |check_#in~pc.offset|) (= check_~pc.base |check_#in~pc.base|) (or (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (+ (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) 4)) |check_#in~i|)) (<= 1 |check_#res|))) [2020-11-07 05:21:18,951 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= |check_#in~i| check_~i) (= check_~pc.offset |check_#in~pc.offset|) (= check_~pc.base |check_#in~pc.base|)) [2020-11-07 05:21:18,951 INFO L262 CegarLoopResult]: At program point checkEXIT(lines 17 20) the Hoare annotation is: (and (= |check_#in~i| check_~i) (= check_~pc.offset |check_#in~pc.offset|) (= check_~pc.base |check_#in~pc.base|) (or (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (+ (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) 4)) |check_#in~i|)) (<= 1 |check_#res|))) [2020-11-07 05:21:18,951 INFO L262 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (and (= |check_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|)) (= |check_#in~i| check_~i) (= (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|) |check_#t~mem7.base|) (= check_~pc.offset |check_#in~pc.offset|) (= check_~pc.base |check_#in~pc.base|)) [2020-11-07 05:21:18,969 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-07 05:21:18,971 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-07 05:21:18,971 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-07 05:21:18,971 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-07 05:21:18,972 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-07 05:21:18,972 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-07 05:21:18,972 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,973 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:18,973 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:18,973 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,973 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,974 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,974 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,974 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:18,974 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:18,974 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,975 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,975 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,975 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,975 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,975 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,975 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:18,976 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:18,977 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-07 05:21:18,978 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-07 05:21:18,978 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-07 05:21:18,978 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-07 05:21:18,979 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-07 05:21:18,979 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-07 05:21:18,979 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,979 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:18,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:18,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,981 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:18,981 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:18,981 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,981 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,981 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,982 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,982 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,982 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,982 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:18,982 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:18,985 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-07 05:21:18,985 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-07 05:21:18,986 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:18,986 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:18,986 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:18,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:21:18 BoogieIcfgContainer [2020-11-07 05:21:18,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:21:18,990 INFO L168 Benchmark]: Toolchain (without parser) took 256811.53 ms. Allocated memory was 164.6 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 141.3 MB in the beginning and 841.8 MB in the end (delta: -700.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 8.0 GB. [2020-11-07 05:21:18,991 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 125.8 MB. Free memory was 96.1 MB in the beginning and 95.9 MB in the end (delta: 160.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:21:18,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.89 ms. Allocated memory is still 164.6 MB. Free memory was 140.7 MB in the beginning and 130.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-11-07 05:21:18,992 INFO L168 Benchmark]: Boogie Preprocessor took 47.24 ms. Allocated memory is still 164.6 MB. Free memory was 130.7 MB in the beginning and 129.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:21:18,992 INFO L168 Benchmark]: RCFGBuilder took 766.00 ms. Allocated memory is still 164.6 MB. Free memory was 129.0 MB in the beginning and 134.8 MB in the end (delta: -5.8 MB). Peak memory consumption was 11.7 MB. Max. memory is 8.0 GB. [2020-11-07 05:21:18,993 INFO L168 Benchmark]: TraceAbstraction took 255650.30 ms. Allocated memory was 164.6 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 134.4 MB in the beginning and 841.8 MB in the end (delta: -707.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 8.0 GB. [2020-11-07 05:21:18,997 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.24 ms. Allocated memory is still 125.8 MB. Free memory was 96.1 MB in the beginning and 95.9 MB in the end (delta: 160.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 329.89 ms. Allocated memory is still 164.6 MB. Free memory was 140.7 MB in the beginning and 130.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 47.24 ms. Allocated memory is still 164.6 MB. Free memory was 130.7 MB in the beginning and 129.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 766.00 ms. Allocated memory is still 164.6 MB. Free memory was 129.0 MB in the beginning and 134.8 MB in the end (delta: -5.8 MB). Peak memory consumption was 11.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 255650.30 ms. Allocated memory was 164.6 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 134.4 MB in the beginning and 841.8 MB in the end (delta: -707.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * 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: 23]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: array == 0 - InvariantResult [Line: 39]: Loop Invariant [2020-11-07 05:21:19,004 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-07 05:21:19,004 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-07 05:21:19,005 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-07 05:21:19,005 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-07 05:21:19,005 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-07 05:21:19,006 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-07 05:21:19,006 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,006 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:19,006 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:19,006 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,006 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,007 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,007 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,007 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:19,007 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:19,007 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,008 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,008 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,008 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,008 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,008 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,008 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:19,008 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:19,009 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-07 05:21:19,009 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-07 05:21:19,010 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-07 05:21:19,010 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-07 05:21:19,011 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-07 05:21:19,011 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-07 05:21:19,011 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,011 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:19,011 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:19,012 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,012 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,012 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,012 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,012 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:19,013 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:19,013 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,013 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,013 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,013 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,014 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,014 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,014 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:19,014 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((i + 10 == unknown-#memory_int-unknown[#memory_$Pointer$[cont][cont]][#memory_$Pointer$[cont][cont] + 4] && i + 10 <= unknown-#memory_int-unknown[pa][pa]) && array == 0) && unknown-#memory_int-unknown[pa][pa] <= i + 10) || (((array == 0 && unknown-#memory_int-unknown[pa][pa] == unknown-#memory_int-unknown[#memory_$Pointer$[cont][cont]][#memory_$Pointer$[cont][cont] + 4]) && i <= unknown-#memory_int-unknown[pa][pa]) && unknown-#memory_int-unknown[pa][pa] <= i + 8)) || (((i + 9 <= unknown-#memory_int-unknown[pa][pa] && unknown-#memory_int-unknown[pa][pa] <= i + 9) && array == 0) && unknown-#memory_int-unknown[pa][pa] == unknown-#memory_int-unknown[#memory_$Pointer$[cont][cont]][#memory_$Pointer$[cont][cont] + 4]) - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for check [2020-11-07 05:21:19,015 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-07 05:21:19,015 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-07 05:21:19,016 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,016 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:19,016 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:19,016 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-07 05:21:19,017 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-07 05:21:19,017 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 05:21:19,017 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-07 05:21:19,017 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived contract for procedure check: ((\old(i) == i && pc == pc) && pc == pc) && (!(unknown-#memory_int-unknown[#memory_$Pointer$[pc][pc]][#memory_$Pointer$[pc][pc] + 4] == \old(i)) || 1 <= \result) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 248.1s, OverallIterations: 21, TraceHistogramMax: 12, AutomataDifference: 65.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1619 SDtfs, 1903 SDslu, 25001 SDs, 0 SdLazy, 27360 SolverSat, 372 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1140 GetRequests, 115 SyntacticMatches, 8 SemanticMatches, 1017 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15128 ImplicationChecksByTransitivity, 141.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 102 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 86 LocationsWithAnnotation, 346 PreInvPairs, 530 NumberOfFragments, 3370 HoareAnnotationTreeSize, 346 FomulaSimplifications, 109347 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 86 FomulaSimplificationsInter, 16819 FormulaSimplificationTreeSizeReductionInter, 6.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 177.2s InterpolantComputationTime, 2982 NumberOfCodeBlocks, 2982 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2961 ConstructedInterpolants, 0 QuantifiedInterpolants, 4720394 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 1 PerfectInterpolantSequences, 364/7523 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...