/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:12:59,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:12:59,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:12:59,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:12:59,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:12:59,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:12:59,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:12:59,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:12:59,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:12:59,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:12:59,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:12:59,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:12:59,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:12:59,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:12:59,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:12:59,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:12:59,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:12:59,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:12:59,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:12:59,340 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:12:59,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:12:59,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:12:59,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:12:59,344 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:12:59,346 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:12:59,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:12:59,347 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:12:59,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:12:59,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:12:59,349 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:12:59,349 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:12:59,350 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:12:59,351 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:12:59,352 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:12:59,353 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:12:59,353 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:12:59,353 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:12:59,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:12:59,354 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:12:59,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:12:59,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:12:59,356 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 21:12:59,370 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:12:59,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:12:59,371 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:12:59,371 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:12:59,371 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:12:59,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:12:59,372 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:12:59,372 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:12:59,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:12:59,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:12:59,373 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:12:59,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:12:59,373 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:12:59,373 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:12:59,373 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:12:59,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:12:59,374 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:12:59,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:12:59,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:12:59,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:12:59,374 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:12:59,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:12:59,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:12:59,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:12:59,375 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:12:59,376 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:12:59,376 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:12:59,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:12:59,376 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:12:59,376 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:12:59,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:12:59,656 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:12:59,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:12:59,661 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:12:59,662 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:12:59,663 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label50.c [2019-11-23 21:12:59,742 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/355c93016/26fc88fd9d074066a78efc714af901f9/FLAG0df70f461 [2019-11-23 21:13:00,301 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:13:00,302 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label50.c [2019-11-23 21:13:00,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/355c93016/26fc88fd9d074066a78efc714af901f9/FLAG0df70f461 [2019-11-23 21:13:00,566 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/355c93016/26fc88fd9d074066a78efc714af901f9 [2019-11-23 21:13:00,574 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:13:00,576 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:13:00,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:13:00,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:13:00,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:13:00,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:13:00" (1/1) ... [2019-11-23 21:13:00,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d0667f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:00, skipping insertion in model container [2019-11-23 21:13:00,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:13:00" (1/1) ... [2019-11-23 21:13:00,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:13:00,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:13:01,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:13:01,254 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:13:01,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:13:01,386 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:13:01,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:01 WrapperNode [2019-11-23 21:13:01,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:13:01,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:13:01,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:13:01,388 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:13:01,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:01" (1/1) ... [2019-11-23 21:13:01,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:01" (1/1) ... [2019-11-23 21:13:01,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:13:01,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:13:01,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:13:01,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:13:01,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:01" (1/1) ... [2019-11-23 21:13:01,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:01" (1/1) ... [2019-11-23 21:13:01,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:01" (1/1) ... [2019-11-23 21:13:01,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:01" (1/1) ... [2019-11-23 21:13:01,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:01" (1/1) ... [2019-11-23 21:13:01,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:01" (1/1) ... [2019-11-23 21:13:01,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:01" (1/1) ... [2019-11-23 21:13:01,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:13:01,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:13:01,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:13:01,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:13:01,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:01" (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 [2019-11-23 21:13:01,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:13:01,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:13:03,467 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:13:03,467 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 21:13:03,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:13:03 BoogieIcfgContainer [2019-11-23 21:13:03,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:13:03,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:13:03,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:13:03,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:13:03,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:13:00" (1/3) ... [2019-11-23 21:13:03,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cae0c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:13:03, skipping insertion in model container [2019-11-23 21:13:03,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:01" (2/3) ... [2019-11-23 21:13:03,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cae0c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:13:03, skipping insertion in model container [2019-11-23 21:13:03,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:13:03" (3/3) ... [2019-11-23 21:13:03,478 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label50.c [2019-11-23 21:13:03,488 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:13:03,497 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:13:03,509 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:13:03,539 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:13:03,539 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:13:03,540 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:13:03,540 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:13:03,540 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:13:03,540 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:13:03,540 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:13:03,541 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:13:03,571 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-23 21:13:03,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 21:13:03,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:03,582 INFO L410 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] [2019-11-23 21:13:03,583 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:03,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:03,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2088660649, now seen corresponding path program 1 times [2019-11-23 21:13:03,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:03,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054490970] [2019-11-23 21:13:03,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:13:03,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054490970] [2019-11-23 21:13:03,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:03,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:13:03,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039930982] [2019-11-23 21:13:03,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:13:03,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:03,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:13:03,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:13:03,860 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-11-23 21:13:05,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:05,871 INFO L93 Difference]: Finished difference Result 866 states and 1574 transitions. [2019-11-23 21:13:05,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:13:05,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-23 21:13:05,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:05,892 INFO L225 Difference]: With dead ends: 866 [2019-11-23 21:13:05,893 INFO L226 Difference]: Without dead ends: 538 [2019-11-23 21:13:05,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:13:05,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-23 21:13:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-23 21:13:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-23 21:13:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 754 transitions. [2019-11-23 21:13:05,973 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 754 transitions. Word has length 37 [2019-11-23 21:13:05,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:05,973 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 754 transitions. [2019-11-23 21:13:05,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:13:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 754 transitions. [2019-11-23 21:13:05,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-23 21:13:05,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:05,981 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:05,981 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:05,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:05,982 INFO L82 PathProgramCache]: Analyzing trace with hash -46764254, now seen corresponding path program 1 times [2019-11-23 21:13:05,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:05,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503550317] [2019-11-23 21:13:05,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:13:06,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503550317] [2019-11-23 21:13:06,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:06,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:13:06,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412367418] [2019-11-23 21:13:06,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:13:06,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:06,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:13:06,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:13:06,653 INFO L87 Difference]: Start difference. First operand 538 states and 754 transitions. Second operand 6 states. [2019-11-23 21:13:08,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:08,668 INFO L93 Difference]: Finished difference Result 1964 states and 2764 transitions. [2019-11-23 21:13:08,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:13:08,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-11-23 21:13:08,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:08,683 INFO L225 Difference]: With dead ends: 1964 [2019-11-23 21:13:08,684 INFO L226 Difference]: Without dead ends: 1428 [2019-11-23 21:13:08,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:13:08,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-11-23 21:13:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2019-11-23 21:13:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-23 21:13:08,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1849 transitions. [2019-11-23 21:13:08,740 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1849 transitions. Word has length 145 [2019-11-23 21:13:08,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:08,743 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 1849 transitions. [2019-11-23 21:13:08,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:13:08,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1849 transitions. [2019-11-23 21:13:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-23 21:13:08,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:08,758 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:13:08,759 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:08,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash -215109710, now seen corresponding path program 1 times [2019-11-23 21:13:08,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:08,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417279244] [2019-11-23 21:13:08,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-23 21:13:08,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417279244] [2019-11-23 21:13:08,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:08,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:13:08,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796046668] [2019-11-23 21:13:08,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:13:08,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:08,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:13:08,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:13:08,967 INFO L87 Difference]: Start difference. First operand 1428 states and 1849 transitions. Second operand 4 states. [2019-11-23 21:13:10,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:10,224 INFO L93 Difference]: Finished difference Result 3922 states and 5314 transitions. [2019-11-23 21:13:10,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:13:10,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-11-23 21:13:10,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:10,237 INFO L225 Difference]: With dead ends: 3922 [2019-11-23 21:13:10,238 INFO L226 Difference]: Without dead ends: 2674 [2019-11-23 21:13:10,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:13:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2019-11-23 21:13:10,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2318. [2019-11-23 21:13:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-23 21:13:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2951 transitions. [2019-11-23 21:13:10,296 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2951 transitions. Word has length 211 [2019-11-23 21:13:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:10,297 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2951 transitions. [2019-11-23 21:13:10,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:13:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2951 transitions. [2019-11-23 21:13:10,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-23 21:13:10,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:10,300 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:13:10,300 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:10,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:10,300 INFO L82 PathProgramCache]: Analyzing trace with hash -525795883, now seen corresponding path program 1 times [2019-11-23 21:13:10,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:10,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467428026] [2019-11-23 21:13:10,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:10,567 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 138 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 21:13:10,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467428026] [2019-11-23 21:13:10,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708969864] [2019-11-23 21:13:10,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:10,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:13:10,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:13:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-23 21:13:10,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:13:10,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 21:13:10,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601531777] [2019-11-23 21:13:10,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:13:10,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:10,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:13:10,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:13:10,792 INFO L87 Difference]: Start difference. First operand 2318 states and 2951 transitions. Second operand 3 states. [2019-11-23 21:13:11,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:11,674 INFO L93 Difference]: Finished difference Result 4456 states and 5716 transitions. [2019-11-23 21:13:11,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:13:11,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-11-23 21:13:11,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:11,687 INFO L225 Difference]: With dead ends: 4456 [2019-11-23 21:13:11,687 INFO L226 Difference]: Without dead ends: 2318 [2019-11-23 21:13:11,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:13:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2019-11-23 21:13:11,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318. [2019-11-23 21:13:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-23 21:13:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2817 transitions. [2019-11-23 21:13:11,740 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2817 transitions. Word has length 225 [2019-11-23 21:13:11,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:11,741 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2817 transitions. [2019-11-23 21:13:11,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:13:11,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2817 transitions. [2019-11-23 21:13:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-11-23 21:13:11,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:11,747 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2019-11-23 21:13:11,951 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:11,952 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:11,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:11,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1918860878, now seen corresponding path program 1 times [2019-11-23 21:13:11,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:11,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126079996] [2019-11-23 21:13:11,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 235 proven. 4 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-23 21:13:12,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126079996] [2019-11-23 21:13:12,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224923906] [2019-11-23 21:13:12,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:12,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:13:12,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:13:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-11-23 21:13:12,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:13:12,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 21:13:12,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741223991] [2019-11-23 21:13:12,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:13:12,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:12,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:13:12,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:13:12,538 INFO L87 Difference]: Start difference. First operand 2318 states and 2817 transitions. Second operand 3 states. [2019-11-23 21:13:13,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:13,406 INFO L93 Difference]: Finished difference Result 5880 states and 7234 transitions. [2019-11-23 21:13:13,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:13:13,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-11-23 21:13:13,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:13,423 INFO L225 Difference]: With dead ends: 5880 [2019-11-23 21:13:13,423 INFO L226 Difference]: Without dead ends: 3742 [2019-11-23 21:13:13,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:13:13,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2019-11-23 21:13:13,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3564. [2019-11-23 21:13:13,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2019-11-23 21:13:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 4207 transitions. [2019-11-23 21:13:13,500 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 4207 transitions. Word has length 294 [2019-11-23 21:13:13,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:13,501 INFO L462 AbstractCegarLoop]: Abstraction has 3564 states and 4207 transitions. [2019-11-23 21:13:13,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:13:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 4207 transitions. [2019-11-23 21:13:13,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-23 21:13:13,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:13,507 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 21:13:13,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:13,711 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:13,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:13,711 INFO L82 PathProgramCache]: Analyzing trace with hash 148258701, now seen corresponding path program 1 times [2019-11-23 21:13:13,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:13,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401224130] [2019-11-23 21:13:13,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:13,996 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 246 proven. 4 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-23 21:13:13,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401224130] [2019-11-23 21:13:13,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896707314] [2019-11-23 21:13:13,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:14,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 21:13:14,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:13:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-23 21:13:14,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:13:14,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 21:13:14,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134491017] [2019-11-23 21:13:14,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:13:14,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:14,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:13:14,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:13:14,205 INFO L87 Difference]: Start difference. First operand 3564 states and 4207 transitions. Second operand 4 states. [2019-11-23 21:13:15,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:15,282 INFO L93 Difference]: Finished difference Result 7006 states and 8274 transitions. [2019-11-23 21:13:15,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:13:15,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 307 [2019-11-23 21:13:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:15,304 INFO L225 Difference]: With dead ends: 7006 [2019-11-23 21:13:15,304 INFO L226 Difference]: Without dead ends: 3564 [2019-11-23 21:13:15,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 306 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:13:15,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2019-11-23 21:13:15,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3386. [2019-11-23 21:13:15,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2019-11-23 21:13:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3645 transitions. [2019-11-23 21:13:15,400 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3645 transitions. Word has length 307 [2019-11-23 21:13:15,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:15,410 INFO L462 AbstractCegarLoop]: Abstraction has 3386 states and 3645 transitions. [2019-11-23 21:13:15,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:13:15,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3645 transitions. [2019-11-23 21:13:15,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-11-23 21:13:15,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:15,428 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:15,632 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:15,633 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:15,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:15,634 INFO L82 PathProgramCache]: Analyzing trace with hash -350804965, now seen corresponding path program 1 times [2019-11-23 21:13:15,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:15,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494588249] [2019-11-23 21:13:15,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:16,520 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 396 proven. 65 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-23 21:13:16,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494588249] [2019-11-23 21:13:16,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001518276] [2019-11-23 21:13:16,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:16,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:13:16,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:13:16,739 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2019-11-23 21:13:16,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:13:16,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-23 21:13:16,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832985202] [2019-11-23 21:13:16,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:13:16,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:16,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:13:16,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:13:16,742 INFO L87 Difference]: Start difference. First operand 3386 states and 3645 transitions. Second operand 3 states. [2019-11-23 21:13:17,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:17,485 INFO L93 Difference]: Finished difference Result 7482 states and 8108 transitions. [2019-11-23 21:13:17,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:13:17,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 402 [2019-11-23 21:13:17,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:17,502 INFO L225 Difference]: With dead ends: 7482 [2019-11-23 21:13:17,503 INFO L226 Difference]: Without dead ends: 4276 [2019-11-23 21:13:17,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 401 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:13:17,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-11-23 21:13:17,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4276. [2019-11-23 21:13:17,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2019-11-23 21:13:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4590 transitions. [2019-11-23 21:13:17,580 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4590 transitions. Word has length 402 [2019-11-23 21:13:17,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:17,581 INFO L462 AbstractCegarLoop]: Abstraction has 4276 states and 4590 transitions. [2019-11-23 21:13:17,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:13:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4590 transitions. [2019-11-23 21:13:17,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-11-23 21:13:17,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:17,591 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:17,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:17,794 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:17,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:17,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1425885231, now seen corresponding path program 1 times [2019-11-23 21:13:17,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:17,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965694821] [2019-11-23 21:13:17,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 404 proven. 65 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-23 21:13:18,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965694821] [2019-11-23 21:13:18,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340753394] [2019-11-23 21:13:18,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:18,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:13:18,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:13:18,735 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-11-23 21:13:18,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:13:18,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-23 21:13:18,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851462375] [2019-11-23 21:13:18,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:13:18,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:18,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:13:18,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:13:18,737 INFO L87 Difference]: Start difference. First operand 4276 states and 4590 transitions. Second operand 3 states. [2019-11-23 21:13:19,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:19,339 INFO L93 Difference]: Finished difference Result 9618 states and 10333 transitions. [2019-11-23 21:13:19,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:13:19,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 410 [2019-11-23 21:13:19,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:19,358 INFO L225 Difference]: With dead ends: 9618 [2019-11-23 21:13:19,359 INFO L226 Difference]: Without dead ends: 4810 [2019-11-23 21:13:19,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 409 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:13:19,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2019-11-23 21:13:19,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 3920. [2019-11-23 21:13:19,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-11-23 21:13:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4186 transitions. [2019-11-23 21:13:19,465 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4186 transitions. Word has length 410 [2019-11-23 21:13:19,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:19,465 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 4186 transitions. [2019-11-23 21:13:19,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:13:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4186 transitions. [2019-11-23 21:13:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-11-23 21:13:19,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:19,481 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:19,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:19,687 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:19,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:19,689 INFO L82 PathProgramCache]: Analyzing trace with hash 147470516, now seen corresponding path program 1 times [2019-11-23 21:13:19,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:19,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987990939] [2019-11-23 21:13:19,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 415 proven. 65 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-23 21:13:20,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987990939] [2019-11-23 21:13:20,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956561384] [2019-11-23 21:13:20,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:20,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:13:20,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:13:20,783 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-11-23 21:13:20,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:13:20,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-23 21:13:20,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617479663] [2019-11-23 21:13:20,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:13:20,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:20,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:13:20,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:13:20,786 INFO L87 Difference]: Start difference. First operand 3920 states and 4186 transitions. Second operand 3 states. [2019-11-23 21:13:21,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:21,428 INFO L93 Difference]: Finished difference Result 8194 states and 8797 transitions. [2019-11-23 21:13:21,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:13:21,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 421 [2019-11-23 21:13:21,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:21,469 INFO L225 Difference]: With dead ends: 8194 [2019-11-23 21:13:21,469 INFO L226 Difference]: Without dead ends: 4632 [2019-11-23 21:13:21,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 420 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:13:21,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-11-23 21:13:21,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4098. [2019-11-23 21:13:21,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-11-23 21:13:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4379 transitions. [2019-11-23 21:13:21,572 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4379 transitions. Word has length 421 [2019-11-23 21:13:21,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:21,572 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 4379 transitions. [2019-11-23 21:13:21,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:13:21,573 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4379 transitions. [2019-11-23 21:13:21,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-11-23 21:13:21,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:21,587 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:21,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:21,791 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:21,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:21,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1587624649, now seen corresponding path program 1 times [2019-11-23 21:13:21,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:21,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808285091] [2019-11-23 21:13:21,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 420 proven. 65 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-11-23 21:13:22,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808285091] [2019-11-23 21:13:22,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537818615] [2019-11-23 21:13:22,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:22,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 21:13:22,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:13:23,142 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-11-23 21:13:23,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:13:23,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-11-23 21:13:23,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947893405] [2019-11-23 21:13:23,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:13:23,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:23,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:13:23,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:13:23,147 INFO L87 Difference]: Start difference. First operand 4098 states and 4379 transitions. Second operand 7 states. [2019-11-23 21:13:24,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:24,193 INFO L93 Difference]: Finished difference Result 8066 states and 8627 transitions. [2019-11-23 21:13:24,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 21:13:24,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 435 [2019-11-23 21:13:24,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:24,209 INFO L225 Difference]: With dead ends: 8066 [2019-11-23 21:13:24,210 INFO L226 Difference]: Without dead ends: 4276 [2019-11-23 21:13:24,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 430 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:13:24,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-11-23 21:13:24,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4098. [2019-11-23 21:13:24,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-11-23 21:13:24,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4302 transitions. [2019-11-23 21:13:24,271 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4302 transitions. Word has length 435 [2019-11-23 21:13:24,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:24,272 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 4302 transitions. [2019-11-23 21:13:24,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:13:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4302 transitions. [2019-11-23 21:13:24,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2019-11-23 21:13:24,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:24,293 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:13:24,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:24,497 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:24,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:24,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1311951587, now seen corresponding path program 1 times [2019-11-23 21:13:24,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:24,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618577202] [2019-11-23 21:13:24,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1687 backedges. 1219 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2019-11-23 21:13:25,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618577202] [2019-11-23 21:13:25,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:25,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:13:25,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104555200] [2019-11-23 21:13:25,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:13:25,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:25,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:13:25,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:13:25,534 INFO L87 Difference]: Start difference. First operand 4098 states and 4302 transitions. Second operand 4 states. [2019-11-23 21:13:26,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:26,466 INFO L93 Difference]: Finished difference Result 8906 states and 9413 transitions. [2019-11-23 21:13:26,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:13:26,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 765 [2019-11-23 21:13:26,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:26,481 INFO L225 Difference]: With dead ends: 8906 [2019-11-23 21:13:26,482 INFO L226 Difference]: Without dead ends: 4988 [2019-11-23 21:13:26,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:13:26,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2019-11-23 21:13:26,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4810. [2019-11-23 21:13:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2019-11-23 21:13:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5046 transitions. [2019-11-23 21:13:26,547 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5046 transitions. Word has length 765 [2019-11-23 21:13:26,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:26,548 INFO L462 AbstractCegarLoop]: Abstraction has 4810 states and 5046 transitions. [2019-11-23 21:13:26,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:13:26,548 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5046 transitions. [2019-11-23 21:13:26,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2019-11-23 21:13:26,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:26,572 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:26,572 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:26,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:26,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2008502924, now seen corresponding path program 1 times [2019-11-23 21:13:26,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:26,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811530884] [2019-11-23 21:13:26,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 1001 proven. 4 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2019-11-23 21:13:27,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811530884] [2019-11-23 21:13:27,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719558989] [2019-11-23 21:13:27,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:27,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 21:13:27,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:13:27,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:13:28,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 982 proven. 23 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2019-11-23 21:13:28,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:13:28,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-23 21:13:28,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876642620] [2019-11-23 21:13:28,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:13:28,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:28,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:13:28,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:13:28,586 INFO L87 Difference]: Start difference. First operand 4810 states and 5046 transitions. Second operand 8 states. [2019-11-23 21:13:30,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:30,678 INFO L93 Difference]: Finished difference Result 9687 states and 10168 transitions. [2019-11-23 21:13:30,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:13:30,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 807 [2019-11-23 21:13:30,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:30,686 INFO L225 Difference]: With dead ends: 9687 [2019-11-23 21:13:30,686 INFO L226 Difference]: Without dead ends: 5235 [2019-11-23 21:13:30,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 815 GetRequests, 805 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:13:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5235 states. [2019-11-23 21:13:30,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5235 to 4632. [2019-11-23 21:13:30,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-23 21:13:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4866 transitions. [2019-11-23 21:13:30,759 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4866 transitions. Word has length 807 [2019-11-23 21:13:30,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:30,760 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4866 transitions. [2019-11-23 21:13:30,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 21:13:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4866 transitions. [2019-11-23 21:13:30,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 897 [2019-11-23 21:13:30,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:30,773 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:30,977 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:30,978 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:30,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:30,979 INFO L82 PathProgramCache]: Analyzing trace with hash -32320893, now seen corresponding path program 1 times [2019-11-23 21:13:30,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:30,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858294807] [2019-11-23 21:13:30,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:32,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2361 backedges. 1683 proven. 0 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2019-11-23 21:13:32,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858294807] [2019-11-23 21:13:32,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:32,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:13:32,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762373559] [2019-11-23 21:13:32,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:13:32,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:32,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:13:32,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:13:32,706 INFO L87 Difference]: Start difference. First operand 4632 states and 4866 transitions. Second operand 7 states. [2019-11-23 21:13:34,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:34,057 INFO L93 Difference]: Finished difference Result 9621 states and 10099 transitions. [2019-11-23 21:13:34,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:13:34,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 896 [2019-11-23 21:13:34,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:34,068 INFO L225 Difference]: With dead ends: 9621 [2019-11-23 21:13:34,068 INFO L226 Difference]: Without dead ends: 4991 [2019-11-23 21:13:34,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:13:34,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4991 states. [2019-11-23 21:13:34,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4991 to 4632. [2019-11-23 21:13:34,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-23 21:13:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4862 transitions. [2019-11-23 21:13:34,132 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4862 transitions. Word has length 896 [2019-11-23 21:13:34,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:34,133 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4862 transitions. [2019-11-23 21:13:34,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:13:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4862 transitions. [2019-11-23 21:13:34,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 974 [2019-11-23 21:13:34,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:34,145 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:34,145 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:34,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:34,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1437208854, now seen corresponding path program 1 times [2019-11-23 21:13:34,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:34,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444428454] [2019-11-23 21:13:34,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2929 backedges. 981 proven. 0 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2019-11-23 21:13:35,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444428454] [2019-11-23 21:13:35,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:35,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:13:35,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699384366] [2019-11-23 21:13:35,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:13:35,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:35,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:13:35,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:13:35,198 INFO L87 Difference]: Start difference. First operand 4632 states and 4862 transitions. Second operand 4 states. [2019-11-23 21:13:36,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:36,175 INFO L93 Difference]: Finished difference Result 9440 states and 9905 transitions. [2019-11-23 21:13:36,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:13:36,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 973 [2019-11-23 21:13:36,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:36,185 INFO L225 Difference]: With dead ends: 9440 [2019-11-23 21:13:36,185 INFO L226 Difference]: Without dead ends: 4632 [2019-11-23 21:13:36,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:13:36,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-11-23 21:13:36,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4454. [2019-11-23 21:13:36,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-11-23 21:13:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4631 transitions. [2019-11-23 21:13:36,249 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4631 transitions. Word has length 973 [2019-11-23 21:13:36,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:36,251 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 4631 transitions. [2019-11-23 21:13:36,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:13:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4631 transitions. [2019-11-23 21:13:36,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1049 [2019-11-23 21:13:36,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:36,275 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:13:36,275 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:36,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:36,276 INFO L82 PathProgramCache]: Analyzing trace with hash 659097908, now seen corresponding path program 1 times [2019-11-23 21:13:36,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:36,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295514932] [2019-11-23 21:13:36,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3560 backedges. 1091 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2019-11-23 21:13:37,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295514932] [2019-11-23 21:13:37,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:37,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:13:37,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637541561] [2019-11-23 21:13:37,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:13:37,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:37,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:13:37,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:13:37,421 INFO L87 Difference]: Start difference. First operand 4454 states and 4631 transitions. Second operand 4 states. [2019-11-23 21:13:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:38,574 INFO L93 Difference]: Finished difference Result 9618 states and 10005 transitions. [2019-11-23 21:13:38,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:13:38,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1048 [2019-11-23 21:13:38,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:38,584 INFO L225 Difference]: With dead ends: 9618 [2019-11-23 21:13:38,584 INFO L226 Difference]: Without dead ends: 4810 [2019-11-23 21:13:38,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:13:38,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2019-11-23 21:13:38,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 3742. [2019-11-23 21:13:38,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-11-23 21:13:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3834 transitions. [2019-11-23 21:13:38,635 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3834 transitions. Word has length 1048 [2019-11-23 21:13:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:38,636 INFO L462 AbstractCegarLoop]: Abstraction has 3742 states and 3834 transitions. [2019-11-23 21:13:38,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:13:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3834 transitions. [2019-11-23 21:13:38,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1097 [2019-11-23 21:13:38,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:38,649 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:13:38,649 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:38,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:38,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1358554948, now seen corresponding path program 1 times [2019-11-23 21:13:38,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:38,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971233146] [2019-11-23 21:13:38,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:39,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3797 backedges. 1131 proven. 0 refuted. 0 times theorem prover too weak. 2666 trivial. 0 not checked. [2019-11-23 21:13:39,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971233146] [2019-11-23 21:13:39,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:39,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:13:39,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69123207] [2019-11-23 21:13:39,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:13:39,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:39,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:13:39,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:13:39,814 INFO L87 Difference]: Start difference. First operand 3742 states and 3834 transitions. Second operand 5 states. [2019-11-23 21:13:40,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:40,999 INFO L93 Difference]: Finished difference Result 8548 states and 8760 transitions. [2019-11-23 21:13:41,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:13:41,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1096 [2019-11-23 21:13:41,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:41,002 INFO L225 Difference]: With dead ends: 8548 [2019-11-23 21:13:41,002 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 21:13:41,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:13:41,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 21:13:41,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 21:13:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 21:13:41,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 21:13:41,009 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1096 [2019-11-23 21:13:41,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:41,009 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 21:13:41,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:13:41,010 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 21:13:41,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 21:13:41,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 21:13:41,227 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 148 [2019-11-23 21:13:41,462 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 148 [2019-11-23 21:13:42,217 WARN L192 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 45 [2019-11-23 21:13:42,980 WARN L192 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 45 [2019-11-23 21:13:42,985 INFO L444 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-23 21:13:42,985 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-23 21:13:42,985 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,985 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,986 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,986 INFO L444 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-23 21:13:42,986 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-23 21:13:42,986 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-23 21:13:42,986 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-23 21:13:42,987 INFO L444 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-23 21:13:42,987 INFO L444 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-23 21:13:42,987 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-23 21:13:42,987 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-23 21:13:42,987 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,987 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,987 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,987 INFO L444 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-23 21:13:42,988 INFO L444 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-23 21:13:42,988 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-23 21:13:42,988 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-23 21:13:42,988 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-23 21:13:42,988 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-23 21:13:42,988 INFO L444 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-23 21:13:42,988 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-23 21:13:42,988 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,988 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,988 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,988 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-23 21:13:42,988 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-23 21:13:42,988 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-23 21:13:42,988 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-23 21:13:42,989 INFO L444 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-23 21:13:42,989 INFO L444 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-23 21:13:42,989 INFO L444 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-23 21:13:42,989 INFO L444 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-23 21:13:42,989 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-23 21:13:42,989 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,989 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,989 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,989 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-23 21:13:42,989 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-23 21:13:42,989 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-23 21:13:42,989 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-23 21:13:42,989 INFO L444 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-23 21:13:42,990 INFO L444 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-23 21:13:42,990 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-23 21:13:42,990 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,990 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,990 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,990 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-23 21:13:42,990 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-23 21:13:42,990 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-23 21:13:42,991 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-23 21:13:42,991 INFO L444 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-23 21:13:42,991 INFO L444 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-23 21:13:42,991 INFO L444 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-23 21:13:42,991 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-23 21:13:42,991 INFO L444 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-23 21:13:42,991 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,991 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,991 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,991 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-23 21:13:42,991 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-23 21:13:42,991 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-23 21:13:42,991 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-23 21:13:42,991 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-23 21:13:42,992 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-23 21:13:42,992 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-23 21:13:42,992 INFO L444 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-23 21:13:42,992 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,992 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,992 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,992 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-23 21:13:42,992 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-23 21:13:42,992 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-23 21:13:42,992 INFO L444 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-23 21:13:42,992 INFO L444 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-23 21:13:42,992 INFO L444 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-23 21:13:42,992 INFO L444 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-23 21:13:42,993 INFO L444 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-23 21:13:42,993 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,993 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,993 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,993 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-23 21:13:42,993 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-23 21:13:42,993 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 21:13:42,993 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-23 21:13:42,993 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-23 21:13:42,993 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-23 21:13:42,993 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-23 21:13:42,993 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-23 21:13:42,993 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-23 21:13:42,993 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,994 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,994 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,994 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-23 21:13:42,994 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-23 21:13:42,994 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-23 21:13:42,994 INFO L444 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-23 21:13:42,994 INFO L444 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-23 21:13:42,994 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-23 21:13:42,994 INFO L444 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-23 21:13:42,994 INFO L444 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-23 21:13:42,994 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,994 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,994 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,994 INFO L444 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-23 21:13:42,995 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-23 21:13:42,995 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-23 21:13:42,995 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-23 21:13:42,995 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-23 21:13:42,995 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-23 21:13:42,995 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 21:13:42,995 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2019-11-23 21:13:42,995 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-23 21:13:42,995 INFO L444 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-23 21:13:42,995 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,995 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,996 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,996 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-23 21:13:42,996 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-23 21:13:42,996 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-23 21:13:42,996 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-23 21:13:42,996 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-23 21:13:42,996 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-23 21:13:42,996 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-23 21:13:42,996 INFO L444 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-23 21:13:42,997 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,997 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,997 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,997 INFO L444 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-23 21:13:42,997 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-23 21:13:42,997 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-23 21:13:42,997 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-23 21:13:42,997 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-23 21:13:42,998 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-23 21:13:42,998 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-23 21:13:42,998 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-23 21:13:42,998 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,998 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,998 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-23 21:13:42,998 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-23 21:13:42,998 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-23 21:13:42,998 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-23 21:13:42,999 INFO L444 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-23 21:13:42,999 INFO L444 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-23 21:13:42,999 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-23 21:13:42,999 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-23 21:13:42,999 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,999 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:42,999 INFO L444 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-23 21:13:42,999 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-23 21:13:42,999 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-23 21:13:43,000 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-23 21:13:43,000 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-23 21:13:43,000 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-23 21:13:43,000 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,000 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,000 INFO L440 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse4 (<= 10 ~a21~0)) (.cse0 (<= ~a15~0 6)) (.cse6 (<= ~a12~0 11)) (.cse1 (<= (+ ~a12~0 49) 0)) (.cse5 (< 80 ~a12~0)) (.cse3 (= ~a24~0 1)) (.cse7 (<= ~a15~0 8)) (.cse2 (<= ~a21~0 6))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 (<= ~a12~0 95442)) (and .cse4 .cse3 .cse5) (and .cse4 .cse3 .cse6) (and (<= 8 ~a21~0) .cse3 .cse7) (and .cse0 .cse3) (and (= ~a15~0 8) .cse3 .cse6) (and .cse3 .cse7 .cse1) (and (<= 9 ~a15~0) .cse3 (= ~a21~0 7) .cse5) (and .cse3 .cse5 (= ~a21~0 9)) (and .cse3 (= ~a21~0 8)) (and .cse3 .cse7 .cse2))) [2019-11-23 21:13:43,001 INFO L444 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-23 21:13:43,001 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-23 21:13:43,001 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-23 21:13:43,001 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-23 21:13:43,001 INFO L444 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-23 21:13:43,001 INFO L444 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-23 21:13:43,001 INFO L444 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-23 21:13:43,001 INFO L444 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-23 21:13:43,001 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,002 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,002 INFO L447 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-23 21:13:43,002 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-23 21:13:43,002 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-23 21:13:43,002 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-23 21:13:43,002 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-23 21:13:43,002 INFO L444 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-23 21:13:43,002 INFO L444 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-23 21:13:43,002 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-23 21:13:43,003 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,003 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,003 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-23 21:13:43,003 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-23 21:13:43,003 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-23 21:13:43,003 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-23 21:13:43,003 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 21:13:43,003 INFO L444 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-23 21:13:43,003 INFO L444 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-23 21:13:43,003 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,003 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,004 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-23 21:13:43,004 INFO L444 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,004 INFO L444 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-23 21:13:43,004 INFO L440 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse4 (<= 10 ~a21~0)) (.cse0 (<= ~a15~0 6)) (.cse6 (<= ~a12~0 11)) (.cse1 (<= (+ ~a12~0 49) 0)) (.cse5 (< 80 ~a12~0)) (.cse3 (= ~a24~0 1)) (.cse7 (<= ~a15~0 8)) (.cse2 (<= ~a21~0 6))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 (<= ~a12~0 95442)) (and .cse4 .cse3 .cse5) (and .cse4 .cse3 .cse6) (and (<= 8 ~a21~0) .cse3 .cse7) (and .cse0 .cse3) (and (= ~a15~0 8) .cse3 .cse6) (and .cse3 .cse7 .cse1) (and (<= 9 ~a15~0) .cse3 (= ~a21~0 7) .cse5) (and .cse3 .cse5 (= ~a21~0 9)) (and .cse3 (= ~a21~0 8)) (and .cse3 .cse7 .cse2))) [2019-11-23 21:13:43,004 INFO L444 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-23 21:13:43,004 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-23 21:13:43,004 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-23 21:13:43,004 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-23 21:13:43,005 INFO L444 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-23 21:13:43,005 INFO L444 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-23 21:13:43,005 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-23 21:13:43,005 INFO L444 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-23 21:13:43,005 INFO L444 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-23 21:13:43,005 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,005 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,005 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,005 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-23 21:13:43,005 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-23 21:13:43,006 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-23 21:13:43,006 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-23 21:13:43,006 INFO L444 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-23 21:13:43,006 INFO L444 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-23 21:13:43,006 INFO L444 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-23 21:13:43,006 INFO L444 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-23 21:13:43,006 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-23 21:13:43,006 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,006 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,006 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,007 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-23 21:13:43,007 INFO L444 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-23 21:13:43,007 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-23 21:13:43,007 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-23 21:13:43,007 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 21:13:43,007 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-23 21:13:43,007 INFO L444 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-23 21:13:43,007 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-23 21:13:43,008 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-23 21:13:43,008 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,008 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,008 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,008 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-23 21:13:43,008 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-23 21:13:43,008 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-23 21:13:43,008 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-23 21:13:43,008 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-23 21:13:43,009 INFO L444 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-23 21:13:43,009 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-23 21:13:43,009 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-23 21:13:43,009 INFO L444 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-23 21:13:43,009 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,009 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,009 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:43,009 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-23 21:13:43,009 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-23 21:13:43,010 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-23 21:13:43,010 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-23 21:13:43,010 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-23 21:13:43,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:13:43 BoogieIcfgContainer [2019-11-23 21:13:43,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 21:13:43,035 INFO L168 Benchmark]: Toolchain (without parser) took 42459.59 ms. Allocated memory was 139.5 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 101.2 MB in the beginning and 536.9 MB in the end (delta: -435.6 MB). Peak memory consumption was 878.3 MB. Max. memory is 7.1 GB. [2019-11-23 21:13:43,036 INFO L168 Benchmark]: CDTParser took 1.46 ms. Allocated memory is still 139.5 MB. Free memory is still 122.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-23 21:13:43,037 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.82 ms. Allocated memory was 139.5 MB in the beginning and 207.1 MB in the end (delta: 67.6 MB). Free memory was 101.0 MB in the beginning and 170.2 MB in the end (delta: -69.1 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. [2019-11-23 21:13:43,037 INFO L168 Benchmark]: Boogie Procedure Inliner took 136.60 ms. Allocated memory is still 207.1 MB. Free memory was 170.2 MB in the beginning and 160.3 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-11-23 21:13:43,038 INFO L168 Benchmark]: Boogie Preprocessor took 108.55 ms. Allocated memory is still 207.1 MB. Free memory was 160.3 MB in the beginning and 153.4 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 7.1 GB. [2019-11-23 21:13:43,038 INFO L168 Benchmark]: RCFGBuilder took 1835.63 ms. Allocated memory was 207.1 MB in the beginning and 239.6 MB in the end (delta: 32.5 MB). Free memory was 153.4 MB in the beginning and 139.6 MB in the end (delta: 13.7 MB). Peak memory consumption was 71.3 MB. Max. memory is 7.1 GB. [2019-11-23 21:13:43,039 INFO L168 Benchmark]: TraceAbstraction took 39563.44 ms. Allocated memory was 239.6 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 139.6 MB in the beginning and 536.9 MB in the end (delta: -397.2 MB). Peak memory consumption was 816.5 MB. Max. memory is 7.1 GB. [2019-11-23 21:13:43,043 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.46 ms. Allocated memory is still 139.5 MB. Free memory is still 122.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 810.82 ms. Allocated memory was 139.5 MB in the beginning and 207.1 MB in the end (delta: 67.6 MB). Free memory was 101.0 MB in the beginning and 170.2 MB in the end (delta: -69.1 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 136.60 ms. Allocated memory is still 207.1 MB. Free memory was 170.2 MB in the beginning and 160.3 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.55 ms. Allocated memory is still 207.1 MB. Free memory was 160.3 MB in the beginning and 153.4 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1835.63 ms. Allocated memory was 207.1 MB in the beginning and 239.6 MB in the end (delta: 32.5 MB). Free memory was 153.4 MB in the beginning and 139.6 MB in the end (delta: 13.7 MB). Peak memory consumption was 71.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39563.44 ms. Allocated memory was 239.6 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 139.6 MB in the beginning and 536.9 MB in the end (delta: -397.2 MB). Peak memory consumption was 816.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 115]: 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: 880]: Loop Invariant Derived loop invariant: ((((((((((((a15 <= 6 && a12 + 49 <= 0) && a21 <= 6) || ((a24 == 1 && a21 <= 6) && a12 <= 95442)) || ((10 <= a21 && a24 == 1) && 80 < a12)) || ((10 <= a21 && a24 == 1) && a12 <= 11)) || ((8 <= a21 && a24 == 1) && a15 <= 8)) || (a15 <= 6 && a24 == 1)) || ((a15 == 8 && a24 == 1) && a12 <= 11)) || ((a24 == 1 && a15 <= 8) && a12 + 49 <= 0)) || (((9 <= a15 && a24 == 1) && a21 == 7) && 80 < a12)) || ((a24 == 1 && 80 < a12) && a21 == 9)) || (a24 == 1 && a21 == 8)) || ((a24 == 1 && a15 <= 8) && a21 <= 6) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((((((a15 <= 6 && a12 + 49 <= 0) && a21 <= 6) || ((a24 == 1 && a21 <= 6) && a12 <= 95442)) || ((10 <= a21 && a24 == 1) && 80 < a12)) || ((10 <= a21 && a24 == 1) && a12 <= 11)) || ((8 <= a21 && a24 == 1) && a15 <= 8)) || (a15 <= 6 && a24 == 1)) || ((a15 == 8 && a24 == 1) && a12 <= 11)) || ((a24 == 1 && a15 <= 8) && a12 + 49 <= 0)) || (((9 <= a15 && a24 == 1) && a21 == 7) && 80 < a12)) || ((a24 == 1 && 80 < a12) && a21 == 9)) || (a24 == 1 && a21 == 8)) || ((a24 == 1 && a15 <= 8) && a21 <= 6) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 39.4s, OverallIterations: 16, TraceHistogramMax: 10, AutomataDifference: 19.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, HoareTripleCheckerStatistics: 1854 SDtfs, 4577 SDslu, 191 SDs, 0 SdLazy, 13817 SolverSat, 1483 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3383 GetRequests, 3300 SyntacticMatches, 9 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4810occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 4700 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 86 NumberOfFragments, 245 HoareAnnotationTreeSize, 3 FomulaSimplifications, 23724 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 10362 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 11773 NumberOfCodeBlocks, 11773 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 11749 ConstructedInterpolants, 0 QuantifiedInterpolants, 22940721 SizeOfPredicates, 17 NumberOfNonLiveVariables, 4277 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 24 InterpolantComputations, 15 PerfectInterpolantSequences, 24467/24766 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...