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/Problem11_label22.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 18:18:32,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 18:18:32,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 18:18:32,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 18:18:32,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 18:18:32,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 18:18:32,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 18:18:32,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 18:18:32,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 18:18:32,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 18:18:32,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 18:18:32,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 18:18:32,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 18:18:32,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 18:18:32,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 18:18:32,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 18:18:32,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 18:18:32,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 18:18:32,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 18:18:32,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 18:18:32,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 18:18:32,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 18:18:32,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 18:18:32,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 18:18:32,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 18:18:32,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 18:18:32,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 18:18:32,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 18:18:32,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 18:18:32,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 18:18:32,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 18:18:32,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 18:18:32,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 18:18:32,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 18:18:32,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 18:18:32,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 18:18:32,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 18:18:32,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 18:18:32,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 18:18:32,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 18:18:32,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 18:18:32,412 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 18:18:32,442 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 18:18:32,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 18:18:32,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 18:18:32,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 18:18:32,445 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 18:18:32,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 18:18:32,446 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 18:18:32,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 18:18:32,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 18:18:32,446 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 18:18:32,448 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 18:18:32,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 18:18:32,448 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 18:18:32,448 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 18:18:32,449 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 18:18:32,449 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 18:18:32,449 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 18:18:32,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 18:18:32,450 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 18:18:32,450 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 18:18:32,450 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 18:18:32,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 18:18:32,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 18:18:32,451 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 18:18:32,451 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 18:18:32,451 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 18:18:32,452 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 18:18:32,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 18:18:32,452 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 18:18:32,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 18:18:32,527 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 18:18:32,532 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 18:18:32,533 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 18:18:32,534 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 18:18:32,534 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label22.c [2019-09-07 18:18:32,612 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2b85e8ad/59f8ec6bb1ec4e898a160b5794dabeaa/FLAG74bb7a2fc [2019-09-07 18:18:33,217 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 18:18:33,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label22.c [2019-09-07 18:18:33,233 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2b85e8ad/59f8ec6bb1ec4e898a160b5794dabeaa/FLAG74bb7a2fc [2019-09-07 18:18:33,432 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2b85e8ad/59f8ec6bb1ec4e898a160b5794dabeaa [2019-09-07 18:18:33,444 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 18:18:33,445 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 18:18:33,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 18:18:33,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 18:18:33,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 18:18:33,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:18:33" (1/1) ... [2019-09-07 18:18:33,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a9f1bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:33, skipping insertion in model container [2019-09-07 18:18:33,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:18:33" (1/1) ... [2019-09-07 18:18:33,461 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 18:18:33,535 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 18:18:34,464 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:18:34,477 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 18:18:34,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:18:34,687 INFO L192 MainTranslator]: Completed translation [2019-09-07 18:18:34,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:34 WrapperNode [2019-09-07 18:18:34,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 18:18:34,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 18:18:34,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 18:18:34,689 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 18:18:34,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:34" (1/1) ... [2019-09-07 18:18:34,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:34" (1/1) ... [2019-09-07 18:18:34,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:34" (1/1) ... [2019-09-07 18:18:34,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:34" (1/1) ... [2019-09-07 18:18:34,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:34" (1/1) ... [2019-09-07 18:18:34,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:34" (1/1) ... [2019-09-07 18:18:34,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:34" (1/1) ... [2019-09-07 18:18:34,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 18:18:34,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 18:18:34,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 18:18:34,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 18:18:34,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:34" (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 18:18:34,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 18:18:34,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 18:18:34,896 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 18:18:34,896 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 18:18:34,896 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 18:18:34,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 18:18:34,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 18:18:34,897 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 18:18:34,897 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 18:18:34,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 18:18:34,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 18:18:36,611 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 18:18:36,612 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 18:18:36,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:18:36 BoogieIcfgContainer [2019-09-07 18:18:36,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 18:18:36,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 18:18:36,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 18:18:36,618 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 18:18:36,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 06:18:33" (1/3) ... [2019-09-07 18:18:36,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c682d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:18:36, skipping insertion in model container [2019-09-07 18:18:36,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:18:34" (2/3) ... [2019-09-07 18:18:36,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c682d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:18:36, skipping insertion in model container [2019-09-07 18:18:36,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:18:36" (3/3) ... [2019-09-07 18:18:36,623 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label22.c [2019-09-07 18:18:36,634 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 18:18:36,642 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 18:18:36,659 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 18:18:36,695 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 18:18:36,695 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 18:18:36,696 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 18:18:36,696 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 18:18:36,696 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 18:18:36,696 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 18:18:36,696 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 18:18:36,697 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 18:18:36,697 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 18:18:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-09-07 18:18:36,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-07 18:18:36,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:36,735 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:18:36,737 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:36,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:36,743 INFO L82 PathProgramCache]: Analyzing trace with hash 237032882, now seen corresponding path program 1 times [2019-09-07 18:18:36,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:36,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:36,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:36,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:36,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:37,146 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 18:18:37,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:18:37,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 18:18:37,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 18:18:37,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 18:18:37,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 18:18:37,171 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 3 states. [2019-09-07 18:18:38,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:18:38,584 INFO L93 Difference]: Finished difference Result 787 states and 1379 transitions. [2019-09-07 18:18:38,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 18:18:38,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-07 18:18:38,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:18:38,604 INFO L225 Difference]: With dead ends: 787 [2019-09-07 18:18:38,604 INFO L226 Difference]: Without dead ends: 433 [2019-09-07 18:18:38,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 18:18:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-09-07 18:18:38,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 426. [2019-09-07 18:18:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-07 18:18:38,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 678 transitions. [2019-09-07 18:18:38,721 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 678 transitions. Word has length 61 [2019-09-07 18:18:38,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:18:38,722 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 678 transitions. [2019-09-07 18:18:38,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 18:18:38,722 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 678 transitions. [2019-09-07 18:18:38,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-07 18:18:38,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:38,729 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:18:38,730 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:38,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:38,730 INFO L82 PathProgramCache]: Analyzing trace with hash -804898139, now seen corresponding path program 1 times [2019-09-07 18:18:38,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:38,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:38,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:38,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:38,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:18:38,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:18:38,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 18:18:38,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 18:18:38,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 18:18:38,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 18:18:38,949 INFO L87 Difference]: Start difference. First operand 426 states and 678 transitions. Second operand 5 states. [2019-09-07 18:18:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:18:40,506 INFO L93 Difference]: Finished difference Result 1259 states and 2034 transitions. [2019-09-07 18:18:40,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 18:18:40,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-09-07 18:18:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:18:40,513 INFO L225 Difference]: With dead ends: 1259 [2019-09-07 18:18:40,513 INFO L226 Difference]: Without dead ends: 839 [2019-09-07 18:18:40,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 18:18:40,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-09-07 18:18:40,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 627. [2019-09-07 18:18:40,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-09-07 18:18:40,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 934 transitions. [2019-09-07 18:18:40,555 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 934 transitions. Word has length 136 [2019-09-07 18:18:40,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:18:40,556 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 934 transitions. [2019-09-07 18:18:40,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 18:18:40,556 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 934 transitions. [2019-09-07 18:18:40,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-07 18:18:40,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:40,562 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, 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] [2019-09-07 18:18:40,562 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:40,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:40,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1955733518, now seen corresponding path program 1 times [2019-09-07 18:18:40,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:40,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:40,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:40,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:40,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:18:40,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:18:40,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 18:18:40,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 18:18:40,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 18:18:40,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 18:18:40,746 INFO L87 Difference]: Start difference. First operand 627 states and 934 transitions. Second operand 5 states. [2019-09-07 18:18:42,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:18:42,480 INFO L93 Difference]: Finished difference Result 1874 states and 2847 transitions. [2019-09-07 18:18:42,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 18:18:42,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-09-07 18:18:42,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:18:42,491 INFO L225 Difference]: With dead ends: 1874 [2019-09-07 18:18:42,492 INFO L226 Difference]: Without dead ends: 1253 [2019-09-07 18:18:42,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 18:18:42,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2019-09-07 18:18:42,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1222. [2019-09-07 18:18:42,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-09-07 18:18:42,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1682 transitions. [2019-09-07 18:18:42,540 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1682 transitions. Word has length 147 [2019-09-07 18:18:42,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:18:42,541 INFO L475 AbstractCegarLoop]: Abstraction has 1222 states and 1682 transitions. [2019-09-07 18:18:42,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 18:18:42,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1682 transitions. [2019-09-07 18:18:42,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-07 18:18:42,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:42,554 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:18:42,554 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:42,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:42,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1859141034, now seen corresponding path program 1 times [2019-09-07 18:18:42,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:42,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:42,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:42,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:42,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:18:42,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:18:42,823 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) [2019-09-07 18:18:42,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:18:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:42,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:18:42,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:18:43,116 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 18:18:43,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:18:43,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 18:18:43,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:18:43,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:18:43,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:18:43,131 INFO L87 Difference]: Start difference. First operand 1222 states and 1682 transitions. Second operand 9 states. [2019-09-07 18:18:47,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:18:47,425 INFO L93 Difference]: Finished difference Result 5003 states and 7503 transitions. [2019-09-07 18:18:47,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 18:18:47,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 192 [2019-09-07 18:18:47,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:18:47,463 INFO L225 Difference]: With dead ends: 5003 [2019-09-07 18:18:47,464 INFO L226 Difference]: Without dead ends: 3787 [2019-09-07 18:18:47,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-09-07 18:18:47,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2019-09-07 18:18:47,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3586. [2019-09-07 18:18:47,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3586 states. [2019-09-07 18:18:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 4987 transitions. [2019-09-07 18:18:47,708 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 4987 transitions. Word has length 192 [2019-09-07 18:18:47,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:18:47,710 INFO L475 AbstractCegarLoop]: Abstraction has 3586 states and 4987 transitions. [2019-09-07 18:18:47,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:18:47,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 4987 transitions. [2019-09-07 18:18:47,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-07 18:18:47,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:47,722 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, 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, 1, 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 18:18:47,723 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:47,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:47,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1158247517, now seen corresponding path program 1 times [2019-09-07 18:18:47,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:47,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:47,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:47,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:47,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 108 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 18:18:48,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:18:48,060 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 18:18:48,081 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 18:18:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:48,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 18:18:48,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:18:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 18:18:48,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:18:48,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 18:18:48,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:18:48,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:18:48,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:18:48,427 INFO L87 Difference]: Start difference. First operand 3586 states and 4987 transitions. Second operand 9 states. [2019-09-07 18:18:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:18:50,977 INFO L93 Difference]: Finished difference Result 10813 states and 16308 transitions. [2019-09-07 18:18:50,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 18:18:50,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 220 [2019-09-07 18:18:50,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:18:51,042 INFO L225 Difference]: With dead ends: 10813 [2019-09-07 18:18:51,043 INFO L226 Difference]: Without dead ends: 7237 [2019-09-07 18:18:51,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 18:18:51,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7237 states. [2019-09-07 18:18:51,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7237 to 6949. [2019-09-07 18:18:51,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6949 states. [2019-09-07 18:18:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6949 states to 6949 states and 9953 transitions. [2019-09-07 18:18:51,348 INFO L78 Accepts]: Start accepts. Automaton has 6949 states and 9953 transitions. Word has length 220 [2019-09-07 18:18:51,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:18:51,349 INFO L475 AbstractCegarLoop]: Abstraction has 6949 states and 9953 transitions. [2019-09-07 18:18:51,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:18:51,349 INFO L276 IsEmpty]: Start isEmpty. Operand 6949 states and 9953 transitions. [2019-09-07 18:18:51,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-07 18:18:51,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:51,356 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, 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, 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 18:18:51,356 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:51,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:51,357 INFO L82 PathProgramCache]: Analyzing trace with hash -393430279, now seen corresponding path program 1 times [2019-09-07 18:18:51,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:51,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:51,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:51,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:51,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-07 18:18:51,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:18:51,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:18:51,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:18:51,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:18:51,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:18:51,581 INFO L87 Difference]: Start difference. First operand 6949 states and 9953 transitions. Second operand 4 states. [2019-09-07 18:18:53,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:18:53,262 INFO L93 Difference]: Finished difference Result 16965 states and 25229 transitions. [2019-09-07 18:18:53,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:18:53,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 222 [2019-09-07 18:18:53,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:18:53,338 INFO L225 Difference]: With dead ends: 16965 [2019-09-07 18:18:53,339 INFO L226 Difference]: Without dead ends: 10210 [2019-09-07 18:18:53,368 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 18:18:53,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10210 states. [2019-09-07 18:18:53,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10210 to 8128. [2019-09-07 18:18:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8128 states. [2019-09-07 18:18:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8128 states to 8128 states and 11659 transitions. [2019-09-07 18:18:53,715 INFO L78 Accepts]: Start accepts. Automaton has 8128 states and 11659 transitions. Word has length 222 [2019-09-07 18:18:53,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:18:53,716 INFO L475 AbstractCegarLoop]: Abstraction has 8128 states and 11659 transitions. [2019-09-07 18:18:53,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:18:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 8128 states and 11659 transitions. [2019-09-07 18:18:53,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-07 18:18:53,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:53,726 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:18:53,727 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:53,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:53,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1081292824, now seen corresponding path program 1 times [2019-09-07 18:18:53,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:53,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:53,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:53,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:53,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:53,917 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:18:53,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:18:53,918 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 18:18:53,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:54,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 18:18:54,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:18:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:18:54,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:18:54,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-09-07 18:18:54,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:18:54,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:18:54,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:18:54,112 INFO L87 Difference]: Start difference. First operand 8128 states and 11659 transitions. Second operand 6 states. [2019-09-07 18:18:55,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:18:55,518 INFO L93 Difference]: Finished difference Result 14982 states and 21934 transitions. [2019-09-07 18:18:55,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:18:55,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 238 [2019-09-07 18:18:55,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:18:55,566 INFO L225 Difference]: With dead ends: 14982 [2019-09-07 18:18:55,567 INFO L226 Difference]: Without dead ends: 7048 [2019-09-07 18:18:55,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:18:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7048 states. [2019-09-07 18:18:55,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7048 to 6934. [2019-09-07 18:18:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6934 states. [2019-09-07 18:18:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6934 states to 6934 states and 9225 transitions. [2019-09-07 18:18:55,843 INFO L78 Accepts]: Start accepts. Automaton has 6934 states and 9225 transitions. Word has length 238 [2019-09-07 18:18:55,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:18:55,844 INFO L475 AbstractCegarLoop]: Abstraction has 6934 states and 9225 transitions. [2019-09-07 18:18:55,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:18:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 6934 states and 9225 transitions. [2019-09-07 18:18:55,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-07 18:18:55,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:55,866 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:18:55,866 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:55,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:55,867 INFO L82 PathProgramCache]: Analyzing trace with hash -283848815, now seen corresponding path program 1 times [2019-09-07 18:18:55,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:55,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:55,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:55,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:55,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 112 proven. 98 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 18:18:56,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:18:56,344 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) [2019-09-07 18:18:56,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:18:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:56,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 18:18:56,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:18:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 112 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-07 18:18:56,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:18:56,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-09-07 18:18:56,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:18:56,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:18:56,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:18:56,582 INFO L87 Difference]: Start difference. First operand 6934 states and 9225 transitions. Second operand 9 states. [2019-09-07 18:19:00,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:00,851 INFO L93 Difference]: Finished difference Result 23329 states and 35752 transitions. [2019-09-07 18:19:00,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 18:19:00,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 296 [2019-09-07 18:19:00,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:01,126 INFO L225 Difference]: With dead ends: 23329 [2019-09-07 18:19:01,126 INFO L226 Difference]: Without dead ends: 16589 [2019-09-07 18:19:01,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-07 18:19:01,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16589 states. [2019-09-07 18:19:01,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16589 to 16005. [2019-09-07 18:19:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16005 states. [2019-09-07 18:19:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16005 states to 16005 states and 22380 transitions. [2019-09-07 18:19:01,667 INFO L78 Accepts]: Start accepts. Automaton has 16005 states and 22380 transitions. Word has length 296 [2019-09-07 18:19:01,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:01,668 INFO L475 AbstractCegarLoop]: Abstraction has 16005 states and 22380 transitions. [2019-09-07 18:19:01,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:19:01,669 INFO L276 IsEmpty]: Start isEmpty. Operand 16005 states and 22380 transitions. [2019-09-07 18:19:01,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-07 18:19:01,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:01,706 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, 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, 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] [2019-09-07 18:19:01,707 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:01,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:01,707 INFO L82 PathProgramCache]: Analyzing trace with hash 2002267129, now seen corresponding path program 1 times [2019-09-07 18:19:01,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:01,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:01,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:01,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:01,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 238 proven. 86 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-07 18:19:01,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:19:01,976 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 18:19:01,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:02,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 18:19:02,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:19:02,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:19:02,391 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-07 18:19:02,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:19:02,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 18:19:02,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:19:02,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:19:02,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:19:02,411 INFO L87 Difference]: Start difference. First operand 16005 states and 22380 transitions. Second operand 9 states. [2019-09-07 18:19:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:06,714 INFO L93 Difference]: Finished difference Result 31346 states and 43058 transitions. [2019-09-07 18:19:06,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 18:19:06,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 325 [2019-09-07 18:19:06,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:06,768 INFO L225 Difference]: With dead ends: 31346 [2019-09-07 18:19:06,768 INFO L226 Difference]: Without dead ends: 16313 [2019-09-07 18:19:06,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-09-07 18:19:06,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16313 states. [2019-09-07 18:19:07,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16313 to 15287. [2019-09-07 18:19:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15287 states. [2019-09-07 18:19:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15287 states to 15287 states and 19957 transitions. [2019-09-07 18:19:07,172 INFO L78 Accepts]: Start accepts. Automaton has 15287 states and 19957 transitions. Word has length 325 [2019-09-07 18:19:07,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:07,173 INFO L475 AbstractCegarLoop]: Abstraction has 15287 states and 19957 transitions. [2019-09-07 18:19:07,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:19:07,173 INFO L276 IsEmpty]: Start isEmpty. Operand 15287 states and 19957 transitions. [2019-09-07 18:19:07,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-07 18:19:07,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:07,209 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2019-09-07 18:19:07,211 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:07,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:07,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1530016645, now seen corresponding path program 1 times [2019-09-07 18:19:07,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:07,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:07,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:07,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:07,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:07,694 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 171 proven. 6 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-09-07 18:19:07,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:19:07,695 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 18:19:07,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:07,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 18:19:07,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:19:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 353 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-07 18:19:07,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:19:07,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 18:19:07,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 18:19:07,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 18:19:07,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-07 18:19:07,923 INFO L87 Difference]: Start difference. First operand 15287 states and 19957 transitions. Second operand 10 states. [2019-09-07 18:19:15,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:15,542 INFO L93 Difference]: Finished difference Result 34318 states and 45545 transitions. [2019-09-07 18:19:15,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 18:19:15,543 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 367 [2019-09-07 18:19:15,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:15,601 INFO L225 Difference]: With dead ends: 34318 [2019-09-07 18:19:15,601 INFO L226 Difference]: Without dead ends: 19415 [2019-09-07 18:19:15,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=540, Invalid=3120, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 18:19:15,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19415 states. [2019-09-07 18:19:15,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19415 to 16385. [2019-09-07 18:19:15,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16385 states. [2019-09-07 18:19:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16385 states to 16385 states and 20662 transitions. [2019-09-07 18:19:15,996 INFO L78 Accepts]: Start accepts. Automaton has 16385 states and 20662 transitions. Word has length 367 [2019-09-07 18:19:15,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:15,997 INFO L475 AbstractCegarLoop]: Abstraction has 16385 states and 20662 transitions. [2019-09-07 18:19:15,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 18:19:15,997 INFO L276 IsEmpty]: Start isEmpty. Operand 16385 states and 20662 transitions. [2019-09-07 18:19:16,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-09-07 18:19:16,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:16,019 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:19:16,019 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:16,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:16,020 INFO L82 PathProgramCache]: Analyzing trace with hash -2143327654, now seen corresponding path program 1 times [2019-09-07 18:19:16,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:16,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:16,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:16,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:16,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 235 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:19:16,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:19:16,339 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 18:19:16,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:16,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 18:19:16,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:19:16,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:16,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:18,811 WARN L188 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-09-07 18:19:19,105 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 109 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 18:19:19,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:19:19,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2019-09-07 18:19:19,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 18:19:19,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 18:19:19,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=64, Unknown=1, NotChecked=0, Total=90 [2019-09-07 18:19:19,118 INFO L87 Difference]: Start difference. First operand 16385 states and 20662 transitions. Second operand 10 states. [2019-09-07 18:20:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:20:12,907 INFO L93 Difference]: Finished difference Result 46304 states and 64053 transitions. [2019-09-07 18:20:12,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 18:20:12,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 371 [2019-09-07 18:20:12,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:20:13,018 INFO L225 Difference]: With dead ends: 46304 [2019-09-07 18:20:13,018 INFO L226 Difference]: Without dead ends: 30303 [2019-09-07 18:20:13,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=133, Invalid=370, Unknown=3, NotChecked=0, Total=506 [2019-09-07 18:20:13,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30303 states. [2019-09-07 18:20:13,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30303 to 28819. [2019-09-07 18:20:13,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28819 states. [2019-09-07 18:20:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28819 states to 28819 states and 36441 transitions. [2019-09-07 18:20:13,824 INFO L78 Accepts]: Start accepts. Automaton has 28819 states and 36441 transitions. Word has length 371 [2019-09-07 18:20:13,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:20:13,825 INFO L475 AbstractCegarLoop]: Abstraction has 28819 states and 36441 transitions. [2019-09-07 18:20:13,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 18:20:13,825 INFO L276 IsEmpty]: Start isEmpty. Operand 28819 states and 36441 transitions. [2019-09-07 18:20:13,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2019-09-07 18:20:13,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:20:13,895 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, 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, 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, 1, 1, 1, 1, 1, 1, 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 18:20:13,895 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:20:13,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:20:13,895 INFO L82 PathProgramCache]: Analyzing trace with hash -194073368, now seen corresponding path program 1 times [2019-09-07 18:20:13,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:20:13,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:20:13,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:20:13,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:20:13,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:20:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:20:15,312 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 430 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-07 18:20:15,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:20:15,312 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 18:20:15,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:20:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:20:15,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 18:20:15,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:20:15,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:20:15,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:20:15,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:20:15,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:20:15,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:20:15,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:20:15,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:20:15,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:20:15,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:20:15,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:20:15,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:20:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 430 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-07 18:20:16,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:20:16,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2019-09-07 18:20:16,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 18:20:16,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 18:20:16,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2019-09-07 18:20:16,144 INFO L87 Difference]: Start difference. First operand 28819 states and 36441 transitions. Second operand 16 states. [2019-09-07 18:20:17,476 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-07 18:20:19,742 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-07 18:20:22,752 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-07 18:20:23,191 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-07 18:20:23,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:20:23,325 INFO L93 Difference]: Finished difference Result 60887 states and 77808 transitions. [2019-09-07 18:20:23,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 18:20:23,325 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 509 [2019-09-07 18:20:23,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:20:23,429 INFO L225 Difference]: With dead ends: 60887 [2019-09-07 18:20:23,429 INFO L226 Difference]: Without dead ends: 32452 [2019-09-07 18:20:23,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 529 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=461, Invalid=1431, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 18:20:23,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32452 states. [2019-09-07 18:20:24,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32452 to 32098. [2019-09-07 18:20:24,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32098 states. [2019-09-07 18:20:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32098 states to 32098 states and 40216 transitions. [2019-09-07 18:20:24,236 INFO L78 Accepts]: Start accepts. Automaton has 32098 states and 40216 transitions. Word has length 509 [2019-09-07 18:20:24,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:20:24,237 INFO L475 AbstractCegarLoop]: Abstraction has 32098 states and 40216 transitions. [2019-09-07 18:20:24,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 18:20:24,237 INFO L276 IsEmpty]: Start isEmpty. Operand 32098 states and 40216 transitions. [2019-09-07 18:20:24,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2019-09-07 18:20:24,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:20:24,265 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:20:24,265 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:20:24,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:20:24,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1989868536, now seen corresponding path program 1 times [2019-09-07 18:20:24,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:20:24,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:20:24,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:20:24,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:20:24,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:20:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:20:24,643 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 314 proven. 182 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-09-07 18:20:24,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:20:24,644 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 18:20:24,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:20:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:20:24,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:20:24,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:20:24,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:20:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 683 proven. 2 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 18:20:25,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:20:25,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 18:20:25,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 18:20:25,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 18:20:25,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 18:20:25,178 INFO L87 Difference]: Start difference. First operand 32098 states and 40216 transitions. Second operand 8 states. [2019-09-07 18:20:30,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:20:30,081 INFO L93 Difference]: Finished difference Result 70981 states and 89031 transitions. [2019-09-07 18:20:30,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 18:20:30,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 519 [2019-09-07 18:20:30,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:20:30,156 INFO L225 Difference]: With dead ends: 70981 [2019-09-07 18:20:30,156 INFO L226 Difference]: Without dead ends: 39077 [2019-09-07 18:20:30,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=293, Invalid=1189, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 18:20:30,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39077 states. [2019-09-07 18:20:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39077 to 37858. [2019-09-07 18:20:31,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37858 states. [2019-09-07 18:20:31,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37858 states to 37858 states and 45723 transitions. [2019-09-07 18:20:31,118 INFO L78 Accepts]: Start accepts. Automaton has 37858 states and 45723 transitions. Word has length 519 [2019-09-07 18:20:31,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:20:31,119 INFO L475 AbstractCegarLoop]: Abstraction has 37858 states and 45723 transitions. [2019-09-07 18:20:31,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 18:20:31,119 INFO L276 IsEmpty]: Start isEmpty. Operand 37858 states and 45723 transitions. [2019-09-07 18:20:31,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2019-09-07 18:20:31,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:20:31,182 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:20:31,182 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:20:31,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:20:31,183 INFO L82 PathProgramCache]: Analyzing trace with hash 511773873, now seen corresponding path program 1 times [2019-09-07 18:20:31,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:20:31,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:20:31,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:20:31,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:20:31,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:20:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:20:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 462 proven. 104 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2019-09-07 18:20:31,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:20:31,832 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 18:20:31,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:20:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:20:32,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 18:20:32,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:20:32,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:20:32,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:20:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 711 proven. 2 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-09-07 18:20:32,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:20:32,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 18:20:32,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:20:32,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:20:32,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:20:32,598 INFO L87 Difference]: Start difference. First operand 37858 states and 45723 transitions. Second operand 6 states. [2019-09-07 18:20:34,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:20:34,968 INFO L93 Difference]: Finished difference Result 79066 states and 98014 transitions. [2019-09-07 18:20:34,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 18:20:34,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 535 [2019-09-07 18:20:34,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:20:35,052 INFO L225 Difference]: With dead ends: 79066 [2019-09-07 18:20:35,052 INFO L226 Difference]: Without dead ends: 41592 [2019-09-07 18:20:35,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 539 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-07 18:20:35,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41592 states. [2019-09-07 18:20:35,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41592 to 40904. [2019-09-07 18:20:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40904 states. [2019-09-07 18:20:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40904 states to 40904 states and 49074 transitions. [2019-09-07 18:20:35,909 INFO L78 Accepts]: Start accepts. Automaton has 40904 states and 49074 transitions. Word has length 535 [2019-09-07 18:20:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:20:35,910 INFO L475 AbstractCegarLoop]: Abstraction has 40904 states and 49074 transitions. [2019-09-07 18:20:35,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:20:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 40904 states and 49074 transitions. [2019-09-07 18:20:35,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2019-09-07 18:20:35,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:20:35,976 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:20:35,977 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:20:35,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:20:35,977 INFO L82 PathProgramCache]: Analyzing trace with hash 470303225, now seen corresponding path program 1 times [2019-09-07 18:20:35,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:20:35,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:20:35,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:20:35,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:20:35,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:20:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:20:36,708 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 311 proven. 174 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-07 18:20:36,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:20:36,709 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 18:20:36,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:20:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:20:36,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 18:20:36,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:20:36,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:20:36,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:20:38,982 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-09-07 18:20:38,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:20:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 432 proven. 2 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-07 18:20:41,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:20:41,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-07 18:20:41,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 18:20:41,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 18:20:41,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=76, Unknown=1, NotChecked=0, Total=110 [2019-09-07 18:20:41,222 INFO L87 Difference]: Start difference. First operand 40904 states and 49074 transitions. Second operand 11 states. [2019-09-07 18:20:44,665 WARN L188 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 30 DAG size of output: 18 [2019-09-07 18:20:51,259 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 18 [2019-09-07 18:22:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:22:12,565 INFO L93 Difference]: Finished difference Result 90870 states and 111823 transitions. [2019-09-07 18:22:12,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 18:22:12,565 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 563 [2019-09-07 18:22:12,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:22:12,665 INFO L225 Difference]: With dead ends: 90870 [2019-09-07 18:22:12,666 INFO L226 Difference]: Without dead ends: 50350 [2019-09-07 18:22:12,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 573 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=173, Invalid=425, Unknown=2, NotChecked=0, Total=600 [2019-09-07 18:22:12,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50350 states. [2019-09-07 18:22:13,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50350 to 49550. [2019-09-07 18:22:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49550 states. [2019-09-07 18:22:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49550 states to 49550 states and 59115 transitions. [2019-09-07 18:22:13,368 INFO L78 Accepts]: Start accepts. Automaton has 49550 states and 59115 transitions. Word has length 563 [2019-09-07 18:22:13,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:22:13,369 INFO L475 AbstractCegarLoop]: Abstraction has 49550 states and 59115 transitions. [2019-09-07 18:22:13,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 18:22:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 49550 states and 59115 transitions. [2019-09-07 18:22:13,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2019-09-07 18:22:13,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:22:13,431 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-07 18:22:13,431 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:22:13,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:22:13,431 INFO L82 PathProgramCache]: Analyzing trace with hash 773119110, now seen corresponding path program 1 times [2019-09-07 18:22:13,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:22:13,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:22:13,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:13,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:22:13,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:14,525 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 674 proven. 102 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-07 18:22:14,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:22:14,525 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) [2019-09-07 18:22:14,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:22:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:14,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 18:22:14,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:22:14,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:14,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:14,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:22:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 532 proven. 2 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2019-09-07 18:22:15,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:22:15,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 18:22:15,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 18:22:15,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 18:22:15,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-07 18:22:15,015 INFO L87 Difference]: Start difference. First operand 49550 states and 59115 transitions. Second operand 11 states. [2019-09-07 18:22:23,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:22:23,311 INFO L93 Difference]: Finished difference Result 113221 states and 135017 transitions. [2019-09-07 18:22:23,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 18:22:23,312 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 577 [2019-09-07 18:22:23,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:22:23,433 INFO L225 Difference]: With dead ends: 113221 [2019-09-07 18:22:23,433 INFO L226 Difference]: Without dead ends: 66433 [2019-09-07 18:22:23,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 604 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=365, Invalid=1705, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 18:22:23,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66433 states. [2019-09-07 18:22:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66433 to 65690. [2019-09-07 18:22:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65690 states. [2019-09-07 18:22:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65690 states to 65690 states and 77799 transitions. [2019-09-07 18:22:24,283 INFO L78 Accepts]: Start accepts. Automaton has 65690 states and 77799 transitions. Word has length 577 [2019-09-07 18:22:24,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:22:24,284 INFO L475 AbstractCegarLoop]: Abstraction has 65690 states and 77799 transitions. [2019-09-07 18:22:24,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 18:22:24,284 INFO L276 IsEmpty]: Start isEmpty. Operand 65690 states and 77799 transitions. [2019-09-07 18:22:24,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2019-09-07 18:22:24,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:22:24,349 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, 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, 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, 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 18:22:24,349 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:22:24,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:22:24,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1413912182, now seen corresponding path program 1 times [2019-09-07 18:22:24,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:22:24,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:22:24,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:24,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:22:24,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 514 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-07 18:22:25,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:22:25,134 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 18:22:25,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:22:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:25,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 18:22:25,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:22:25,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:25,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:25,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:25,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:25,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:25,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:25,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:25,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 514 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-07 18:22:25,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:22:25,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-09-07 18:22:25,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 18:22:25,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 18:22:25,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 18:22:25,518 INFO L87 Difference]: Start difference. First operand 65690 states and 77799 transitions. Second operand 8 states. [2019-09-07 18:22:28,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:22:28,574 INFO L93 Difference]: Finished difference Result 127116 states and 150604 transitions. [2019-09-07 18:22:28,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 18:22:28,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 601 [2019-09-07 18:22:28,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:22:29,024 INFO L225 Difference]: With dead ends: 127116 [2019-09-07 18:22:29,025 INFO L226 Difference]: Without dead ends: 59658 [2019-09-07 18:22:29,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 609 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-09-07 18:22:29,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59658 states. [2019-09-07 18:22:29,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59658 to 53322. [2019-09-07 18:22:29,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53322 states. [2019-09-07 18:22:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53322 states to 53322 states and 60999 transitions. [2019-09-07 18:22:29,865 INFO L78 Accepts]: Start accepts. Automaton has 53322 states and 60999 transitions. Word has length 601 [2019-09-07 18:22:29,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:22:29,866 INFO L475 AbstractCegarLoop]: Abstraction has 53322 states and 60999 transitions. [2019-09-07 18:22:29,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 18:22:29,866 INFO L276 IsEmpty]: Start isEmpty. Operand 53322 states and 60999 transitions. [2019-09-07 18:22:29,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2019-09-07 18:22:29,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:22:29,923 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:22:29,923 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:22:29,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:22:29,924 INFO L82 PathProgramCache]: Analyzing trace with hash -377141399, now seen corresponding path program 1 times [2019-09-07 18:22:29,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:22:29,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:22:29,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:29,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:22:29,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1881 backedges. 733 proven. 100 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2019-09-07 18:22:30,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:22:30,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:22:31,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:22:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:32,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:22:32,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:22:32,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1881 backedges. 1224 proven. 2 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2019-09-07 18:22:32,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:22:32,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 18:22:32,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:22:32,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:22:32,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:22:32,480 INFO L87 Difference]: Start difference. First operand 53322 states and 60999 transitions. Second operand 9 states. [2019-09-07 18:22:34,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:22:34,881 INFO L93 Difference]: Finished difference Result 102373 states and 117426 transitions. [2019-09-07 18:22:34,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 18:22:34,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 808 [2019-09-07 18:22:34,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:22:34,995 INFO L225 Difference]: With dead ends: 102373 [2019-09-07 18:22:34,996 INFO L226 Difference]: Without dead ends: 50911 [2019-09-07 18:22:35,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 827 GetRequests, 813 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 18:22:35,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50911 states. [2019-09-07 18:22:35,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50911 to 47336. [2019-09-07 18:22:35,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47336 states. [2019-09-07 18:22:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47336 states to 47336 states and 53685 transitions. [2019-09-07 18:22:35,950 INFO L78 Accepts]: Start accepts. Automaton has 47336 states and 53685 transitions. Word has length 808 [2019-09-07 18:22:35,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:22:35,950 INFO L475 AbstractCegarLoop]: Abstraction has 47336 states and 53685 transitions. [2019-09-07 18:22:35,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:22:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand 47336 states and 53685 transitions. [2019-09-07 18:22:35,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2019-09-07 18:22:35,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:22:35,994 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 18:22:35,994 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:22:35,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:22:35,994 INFO L82 PathProgramCache]: Analyzing trace with hash -802505330, now seen corresponding path program 1 times [2019-09-07 18:22:35,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:22:35,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:22:35,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:35,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:22:35,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:36,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1880 backedges. 763 proven. 401 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2019-09-07 18:22:36,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:22:36,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:22:36,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:22:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:37,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 18:22:37,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:22:37,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:37,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:37,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1880 backedges. 960 proven. 2 refuted. 0 times theorem prover too weak. 918 trivial. 0 not checked. [2019-09-07 18:22:39,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:22:39,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-07 18:22:39,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 18:22:39,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 18:22:39,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=106, Unknown=1, NotChecked=0, Total=132 [2019-09-07 18:22:39,340 INFO L87 Difference]: Start difference. First operand 47336 states and 53685 transitions. Second operand 12 states. [2019-09-07 18:22:48,262 WARN L188 SmtUtils]: Spent 5.29 s on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-09-07 18:22:56,196 WARN L188 SmtUtils]: Spent 5.11 s on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2019-09-07 18:23:02,415 WARN L188 SmtUtils]: Spent 5.73 s on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-09-07 18:23:07,023 WARN L188 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 35 DAG size of output: 22 [2019-09-07 18:23:35,263 WARN L188 SmtUtils]: Spent 5.50 s on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-09-07 18:23:50,183 WARN L188 SmtUtils]: Spent 5.46 s on a formula simplification. DAG size of input: 32 DAG size of output: 19 [2019-09-07 18:24:03,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:24:03,371 INFO L93 Difference]: Finished difference Result 116543 states and 132205 transitions. [2019-09-07 18:24:03,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-07 18:24:03,371 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 809 [2019-09-07 18:24:03,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:24:03,502 INFO L225 Difference]: With dead ends: 116543 [2019-09-07 18:24:03,502 INFO L226 Difference]: Without dead ends: 68837 [2019-09-07 18:24:03,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 943 GetRequests, 862 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2373 ImplicationChecksByTransitivity, 41.1s TimeCoverageRelationStatistics Valid=1062, Invalid=5253, Unknown=5, NotChecked=0, Total=6320 [2019-09-07 18:24:03,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68837 states. [2019-09-07 18:24:05,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68837 to 65856. [2019-09-07 18:24:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65856 states. [2019-09-07 18:24:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65856 states to 65856 states and 73782 transitions. [2019-09-07 18:24:05,639 INFO L78 Accepts]: Start accepts. Automaton has 65856 states and 73782 transitions. Word has length 809 [2019-09-07 18:24:05,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:24:05,639 INFO L475 AbstractCegarLoop]: Abstraction has 65856 states and 73782 transitions. [2019-09-07 18:24:05,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 18:24:05,639 INFO L276 IsEmpty]: Start isEmpty. Operand 65856 states and 73782 transitions. [2019-09-07 18:24:05,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2019-09-07 18:24:05,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:24:05,707 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 18:24:05,707 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:24:05,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:24:05,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1777924204, now seen corresponding path program 1 times [2019-09-07 18:24:05,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:24:05,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:24:05,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:24:05,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:24:05,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:24:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:24:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2018 backedges. 761 proven. 590 refuted. 0 times theorem prover too weak. 667 trivial. 0 not checked. [2019-09-07 18:24:08,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:24:08,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:24:08,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:24:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:24:08,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 18:24:08,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:24:08,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:24:09,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2018 backedges. 1203 proven. 2 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2019-09-07 18:24:09,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:24:09,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 8] total 25 [2019-09-07 18:24:09,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 18:24:09,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 18:24:09,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-07 18:24:09,099 INFO L87 Difference]: Start difference. First operand 65856 states and 73782 transitions. Second operand 25 states. [2019-09-07 18:24:17,750 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-07 18:24:17,939 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-07 18:24:18,702 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-09-07 18:24:20,210 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-07 18:24:21,614 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-07 18:24:23,470 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-07 18:24:24,467 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-07 18:24:25,079 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-07 18:24:25,386 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-07 18:24:25,821 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-07 18:24:27,893 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-07 18:24:28,042 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-07 18:24:28,822 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-07 18:24:29,079 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-07 18:24:29,994 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-07 18:24:31,606 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-07 18:24:32,190 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-07 18:24:35,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:24:35,883 INFO L93 Difference]: Finished difference Result 139887 states and 162806 transitions. [2019-09-07 18:24:35,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-07 18:24:35,884 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 877 [2019-09-07 18:24:35,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:24:36,092 INFO L225 Difference]: With dead ends: 139887 [2019-09-07 18:24:36,092 INFO L226 Difference]: Without dead ends: 77255 [2019-09-07 18:24:36,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1121 GetRequests, 967 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8970 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=3168, Invalid=21012, Unknown=0, NotChecked=0, Total=24180 [2019-09-07 18:24:36,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77255 states. [2019-09-07 18:24:37,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77255 to 56991. [2019-09-07 18:24:37,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56991 states. [2019-09-07 18:24:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56991 states to 56991 states and 63630 transitions. [2019-09-07 18:24:37,127 INFO L78 Accepts]: Start accepts. Automaton has 56991 states and 63630 transitions. Word has length 877 [2019-09-07 18:24:37,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:24:37,128 INFO L475 AbstractCegarLoop]: Abstraction has 56991 states and 63630 transitions. [2019-09-07 18:24:37,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 18:24:37,128 INFO L276 IsEmpty]: Start isEmpty. Operand 56991 states and 63630 transitions. [2019-09-07 18:24:37,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 931 [2019-09-07 18:24:37,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:24:37,180 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, 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, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:24:37,180 INFO L418 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:24:37,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:24:37,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1331262397, now seen corresponding path program 1 times [2019-09-07 18:24:37,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:24:37,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:24:37,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:24:37,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:24:37,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:24:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:24:42,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2495 backedges. 995 proven. 1132 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2019-09-07 18:24:42,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:24:42,384 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:24:42,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:24:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:24:42,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 18:24:42,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:24:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2495 backedges. 1599 proven. 2 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2019-09-07 18:24:43,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:24:43,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 5] total 29 [2019-09-07 18:24:43,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 18:24:43,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 18:24:43,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2019-09-07 18:24:43,114 INFO L87 Difference]: Start difference. First operand 56991 states and 63630 transitions. Second operand 29 states. [2019-09-07 18:24:46,312 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-09-07 18:24:48,803 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-07 18:24:52,667 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2019-09-07 18:24:53,277 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-07 18:24:54,148 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-09-07 18:24:54,633 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-07 18:24:54,963 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 18:24:55,127 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-07 18:24:56,858 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-07 18:24:58,373 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 29 [2019-09-07 18:25:01,825 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-09-07 18:25:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:25:05,085 INFO L93 Difference]: Finished difference Result 115154 states and 131410 transitions. [2019-09-07 18:25:05,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-07 18:25:05,085 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 930 [2019-09-07 18:25:05,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:25:05,228 INFO L225 Difference]: With dead ends: 115154 [2019-09-07 18:25:05,229 INFO L226 Difference]: Without dead ends: 59323 [2019-09-07 18:25:05,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1118 GetRequests, 1001 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1909, Invalid=11897, Unknown=0, NotChecked=0, Total=13806 [2019-09-07 18:25:05,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59323 states. [2019-09-07 18:25:06,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59323 to 49095. [2019-09-07 18:25:06,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49095 states. [2019-09-07 18:25:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49095 states to 49095 states and 53979 transitions. [2019-09-07 18:25:06,105 INFO L78 Accepts]: Start accepts. Automaton has 49095 states and 53979 transitions. Word has length 930 [2019-09-07 18:25:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:25:06,105 INFO L475 AbstractCegarLoop]: Abstraction has 49095 states and 53979 transitions. [2019-09-07 18:25:06,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 18:25:06,106 INFO L276 IsEmpty]: Start isEmpty. Operand 49095 states and 53979 transitions. [2019-09-07 18:25:06,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 948 [2019-09-07 18:25:06,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:25:06,150 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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:25:06,151 INFO L418 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:25:06,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:25:06,151 INFO L82 PathProgramCache]: Analyzing trace with hash -170108736, now seen corresponding path program 1 times [2019-09-07 18:25:06,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:25:06,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:25:06,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:06,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:25:06,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:25:07,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2581 backedges. 1026 proven. 479 refuted. 0 times theorem prover too weak. 1076 trivial. 0 not checked. [2019-09-07 18:25:07,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:25:07,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:25:07,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:25:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:25:07,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 1365 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 18:25:07,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:25:07,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:25:07,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:25:07,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:25:07,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:25:07,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:25:07,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:25:07,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:25:07,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:25:07,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:25:07,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:25:07,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:25:14,905 WARN L188 SmtUtils]: Spent 3.13 s on a formula simplification that was a NOOP. DAG size: 28 [2019-09-07 18:25:16,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:25:17,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2581 backedges. 1964 proven. 229 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Abandoning pump threads because process wont die! [2019-09-07 18:25:18,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:25:18,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 14 [2019-09-07 18:25:18,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 18:25:18,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 18:25:18,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=144, Unknown=2, NotChecked=0, Total=182 [2019-09-07 18:25:18,219 INFO L87 Difference]: Start difference. First operand 49095 states and 53979 transitions. Second operand 14 states. [2019-09-07 18:25:25,011 WARN L188 SmtUtils]: Spent 5.92 s on a formula simplification. DAG size of input: 47 DAG size of output: 33 [2019-09-07 18:25:34,702 WARN L188 SmtUtils]: Spent 3.96 s on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-09-07 18:25:36,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:25:36,285 INFO L93 Difference]: Finished difference Result 89557 states and 98706 transitions. [2019-09-07 18:25:36,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 18:25:36,286 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 947 [2019-09-07 18:25:36,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:25:36,287 INFO L225 Difference]: With dead ends: 89557 [2019-09-07 18:25:36,287 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 18:25:36,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 992 GetRequests, 958 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=236, Invalid=817, Unknown=3, NotChecked=0, Total=1056 [2019-09-07 18:25:36,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 18:25:36,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 18:25:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 18:25:36,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 18:25:36,372 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 947 [2019-09-07 18:25:36,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:25:36,373 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 18:25:36,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 18:25:36,373 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 18:25:36,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 18:25:36,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 18:25:38,996 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 130 [2019-09-07 18:25:39,198 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 125 [2019-09-07 18:26:02,416 WARN L188 SmtUtils]: Spent 22.54 s on a formula simplification. DAG size of input: 3875 DAG size of output: 2964 [2019-09-07 18:26:24,153 WARN L188 SmtUtils]: Spent 21.73 s on a formula simplification. DAG size of input: 3875 DAG size of output: 2964 [2019-09-07 18:26:24,328 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 38 [2019-09-07 18:26:49,224 WARN L188 SmtUtils]: Spent 24.75 s on a formula simplification. DAG size of input: 1664 DAG size of output: 217 [2019-09-07 18:28:12,346 WARN L188 SmtUtils]: Spent 1.38 m on a formula simplification. DAG size of input: 2776 DAG size of output: 194 [2019-09-07 18:29:37,971 WARN L188 SmtUtils]: Spent 1.43 m on a formula simplification. DAG size of input: 2776 DAG size of output: 194 [2019-09-07 18:29:37,975 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 18:29:37,975 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a23~0 |old(~a23~0)|) (<= |old(~a29~0)| ~a29~0) (<= ~a29~0 |old(~a29~0)|) (= ~a4~0 |old(~a4~0)|) (= ~a25~0 |old(~a25~0)|)) [2019-09-07 18:29:37,976 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 18:29:37,976 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-09-07 18:29:37,976 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-09-07 18:29:37,976 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-09-07 18:29:37,976 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,976 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,977 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,977 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,977 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,977 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,977 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,977 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-09-07 18:29:37,977 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-09-07 18:29:37,977 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-09-07 18:29:37,977 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,977 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,977 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,977 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,977 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,978 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,978 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,978 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,978 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,978 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-09-07 18:29:37,978 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-09-07 18:29:37,978 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-09-07 18:29:37,978 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,978 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,978 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,978 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,978 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,978 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,978 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,979 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,979 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,979 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-09-07 18:29:37,979 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-09-07 18:29:37,979 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-09-07 18:29:37,979 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-09-07 18:29:37,979 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-09-07 18:29:37,979 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-09-07 18:29:37,979 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-09-07 18:29:37,979 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,979 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,979 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,979 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,979 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,980 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,980 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,980 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,980 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,980 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,980 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-09-07 18:29:37,980 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-09-07 18:29:37,980 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-09-07 18:29:37,980 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,980 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,980 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,981 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,981 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,981 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-09-07 18:29:37,981 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-09-07 18:29:37,981 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-09-07 18:29:37,981 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,981 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,981 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,981 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,982 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,982 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-09-07 18:29:37,982 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-09-07 18:29:37,982 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,982 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,982 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,982 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,982 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,982 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,983 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-09-07 18:29:37,983 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-09-07 18:29:37,983 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,983 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,983 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-09-07 18:29:37,983 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-09-07 18:29:37,983 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-09-07 18:29:37,983 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,983 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,983 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,983 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,984 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,984 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,984 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,984 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-09-07 18:29:37,984 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-09-07 18:29:37,984 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-09-07 18:29:37,984 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-09-07 18:29:37,984 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-09-07 18:29:37,984 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-09-07 18:29:37,984 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-09-07 18:29:37,984 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,984 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,984 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-09-07 18:29:37,984 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-09-07 18:29:37,984 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,984 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,985 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,985 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,985 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 22 1026) the Hoare annotation is: (let ((.cse41 (= 1 |old(~a4~0)|))) (let ((.cse38 (= 12 |old(~a25~0)|)) (.cse17 (<= |old(~a29~0)| ~a29~0)) (.cse18 (<= ~a29~0 |old(~a29~0)|)) (.cse15 (not (<= |old(~a4~0)| 0))) (.cse35 (not (<= |old(~a29~0)| 130))) (.cse33 (= 1 ~a4~0)) (.cse6 (not .cse41)) (.cse39 (not (<= |old(~a23~0)| 138))) (.cse37 (not (< 138 |old(~a23~0)|))) (.cse43 (not (<= |old(~a25~0)| 10))) (.cse40 (= ~a29~0 |old(~a29~0)|)) (.cse16 (= ~a23~0 |old(~a23~0)|)) (.cse42 (< 138 ~a23~0)) (.cse19 (= ~a4~0 |old(~a4~0)|)) (.cse20 (= ~a25~0 |old(~a25~0)|))) (let ((.cse27 (and (and .cse41 .cse40 .cse16 (<= ~a25~0 10) .cse42) .cse19 .cse20)) (.cse26 (or .cse37 .cse43)) (.cse32 (or .cse6 .cse39 .cse43)) (.cse22 (and (and .cse40 .cse16 .cse33) .cse20)) (.cse25 (not (<= |old(~a23~0)| 312))) (.cse0 (not (= 9 |old(~a25~0)|))) (.cse7 (not (<= |old(~a23~0)| 600000))) (.cse21 (not (<= 277 |old(~a29~0)|))) (.cse9 (or .cse37 (= 13 |old(~a25~0)|))) (.cse11 (and (and .cse41 .cse40 .cse16 (not (= ~a25~0 13)) .cse42) .cse19 .cse20)) (.cse28 (not (= 11 |old(~a25~0)|))) (.cse13 (forall ((v_~a29~0_507 Int)) (or (not (<= |old(~a29~0)| (+ (mod v_~a29~0_507 15) 260))) (not (<= 0 v_~a29~0_507)) (not (<= |old(~a29~0)| v_~a29~0_507))))) (.cse4 (not (< 140 |old(~a29~0)|))) (.cse14 (not (<= (+ |old(~a23~0)| 55) 0))) (.cse29 (or .cse15 .cse35)) (.cse1 (and .cse16 .cse17 .cse18 .cse19 .cse20)) (.cse12 (not .cse38)) (.cse36 (and (and .cse17 .cse18 .cse19 .cse20) .cse16)) (.cse24 (not (= 10 |old(~a25~0)|))) (.cse5 (not (<= 312 |old(~a23~0)|))) (.cse31 (and (and .cse40 .cse16) .cse19 .cse20)) (.cse23 (not (<= 13 |old(~a25~0)|))) (.cse30 (not (<= |old(~a23~0)| 599997))) (.cse2 (not (= 15 ~a8~0))) (.cse3 (not (= 1 ~a3~0))) (.cse10 (not (<= 245 |old(~a29~0)|))) (.cse34 (and .cse40 .cse16 .cse19 .cse20)) (.cse8 (not (<= |old(~a29~0)| 275)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse11 .cse12 .cse13 .cse2 .cse3 .cse6 .cse7) (or .cse14 .cse1 (or .cse13 .cse2 .cse3 .cse4 .cse15) .cse12) (or (and (and .cse16 .cse17 .cse18) .cse19 .cse20) (or .cse0 .cse21 .cse2 .cse3) .cse6 .cse7) (or .cse22 (or .cse13 .cse2 .cse3 .cse4 .cse23 .cse6 .cse7)) (or .cse14 (or .cse24 .cse2 .cse3 .cse6) .cse1) (or (and .cse19 .cse16 .cse17 (= ~a25~0 12) .cse18) (or .cse10 .cse2 .cse3 .cse8 .cse15 (not (<= (+ |old(~a23~0)| 119992) 0))) .cse12) (or (or .cse24 .cse13 .cse2 .cse3 .cse4) .cse1 .cse6 .cse7) (or .cse25 .cse26 .cse24 .cse2 .cse3 .cse6 .cse27) (or .cse14 (and (and .cse19 (and .cse17 .cse18) .cse20) .cse16) (or .cse28 .cse2 .cse3 .cse29)) (or .cse1 .cse28 .cse21 .cse2 .cse3 .cse6 .cse7) (or .cse14 .cse1 (or .cse2 .cse3 .cse29 .cse0)) (or (or .cse4 .cse30) .cse2 .cse3 .cse5 .cse6 .cse12 .cse31) (or (or .cse2 .cse3 .cse32 .cse0) (and (and .cse16 .cse18 .cse33) .cse17 .cse20)) (or .cse9 .cse21 .cse12 .cse11 .cse2 .cse3 .cse6 .cse7) (or .cse1 (or .cse14 (or .cse24 .cse2 .cse3 (forall ((v_~a29~0_511 Int)) (or (not (< 140 v_~a29~0_511)) (not (<= v_~a29~0_511 245)) (not (<= (+ |old(~a29~0)| (* 5 (div v_~a29~0_511 (- 5))) 28690) 0)) (not (= 0 (mod v_~a29~0_511 (- 5)))))) .cse29))) (or .cse27 (or .cse25 .cse26 .cse2 .cse3 (forall ((v_~a29~0_514 Int)) (or (not (<= 0 v_~a29~0_514)) (not (<= 130 v_~a29~0_514)) (not (<= (+ (mod v_~a29~0_514 15) 260) |old(~a29~0)|)))) .cse0 .cse6)) (or .cse24 .cse2 .cse3 .cse34 (or .cse13 .cse32)) (or .cse25 .cse2 .cse3 .cse9 .cse6 .cse11 .cse12) (or (or .cse10 .cse13 .cse2 .cse3 .cse7) .cse28 .cse6 .cse22) (or .cse0 .cse1 .cse25 .cse2 .cse3 .cse6 .cse35) (or .cse31 (or .cse10 .cse13 .cse2 .cse3) .cse0 .cse6 .cse7) (or .cse0 (and .cse19 (= ~a25~0 9) .cse16 .cse17 .cse18) .cse21 .cse14 .cse2 .cse3 .cse15) (or .cse7 (or .cse24 .cse21 .cse2 .cse3 .cse6) .cse1) (or .cse9 .cse28 .cse10 .cse30 .cse11 .cse2 .cse3 .cse6) (or (or .cse28 .cse30 .cse13 .cse2 .cse3 .cse4 .cse6) .cse36) (or .cse14 (or .cse2 .cse3 .cse29 .cse12) .cse1) (or (or .cse12 (not (<= (+ |old(~a23~0)| 304) 0)) .cse2 .cse3 .cse6 .cse35) .cse36) (or .cse24 .cse2 .cse3 .cse5 .cse6 .cse30 (and (and .cse16 .cse18) .cse17 .cse19 .cse20)) (or .cse31 .cse2 .cse3 .cse23 .cse30 (or .cse37 .cse6)) (or (or .cse38 .cse6 .cse39) .cse2 .cse3 .cse10 .cse34 .cse8))))) [2019-09-07 18:29:37,985 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,985 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-09-07 18:29:37,985 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-09-07 18:29:37,985 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-09-07 18:29:37,986 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,986 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,986 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,986 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,986 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,986 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,986 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-09-07 18:29:37,986 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-09-07 18:29:37,986 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-09-07 18:29:37,986 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,986 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,986 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,986 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,986 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,986 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,987 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,987 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,987 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-09-07 18:29:37,987 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-09-07 18:29:37,987 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-09-07 18:29:37,987 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,987 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,987 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,987 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,987 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,988 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,988 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,988 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,988 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,988 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,988 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,988 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-09-07 18:29:37,988 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-09-07 18:29:37,988 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-09-07 18:29:37,989 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-09-07 18:29:37,989 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-09-07 18:29:37,989 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,989 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,989 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,989 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,989 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,989 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,989 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,989 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-09-07 18:29:37,990 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-09-07 18:29:37,990 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-09-07 18:29:37,990 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,990 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,990 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,990 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-09-07 18:29:37,990 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-09-07 18:29:37,990 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,990 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,990 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,990 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,991 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,991 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-09-07 18:29:37,991 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-09-07 18:29:37,991 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,991 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,991 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-09-07 18:29:37,991 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-09-07 18:29:37,991 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,991 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,991 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,992 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,992 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,992 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,992 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-09-07 18:29:37,992 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-09-07 18:29:37,992 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-09-07 18:29:37,992 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-09-07 18:29:37,992 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,992 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,992 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,993 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,993 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,993 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,993 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,993 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,993 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-09-07 18:29:37,993 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-09-07 18:29:37,993 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-09-07 18:29:37,993 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-09-07 18:29:37,993 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-09-07 18:29:37,993 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-09-07 18:29:37,994 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,994 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,994 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,994 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,994 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,994 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,994 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,994 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-09-07 18:29:37,995 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-09-07 18:29:37,995 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,995 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,995 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,995 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,995 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,995 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,995 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,995 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-09-07 18:29:37,995 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-09-07 18:29:37,995 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,995 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,995 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,995 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,996 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,996 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,996 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,996 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-09-07 18:29:37,996 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,996 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,996 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,996 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-09-07 18:29:37,996 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-09-07 18:29:37,996 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-09-07 18:29:37,996 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,996 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-09-07 18:29:37,996 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,996 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-09-07 18:29:37,996 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,996 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,997 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,997 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,997 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,997 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,997 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-09-07 18:29:37,997 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-09-07 18:29:37,997 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-09-07 18:29:37,997 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,997 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,997 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,997 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,997 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,997 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,998 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,998 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,998 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,998 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,998 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-09-07 18:29:37,998 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-09-07 18:29:37,998 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-09-07 18:29:37,998 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,999 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-09-07 18:29:37,999 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-09-07 18:29:37,999 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,999 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,999 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:37,999 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,999 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,999 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-09-07 18:29:37,999 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-09-07 18:29:38,000 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-09-07 18:29:38,000 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-09-07 18:29:38,000 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-09-07 18:29:38,000 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-09-07 18:29:38,000 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-09-07 18:29:38,000 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2019-09-07 18:29:38,000 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-09-07 18:29:38,000 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-09-07 18:29:38,000 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-09-07 18:29:38,001 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-09-07 18:29:38,001 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-09-07 18:29:38,001 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-09-07 18:29:38,001 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:38,001 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:38,001 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:29:38,001 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 18:29:38,001 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~a23~0 312) (= 1 ~a3~0) (<= ~a29~0 130) (= 15 ~a8~0) (= 1 ~a4~0) (<= 130 ~a29~0) (= ~a25~0 10) (<= 312 ~a23~0)) [2019-09-07 18:29:38,002 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 18:29:38,002 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 18:29:38,002 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1028 1044) the Hoare annotation is: (or (not (= 10 |old(~a25~0)|)) (not (<= 130 |old(~a29~0)|)) (and (= ~a25~0 |old(~a25~0)|) (= ~a23~0 |old(~a23~0)|) (<= |old(~a29~0)| ~a29~0) (= 1 ~a4~0) (<= ~a29~0 |old(~a29~0)|)) (not (<= |old(~a23~0)| 312)) (not (= 15 ~a8~0)) (not (= 1 ~a3~0)) (not (<= 312 |old(~a23~0)|)) (not (= 1 |old(~a4~0)|)) (not (<= |old(~a29~0)| 130))) [2019-09-07 18:29:38,002 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1028 1044) no Hoare annotation was computed. [2019-09-07 18:29:38,003 INFO L439 ceAbstractionStarter]: At program point L1042(line 1042) the Hoare annotation is: (let ((.cse20 (= 1 |old(~a4~0)|)) (.cse18 (= ~a4~0 |old(~a4~0)|)) (.cse23 (< 138 ~a23~0))) (let ((.cse15 (= ~a25~0 12)) (.cse24 (and (not (= ~a25~0 13)) .cse18 .cse23)) (.cse7 (<= ~a4~0 0)) (.cse22 (<= ~a29~0 130)) (.cse21 (<= ~a23~0 312)) (.cse27 (and .cse20 (<= ~a25~0 10) .cse18 .cse23)) (.cse10 (= 1 ~a4~0))) (let ((.cse4 (and (exists ((v_~a29~0_507 Int)) (and (<= 0 v_~a29~0_507) (<= |old(~a29~0)| v_~a29~0_507) (<= ~a29~0 (+ (mod v_~a29~0_507 15) 260)))) .cse10)) (.cse0 (and .cse21 .cse27)) (.cse14 (<= 13 ~a25~0)) (.cse25 (and .cse7 .cse20 .cse22)) (.cse19 (<= 312 ~a23~0)) (.cse16 (<= ~a29~0 274)) (.cse8 (<= (+ ~a23~0 55) 0)) (.cse26 (and .cse15 .cse24)) (.cse5 (< 140 ~a29~0)) (.cse11 (<= ~a23~0 599997)) (.cse2 (<= 245 ~a29~0)) (.cse13 (= ~a25~0 11)) (.cse17 (<= ~a23~0 138)) (.cse1 (= ~a25~0 9)) (.cse12 (<= ~a29~0 275)) (.cse6 (= ~a25~0 10)) (.cse9 (<= 277 ~a29~0)) (.cse3 (exists ((v_prenex_7 Int)) (and (<= 0 v_prenex_7) (<= ~a23~0 (+ (mod v_prenex_7 299846) 300155)) (< 306 v_prenex_7))))) (or (and .cse0 .cse1 .cse2) (not (<= 130 |old(~a29~0)|)) (and .cse3 (and .cse4 .cse5 .cse6)) (not (<= 312 |old(~a23~0)|)) (and .cse1 .cse7 .cse8 .cse9) (and (and .cse10 .cse11 .cse5 .cse12) .cse13) (and (<= ~a23~0 600000) (and .cse4 .cse14) .cse5) (not (= 10 |old(~a25~0)|)) (not (<= |old(~a29~0)| 130)) (and (and (and .cse15 .cse7 .cse16) .cse5) .cse8) (and .cse12 (and (and (not (= 12 ~a25~0)) .cse17 .cse18) .cse2)) (and (and .cse11 .cse6 .cse19) .cse10) (and (and .cse6 .cse18) .cse8) (not .cse20) (and (and .cse21 .cse22 .cse10) .cse1) (and (and .cse16 (and .cse17 .cse10)) .cse6) (and .cse6 .cse0) (and .cse3 .cse13 .cse18 .cse9) (and .cse11 .cse14 (and .cse18 .cse23)) (and .cse15 (and .cse21 .cse24)) (and (and .cse1 .cse5 (and .cse16 .cse10) .cse19) .cse3) (and (and .cse25 .cse13) .cse8) (and .cse7 (<= (+ ~a23~0 119992) 0) .cse15 .cse12 .cse2) (and (and .cse9 .cse26) .cse3) (and .cse1 .cse3 .cse18 .cse9) (and (and (and (exists ((v_~a29~0_511 Int)) (and (<= (+ ~a29~0 (* 5 (div v_~a29~0_511 (- 5))) 28690) 0) (<= v_~a29~0_511 245) (< 140 v_~a29~0_511) (= 0 (mod v_~a29~0_511 (- 5))))) .cse25) .cse6) .cse8) (not (<= |old(~a23~0)| 312)) (not (= 1 ~a3~0)) (and .cse8 (and .cse15 .cse7 .cse22)) (and (and (and (and .cse15 .cse16 .cse18) .cse2) .cse19) .cse3) (and (and (and .cse16 .cse18) .cse2) .cse3 .cse13) (or (and .cse1 (and .cse8 (and .cse7 .cse22))) (and (and (and .cse15 .cse22) (<= (+ ~a23~0 304) 0)) .cse10)) (and .cse11 .cse26 .cse5) (and (and .cse11 (and .cse24 .cse2)) .cse13) (and .cse1 (and .cse10 .cse17)) (not (= 15 ~a8~0)) (and (and .cse1 (exists ((v_~a29~0_514 Int)) (and (<= 0 v_~a29~0_514) (<= 130 v_~a29~0_514) (<= (+ (mod v_~a29~0_514 15) 260) ~a29~0))) .cse27 .cse12) .cse3) (and (and .cse6 .cse18 .cse9) .cse3))))) [2019-09-07 18:29:38,003 INFO L443 ceAbstractionStarter]: For program point L1042-1(line 1042) no Hoare annotation was computed. [2019-09-07 18:29:38,003 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-09-07 18:29:38,004 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse20 (= 1 |old(~a4~0)|)) (.cse18 (= ~a4~0 |old(~a4~0)|)) (.cse23 (< 138 ~a23~0))) (let ((.cse15 (= ~a25~0 12)) (.cse24 (and (not (= ~a25~0 13)) .cse18 .cse23)) (.cse7 (<= ~a4~0 0)) (.cse22 (<= ~a29~0 130)) (.cse21 (<= ~a23~0 312)) (.cse27 (and .cse20 (<= ~a25~0 10) .cse18 .cse23)) (.cse10 (= 1 ~a4~0))) (let ((.cse4 (and (exists ((v_~a29~0_507 Int)) (and (<= 0 v_~a29~0_507) (<= |old(~a29~0)| v_~a29~0_507) (<= ~a29~0 (+ (mod v_~a29~0_507 15) 260)))) .cse10)) (.cse0 (and .cse21 .cse27)) (.cse14 (<= 13 ~a25~0)) (.cse25 (and .cse7 .cse20 .cse22)) (.cse19 (<= 312 ~a23~0)) (.cse16 (<= ~a29~0 274)) (.cse8 (<= (+ ~a23~0 55) 0)) (.cse26 (and .cse15 .cse24)) (.cse5 (< 140 ~a29~0)) (.cse11 (<= ~a23~0 599997)) (.cse2 (<= 245 ~a29~0)) (.cse13 (= ~a25~0 11)) (.cse17 (<= ~a23~0 138)) (.cse1 (= ~a25~0 9)) (.cse12 (<= ~a29~0 275)) (.cse6 (= ~a25~0 10)) (.cse9 (<= 277 ~a29~0)) (.cse3 (exists ((v_prenex_7 Int)) (and (<= 0 v_prenex_7) (<= ~a23~0 (+ (mod v_prenex_7 299846) 300155)) (< 306 v_prenex_7))))) (or (and .cse0 .cse1 .cse2) (not (<= 130 |old(~a29~0)|)) (and .cse3 (and .cse4 .cse5 .cse6)) (not (<= 312 |old(~a23~0)|)) (and .cse1 .cse7 .cse8 .cse9) (and (and .cse10 .cse11 .cse5 .cse12) .cse13) (and (<= ~a23~0 600000) (and .cse4 .cse14) .cse5) (not (= 10 |old(~a25~0)|)) (not (<= |old(~a29~0)| 130)) (and (and (and .cse15 .cse7 .cse16) .cse5) .cse8) (and .cse12 (and (and (not (= 12 ~a25~0)) .cse17 .cse18) .cse2)) (and (and .cse11 .cse6 .cse19) .cse10) (and (and .cse6 .cse18) .cse8) (not .cse20) (and (and .cse21 .cse22 .cse10) .cse1) (and (and .cse16 (and .cse17 .cse10)) .cse6) (and .cse6 .cse0) (and .cse3 .cse13 .cse18 .cse9) (and .cse11 .cse14 (and .cse18 .cse23)) (and .cse15 (and .cse21 .cse24)) (and (and .cse1 .cse5 (and .cse16 .cse10) .cse19) .cse3) (and (and .cse25 .cse13) .cse8) (and .cse7 (<= (+ ~a23~0 119992) 0) .cse15 .cse12 .cse2) (and (and .cse9 .cse26) .cse3) (and .cse1 .cse3 .cse18 .cse9) (and (and (and (exists ((v_~a29~0_511 Int)) (and (<= (+ ~a29~0 (* 5 (div v_~a29~0_511 (- 5))) 28690) 0) (<= v_~a29~0_511 245) (< 140 v_~a29~0_511) (= 0 (mod v_~a29~0_511 (- 5))))) .cse25) .cse6) .cse8) (not (<= |old(~a23~0)| 312)) (not (= 1 ~a3~0)) (and .cse8 (and .cse15 .cse7 .cse22)) (and (and (and (and .cse15 .cse16 .cse18) .cse2) .cse19) .cse3) (and (and (and .cse16 .cse18) .cse2) .cse3 .cse13) (or (and .cse1 (and .cse8 (and .cse7 .cse22))) (and (and (and .cse15 .cse22) (<= (+ ~a23~0 304) 0)) .cse10)) (and .cse11 .cse26 .cse5) (and (and .cse11 (and .cse24 .cse2)) .cse13) (and .cse1 (and .cse10 .cse17)) (not (= 15 ~a8~0)) (and (and .cse1 (exists ((v_~a29~0_514 Int)) (and (<= 0 v_~a29~0_514) (<= 130 v_~a29~0_514) (<= (+ (mod v_~a29~0_514 15) 260) ~a29~0))) .cse27 .cse12) .cse3) (and (and .cse6 .cse18 .cse9) .cse3))))) [2019-09-07 18:29:38,004 INFO L443 ceAbstractionStarter]: For program point L1034-3(lines 1028 1044) no Hoare annotation was computed. [2019-09-07 18:29:38,025 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,027 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,029 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,029 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,030 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,030 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,031 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,031 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,031 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,037 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,038 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,038 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,039 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,039 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,039 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,044 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,045 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,045 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,045 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,046 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] [2019-09-07 18:29:38,046 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] [2019-09-07 18:29:38,046 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] [2019-09-07 18:29:38,047 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] [2019-09-07 18:29:38,047 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,048 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,048 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:29:38,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:29:38,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:29:38,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,079 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,080 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,080 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] [2019-09-07 18:29:38,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] [2019-09-07 18:29:38,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] [2019-09-07 18:29:38,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] [2019-09-07 18:29:38,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:29:38,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:29:38,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:29:38,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 06:29:38 BoogieIcfgContainer [2019-09-07 18:29:38,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 18:29:38,104 INFO L168 Benchmark]: Toolchain (without parser) took 664658.32 ms. Allocated memory was 134.7 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 88.0 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-09-07 18:29:38,105 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 134.7 MB. Free memory was 109.1 MB in the beginning and 108.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-09-07 18:29:38,112 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1242.28 ms. Allocated memory was 134.7 MB in the beginning and 207.1 MB in the end (delta: 72.4 MB). Free memory was 87.8 MB in the beginning and 147.7 MB in the end (delta: -59.9 MB). Peak memory consumption was 32.0 MB. Max. memory is 7.1 GB. [2019-09-07 18:29:38,113 INFO L168 Benchmark]: Boogie Preprocessor took 142.67 ms. Allocated memory is still 207.1 MB. Free memory was 147.7 MB in the beginning and 139.8 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 7.1 GB. [2019-09-07 18:29:38,113 INFO L168 Benchmark]: RCFGBuilder took 1781.66 ms. Allocated memory was 207.1 MB in the beginning and 234.9 MB in the end (delta: 27.8 MB). Free memory was 139.8 MB in the beginning and 87.9 MB in the end (delta: 52.0 MB). Peak memory consumption was 79.7 MB. Max. memory is 7.1 GB. [2019-09-07 18:29:38,114 INFO L168 Benchmark]: TraceAbstraction took 661487.42 ms. Allocated memory was 234.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 87.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-09-07 18:29:38,119 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.45 ms. Allocated memory is still 134.7 MB. Free memory was 109.1 MB in the beginning and 108.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1242.28 ms. Allocated memory was 134.7 MB in the beginning and 207.1 MB in the end (delta: 72.4 MB). Free memory was 87.8 MB in the beginning and 147.7 MB in the end (delta: -59.9 MB). Peak memory consumption was 32.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 142.67 ms. Allocated memory is still 207.1 MB. Free memory was 147.7 MB in the beginning and 139.8 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1781.66 ms. Allocated memory was 207.1 MB in the beginning and 234.9 MB in the end (delta: 27.8 MB). Free memory was 139.8 MB in the beginning and 87.9 MB in the end (delta: 52.0 MB). Peak memory consumption was 79.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 661487.42 ms. Allocated memory was 234.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 87.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.6 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_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 171]: 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: 1034]: Loop Invariant [2019-09-07 18:29:38,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,142 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] [2019-09-07 18:29:38,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] [2019-09-07 18:29:38,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] [2019-09-07 18:29:38,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] [2019-09-07 18:29:38,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:29:38,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:29:38,154 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:29:38,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,155 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,158 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,159 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,159 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,159 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-09-07 18:29:38,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,162 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,162 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,166 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,166 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] [2019-09-07 18:29:38,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] [2019-09-07 18:29:38,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] [2019-09-07 18:29:38,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_511,QUANTIFIED] [2019-09-07 18:29:38,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:29:38,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:29:38,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:29:38,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-09-07 18:29:38,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((a23 <= 312 && ((1 == \old(a4) && a25 <= 10) && a4 == \old(a4)) && 138 < a23) && a25 == 9) && 245 <= a29) || !(130 <= \old(a29))) || ((\exists v_prenex_7 : int :: (0 <= v_prenex_7 && a23 <= v_prenex_7 % 299846 + 300155) && 306 < v_prenex_7) && (((\exists v_~a29~0_507 : int :: (0 <= v_~a29~0_507 && \old(a29) <= v_~a29~0_507) && a29 <= v_~a29~0_507 % 15 + 260) && 1 == a4) && 140 < a29) && a25 == 10)) || !(312 <= \old(a23))) || (((a25 == 9 && a4 <= 0) && a23 + 55 <= 0) && 277 <= a29)) || ((((1 == a4 && a23 <= 599997) && 140 < a29) && a29 <= 275) && a25 == 11)) || ((a23 <= 600000 && ((\exists v_~a29~0_507 : int :: (0 <= v_~a29~0_507 && \old(a29) <= v_~a29~0_507) && a29 <= v_~a29~0_507 % 15 + 260) && 1 == a4) && 13 <= a25) && 140 < a29)) || !(10 == \old(a25))) || !(\old(a29) <= 130)) || ((((a25 == 12 && a4 <= 0) && a29 <= 274) && 140 < a29) && a23 + 55 <= 0)) || (a29 <= 275 && ((!(12 == a25) && a23 <= 138) && a4 == \old(a4)) && 245 <= a29)) || (((a23 <= 599997 && a25 == 10) && 312 <= a23) && 1 == a4)) || ((a25 == 10 && a4 == \old(a4)) && a23 + 55 <= 0)) || !(1 == \old(a4))) || (((a23 <= 312 && a29 <= 130) && 1 == a4) && a25 == 9)) || ((a29 <= 274 && a23 <= 138 && 1 == a4) && a25 == 10)) || (a25 == 10 && a23 <= 312 && ((1 == \old(a4) && a25 <= 10) && a4 == \old(a4)) && 138 < a23)) || ((((\exists v_prenex_7 : int :: (0 <= v_prenex_7 && a23 <= v_prenex_7 % 299846 + 300155) && 306 < v_prenex_7) && a25 == 11) && a4 == \old(a4)) && 277 <= a29)) || ((a23 <= 599997 && 13 <= a25) && a4 == \old(a4) && 138 < a23)) || (a25 == 12 && a23 <= 312 && (!(a25 == 13) && a4 == \old(a4)) && 138 < a23)) || ((((a25 == 9 && 140 < a29) && a29 <= 274 && 1 == a4) && 312 <= a23) && (\exists v_prenex_7 : int :: (0 <= v_prenex_7 && a23 <= v_prenex_7 % 299846 + 300155) && 306 < v_prenex_7))) || ((((a4 <= 0 && 1 == \old(a4)) && a29 <= 130) && a25 == 11) && a23 + 55 <= 0)) || ((((a4 <= 0 && a23 + 119992 <= 0) && a25 == 12) && a29 <= 275) && 245 <= a29)) || ((277 <= a29 && a25 == 12 && (!(a25 == 13) && a4 == \old(a4)) && 138 < a23) && (\exists v_prenex_7 : int :: (0 <= v_prenex_7 && a23 <= v_prenex_7 % 299846 + 300155) && 306 < v_prenex_7))) || (((a25 == 9 && (\exists v_prenex_7 : int :: (0 <= v_prenex_7 && a23 <= v_prenex_7 % 299846 + 300155) && 306 < v_prenex_7)) && a4 == \old(a4)) && 277 <= a29)) || ((((\exists v_~a29~0_511 : int :: ((a29 + 5 * (v_~a29~0_511 / -5) + 28690 <= 0 && v_~a29~0_511 <= 245) && 140 < v_~a29~0_511) && 0 == v_~a29~0_511 % -5) && (a4 <= 0 && 1 == \old(a4)) && a29 <= 130) && a25 == 10) && a23 + 55 <= 0)) || !(\old(a23) <= 312)) || !(1 == a3)) || (a23 + 55 <= 0 && (a25 == 12 && a4 <= 0) && a29 <= 130)) || (((((a25 == 12 && a29 <= 274) && a4 == \old(a4)) && 245 <= a29) && 312 <= a23) && (\exists v_prenex_7 : int :: (0 <= v_prenex_7 && a23 <= v_prenex_7 % 299846 + 300155) && 306 < v_prenex_7))) || ((((a29 <= 274 && a4 == \old(a4)) && 245 <= a29) && (\exists v_prenex_7 : int :: (0 <= v_prenex_7 && a23 <= v_prenex_7 % 299846 + 300155) && 306 < v_prenex_7)) && a25 == 11)) || (a25 == 9 && a23 + 55 <= 0 && a4 <= 0 && a29 <= 130) || (((a25 == 12 && a29 <= 130) && a23 + 304 <= 0) && 1 == a4)) || ((a23 <= 599997 && a25 == 12 && (!(a25 == 13) && a4 == \old(a4)) && 138 < a23) && 140 < a29)) || ((a23 <= 599997 && ((!(a25 == 13) && a4 == \old(a4)) && 138 < a23) && 245 <= a29) && a25 == 11)) || (a25 == 9 && 1 == a4 && a23 <= 138)) || !(15 == a8)) || ((((a25 == 9 && (\exists v_~a29~0_514 : int :: (0 <= v_~a29~0_514 && 130 <= v_~a29~0_514) && v_~a29~0_514 % 15 + 260 <= a29)) && ((1 == \old(a4) && a25 <= 10) && a4 == \old(a4)) && 138 < a23) && a29 <= 275) && (\exists v_prenex_7 : int :: (0 <= v_prenex_7 && a23 <= v_prenex_7 % 299846 + 300155) && 306 < v_prenex_7))) || (((a25 == 10 && a4 == \old(a4)) && 277 <= a29) && (\exists v_prenex_7 : int :: (0 <= v_prenex_7 && a23 <= v_prenex_7 % 299846 + 300155) && 306 < v_prenex_7)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 292 locations, 1 error locations. SAFE Result, 661.3s OverallTime, 22 OverallIterations, 8 TraceHistogramMax, 358.1s AutomataDifference, 0.0s DeadEndRemovalTime, 241.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1702 SDtfs, 43834 SDslu, 5694 SDs, 0 SdLazy, 84750 SolverSat, 16271 SolverUnsat, 95 SolverUnknown, 0 SolverNotchecked, 246.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10864 GetRequests, 10111 SyntacticMatches, 13 SemanticMatches, 740 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 19396 ImplicationChecksByTransitivity, 100.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65856occurred in iteration=19, 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: 12.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 56247 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 3846 PreInvPairs, 4546 NumberOfFragments, 3204 HoareAnnotationTreeSize, 3846 FomulaSimplifications, 9417545 FormulaSimplificationTreeSizeReduction, 47.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1832414 FormulaSimplificationTreeSizeReductionInter, 193.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 29.0s InterpolantComputationTime, 19934 NumberOfCodeBlocks, 19934 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 19894 ConstructedInterpolants, 26 QuantifiedInterpolants, 48113347 SizeOfPredicates, 21 NumberOfNonLiveVariables, 14803 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 40 InterpolantComputations, 7 PerfectInterpolantSequences, 30414/34332 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...