java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label45.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:11:38,467 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:11:38,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:11:38,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:11:38,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:11:38,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:11:38,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:11:38,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:11:38,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:11:38,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:11:38,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:11:38,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:11:38,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:11:38,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:11:38,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:11:38,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:11:38,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:11:38,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:11:38,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:11:38,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:11:38,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:11:38,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:11:38,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:11:38,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:11:38,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:11:38,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:11:38,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:11:38,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:11:38,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:11:38,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:11:38,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:11:38,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:11:38,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:11:38,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:11:38,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:11:38,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:11:38,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:11:38,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:11:38,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:11:38,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:11:38,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:11:38,524 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-09-07 20:11:38,543 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:11:38,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:11:38,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:11:38,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:11:38,545 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:11:38,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:11:38,546 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:11:38,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:11:38,550 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:11:38,550 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:11:38,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:11:38,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:11:38,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:11:38,551 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:11:38,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:11:38,552 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:11:38,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:11:38,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:11:38,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:11:38,552 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:11:38,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:11:38,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:11:38,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:11:38,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:11:38,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:11:38,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:11:38,554 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:11:38,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:11:38,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:11:38,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:11:38,619 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:11:38,622 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:11:38,624 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:11:38,624 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:11:38,625 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label45.c [2019-09-07 20:11:38,689 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267949000/64c5cb83e6eb46cfb0802d5ac7e46155/FLAG66f37086c [2019-09-07 20:11:39,260 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:11:39,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label45.c [2019-09-07 20:11:39,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267949000/64c5cb83e6eb46cfb0802d5ac7e46155/FLAG66f37086c [2019-09-07 20:11:39,564 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267949000/64c5cb83e6eb46cfb0802d5ac7e46155 [2019-09-07 20:11:39,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:11:39,575 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:11:39,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:11:39,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:11:39,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:11:39,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:11:39" (1/1) ... [2019-09-07 20:11:39,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a070ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:39, skipping insertion in model container [2019-09-07 20:11:39,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:11:39" (1/1) ... [2019-09-07 20:11:39,591 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:11:39,656 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:11:40,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:11:40,313 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:11:40,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:11:40,455 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:11:40,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:40 WrapperNode [2019-09-07 20:11:40,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:11:40,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:11:40,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:11:40,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:11:40,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:40" (1/1) ... [2019-09-07 20:11:40,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:40" (1/1) ... [2019-09-07 20:11:40,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:40" (1/1) ... [2019-09-07 20:11:40,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:40" (1/1) ... [2019-09-07 20:11:40,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:40" (1/1) ... [2019-09-07 20:11:40,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:40" (1/1) ... [2019-09-07 20:11:40,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:40" (1/1) ... [2019-09-07 20:11:40,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:11:40,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:11:40,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:11:40,595 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:11:40,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:40" (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-09-07 20:11:40,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:11:40,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:11:40,666 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:11:40,667 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:11:40,668 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:11:40,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:11:40,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:11:40,668 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:11:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:11:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:11:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:11:42,089 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:11:42,092 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:11:42,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:11:42 BoogieIcfgContainer [2019-09-07 20:11:42,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:11:42,095 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:11:42,095 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:11:42,099 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:11:42,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:11:39" (1/3) ... [2019-09-07 20:11:42,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ddae1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:11:42, skipping insertion in model container [2019-09-07 20:11:42,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:11:40" (2/3) ... [2019-09-07 20:11:42,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ddae1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:11:42, skipping insertion in model container [2019-09-07 20:11:42,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:11:42" (3/3) ... [2019-09-07 20:11:42,103 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label45.c [2019-09-07 20:11:42,113 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:11:42,121 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:11:42,138 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:11:42,171 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:11:42,172 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:11:42,172 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:11:42,172 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:11:42,173 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:11:42,173 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:11:42,173 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:11:42,173 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:11:42,173 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:11:42,198 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-09-07 20:11:42,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-07 20:11:42,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:11:42,208 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:11:42,210 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:11:42,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:11:42,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1020079963, now seen corresponding path program 1 times [2019-09-07 20:11:42,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:11:42,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:11:42,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:42,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:11:42,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:11:42,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:11:42,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:11:42,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:11:42,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:11:42,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:11:42,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:11:42,562 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 4 states. [2019-09-07 20:11:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:11:44,523 INFO L93 Difference]: Finished difference Result 890 states and 1606 transitions. [2019-09-07 20:11:44,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:11:44,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-09-07 20:11:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:11:44,547 INFO L225 Difference]: With dead ends: 890 [2019-09-07 20:11:44,547 INFO L226 Difference]: Without dead ends: 554 [2019-09-07 20:11:44,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-09-07 20:11:44,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-09-07 20:11:44,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 372. [2019-09-07 20:11:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-09-07 20:11:44,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 524 transitions. [2019-09-07 20:11:44,631 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 524 transitions. Word has length 42 [2019-09-07 20:11:44,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:11:44,632 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 524 transitions. [2019-09-07 20:11:44,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:11:44,632 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 524 transitions. [2019-09-07 20:11:44,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-07 20:11:44,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:11:44,639 INFO L399 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, 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] [2019-09-07 20:11:44,639 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:11:44,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:11:44,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2050989129, now seen corresponding path program 1 times [2019-09-07 20:11:44,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:11:44,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:11:44,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:44,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:11:44,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:11:44,822 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:11:44,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:11:44,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:11:44,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:11:44,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:11:44,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:11:44,825 INFO L87 Difference]: Start difference. First operand 372 states and 524 transitions. Second operand 4 states. [2019-09-07 20:11:46,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:11:46,340 INFO L93 Difference]: Finished difference Result 1466 states and 2091 transitions. [2019-09-07 20:11:46,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:11:46,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-07 20:11:46,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:11:46,348 INFO L225 Difference]: With dead ends: 1466 [2019-09-07 20:11:46,348 INFO L226 Difference]: Without dead ends: 736 [2019-09-07 20:11:46,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-09-07 20:11:46,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-09-07 20:11:46,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 554. [2019-09-07 20:11:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-09-07 20:11:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 809 transitions. [2019-09-07 20:11:46,407 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 809 transitions. Word has length 125 [2019-09-07 20:11:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:11:46,407 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 809 transitions. [2019-09-07 20:11:46,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:11:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 809 transitions. [2019-09-07 20:11:46,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-07 20:11:46,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:11:46,413 INFO L399 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, 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] [2019-09-07 20:11:46,413 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:11:46,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:11:46,414 INFO L82 PathProgramCache]: Analyzing trace with hash 488627185, now seen corresponding path program 1 times [2019-09-07 20:11:46,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:11:46,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:11:46,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:46,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:11:46,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:11:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:11:46,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:11:46,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:11:46,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:11:46,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:11:46,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:11:46,560 INFO L87 Difference]: Start difference. First operand 554 states and 809 transitions. Second operand 4 states. [2019-09-07 20:11:47,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:11:47,948 INFO L93 Difference]: Finished difference Result 2194 states and 3264 transitions. [2019-09-07 20:11:47,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:11:47,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-09-07 20:11:47,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:11:47,964 INFO L225 Difference]: With dead ends: 2194 [2019-09-07 20:11:47,965 INFO L226 Difference]: Without dead ends: 1646 [2019-09-07 20:11:47,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-09-07 20:11:47,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-09-07 20:11:48,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1646. [2019-09-07 20:11:48,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-09-07 20:11:48,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2286 transitions. [2019-09-07 20:11:48,045 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2286 transitions. Word has length 137 [2019-09-07 20:11:48,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:11:48,047 INFO L475 AbstractCegarLoop]: Abstraction has 1646 states and 2286 transitions. [2019-09-07 20:11:48,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:11:48,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2286 transitions. [2019-09-07 20:11:48,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-07 20:11:48,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:11:48,074 INFO L399 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, 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, 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-09-07 20:11:48,074 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:11:48,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:11:48,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1957605909, now seen corresponding path program 1 times [2019-09-07 20:11:48,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:11:48,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:11:48,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:48,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:11:48,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:11:48,367 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 163 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:11:48,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:11:48,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:11:48,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:11:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:11:48,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:11:48,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:11:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 163 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:11:48,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:11:48,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:11:48,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:11:48,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:11:48,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:11:48,728 INFO L87 Difference]: Start difference. First operand 1646 states and 2286 transitions. Second operand 9 states. [2019-09-07 20:11:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:11:51,601 INFO L93 Difference]: Finished difference Result 4888 states and 7260 transitions. [2019-09-07 20:11:51,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 20:11:51,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 256 [2019-09-07 20:11:51,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:11:51,629 INFO L225 Difference]: With dead ends: 4888 [2019-09-07 20:11:51,629 INFO L226 Difference]: Without dead ends: 2864 [2019-09-07 20:11:51,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:11:51,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2019-09-07 20:11:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2070. [2019-09-07 20:11:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states. [2019-09-07 20:11:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 2700 transitions. [2019-09-07 20:11:51,751 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 2700 transitions. Word has length 256 [2019-09-07 20:11:51,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:11:51,752 INFO L475 AbstractCegarLoop]: Abstraction has 2070 states and 2700 transitions. [2019-09-07 20:11:51,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:11:51,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2700 transitions. [2019-09-07 20:11:51,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-07 20:11:51,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:11:51,760 INFO L399 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, 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, 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] [2019-09-07 20:11:51,761 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:11:51,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:11:51,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1276185383, now seen corresponding path program 1 times [2019-09-07 20:11:51,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:11:51,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:11:51,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:51,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:11:51,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:11:52,000 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 71 proven. 41 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-07 20:11:52,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:11:52,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:11:52,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:11:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:11:52,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:11:52,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:11:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 177 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:11:52,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:11:52,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:11:52,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:11:52,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:11:52,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:11:52,282 INFO L87 Difference]: Start difference. First operand 2070 states and 2700 transitions. Second operand 9 states. [2019-09-07 20:11:53,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:11:53,541 INFO L93 Difference]: Finished difference Result 3932 states and 5191 transitions. [2019-09-07 20:11:53,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:11:53,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 270 [2019-09-07 20:11:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:11:53,558 INFO L225 Difference]: With dead ends: 3932 [2019-09-07 20:11:53,558 INFO L226 Difference]: Without dead ends: 2066 [2019-09-07 20:11:53,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 271 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:11:53,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2019-09-07 20:11:53,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 2040. [2019-09-07 20:11:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2040 states. [2019-09-07 20:11:53,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 2567 transitions. [2019-09-07 20:11:53,677 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 2567 transitions. Word has length 270 [2019-09-07 20:11:53,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:11:53,678 INFO L475 AbstractCegarLoop]: Abstraction has 2040 states and 2567 transitions. [2019-09-07 20:11:53,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:11:53,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2567 transitions. [2019-09-07 20:11:53,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-07 20:11:53,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:11:53,685 INFO L399 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, 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, 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] [2019-09-07 20:11:53,685 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:11:53,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:11:53,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1338425938, now seen corresponding path program 1 times [2019-09-07 20:11:53,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:11:53,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:11:53,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:53,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:11:53,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:11:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 144 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:11:54,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:11:54,562 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:11:54,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:11:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:11:54,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 20:11:54,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:11:54,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:11:54,811 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 20:11:54,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:11:54,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-09-07 20:11:54,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 20:11:54,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 20:11:54,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:11:54,818 INFO L87 Difference]: Start difference. First operand 2040 states and 2567 transitions. Second operand 15 states. [2019-09-07 20:11:57,517 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-07 20:11:58,139 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-07 20:11:59,454 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-07 20:11:59,707 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-07 20:11:59,867 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-07 20:12:02,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:12:02,699 INFO L93 Difference]: Finished difference Result 5070 states and 6342 transitions. [2019-09-07 20:12:02,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 20:12:02,702 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 273 [2019-09-07 20:12:02,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:12:02,715 INFO L225 Difference]: With dead ends: 5070 [2019-09-07 20:12:02,715 INFO L226 Difference]: Without dead ends: 2840 [2019-09-07 20:12:02,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=414, Invalid=2136, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 20:12:02,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2019-09-07 20:12:02,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 2434. [2019-09-07 20:12:02,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2019-09-07 20:12:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 2977 transitions. [2019-09-07 20:12:02,787 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 2977 transitions. Word has length 273 [2019-09-07 20:12:02,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:12:02,788 INFO L475 AbstractCegarLoop]: Abstraction has 2434 states and 2977 transitions. [2019-09-07 20:12:02,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 20:12:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 2977 transitions. [2019-09-07 20:12:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-09-07 20:12:02,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:12:02,797 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:12:02,798 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:12:02,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:12:02,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1103855, now seen corresponding path program 1 times [2019-09-07 20:12:02,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:12:02,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:12:02,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:02,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:02,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 191 proven. 197 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:12:03,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:12:03,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:12:03,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:03,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 20:12:03,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:12:03,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:12:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 303 proven. 53 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 20:12:04,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:12:04,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2019-09-07 20:12:04,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 20:12:04,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 20:12:04,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:12:04,031 INFO L87 Difference]: Start difference. First operand 2434 states and 2977 transitions. Second operand 15 states. [2019-09-07 20:12:06,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:12:06,370 INFO L93 Difference]: Finished difference Result 4769 states and 5878 transitions. [2019-09-07 20:12:06,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 20:12:06,371 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 375 [2019-09-07 20:12:06,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:12:06,383 INFO L225 Difference]: With dead ends: 4769 [2019-09-07 20:12:06,383 INFO L226 Difference]: Without dead ends: 2660 [2019-09-07 20:12:06,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2019-09-07 20:12:06,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2019-09-07 20:12:06,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2434. [2019-09-07 20:12:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2019-09-07 20:12:06,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 2784 transitions. [2019-09-07 20:12:06,453 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 2784 transitions. Word has length 375 [2019-09-07 20:12:06,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:12:06,454 INFO L475 AbstractCegarLoop]: Abstraction has 2434 states and 2784 transitions. [2019-09-07 20:12:06,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 20:12:06,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 2784 transitions. [2019-09-07 20:12:06,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-09-07 20:12:06,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:12:06,465 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:12:06,465 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:12:06,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:12:06,466 INFO L82 PathProgramCache]: Analyzing trace with hash 796559996, now seen corresponding path program 1 times [2019-09-07 20:12:06,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:12:06,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:12:06,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:06,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:06,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:07,301 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 334 proven. 2 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-07 20:12:07,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:12:07,302 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:12:07,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:07,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:12:07,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:12:07,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:12:07,623 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-09-07 20:12:07,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:12:07,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2019-09-07 20:12:07,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 20:12:07,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 20:12:07,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:12:07,640 INFO L87 Difference]: Start difference. First operand 2434 states and 2784 transitions. Second operand 16 states. [2019-09-07 20:12:11,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:12:11,749 INFO L93 Difference]: Finished difference Result 4704 states and 5411 transitions. [2019-09-07 20:12:11,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 20:12:11,750 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 400 [2019-09-07 20:12:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:12:11,760 INFO L225 Difference]: With dead ends: 4704 [2019-09-07 20:12:11,760 INFO L226 Difference]: Without dead ends: 2642 [2019-09-07 20:12:11,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 415 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=482, Invalid=1680, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 20:12:11,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2019-09-07 20:12:11,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 2444. [2019-09-07 20:12:11,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2444 states. [2019-09-07 20:12:11,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 2712 transitions. [2019-09-07 20:12:11,827 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 2712 transitions. Word has length 400 [2019-09-07 20:12:11,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:12:11,830 INFO L475 AbstractCegarLoop]: Abstraction has 2444 states and 2712 transitions. [2019-09-07 20:12:11,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 20:12:11,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 2712 transitions. [2019-09-07 20:12:11,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2019-09-07 20:12:11,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:12:11,849 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 3, 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] [2019-09-07 20:12:11,849 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:12:11,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:12:11,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1013279779, now seen corresponding path program 1 times [2019-09-07 20:12:11,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:12:11,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:12:11,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:11,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:11,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 297 proven. 607 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-09-07 20:12:12,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:12:12,620 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:12:12,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:12,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:12:12,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:12:12,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:12:13,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 599 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:12:13,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:12:13,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 20:12:13,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 20:12:13,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 20:12:13,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:12:13,278 INFO L87 Difference]: Start difference. First operand 2444 states and 2712 transitions. Second operand 11 states. [2019-09-07 20:12:16,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:12:16,799 INFO L93 Difference]: Finished difference Result 5100 states and 5830 transitions. [2019-09-07 20:12:16,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 20:12:16,799 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 589 [2019-09-07 20:12:16,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:12:16,811 INFO L225 Difference]: With dead ends: 5100 [2019-09-07 20:12:16,811 INFO L226 Difference]: Without dead ends: 3028 [2019-09-07 20:12:16,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 608 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=312, Invalid=1094, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 20:12:16,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2019-09-07 20:12:16,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 2998. [2019-09-07 20:12:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2998 states. [2019-09-07 20:12:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 3278 transitions. [2019-09-07 20:12:16,884 INFO L78 Accepts]: Start accepts. Automaton has 2998 states and 3278 transitions. Word has length 589 [2019-09-07 20:12:16,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:12:16,885 INFO L475 AbstractCegarLoop]: Abstraction has 2998 states and 3278 transitions. [2019-09-07 20:12:16,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:12:16,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 3278 transitions. [2019-09-07 20:12:16,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2019-09-07 20:12:16,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:12:16,907 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:12:16,907 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:12:16,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:12:16,908 INFO L82 PathProgramCache]: Analyzing trace with hash -142539850, now seen corresponding path program 1 times [2019-09-07 20:12:16,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:12:16,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:12:16,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:16,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:16,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1294 backedges. 527 proven. 119 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2019-09-07 20:12:17,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:12:17,658 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:12:17,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:17,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:12:17,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:12:18,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1294 backedges. 934 proven. 2 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2019-09-07 20:12:18,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:12:18,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 20:12:18,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:12:18,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:12:18,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:12:18,046 INFO L87 Difference]: Start difference. First operand 2998 states and 3278 transitions. Second operand 7 states. [2019-09-07 20:12:19,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:12:19,757 INFO L93 Difference]: Finished difference Result 6690 states and 7863 transitions. [2019-09-07 20:12:19,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 20:12:19,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 676 [2019-09-07 20:12:19,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:12:19,774 INFO L225 Difference]: With dead ends: 6690 [2019-09-07 20:12:19,774 INFO L226 Difference]: Without dead ends: 4064 [2019-09-07 20:12:19,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 682 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:12:19,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4064 states. [2019-09-07 20:12:19,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4064 to 3764. [2019-09-07 20:12:19,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3764 states. [2019-09-07 20:12:19,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 4214 transitions. [2019-09-07 20:12:19,873 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 4214 transitions. Word has length 676 [2019-09-07 20:12:19,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:12:19,874 INFO L475 AbstractCegarLoop]: Abstraction has 3764 states and 4214 transitions. [2019-09-07 20:12:19,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:12:19,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 4214 transitions. [2019-09-07 20:12:19,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2019-09-07 20:12:19,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:12:19,886 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:12:19,887 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:12:19,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:12:19,887 INFO L82 PathProgramCache]: Analyzing trace with hash 919563926, now seen corresponding path program 1 times [2019-09-07 20:12:19,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:12:19,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:12:19,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:19,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:19,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:20,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 395 proven. 662 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-09-07 20:12:20,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:12:20,755 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:12:20,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:20,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 20:12:20,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:12:20,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:12:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 952 proven. 2 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2019-09-07 20:12:21,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:12:21,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2019-09-07 20:12:21,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 20:12:21,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 20:12:21,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:12:21,416 INFO L87 Difference]: Start difference. First operand 3764 states and 4214 transitions. Second operand 15 states. [2019-09-07 20:12:25,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:12:25,986 INFO L93 Difference]: Finished difference Result 8328 states and 9420 transitions. [2019-09-07 20:12:25,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 20:12:25,986 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 692 [2019-09-07 20:12:25,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:12:26,001 INFO L225 Difference]: With dead ends: 8328 [2019-09-07 20:12:26,001 INFO L226 Difference]: Without dead ends: 4564 [2019-09-07 20:12:26,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 762 GetRequests, 715 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=452, Invalid=1804, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 20:12:26,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4564 states. [2019-09-07 20:12:26,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4564 to 4546. [2019-09-07 20:12:26,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4546 states. [2019-09-07 20:12:26,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4546 states to 4546 states and 5034 transitions. [2019-09-07 20:12:26,098 INFO L78 Accepts]: Start accepts. Automaton has 4546 states and 5034 transitions. Word has length 692 [2019-09-07 20:12:26,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:12:26,099 INFO L475 AbstractCegarLoop]: Abstraction has 4546 states and 5034 transitions. [2019-09-07 20:12:26,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 20:12:26,099 INFO L276 IsEmpty]: Start isEmpty. Operand 4546 states and 5034 transitions. [2019-09-07 20:12:26,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2019-09-07 20:12:26,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:12:26,112 INFO L399 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, 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, 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, 4, 3, 3, 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] [2019-09-07 20:12:26,113 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:12:26,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:12:26,113 INFO L82 PathProgramCache]: Analyzing trace with hash 70879184, now seen corresponding path program 1 times [2019-09-07 20:12:26,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:12:26,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:12:26,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:26,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:26,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1739 backedges. 545 proven. 777 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2019-09-07 20:12:27,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:12:27,354 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:12:27,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:27,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 20:12:27,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:12:27,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:12:27,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1739 backedges. 1275 proven. 2 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-09-07 20:12:27,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:12:27,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 13 [2019-09-07 20:12:27,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:12:27,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:12:27,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:12:27,991 INFO L87 Difference]: Start difference. First operand 4546 states and 5034 transitions. Second operand 13 states. [2019-09-07 20:12:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:12:29,795 INFO L93 Difference]: Finished difference Result 8871 states and 10060 transitions. [2019-09-07 20:12:29,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 20:12:29,795 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 707 [2019-09-07 20:12:29,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:12:29,812 INFO L225 Difference]: With dead ends: 8871 [2019-09-07 20:12:29,812 INFO L226 Difference]: Without dead ends: 4840 [2019-09-07 20:12:29,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 715 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2019-09-07 20:12:29,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4840 states. [2019-09-07 20:12:29,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4840 to 4532. [2019-09-07 20:12:29,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4532 states. [2019-09-07 20:12:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4532 states to 4532 states and 4900 transitions. [2019-09-07 20:12:29,909 INFO L78 Accepts]: Start accepts. Automaton has 4532 states and 4900 transitions. Word has length 707 [2019-09-07 20:12:29,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:12:29,909 INFO L475 AbstractCegarLoop]: Abstraction has 4532 states and 4900 transitions. [2019-09-07 20:12:29,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:12:29,910 INFO L276 IsEmpty]: Start isEmpty. Operand 4532 states and 4900 transitions. [2019-09-07 20:12:29,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 807 [2019-09-07 20:12:29,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:12:29,924 INFO L399 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, 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, 6, 6, 6, 5, 3, 3, 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] [2019-09-07 20:12:29,924 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:12:29,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:12:29,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1234661610, now seen corresponding path program 1 times [2019-09-07 20:12:29,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:12:29,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:12:29,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:29,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:29,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:31,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2341 backedges. 693 proven. 1062 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2019-09-07 20:12:31,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:12:31,216 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:12:31,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:31,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:12:31,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:12:31,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:12:31,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2341 backedges. 1566 proven. 2 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2019-09-07 20:12:31,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:12:31,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 19 [2019-09-07 20:12:31,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 20:12:31,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 20:12:31,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-07 20:12:31,791 INFO L87 Difference]: Start difference. First operand 4532 states and 4900 transitions. Second operand 19 states. [2019-09-07 20:12:36,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:12:36,088 INFO L93 Difference]: Finished difference Result 8883 states and 9818 transitions. [2019-09-07 20:12:36,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 20:12:36,088 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 806 [2019-09-07 20:12:36,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:12:36,102 INFO L225 Difference]: With dead ends: 8883 [2019-09-07 20:12:36,102 INFO L226 Difference]: Without dead ends: 4649 [2019-09-07 20:12:36,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 877 GetRequests, 825 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=594, Invalid=2268, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 20:12:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4649 states. [2019-09-07 20:12:36,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4649 to 4130. [2019-09-07 20:12:36,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4130 states. [2019-09-07 20:12:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4130 states to 4130 states and 4380 transitions. [2019-09-07 20:12:36,223 INFO L78 Accepts]: Start accepts. Automaton has 4130 states and 4380 transitions. Word has length 806 [2019-09-07 20:12:36,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:12:36,224 INFO L475 AbstractCegarLoop]: Abstraction has 4130 states and 4380 transitions. [2019-09-07 20:12:36,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 20:12:36,224 INFO L276 IsEmpty]: Start isEmpty. Operand 4130 states and 4380 transitions. [2019-09-07 20:12:36,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2019-09-07 20:12:36,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:12:36,239 INFO L399 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:12:36,239 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:12:36,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:12:36,240 INFO L82 PathProgramCache]: Analyzing trace with hash 733851430, now seen corresponding path program 1 times [2019-09-07 20:12:36,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:12:36,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:12:36,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:36,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:36,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1943 backedges. 771 proven. 841 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-09-07 20:12:38,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:12:38,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:12:38,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:38,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 1172 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:12:38,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:12:39,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1943 backedges. 1250 proven. 2 refuted. 0 times theorem prover too weak. 691 trivial. 0 not checked. [2019-09-07 20:12:39,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:12:39,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5] total 20 [2019-09-07 20:12:39,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 20:12:39,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 20:12:39,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:12:39,424 INFO L87 Difference]: Start difference. First operand 4130 states and 4380 transitions. Second operand 20 states. [2019-09-07 20:12:45,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:12:45,734 INFO L93 Difference]: Finished difference Result 8620 states and 9175 transitions. [2019-09-07 20:12:45,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 20:12:45,734 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 835 [2019-09-07 20:12:45,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:12:45,745 INFO L225 Difference]: With dead ends: 8620 [2019-09-07 20:12:45,745 INFO L226 Difference]: Without dead ends: 4492 [2019-09-07 20:12:45,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 871 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1263 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=721, Invalid=3701, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 20:12:45,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4492 states. [2019-09-07 20:12:45,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4492 to 3720. [2019-09-07 20:12:45,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2019-09-07 20:12:45,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 3852 transitions. [2019-09-07 20:12:45,817 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 3852 transitions. Word has length 835 [2019-09-07 20:12:45,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:12:45,818 INFO L475 AbstractCegarLoop]: Abstraction has 3720 states and 3852 transitions. [2019-09-07 20:12:45,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 20:12:45,818 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 3852 transitions. [2019-09-07 20:12:45,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1057 [2019-09-07 20:12:45,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:12:45,835 INFO L399 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, 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, 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, 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, 1, 1, 1] [2019-09-07 20:12:45,836 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:12:45,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:12:45,837 INFO L82 PathProgramCache]: Analyzing trace with hash -52968781, now seen corresponding path program 1 times [2019-09-07 20:12:45,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:12:45,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:12:45,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:45,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:45,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:48,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3272 backedges. 665 proven. 1509 refuted. 0 times theorem prover too weak. 1098 trivial. 0 not checked. [2019-09-07 20:12:48,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:12:48,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:12:48,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:49,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 1469 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:12:49,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:12:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3272 backedges. 2211 proven. 2 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:12:49,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:12:49,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2019-09-07 20:12:49,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 20:12:49,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 20:12:49,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:12:49,566 INFO L87 Difference]: Start difference. First operand 3720 states and 3852 transitions. Second operand 18 states. [2019-09-07 20:12:54,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:12:54,272 INFO L93 Difference]: Finished difference Result 7466 states and 7772 transitions. [2019-09-07 20:12:54,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 20:12:54,273 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1056 [2019-09-07 20:12:54,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:12:54,285 INFO L225 Difference]: With dead ends: 7466 [2019-09-07 20:12:54,285 INFO L226 Difference]: Without dead ends: 3752 [2019-09-07 20:12:54,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1125 GetRequests, 1073 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=558, Invalid=2304, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 20:12:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2019-09-07 20:12:54,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 3712. [2019-09-07 20:12:54,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3712 states. [2019-09-07 20:12:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 3828 transitions. [2019-09-07 20:12:54,355 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 3828 transitions. Word has length 1056 [2019-09-07 20:12:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:12:54,356 INFO L475 AbstractCegarLoop]: Abstraction has 3712 states and 3828 transitions. [2019-09-07 20:12:54,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 20:12:54,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 3828 transitions. [2019-09-07 20:12:54,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1138 [2019-09-07 20:12:54,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:12:54,377 INFO L399 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, 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, 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, 1, 1, 1, 1] [2019-09-07 20:12:54,378 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:12:54,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:12:54,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1908903455, now seen corresponding path program 1 times [2019-09-07 20:12:54,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:12:54,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:12:54,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:54,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:54,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:12:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3950 backedges. 865 proven. 2133 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2019-09-07 20:12:58,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:12:58,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:12:58,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:12:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:12:58,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 1588 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 20:12:58,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:12:58,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:12:58,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:12:59,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3950 backedges. 2434 proven. 6 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2019-09-07 20:12:59,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:12:59,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 7] total 32 [2019-09-07 20:12:59,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 20:12:59,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 20:12:59,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2019-09-07 20:12:59,292 INFO L87 Difference]: Start difference. First operand 3712 states and 3828 transitions. Second operand 32 states. [2019-09-07 20:13:01,938 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-07 20:13:02,106 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-07 20:13:03,318 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-07 20:13:04,105 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-07 20:13:04,730 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-07 20:13:05,124 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-07 20:13:05,335 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-09-07 20:13:05,486 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-07 20:13:08,702 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2019-09-07 20:13:09,846 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-07 20:13:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:13:17,178 INFO L93 Difference]: Finished difference Result 8143 states and 8577 transitions. [2019-09-07 20:13:17,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-07 20:13:17,179 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1137 [2019-09-07 20:13:17,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:13:17,180 INFO L225 Difference]: With dead ends: 8143 [2019-09-07 20:13:17,180 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 20:13:17,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1296 GetRequests, 1177 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4489 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2155, Invalid=12125, Unknown=0, NotChecked=0, Total=14280 [2019-09-07 20:13:17,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 20:13:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 20:13:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 20:13:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 20:13:17,200 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1137 [2019-09-07 20:13:17,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:13:17,200 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 20:13:17,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 20:13:17,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 20:13:17,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 20:13:17,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 20:13:19,741 WARN L188 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 552 DAG size of output: 489 [2019-09-07 20:13:21,054 WARN L188 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 552 DAG size of output: 489 [2019-09-07 20:13:24,513 WARN L188 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 409 DAG size of output: 142 [2019-09-07 20:13:29,432 WARN L188 SmtUtils]: Spent 4.90 s on a formula simplification. DAG size of input: 496 DAG size of output: 135 [2019-09-07 20:13:34,294 WARN L188 SmtUtils]: Spent 4.86 s on a formula simplification. DAG size of input: 496 DAG size of output: 135 [2019-09-07 20:13:34,296 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 20:13:34,297 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a12~0 |old(~a12~0)|) (<= |old(~a12~0)| ~a12~0) (= ~a24~0 |old(~a24~0)|) (= ~a21~0 |old(~a21~0)|) (= ~a15~0 |old(~a15~0)|)) [2019-09-07 20:13:34,297 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 20:13:34,297 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-09-07 20:13:34,297 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-09-07 20:13:34,297 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,297 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,297 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,297 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-09-07 20:13:34,298 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-09-07 20:13:34,298 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-09-07 20:13:34,298 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-09-07 20:13:34,298 INFO L443 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-09-07 20:13:34,298 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-09-07 20:13:34,298 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-09-07 20:13:34,298 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-09-07 20:13:34,298 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,298 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,299 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,299 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-09-07 20:13:34,299 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-09-07 20:13:34,299 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-09-07 20:13:34,299 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-09-07 20:13:34,299 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-09-07 20:13:34,299 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-09-07 20:13:34,299 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-09-07 20:13:34,299 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-09-07 20:13:34,300 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,300 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,300 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,300 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-09-07 20:13:34,300 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-09-07 20:13:34,300 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-09-07 20:13:34,300 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-09-07 20:13:34,300 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-09-07 20:13:34,300 INFO L443 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-09-07 20:13:34,301 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-09-07 20:13:34,301 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-09-07 20:13:34,301 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-09-07 20:13:34,301 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,301 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,301 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,301 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-09-07 20:13:34,302 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-09-07 20:13:34,302 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-09-07 20:13:34,302 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-09-07 20:13:34,302 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-09-07 20:13:34,302 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-09-07 20:13:34,302 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-09-07 20:13:34,302 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-09-07 20:13:34,302 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,303 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,303 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,303 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-09-07 20:13:34,303 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-09-07 20:13:34,303 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-09-07 20:13:34,303 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-09-07 20:13:34,303 INFO L443 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-09-07 20:13:34,303 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-09-07 20:13:34,304 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-09-07 20:13:34,304 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-09-07 20:13:34,304 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-09-07 20:13:34,304 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,304 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,304 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,304 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,304 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-09-07 20:13:34,304 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-09-07 20:13:34,305 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-09-07 20:13:34,305 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-09-07 20:13:34,305 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-09-07 20:13:34,305 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-09-07 20:13:34,305 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-09-07 20:13:34,305 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-09-07 20:13:34,305 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,305 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,306 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,306 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-09-07 20:13:34,306 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-09-07 20:13:34,306 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-09-07 20:13:34,306 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-09-07 20:13:34,306 INFO L443 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-09-07 20:13:34,306 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-09-07 20:13:34,306 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-09-07 20:13:34,307 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-09-07 20:13:34,307 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,307 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,307 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,307 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-09-07 20:13:34,307 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-09-07 20:13:34,307 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-09-07 20:13:34,307 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-09-07 20:13:34,308 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-09-07 20:13:34,308 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-09-07 20:13:34,308 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse36 (+ |old(~a12~0)| 43))) (let ((.cse22 (= 7 |old(~a15~0)|)) (.cse10 (= 7 |old(~a21~0)|)) (.cse3 (not (<= .cse36 0)))) (let ((.cse7 (= ~a21~0 7)) (.cse23 (let ((.cse37 (not (<= |old(~a15~0)| 7)))) (and (or .cse22 .cse37) (or .cse10 .cse37 .cse3)))) (.cse35 (= 1 |old(~a24~0)|)) (.cse27 (= 10 |old(~a21~0)|))) (let ((.cse6 (= ~a24~0 1)) (.cse11 (not .cse27)) (.cse1 (not .cse35)) (.cse31 (not (< 80 |old(~a12~0)|))) (.cse16 (or (and .cse35 (not (< 0 .cse36)) (= 5 |old(~a15~0)|) .cse10) .cse23)) (.cse33 (= ~a12~0 |old(~a12~0)|)) (.cse32 (not .cse7)) (.cse26 (= 6 |old(~a21~0)|)) (.cse13 (= ~a24~0 |old(~a24~0)|)) (.cse4 (<= ~a12~0 |old(~a12~0)|)) (.cse5 (<= |old(~a12~0)| ~a12~0)) (.cse14 (= ~a21~0 |old(~a21~0)|)) (.cse15 (= ~a15~0 |old(~a15~0)|))) (let ((.cse2 (and .cse13 (and .cse4 .cse5) .cse14 .cse15)) (.cse9 (not (= 9 |old(~a15~0)|))) (.cse8 (= ~a15~0 9)) (.cse17 (not .cse26)) (.cse12 (and .cse33 (let ((.cse34 (<= ~a15~0 7))) (or (and .cse34 (<= (+ ~a12~0 43) 0) .cse32) (and .cse34 (not (= ~a15~0 7))))))) (.cse0 (and (or .cse11 .cse22 .cse1 .cse31) (or .cse16 .cse27))) (.cse21 (not (= 8 |old(~a21~0)|))) (.cse28 (not (= 9 |old(~a21~0)|))) (.cse29 (and .cse4 .cse5 (= ~a21~0 9) .cse15 .cse6)) (.cse24 (and .cse33 .cse13 .cse14 .cse15)) (.cse20 (not .cse22)) (.cse18 (and .cse4 .cse5 .cse14 .cse15 .cse6)) (.cse25 (not (<= |old(~a12~0)| 11))) (.cse19 (not (= 8 |old(~a15~0)|)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse2 .cse3) (or (and .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 (not .cse10) .cse1) (or .cse11 (and (and .cse12 .cse13) .cse14 .cse15) .cse16) (or .cse17 .cse18 .cse1 .cse19) (or (= ~a21~0 6) .cse17 .cse20) (or .cse9 .cse1 (and .cse4 .cse5 .cse14 .cse6 .cse8) .cse21) (or .cse17 .cse18 (not (<= |old(~a12~0)| 95442)) .cse22 .cse1) (or (not (= 6 |old(~a15~0)|)) (= ~a15~0 6)) (or .cse23 .cse24 (not (<= (+ |old(~a12~0)| 49) 0))) (or .cse11 .cse22 .cse1 .cse25 .cse18) (or .cse26 (and .cse13 .cse14 .cse15 .cse12) .cse0 .cse27) (or .cse28 (not (<= |old(~a12~0)| 76)) .cse1 .cse19 .cse29) (or .cse1 .cse19 .cse18 (forall ((v_~a12~0_448 Int)) (let ((.cse30 (+ v_~a12~0_448 366333))) (or (not (< 11 v_~a12~0_448)) (not (<= 0 .cse30)) (not (<= v_~a12~0_448 80)) (not (<= |old(~a12~0)| (div .cse30 5)))))) .cse21) (or .cse28 .cse29 .cse22 .cse1 .cse31) (or (and .cse15 .cse32) .cse10 .cse20) (or .cse24 .cse20 (not (<= (+ |old(~a12~0)| 340660) 0))) (or .cse18 (or .cse25 (not (<= |old(~a21~0)| 7))) .cse1 .cse19))))))) [2019-09-07 20:13:34,309 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-09-07 20:13:34,309 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-09-07 20:13:34,309 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,309 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,309 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,309 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-09-07 20:13:34,309 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-09-07 20:13:34,309 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-09-07 20:13:34,309 INFO L443 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-09-07 20:13:34,309 INFO L443 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-09-07 20:13:34,310 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-09-07 20:13:34,310 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-09-07 20:13:34,310 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-09-07 20:13:34,310 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,310 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,310 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,310 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-09-07 20:13:34,310 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-09-07 20:13:34,310 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-09-07 20:13:34,310 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-09-07 20:13:34,311 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-09-07 20:13:34,311 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-09-07 20:13:34,311 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-09-07 20:13:34,311 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-09-07 20:13:34,311 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,311 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,311 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,311 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-09-07 20:13:34,311 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-09-07 20:13:34,311 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-09-07 20:13:34,312 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-09-07 20:13:34,312 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-09-07 20:13:34,312 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-09-07 20:13:34,312 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-09-07 20:13:34,312 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-09-07 20:13:34,312 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,312 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,312 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,312 INFO L443 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-09-07 20:13:34,312 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-09-07 20:13:34,313 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-09-07 20:13:34,313 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-09-07 20:13:34,313 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-09-07 20:13:34,313 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-09-07 20:13:34,313 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-09-07 20:13:34,313 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-09-07 20:13:34,313 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,313 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,313 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-09-07 20:13:34,314 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-09-07 20:13:34,314 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-09-07 20:13:34,314 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-09-07 20:13:34,314 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-09-07 20:13:34,314 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-09-07 20:13:34,314 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-09-07 20:13:34,314 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-09-07 20:13:34,314 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,314 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,314 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-09-07 20:13:34,315 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-09-07 20:13:34,315 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-09-07 20:13:34,315 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-09-07 20:13:34,315 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-09-07 20:13:34,315 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-09-07 20:13:34,315 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,315 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,315 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-09-07 20:13:34,315 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-09-07 20:13:34,316 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-09-07 20:13:34,316 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-09-07 20:13:34,316 INFO L443 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-09-07 20:13:34,316 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-09-07 20:13:34,316 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-09-07 20:13:34,316 INFO L443 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-09-07 20:13:34,316 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,316 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,316 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-09-07 20:13:34,316 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-09-07 20:13:34,317 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-09-07 20:13:34,317 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-09-07 20:13:34,317 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-09-07 20:13:34,317 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-09-07 20:13:34,317 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-09-07 20:13:34,317 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,317 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,317 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,317 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-09-07 20:13:34,317 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-09-07 20:13:34,318 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-09-07 20:13:34,318 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-09-07 20:13:34,318 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-09-07 20:13:34,318 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-09-07 20:13:34,318 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,318 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,318 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-09-07 20:13:34,318 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,318 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-09-07 20:13:34,318 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-09-07 20:13:34,319 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-09-07 20:13:34,319 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-09-07 20:13:34,319 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-09-07 20:13:34,319 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-09-07 20:13:34,319 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-09-07 20:13:34,319 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-09-07 20:13:34,319 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-09-07 20:13:34,319 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-09-07 20:13:34,319 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,319 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,319 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,320 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-09-07 20:13:34,320 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-09-07 20:13:34,320 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-09-07 20:13:34,320 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-09-07 20:13:34,320 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-09-07 20:13:34,320 INFO L443 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-09-07 20:13:34,320 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-09-07 20:13:34,320 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-09-07 20:13:34,320 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,321 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,321 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,321 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-09-07 20:13:34,321 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-09-07 20:13:34,321 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-09-07 20:13:34,321 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-09-07 20:13:34,321 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-09-07 20:13:34,321 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-09-07 20:13:34,321 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-09-07 20:13:34,321 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-09-07 20:13:34,321 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,322 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,322 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,322 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-09-07 20:13:34,322 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-09-07 20:13:34,322 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-09-07 20:13:34,322 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-09-07 20:13:34,322 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-09-07 20:13:34,322 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-09-07 20:13:34,322 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-09-07 20:13:34,323 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-09-07 20:13:34,323 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-09-07 20:13:34,323 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,323 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,323 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:13:34,323 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-09-07 20:13:34,323 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-09-07 20:13:34,323 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-09-07 20:13:34,323 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-09-07 20:13:34,323 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-09-07 20:13:34,324 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 20:13:34,324 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~a21~0 7) (<= 7 ~a21~0) (= ~a15~0 8) (= ~a24~0 1) (<= (+ ~a12~0 49) 0)) [2019-09-07 20:13:34,324 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 20:13:34,324 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 20:13:34,324 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (not (<= (+ |old(~a12~0)| 49) 0)) (not (= 8 |old(~a15~0)|)) (not (<= 7 |old(~a21~0)|)) (not (= 1 |old(~a24~0)|)) (and (<= ~a12~0 |old(~a12~0)|) (<= |old(~a12~0)| ~a12~0) (= ~a15~0 |old(~a15~0)|) (<= |old(~a21~0)| ~a21~0) (<= ~a21~0 7) (= ~a24~0 1)) (not (<= |old(~a21~0)| 7))) [2019-09-07 20:13:34,324 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2019-09-07 20:13:34,325 INFO L439 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse16 (= ~a15~0 7))) (let ((.cse9 (not .cse16)) (.cse19 (not (= 1 |old(~a24~0)|))) (.cse7 (= ~a21~0 7))) (let ((.cse15 (= ~a21~0 10)) (.cse8 (not (= ~a15~0 5))) (.cse12 (= ~a24~0 1)) (.cse0 (+ ~a12~0 43)) (.cse21 (not .cse7)) (.cse23 (or (not (= 9 |old(~a15~0)|)) (not (= 7 |old(~a21~0)|)) .cse19)) (.cse2 (and (<= ~a15~0 7) .cse9)) (.cse24 (or (and (<= |old(~a21~0)| 10) (<= |old(~a12~0)| 80)) (<= |old(~a21~0)| 6)))) (let ((.cse26 (not (= 6 |old(~a21~0)|))) (.cse27 (not (= 5 |old(~a15~0)|))) (.cse14 (and (or .cse8 (not .cse12) (< 0 .cse0) .cse21) (and .cse23 .cse2) .cse24)) (.cse25 (not .cse15))) (let ((.cse10 (<= ~a15~0 8)) (.cse13 (and .cse14 .cse25)) (.cse22 (and (<= 9 ~a21~0) .cse23 .cse24 (< 80 ~a12~0) (or .cse26 (<= 0 (+ |old(~a12~0)| 42)) .cse27 .cse19))) (.cse4 (= ~a24~0 |old(~a24~0)|))) (let ((.cse6 (= ~a15~0 9)) (.cse1 (or .cse13 (and (and .cse22 .cse15) .cse4))) (.cse3 (= ~a21~0 6)) (.cse11 (<= ~a12~0 11)) (.cse5 (= ~a21~0 8)) (.cse18 (and (and (and .cse8 .cse23 (and .cse10 .cse21) .cse24) (not (= 10 |old(~a21~0)|)) .cse25) (or .cse26 .cse27 .cse19))) (.cse20 (= ~a21~0 9))) (or (not (= 8 |old(~a15~0)|)) (and (<= .cse0 0) .cse1) (and .cse2 (<= (+ ~a12~0 49) 0)) (and .cse3 .cse4 (= ~a15~0 |old(~a15~0)|)) (and .cse4 .cse5 .cse6) (and .cse4 (and .cse7 .cse6)) (not (<= (+ |old(~a12~0)| 49) 0)) (and (and (and (<= ~a21~0 7) .cse8 .cse9 .cse10) .cse11) .cse12) (and (not .cse3) .cse13) (and .cse14 .cse15) (and .cse1 .cse4) (not (<= |old(~a21~0)| 7)) (and .cse3 .cse4 (<= ~a12~0 95442)) (not (<= 7 |old(~a21~0)|)) (and .cse11 .cse4 .cse15) (and .cse16 (<= (+ ~a12~0 340660) 0)) (and (exists ((v_~a12~0_448 Int)) (let ((.cse17 (+ v_~a12~0_448 366333))) (and (<= 0 .cse17) (< 11 v_~a12~0_448) (<= v_~a12~0_448 80) (<= ~a12~0 (div .cse17 5))))) (and .cse12 (and .cse18 .cse5))) .cse19 (and (and (and (<= ~a12~0 76) .cse18) .cse20) .cse12) (and .cse16 .cse21) (and .cse4 .cse22 .cse20) (= ~a15~0 6)))))))) [2019-09-07 20:13:34,325 INFO L443 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2019-09-07 20:13:34,325 INFO L443 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-09-07 20:13:34,326 INFO L439 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse16 (= ~a15~0 7))) (let ((.cse9 (not .cse16)) (.cse19 (not (= 1 |old(~a24~0)|))) (.cse7 (= ~a21~0 7))) (let ((.cse15 (= ~a21~0 10)) (.cse8 (not (= ~a15~0 5))) (.cse12 (= ~a24~0 1)) (.cse0 (+ ~a12~0 43)) (.cse21 (not .cse7)) (.cse23 (or (not (= 9 |old(~a15~0)|)) (not (= 7 |old(~a21~0)|)) .cse19)) (.cse2 (and (<= ~a15~0 7) .cse9)) (.cse24 (or (and (<= |old(~a21~0)| 10) (<= |old(~a12~0)| 80)) (<= |old(~a21~0)| 6)))) (let ((.cse26 (not (= 6 |old(~a21~0)|))) (.cse27 (not (= 5 |old(~a15~0)|))) (.cse14 (and (or .cse8 (not .cse12) (< 0 .cse0) .cse21) (and .cse23 .cse2) .cse24)) (.cse25 (not .cse15))) (let ((.cse10 (<= ~a15~0 8)) (.cse13 (and .cse14 .cse25)) (.cse22 (and (<= 9 ~a21~0) .cse23 .cse24 (< 80 ~a12~0) (or .cse26 (<= 0 (+ |old(~a12~0)| 42)) .cse27 .cse19))) (.cse4 (= ~a24~0 |old(~a24~0)|))) (let ((.cse6 (= ~a15~0 9)) (.cse1 (or .cse13 (and (and .cse22 .cse15) .cse4))) (.cse3 (= ~a21~0 6)) (.cse11 (<= ~a12~0 11)) (.cse5 (= ~a21~0 8)) (.cse18 (and (and (and .cse8 .cse23 (and .cse10 .cse21) .cse24) (not (= 10 |old(~a21~0)|)) .cse25) (or .cse26 .cse27 .cse19))) (.cse20 (= ~a21~0 9))) (or (not (= 8 |old(~a15~0)|)) (and (<= .cse0 0) .cse1) (and .cse2 (<= (+ ~a12~0 49) 0)) (and .cse3 .cse4 (= ~a15~0 |old(~a15~0)|)) (and .cse4 .cse5 .cse6) (and .cse4 (and .cse7 .cse6)) (not (<= (+ |old(~a12~0)| 49) 0)) (and (and (and (<= ~a21~0 7) .cse8 .cse9 .cse10) .cse11) .cse12) (and (not .cse3) .cse13) (and .cse14 .cse15) (and .cse1 .cse4) (not (<= |old(~a21~0)| 7)) (and .cse3 .cse4 (<= ~a12~0 95442)) (not (<= 7 |old(~a21~0)|)) (and .cse11 .cse4 .cse15) (and .cse16 (<= (+ ~a12~0 340660) 0)) (and (exists ((v_~a12~0_448 Int)) (let ((.cse17 (+ v_~a12~0_448 366333))) (and (<= 0 .cse17) (< 11 v_~a12~0_448) (<= v_~a12~0_448 80) (<= ~a12~0 (div .cse17 5))))) (and .cse12 (and .cse18 .cse5))) .cse19 (and (and (and (<= ~a12~0 76) .cse18) .cse20) .cse12) (and .cse16 .cse21) (and .cse4 .cse22 .cse20) (= ~a15~0 6)))))))) [2019-09-07 20:13:34,326 INFO L443 ceAbstractionStarter]: For program point L880-3(lines 874 890) no Hoare annotation was computed. [2019-09-07 20:13:34,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-09-07 20:13:34,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-09-07 20:13:34,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-09-07 20:13:34,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-09-07 20:13:34,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-09-07 20:13:34,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-09-07 20:13:34,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-09-07 20:13:34,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-09-07 20:13:34,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 08:13:34 BoogieIcfgContainer [2019-09-07 20:13:34,363 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 20:13:34,365 INFO L168 Benchmark]: Toolchain (without parser) took 114789.98 ms. Allocated memory was 136.8 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 91.5 MB in the beginning and 677.4 MB in the end (delta: -585.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-09-07 20:13:34,366 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory was 111.3 MB in the beginning and 111.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 20:13:34,367 INFO L168 Benchmark]: CACSL2BoogieTranslator took 879.94 ms. Allocated memory was 136.8 MB in the beginning and 202.4 MB in the end (delta: 65.5 MB). Free memory was 91.1 MB in the beginning and 158.4 MB in the end (delta: -67.3 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. [2019-09-07 20:13:34,367 INFO L168 Benchmark]: Boogie Preprocessor took 137.94 ms. Allocated memory is still 202.4 MB. Free memory was 158.4 MB in the beginning and 152.8 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2019-09-07 20:13:34,368 INFO L168 Benchmark]: RCFGBuilder took 1499.24 ms. Allocated memory was 202.4 MB in the beginning and 234.9 MB in the end (delta: 32.5 MB). Free memory was 152.8 MB in the beginning and 149.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 74.2 MB. Max. memory is 7.1 GB. [2019-09-07 20:13:34,369 INFO L168 Benchmark]: TraceAbstraction took 112268.56 ms. Allocated memory was 234.9 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 149.7 MB in the beginning and 677.4 MB in the end (delta: -527.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-09-07 20:13:34,373 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory was 111.3 MB in the beginning and 111.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 879.94 ms. Allocated memory was 136.8 MB in the beginning and 202.4 MB in the end (delta: 65.5 MB). Free memory was 91.1 MB in the beginning and 158.4 MB in the end (delta: -67.3 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 137.94 ms. Allocated memory is still 202.4 MB. Free memory was 158.4 MB in the beginning and 152.8 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1499.24 ms. Allocated memory was 202.4 MB in the beginning and 234.9 MB in the end (delta: 32.5 MB). Free memory was 152.8 MB in the beginning and 149.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 74.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 112268.56 ms. Allocated memory was 234.9 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 149.7 MB in the beginning and 677.4 MB in the end (delta: -527.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 112]: 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 [2019-09-07 20:13:34,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-09-07 20:13:34,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-09-07 20:13:34,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-09-07 20:13:34,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-09-07 20:13:34,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-09-07 20:13:34,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-09-07 20:13:34,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-09-07 20:13:34,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((!(8 == \old(a15)) || (a12 + 43 <= 0 && (((((((!(a15 == 5) || !(a24 == 1)) || 0 < a12 + 43) || !(a21 == 7)) && ((!(9 == \old(a15)) || !(7 == \old(a21))) || !(1 == \old(a24))) && a15 <= 7 && !(a15 == 7)) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(a21 == 10)) || ((((((9 <= a21 && ((!(9 == \old(a15)) || !(7 == \old(a21))) || !(1 == \old(a24)))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && 80 < a12) && (((!(6 == \old(a21)) || 0 <= \old(a12) + 42) || !(5 == \old(a15))) || !(1 == \old(a24)))) && a21 == 10) && a24 == \old(a24))))) || ((a15 <= 7 && !(a15 == 7)) && a12 + 49 <= 0)) || ((a21 == 6 && a24 == \old(a24)) && a15 == \old(a15))) || ((a24 == \old(a24) && a21 == 8) && a15 == 9)) || (a24 == \old(a24) && a21 == 7 && a15 == 9)) || !(\old(a12) + 49 <= 0)) || (((((a21 <= 7 && !(a15 == 5)) && !(a15 == 7)) && a15 <= 8) && a12 <= 11) && a24 == 1)) || (!(a21 == 6) && (((((!(a15 == 5) || !(a24 == 1)) || 0 < a12 + 43) || !(a21 == 7)) && ((!(9 == \old(a15)) || !(7 == \old(a21))) || !(1 == \old(a24))) && a15 <= 7 && !(a15 == 7)) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(a21 == 10))) || ((((((!(a15 == 5) || !(a24 == 1)) || 0 < a12 + 43) || !(a21 == 7)) && ((!(9 == \old(a15)) || !(7 == \old(a21))) || !(1 == \old(a24))) && a15 <= 7 && !(a15 == 7)) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && a21 == 10)) || ((((((((!(a15 == 5) || !(a24 == 1)) || 0 < a12 + 43) || !(a21 == 7)) && ((!(9 == \old(a15)) || !(7 == \old(a21))) || !(1 == \old(a24))) && a15 <= 7 && !(a15 == 7)) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(a21 == 10)) || ((((((9 <= a21 && ((!(9 == \old(a15)) || !(7 == \old(a21))) || !(1 == \old(a24)))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && 80 < a12) && (((!(6 == \old(a21)) || 0 <= \old(a12) + 42) || !(5 == \old(a15))) || !(1 == \old(a24)))) && a21 == 10) && a24 == \old(a24))) && a24 == \old(a24))) || !(\old(a21) <= 7)) || ((a21 == 6 && a24 == \old(a24)) && a12 <= 95442)) || !(7 <= \old(a21))) || ((a12 <= 11 && a24 == \old(a24)) && a21 == 10)) || (a15 == 7 && a12 + 340660 <= 0)) || ((\exists v_~a12~0_448 : int :: ((0 <= v_~a12~0_448 + 366333 && 11 < v_~a12~0_448) && v_~a12~0_448 <= 80) && a12 <= (v_~a12~0_448 + 366333) / 5) && a24 == 1 && ((((((!(a15 == 5) && ((!(9 == \old(a15)) || !(7 == \old(a21))) || !(1 == \old(a24)))) && a15 <= 8 && !(a21 == 7)) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(10 == \old(a21))) && !(a21 == 10)) && ((!(6 == \old(a21)) || !(5 == \old(a15))) || !(1 == \old(a24)))) && a21 == 8)) || !(1 == \old(a24))) || (((a12 <= 76 && (((((!(a15 == 5) && ((!(9 == \old(a15)) || !(7 == \old(a21))) || !(1 == \old(a24)))) && a15 <= 8 && !(a21 == 7)) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(10 == \old(a21))) && !(a21 == 10)) && ((!(6 == \old(a21)) || !(5 == \old(a15))) || !(1 == \old(a24)))) && a21 == 9) && a24 == 1)) || (a15 == 7 && !(a21 == 7))) || ((a24 == \old(a24) && (((9 <= a21 && ((!(9 == \old(a15)) || !(7 == \old(a21))) || !(1 == \old(a24)))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && 80 < a12) && (((!(6 == \old(a21)) || 0 <= \old(a12) + 42) || !(5 == \old(a15))) || !(1 == \old(a24)))) && a21 == 9)) || a15 == 6 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 254 locations, 1 error locations. SAFE Result, 112.1s OverallTime, 16 OverallIterations, 10 TraceHistogramMax, 68.4s AutomataDifference, 0.0s DeadEndRemovalTime, 17.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1027 SDtfs, 42345 SDslu, 2437 SDs, 0 SdLazy, 42262 SolverSat, 6828 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 39.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8857 GetRequests, 8293 SyntacticMatches, 12 SemanticMatches, 552 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9685 ImplicationChecksByTransitivity, 22.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4546occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 4001 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 298 PreInvPairs, 456 NumberOfFragments, 2250 HoareAnnotationTreeSize, 298 FomulaSimplifications, 13537386 FormulaSimplificationTreeSizeReduction, 3.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 5807054 FormulaSimplificationTreeSizeReductionInter, 13.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 16448 NumberOfCodeBlocks, 16448 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 16419 ConstructedInterpolants, 10 QuantifiedInterpolants, 66900628 SizeOfPredicates, 15 NumberOfNonLiveVariables, 11849 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 29 InterpolantComputations, 5 PerfectInterpolantSequences, 28739/36806 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...