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/Problem15_label11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:20:27,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:20:27,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:20:27,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:20:27,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:20:27,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:20:27,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:20:27,288 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:20:27,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:20:27,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:20:27,292 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:20:27,293 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:20:27,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:20:27,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:20:27,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:20:27,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:20:27,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:20:27,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:20:27,300 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:20:27,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:20:27,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:20:27,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:20:27,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:20:27,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:20:27,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:20:27,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:20:27,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:20:27,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:20:27,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:20:27,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:20:27,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:20:27,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:20:27,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:20:27,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:20:27,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:20:27,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:20:27,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:20:27,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:20:27,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:20:27,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:20:27,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:20:27,332 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 20:20:27,356 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:20:27,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:20:27,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:20:27,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:20:27,359 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:20:27,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:20:27,360 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:20:27,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:20:27,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:20:27,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:20:27,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:20:27,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:20:27,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:20:27,362 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:20:27,363 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:20:27,363 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:20:27,363 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:20:27,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:20:27,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:20:27,364 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:20:27,364 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:20:27,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:20:27,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:20:27,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:20:27,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:20:27,365 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:20:27,365 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:20:27,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:20:27,365 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:20:27,408 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:20:27,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:20:27,423 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:20:27,425 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:20:27,425 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:20:27,426 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label11.c [2019-09-07 20:20:27,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81ff61baf/85fb9e9ba7154a4ba2bdc0d74f7c1790/FLAG969957973 [2019-09-07 20:20:28,134 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:20:28,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label11.c [2019-09-07 20:20:28,155 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81ff61baf/85fb9e9ba7154a4ba2bdc0d74f7c1790/FLAG969957973 [2019-09-07 20:20:28,336 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81ff61baf/85fb9e9ba7154a4ba2bdc0d74f7c1790 [2019-09-07 20:20:28,348 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:20:28,349 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:20:28,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:20:28,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:20:28,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:20:28,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:20:28" (1/1) ... [2019-09-07 20:20:28,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e4db4b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:28, skipping insertion in model container [2019-09-07 20:20:28,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:20:28" (1/1) ... [2019-09-07 20:20:28,369 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:20:28,460 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:20:29,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:20:29,376 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:20:29,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:20:29,986 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:20:29,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:29 WrapperNode [2019-09-07 20:20:29,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:20:29,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:20:29,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:20:29,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:20:30,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:29" (1/1) ... [2019-09-07 20:20:30,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:29" (1/1) ... [2019-09-07 20:20:30,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:29" (1/1) ... [2019-09-07 20:20:30,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:29" (1/1) ... [2019-09-07 20:20:30,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:29" (1/1) ... [2019-09-07 20:20:30,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:29" (1/1) ... [2019-09-07 20:20:30,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:29" (1/1) ... [2019-09-07 20:20:30,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:20:30,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:20:30,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:20:30,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:20:30,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:20:30,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:20:30,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:20:30,295 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:20:30,295 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 20:20:30,296 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:20:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:20:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 20:20:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:20:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:20:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:20:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:20:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:20:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:20:35,018 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:20:35,018 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:20:35,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:20:35 BoogieIcfgContainer [2019-09-07 20:20:35,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:20:35,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:20:35,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:20:35,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:20:35,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:20:28" (1/3) ... [2019-09-07 20:20:35,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ede7e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:20:35, skipping insertion in model container [2019-09-07 20:20:35,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:29" (2/3) ... [2019-09-07 20:20:35,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ede7e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:20:35, skipping insertion in model container [2019-09-07 20:20:35,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:20:35" (3/3) ... [2019-09-07 20:20:35,038 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label11.c [2019-09-07 20:20:35,054 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:20:35,064 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:20:35,085 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:20:35,141 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:20:35,143 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:20:35,144 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:20:35,144 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:20:35,144 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:20:35,144 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:20:35,144 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:20:35,144 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:20:35,145 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:20:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-09-07 20:20:35,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-07 20:20:35,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:20:35,202 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 20:20:35,204 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:20:35,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:20:35,210 INFO L82 PathProgramCache]: Analyzing trace with hash -35164099, now seen corresponding path program 1 times [2019-09-07 20:20:35,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:20:35,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:20:35,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:20:35,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:20:35,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:20:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:20:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:20:35,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:20:35,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:20:35,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:20:35,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:20:35,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:20:35,699 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 4 states. [2019-09-07 20:20:40,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:20:40,315 INFO L93 Difference]: Finished difference Result 1554 states and 2845 transitions. [2019-09-07 20:20:40,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:20:40,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-09-07 20:20:40,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:20:40,367 INFO L225 Difference]: With dead ends: 1554 [2019-09-07 20:20:40,367 INFO L226 Difference]: Without dead ends: 1036 [2019-09-07 20:20:40,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:20:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-09-07 20:20:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 697. [2019-09-07 20:20:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-07 20:20:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1188 transitions. [2019-09-07 20:20:40,509 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1188 transitions. Word has length 61 [2019-09-07 20:20:40,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:20:40,509 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 1188 transitions. [2019-09-07 20:20:40,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:20:40,510 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1188 transitions. [2019-09-07 20:20:40,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-07 20:20:40,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:20:40,517 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] [2019-09-07 20:20:40,517 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:20:40,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:20:40,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1070771974, now seen corresponding path program 1 times [2019-09-07 20:20:40,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:20:40,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:20:40,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:20:40,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:20:40,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:20:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:20:40,765 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 20:20:40,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:20:40,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:20:40,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:20:40,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:20:40,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:20:40,774 INFO L87 Difference]: Start difference. First operand 697 states and 1188 transitions. Second operand 4 states. [2019-09-07 20:20:44,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:20:44,411 INFO L93 Difference]: Finished difference Result 2627 states and 4583 transitions. [2019-09-07 20:20:44,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:20:44,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-07 20:20:44,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:20:44,425 INFO L225 Difference]: With dead ends: 2627 [2019-09-07 20:20:44,425 INFO L226 Difference]: Without dead ends: 1936 [2019-09-07 20:20:44,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:20:44,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2019-09-07 20:20:44,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1933. [2019-09-07 20:20:44,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1933 states. [2019-09-07 20:20:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 2950 transitions. [2019-09-07 20:20:44,505 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 2950 transitions. Word has length 130 [2019-09-07 20:20:44,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:20:44,508 INFO L475 AbstractCegarLoop]: Abstraction has 1933 states and 2950 transitions. [2019-09-07 20:20:44,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:20:44,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2950 transitions. [2019-09-07 20:20:44,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-07 20:20:44,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:20:44,524 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] [2019-09-07 20:20:44,525 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:20:44,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:20:44,525 INFO L82 PathProgramCache]: Analyzing trace with hash -652978304, now seen corresponding path program 1 times [2019-09-07 20:20:44,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:20:44,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:20:44,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:20:44,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:20:44,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:20:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:20:44,661 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 20:20:44,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:20:44,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 20:20:44,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 20:20:44,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 20:20:44,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:20:44,663 INFO L87 Difference]: Start difference. First operand 1933 states and 2950 transitions. Second operand 5 states. [2019-09-07 20:20:48,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:20:48,625 INFO L93 Difference]: Finished difference Result 5794 states and 9031 transitions. [2019-09-07 20:20:48,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:20:48,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 177 [2019-09-07 20:20:48,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:20:48,657 INFO L225 Difference]: With dead ends: 5794 [2019-09-07 20:20:48,657 INFO L226 Difference]: Without dead ends: 3867 [2019-09-07 20:20:48,664 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 20:20:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3867 states. [2019-09-07 20:20:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3867 to 3830. [2019-09-07 20:20:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3830 states. [2019-09-07 20:20:48,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3830 states to 3830 states and 5188 transitions. [2019-09-07 20:20:48,826 INFO L78 Accepts]: Start accepts. Automaton has 3830 states and 5188 transitions. Word has length 177 [2019-09-07 20:20:48,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:20:48,836 INFO L475 AbstractCegarLoop]: Abstraction has 3830 states and 5188 transitions. [2019-09-07 20:20:48,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 20:20:48,836 INFO L276 IsEmpty]: Start isEmpty. Operand 3830 states and 5188 transitions. [2019-09-07 20:20:48,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2019-09-07 20:20:48,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:20:48,850 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:20:48,851 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:20:48,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:20:48,851 INFO L82 PathProgramCache]: Analyzing trace with hash -2119663085, now seen corresponding path program 1 times [2019-09-07 20:20:48,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:20:48,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:20:48,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:20:48,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:20:48,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:20:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:20:49,962 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 321 proven. 78 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 20:20:49,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:20:49,963 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:20:49,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:20:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:20:50,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:20:50,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:20:50,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:20:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-07 20:20:50,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:20:50,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-07 20:20:50,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:20:50,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:20:50,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:20:50,566 INFO L87 Difference]: Start difference. First operand 3830 states and 5188 transitions. Second operand 13 states. [2019-09-07 20:21:04,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:21:04,037 INFO L93 Difference]: Finished difference Result 12694 states and 19490 transitions. [2019-09-07 20:21:04,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-07 20:21:04,038 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 439 [2019-09-07 20:21:04,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:21:04,100 INFO L225 Difference]: With dead ends: 12694 [2019-09-07 20:21:04,101 INFO L226 Difference]: Without dead ends: 8870 [2019-09-07 20:21:04,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 455 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=801, Invalid=2859, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 20:21:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8870 states. [2019-09-07 20:21:04,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8870 to 5852. [2019-09-07 20:21:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5852 states. [2019-09-07 20:21:04,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5852 states to 5852 states and 7954 transitions. [2019-09-07 20:21:04,399 INFO L78 Accepts]: Start accepts. Automaton has 5852 states and 7954 transitions. Word has length 439 [2019-09-07 20:21:04,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:21:04,400 INFO L475 AbstractCegarLoop]: Abstraction has 5852 states and 7954 transitions. [2019-09-07 20:21:04,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:21:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 5852 states and 7954 transitions. [2019-09-07 20:21:04,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2019-09-07 20:21:04,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:21:04,415 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:21:04,415 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:21:04,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:21:04,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1254790204, now seen corresponding path program 1 times [2019-09-07 20:21:04,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:21:04,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:21:04,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:21:04,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:21:04,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:21:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:21:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 341 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-07 20:21:04,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:21:04,899 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:21:04,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:21:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:21:05,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:21:05,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:21:05,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:21:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 363 proven. 2 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 20:21:05,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:21:05,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 20:21:05,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:21:05,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:21:05,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:21:05,261 INFO L87 Difference]: Start difference. First operand 5852 states and 7954 transitions. Second operand 8 states. [2019-09-07 20:21:14,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:21:14,353 INFO L93 Difference]: Finished difference Result 20244 states and 28764 transitions. [2019-09-07 20:21:14,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 20:21:14,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 513 [2019-09-07 20:21:14,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:21:14,420 INFO L225 Difference]: With dead ends: 20244 [2019-09-07 20:21:14,420 INFO L226 Difference]: Without dead ends: 11835 [2019-09-07 20:21:14,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 547 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=347, Invalid=1545, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 20:21:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11835 states. [2019-09-07 20:21:14,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11835 to 9310. [2019-09-07 20:21:14,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9310 states. [2019-09-07 20:21:14,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9310 states to 9310 states and 11690 transitions. [2019-09-07 20:21:14,780 INFO L78 Accepts]: Start accepts. Automaton has 9310 states and 11690 transitions. Word has length 513 [2019-09-07 20:21:14,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:21:14,781 INFO L475 AbstractCegarLoop]: Abstraction has 9310 states and 11690 transitions. [2019-09-07 20:21:14,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:21:14,781 INFO L276 IsEmpty]: Start isEmpty. Operand 9310 states and 11690 transitions. [2019-09-07 20:21:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2019-09-07 20:21:14,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:21:14,827 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 20:21:14,828 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:21:14,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:21:14,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1838556596, now seen corresponding path program 1 times [2019-09-07 20:21:14,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:21:14,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:21:14,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:21:14,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:21:14,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:21:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:21:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 167 proven. 193 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-07 20:21:16,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:21:16,172 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:21:16,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:21:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:21:16,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:21:16,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:21:16,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:21:16,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:21:16,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:21:16,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:21:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-07 20:21:17,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:21:17,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-09-07 20:21:17,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 20:21:17,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 20:21:17,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:21:17,329 INFO L87 Difference]: Start difference. First operand 9310 states and 11690 transitions. Second operand 10 states. [2019-09-07 20:21:23,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:21:23,716 INFO L93 Difference]: Finished difference Result 19511 states and 24358 transitions. [2019-09-07 20:21:23,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 20:21:23,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 712 [2019-09-07 20:21:23,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:21:23,751 INFO L225 Difference]: With dead ends: 19511 [2019-09-07 20:21:23,753 INFO L226 Difference]: Without dead ends: 10514 [2019-09-07 20:21:23,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 723 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2019-09-07 20:21:23,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10514 states. [2019-09-07 20:21:23,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10514 to 9029. [2019-09-07 20:21:23,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9029 states. [2019-09-07 20:21:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9029 states to 9029 states and 10411 transitions. [2019-09-07 20:21:23,999 INFO L78 Accepts]: Start accepts. Automaton has 9029 states and 10411 transitions. Word has length 712 [2019-09-07 20:21:24,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:21:24,001 INFO L475 AbstractCegarLoop]: Abstraction has 9029 states and 10411 transitions. [2019-09-07 20:21:24,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 20:21:24,002 INFO L276 IsEmpty]: Start isEmpty. Operand 9029 states and 10411 transitions. [2019-09-07 20:21:24,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 738 [2019-09-07 20:21:24,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:21:24,035 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:21:24,036 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:21:24,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:21:24,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1957529448, now seen corresponding path program 1 times [2019-09-07 20:21:24,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:21:24,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:21:24,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:21:24,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:21:24,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:21:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:21:24,659 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 514 proven. 2 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2019-09-07 20:21:24,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:21:24,660 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:21:24,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:21:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:21:24,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:21:24,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:21:25,230 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 514 proven. 2 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2019-09-07 20:21:25,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:21:25,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 20:21:25,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:21:25,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:21:25,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:21:25,236 INFO L87 Difference]: Start difference. First operand 9029 states and 10411 transitions. Second operand 8 states. [2019-09-07 20:21:30,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:21:30,548 INFO L93 Difference]: Finished difference Result 23050 states and 27068 transitions. [2019-09-07 20:21:30,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 20:21:30,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 737 [2019-09-07 20:21:30,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:21:30,600 INFO L225 Difference]: With dead ends: 23050 [2019-09-07 20:21:30,600 INFO L226 Difference]: Without dead ends: 13396 [2019-09-07 20:21:30,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 747 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-07 20:21:30,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13396 states. [2019-09-07 20:21:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13396 to 10245. [2019-09-07 20:21:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10245 states. [2019-09-07 20:21:30,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 11561 transitions. [2019-09-07 20:21:30,866 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 11561 transitions. Word has length 737 [2019-09-07 20:21:30,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:21:30,868 INFO L475 AbstractCegarLoop]: Abstraction has 10245 states and 11561 transitions. [2019-09-07 20:21:30,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:21:30,868 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 11561 transitions. [2019-09-07 20:21:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 755 [2019-09-07 20:21:30,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:21:30,890 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:21:30,891 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:21:30,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:21:30,891 INFO L82 PathProgramCache]: Analyzing trace with hash 250548651, now seen corresponding path program 1 times [2019-09-07 20:21:30,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:21:30,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:21:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:21:30,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:21:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:21:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:21:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 940 backedges. 734 proven. 93 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-07 20:21:31,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:21:31,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:21:31,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:21:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:21:31,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:21:31,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:21:31,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:21:31,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:21:32,207 INFO L134 CoverageAnalysis]: Checked inductivity of 940 backedges. 514 proven. 2 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2019-09-07 20:21:32,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:21:32,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2019-09-07 20:21:32,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 20:21:32,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 20:21:32,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:21:32,214 INFO L87 Difference]: Start difference. First operand 10245 states and 11561 transitions. Second operand 10 states. [2019-09-07 20:21:40,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:21:40,036 INFO L93 Difference]: Finished difference Result 30990 states and 37057 transitions. [2019-09-07 20:21:40,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 20:21:40,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 754 [2019-09-07 20:21:40,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:21:40,101 INFO L225 Difference]: With dead ends: 30990 [2019-09-07 20:21:40,101 INFO L226 Difference]: Without dead ends: 17595 [2019-09-07 20:21:40,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 765 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2019-09-07 20:21:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17595 states. [2019-09-07 20:21:40,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17595 to 14576. [2019-09-07 20:21:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14576 states. [2019-09-07 20:21:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14576 states to 14576 states and 15971 transitions. [2019-09-07 20:21:40,478 INFO L78 Accepts]: Start accepts. Automaton has 14576 states and 15971 transitions. Word has length 754 [2019-09-07 20:21:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:21:40,480 INFO L475 AbstractCegarLoop]: Abstraction has 14576 states and 15971 transitions. [2019-09-07 20:21:40,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 20:21:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 14576 states and 15971 transitions. [2019-09-07 20:21:40,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 971 [2019-09-07 20:21:40,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:21:40,520 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:21:40,520 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:21:40,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:21:40,521 INFO L82 PathProgramCache]: Analyzing trace with hash -403083007, now seen corresponding path program 1 times [2019-09-07 20:21:40,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:21:40,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:21:40,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:21:40,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:21:40,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:21:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:21:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 416 proven. 1124 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2019-09-07 20:21:41,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:21:41,718 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:21:41,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:21:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:21:41,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:21:41,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:21:42,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:21:42,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:21:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 950 proven. 2 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-07 20:21:42,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:21:42,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-09-07 20:21:42,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:21:42,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:21:42,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:21:42,947 INFO L87 Difference]: Start difference. First operand 14576 states and 15971 transitions. Second operand 13 states. [2019-09-07 20:22:09,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:22:09,647 INFO L93 Difference]: Finished difference Result 50048 states and 54797 transitions. [2019-09-07 20:22:09,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-07 20:22:09,647 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 970 [2019-09-07 20:22:09,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:22:09,733 INFO L225 Difference]: With dead ends: 50048 [2019-09-07 20:22:09,733 INFO L226 Difference]: Without dead ends: 35476 [2019-09-07 20:22:09,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1166 GetRequests, 1050 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5472 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1756, Invalid=12050, Unknown=0, NotChecked=0, Total=13806 [2019-09-07 20:22:09,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35476 states. [2019-09-07 20:22:10,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35476 to 33517. [2019-09-07 20:22:10,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33517 states. [2019-09-07 20:22:10,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33517 states to 33517 states and 35839 transitions. [2019-09-07 20:22:10,342 INFO L78 Accepts]: Start accepts. Automaton has 33517 states and 35839 transitions. Word has length 970 [2019-09-07 20:22:10,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:22:10,342 INFO L475 AbstractCegarLoop]: Abstraction has 33517 states and 35839 transitions. [2019-09-07 20:22:10,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:22:10,343 INFO L276 IsEmpty]: Start isEmpty. Operand 33517 states and 35839 transitions. [2019-09-07 20:22:10,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1094 [2019-09-07 20:22:10,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:22:10,411 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:22:10,411 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:22:10,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:22:10,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1789347604, now seen corresponding path program 1 times [2019-09-07 20:22:10,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:22:10,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:22:10,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:22:10,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:22:10,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:22:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:22:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2255 backedges. 589 proven. 156 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2019-09-07 20:22:11,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:22:11,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:22:11,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:22:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:22:11,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 1427 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:22:11,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:22:11,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:11,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:12,052 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 26 [2019-09-07 20:22:12,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2255 backedges. 1333 proven. 2 refuted. 0 times theorem prover too weak. 920 trivial. 0 not checked. [2019-09-07 20:22:12,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:22:12,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 20:22:12,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:22:12,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:22:12,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:22:12,666 INFO L87 Difference]: Start difference. First operand 33517 states and 35839 transitions. Second operand 8 states. [2019-09-07 20:22:20,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:22:20,301 INFO L93 Difference]: Finished difference Result 68821 states and 73360 transitions. [2019-09-07 20:22:20,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 20:22:20,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1093 [2019-09-07 20:22:20,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:22:20,381 INFO L225 Difference]: With dead ends: 68821 [2019-09-07 20:22:20,381 INFO L226 Difference]: Without dead ends: 35617 [2019-09-07 20:22:20,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1126 GetRequests, 1105 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2019-09-07 20:22:20,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35617 states. [2019-09-07 20:22:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35617 to 34335. [2019-09-07 20:22:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34335 states. [2019-09-07 20:22:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34335 states to 34335 states and 36200 transitions. [2019-09-07 20:22:20,951 INFO L78 Accepts]: Start accepts. Automaton has 34335 states and 36200 transitions. Word has length 1093 [2019-09-07 20:22:20,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:22:20,951 INFO L475 AbstractCegarLoop]: Abstraction has 34335 states and 36200 transitions. [2019-09-07 20:22:20,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:22:20,952 INFO L276 IsEmpty]: Start isEmpty. Operand 34335 states and 36200 transitions. [2019-09-07 20:22:21,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1144 [2019-09-07 20:22:21,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:22:21,001 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, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 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, 2, 2, 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] [2019-09-07 20:22:21,001 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:22:21,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:22:21,002 INFO L82 PathProgramCache]: Analyzing trace with hash -562952668, now seen corresponding path program 1 times [2019-09-07 20:22:21,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:22:21,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:22:21,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:22:21,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:22:21,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:22:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:22:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2395 backedges. 519 proven. 251 refuted. 0 times theorem prover too weak. 1625 trivial. 0 not checked. [2019-09-07 20:22:22,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:22:22,772 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:22:22,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:22:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:22:23,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 1476 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:22:23,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:22:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2395 backedges. 1615 proven. 2 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2019-09-07 20:22:23,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:22:23,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:22:23,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:22:23,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:22:23,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:22:23,742 INFO L87 Difference]: Start difference. First operand 34335 states and 36200 transitions. Second operand 9 states. [2019-09-07 20:22:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:22:27,338 INFO L93 Difference]: Finished difference Result 68376 states and 72106 transitions. [2019-09-07 20:22:27,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 20:22:27,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1143 [2019-09-07 20:22:27,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:22:27,416 INFO L225 Difference]: With dead ends: 68376 [2019-09-07 20:22:27,417 INFO L226 Difference]: Without dead ends: 34354 [2019-09-07 20:22:27,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1162 GetRequests, 1148 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:22:27,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34354 states. [2019-09-07 20:22:27,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34354 to 34326. [2019-09-07 20:22:27,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34326 states. [2019-09-07 20:22:28,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34326 states to 34326 states and 35833 transitions. [2019-09-07 20:22:28,029 INFO L78 Accepts]: Start accepts. Automaton has 34326 states and 35833 transitions. Word has length 1143 [2019-09-07 20:22:28,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:22:28,030 INFO L475 AbstractCegarLoop]: Abstraction has 34326 states and 35833 transitions. [2019-09-07 20:22:28,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:22:28,030 INFO L276 IsEmpty]: Start isEmpty. Operand 34326 states and 35833 transitions. [2019-09-07 20:22:28,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2019-09-07 20:22:28,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:22:28,078 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:22:28,079 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:22:28,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:22:28,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1644392353, now seen corresponding path program 1 times [2019-09-07 20:22:28,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:22:28,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:22:28,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:22:28,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:22:28,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:22:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:22:31,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2434 backedges. 517 proven. 1294 refuted. 0 times theorem prover too weak. 623 trivial. 0 not checked. [2019-09-07 20:22:31,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:22:31,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:22:31,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:22:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:22:31,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 1507 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 20:22:31,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:22:31,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:32,352 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 Int)) (let ((.cse0 (mod (+ v_prenex_1 17705) 299928))) (and (<= .cse0 (+ c_~a29~0 300071)) (= 0 .cse0)))) (exists ((v_~a29~0_904 Int)) (let ((.cse1 (mod (+ v_~a29~0_904 17705) 299928))) (and (<= .cse1 (+ c_~a29~0 599999)) (< (+ v_~a29~0_904 317633) 0) (not (= 0 .cse1))))) (exists ((v_prenex_1 Int)) (and (<= 0 (+ v_prenex_1 317633)) (<= (mod (+ v_prenex_1 17705) 299928) (+ c_~a29~0 300071))))) is different from true [2019-09-07 20:22:32,847 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 Int)) (let ((.cse0 (mod (+ v_prenex_1 17705) 299928))) (and (<= .cse0 (+ c_~a29~0 300071)) (= 0 .cse0)))) (exists ((v_~a29~0_904 Int)) (let ((.cse1 (mod (+ v_~a29~0_904 17705) 299928))) (and (<= .cse1 (+ c_~a29~0 599999)) (< (+ v_~a29~0_904 317633) 0) (not (= 0 .cse1))))) (exists ((v_prenex_2 Int)) (and (<= 0 (+ v_prenex_2 317633)) (<= (mod (+ v_prenex_2 17705) 299928) (+ c_~a29~0 300071))))) is different from true [2019-09-07 20:22:32,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:32,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:22:34,420 WARN L188 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 25 [2019-09-07 20:22:34,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:22:34,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:22:34,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:22:34,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:22:36,669 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 79 DAG size of output: 25 [2019-09-07 20:22:36,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:22:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2434 backedges. 1002 proven. 51 refuted. 0 times theorem prover too weak. 1375 trivial. 6 not checked. [2019-09-07 20:22:37,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:22:37,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 20:22:37,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 20:22:37,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 20:22:37,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=147, Unknown=2, NotChecked=50, Total=240 [2019-09-07 20:22:37,642 INFO L87 Difference]: Start difference. First operand 34326 states and 35833 transitions. Second operand 16 states. [2019-09-07 20:23:11,291 WARN L188 SmtUtils]: Spent 659.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-09-07 20:23:16,165 WARN L188 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-07 20:24:00,294 WARN L188 SmtUtils]: Spent 3.99 s on a formula simplification that was a NOOP. DAG size: 62 [2019-09-07 20:24:04,352 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 47 [2019-09-07 20:24:19,418 WARN L188 SmtUtils]: Spent 4.93 s on a formula simplification that was a NOOP. DAG size: 63 [2019-09-07 20:24:35,030 WARN L188 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2019-09-07 20:24:46,619 WARN L188 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-07 20:25:01,225 WARN L188 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2019-09-07 20:25:02,023 WARN L188 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-09-07 20:25:19,016 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 35 [2019-09-07 20:25:20,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:25:20,407 INFO L93 Difference]: Finished difference Result 72502 states and 75671 transitions. [2019-09-07 20:25:20,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 20:25:20,407 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1212 [2019-09-07 20:25:20,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:25:20,475 INFO L225 Difference]: With dead ends: 72502 [2019-09-07 20:25:20,475 INFO L226 Difference]: Without dead ends: 36291 [2019-09-07 20:25:20,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1280 GetRequests, 1231 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=382, Invalid=1769, Unknown=19, NotChecked=182, Total=2352 [2019-09-07 20:25:20,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36291 states. [2019-09-07 20:25:21,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36291 to 34955. [2019-09-07 20:25:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34955 states. [2019-09-07 20:25:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34955 states to 34955 states and 36382 transitions. [2019-09-07 20:25:21,070 INFO L78 Accepts]: Start accepts. Automaton has 34955 states and 36382 transitions. Word has length 1212 [2019-09-07 20:25:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:25:21,070 INFO L475 AbstractCegarLoop]: Abstraction has 34955 states and 36382 transitions. [2019-09-07 20:25:21,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 20:25:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 34955 states and 36382 transitions. [2019-09-07 20:25:21,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1537 [2019-09-07 20:25:21,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:25:21,126 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:25:21,126 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:25:21,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:25:21,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1225053417, now seen corresponding path program 1 times [2019-09-07 20:25:21,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:25:21,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:25:21,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:25:21,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:25:21,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:25:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:25:24,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3726 backedges. 401 proven. 2012 refuted. 0 times theorem prover too weak. 1313 trivial. 0 not checked. [2019-09-07 20:25:24,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:25:24,643 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:25:24,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:25:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:25:25,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 1917 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 20:25:25,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:25:25,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:25:26,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3726 backedges. 2510 proven. 2 refuted. 0 times theorem prover too weak. 1214 trivial. 0 not checked. [2019-09-07 20:25:26,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:25:26,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-09-07 20:25:26,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 20:25:26,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 20:25:26,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:25:26,139 INFO L87 Difference]: Start difference. First operand 34955 states and 36382 transitions. Second operand 15 states. [2019-09-07 20:25:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:25:37,411 INFO L93 Difference]: Finished difference Result 77716 states and 80977 transitions. [2019-09-07 20:25:37,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-07 20:25:37,412 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1536 [2019-09-07 20:25:37,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:25:37,503 INFO L225 Difference]: With dead ends: 77716 [2019-09-07 20:25:37,503 INFO L226 Difference]: Without dead ends: 43074 [2019-09-07 20:25:37,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1633 GetRequests, 1570 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=702, Invalid=3458, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 20:25:37,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43074 states. [2019-09-07 20:25:38,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43074 to 41180. [2019-09-07 20:25:38,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41180 states. [2019-09-07 20:25:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41180 states to 41180 states and 42842 transitions. [2019-09-07 20:25:38,091 INFO L78 Accepts]: Start accepts. Automaton has 41180 states and 42842 transitions. Word has length 1536 [2019-09-07 20:25:38,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:25:38,092 INFO L475 AbstractCegarLoop]: Abstraction has 41180 states and 42842 transitions. [2019-09-07 20:25:38,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 20:25:38,092 INFO L276 IsEmpty]: Start isEmpty. Operand 41180 states and 42842 transitions. [2019-09-07 20:25:38,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1555 [2019-09-07 20:25:38,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:25:38,139 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:25:38,139 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:25:38,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:25:38,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1844964221, now seen corresponding path program 1 times [2019-09-07 20:25:38,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:25:38,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:25:38,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:25:38,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:25:38,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:25:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:25:39,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4209 backedges. 2198 proven. 108 refuted. 0 times theorem prover too weak. 1903 trivial. 0 not checked. [2019-09-07 20:25:39,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:25:39,963 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:25:39,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:25:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:25:40,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 1974 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-07 20:25:40,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:25:40,808 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-07 20:25:41,081 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-07 20:25:41,357 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-07 20:25:41,672 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-07 20:25:41,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:41,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:41,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:42,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:42,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:44,487 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 130 DAG size of output: 67 [2019-09-07 20:25:44,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:44,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:44,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:44,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:44,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:44,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:44,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:52,809 WARN L188 SmtUtils]: Spent 8.18 s on a formula simplification that was a NOOP. DAG size: 34 [2019-09-07 20:25:52,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:25:52,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:52,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:52,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:52,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:25:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4209 backedges. 2194 proven. 305 refuted. 0 times theorem prover too weak. 1710 trivial. 0 not checked. [2019-09-07 20:25:58,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:25:58,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 20] total 26 [2019-09-07 20:25:58,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 20:25:58,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 20:25:58,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2019-09-07 20:25:58,576 INFO L87 Difference]: Start difference. First operand 41180 states and 42842 transitions. Second operand 26 states. [2019-09-07 20:26:00,274 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-07 20:26:01,089 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-07 20:26:01,667 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-07 20:26:02,441 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-07 20:26:04,620 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2019-09-07 20:26:05,009 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-07 20:26:05,336 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-07 20:26:05,626 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-07 20:26:06,177 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-07 20:26:06,564 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-07 20:26:07,037 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-07 20:26:08,143 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-07 20:26:08,492 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2019-09-07 20:26:09,163 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-07 20:26:09,708 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2019-09-07 20:26:10,497 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2019-09-07 20:26:11,213 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-07 20:26:12,252 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2019-09-07 20:26:13,285 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-07 20:26:13,846 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-09-07 20:26:16,324 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-07 20:26:16,527 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-07 20:26:16,845 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2019-09-07 20:26:17,165 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2019-09-07 20:26:17,452 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-07 20:26:17,805 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2019-09-07 20:26:19,248 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-07 20:26:19,871 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-07 20:26:20,136 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-07 20:26:20,449 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-07 20:26:21,752 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-07 20:26:21,964 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-07 20:26:22,351 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-09-07 20:26:22,585 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-07 20:26:22,946 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-07 20:26:23,576 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-09-07 20:26:24,839 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-07 20:26:25,025 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-07 20:26:25,283 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-07 20:26:25,635 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2019-09-07 20:26:25,883 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-09-07 20:26:26,247 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2019-09-07 20:26:27,267 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-07 20:26:28,117 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2019-09-07 20:26:29,694 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-07 20:26:30,399 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2019-09-07 20:26:31,621 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-07 20:26:33,357 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2019-09-07 20:26:33,679 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 64 [2019-09-07 20:26:34,104 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-09-07 20:26:35,963 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-07 20:26:36,214 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-07 20:26:37,008 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-07 20:26:38,051 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-09-07 20:26:38,690 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-07 20:26:39,123 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-07 20:26:39,908 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-07 20:26:40,408 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-07 20:26:41,738 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-07 20:26:42,210 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 73 [2019-09-07 20:26:44,603 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2019-09-07 20:26:45,524 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2019-09-07 20:26:46,038 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-07 20:26:47,045 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-09-07 20:26:47,574 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-07 20:26:47,823 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-07 20:27:02,745 WARN L188 SmtUtils]: Spent 14.45 s on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-07 20:27:02,968 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-07 20:27:04,166 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2019-09-07 20:27:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:27:05,481 INFO L93 Difference]: Finished difference Result 88889 states and 92524 transitions. [2019-09-07 20:27:05,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-09-07 20:27:05,481 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1554 [2019-09-07 20:27:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:27:05,484 INFO L225 Difference]: With dead ends: 88889 [2019-09-07 20:27:05,484 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 20:27:05,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1812 GetRequests, 1614 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15972 ImplicationChecksByTransitivity, 47.6s TimeCoverageRelationStatistics Valid=6275, Invalid=33127, Unknown=0, NotChecked=0, Total=39402 [2019-09-07 20:27:05,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 20:27:05,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 20:27:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 20:27:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 20:27:05,555 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1554 [2019-09-07 20:27:05,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:27:05,555 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 20:27:05,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 20:27:05,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 20:27:05,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 20:27:05,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 20:27:12,296 WARN L188 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 843 DAG size of output: 669 [2019-09-07 20:27:14,259 WARN L188 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 837 DAG size of output: 670 [2019-09-07 20:27:36,388 WARN L188 SmtUtils]: Spent 20.69 s on a formula simplification. DAG size of input: 939 DAG size of output: 214 [2019-09-07 20:27:56,028 WARN L188 SmtUtils]: Spent 19.58 s on a formula simplification. DAG size of input: 969 DAG size of output: 221 [2019-09-07 20:28:07,573 WARN L188 SmtUtils]: Spent 11.52 s on a formula simplification. DAG size of input: 679 DAG size of output: 181 [2019-09-07 20:28:17,563 WARN L188 SmtUtils]: Spent 9.98 s on a formula simplification. DAG size of input: 680 DAG size of output: 190 [2019-09-07 20:28:57,499 WARN L188 SmtUtils]: Spent 39.88 s on a formula simplification. DAG size of input: 1122 DAG size of output: 323 [2019-09-07 20:28:57,503 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 20:28:57,503 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a29~0 |old(~a29~0)|) (= ~a2~0 |old(~a2~0)|) (= ~a0~0 |old(~a0~0)|) (= ~a4~0 |old(~a4~0)|)) [2019-09-07 20:28:57,503 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 20:28:57,503 INFO L443 ceAbstractionStarter]: For program point calculate_output2EXIT(lines 1658 1758) no Hoare annotation was computed. [2019-09-07 20:28:57,504 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-09-07 20:28:57,504 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-09-07 20:28:57,504 INFO L439 ceAbstractionStarter]: At program point calculate_output2ENTRY(lines 1658 1758) the Hoare annotation is: (let ((.cse3 (not (< 0 (+ |old(~a29~0)| 144)))) (.cse6 (= 2 |old(~a2~0)|)) (.cse29 (not (= 3 |old(~a2~0)|))) (.cse33 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse12 (= 4 |old(~a2~0)|)) (.cse48 (+ |old(~a4~0)| 86)) (.cse44 (= 1 |old(~a2~0)|)) (.cse46 (+ |old(~a0~0)| 147))) (let ((.cse43 (= 4 ~a2~0)) (.cse45 (not (< 0 .cse46))) (.cse38 (not .cse44)) (.cse36 (not (< 0 .cse48))) (.cse49 (+ |old(~a29~0)| 127)) (.cse34 (= 3 ~a2~0)) (.cse21 (= ~a29~0 |old(~a29~0)|)) (.cse22 (= ~a2~0 |old(~a2~0)|)) (.cse20 (= ~a0~0 |old(~a0~0)|)) (.cse23 (= ~a4~0 |old(~a4~0)|)) (.cse13 (or .cse33 .cse12)) (.cse15 (not (<= |old(~a2~0)| 2))) (.cse19 (and (not .cse6) .cse29)) (.cse50 (or .cse33 .cse3 .cse12))) (let ((.cse27 (or .cse6 .cse44 .cse50)) (.cse39 (or (or .cse13 .cse15) .cse19)) (.cse24 (or (or .cse50 .cse15) .cse19)) (.cse42 (and (and .cse21 .cse22) .cse20 .cse23)) (.cse28 (and .cse21 .cse20 .cse34 .cse23)) (.cse26 (not (<= 0 .cse49))) (.cse40 (and (and .cse21 .cse22 .cse23) .cse20)) (.cse7 (not (<= .cse49 0))) (.cse18 (not (<= 0 (+ |old(~a29~0)| 599999)))) (.cse4 (not (<= (+ |old(~a0~0)| 216075) 0))) (.cse16 (and .cse21 (= 2 ~a2~0) .cse20 .cse23)) (.cse14 (not (<= 0 (+ |old(~a0~0)| 60)))) (.cse17 (not (<= .cse48 0))) (.cse10 (not (<= 0 (+ |old(~a29~0)| 192415)))) (.cse41 (or .cse38 (and (not (<= (+ |old(~a0~0)| 61) 0)) .cse36 .cse3))) (.cse31 (not (<= (+ |old(~a0~0)| 98) 0))) (.cse32 (and .cse21 .cse20)) (.cse0 (not .cse12)) (.cse5 (and .cse36 .cse45 .cse12)) (.cse25 (forall ((v_~a29~0_903 Int)) (let ((.cse47 (mod v_~a29~0_903 29))) (or (not (= .cse47 0)) (not (< 43 v_~a29~0_903)) (not (= (mod .cse47 5) 0)) (not (<= (div (+ .cse47 15) 5) (+ |old(~a29~0)| 16))) (= (mod (+ .cse47 1) 5) 0) (not (< .cse47 14)))))) (.cse2 (and .cse21 .cse43 .cse20 .cse23)) (.cse37 (not (<= .cse46 0))) (.cse1 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse30 (or .cse3 .cse12)) (.cse11 (not (<= (+ |old(~a0~0)| 99) 0))) (.cse35 (not (<= |old(~a29~0)| 41))) (.cse9 (and (not (< 0 (+ |old(~a29~0)| 16))) .cse45)) (.cse8 (and .cse21 .cse22 .cse20 .cse23))) (and (or .cse0 .cse1 .cse2 (or .cse3 .cse4) .cse5) (or .cse6 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse8 .cse11) (or .cse14 .cse15 .cse16 .cse7 .cse17 .cse18 .cse19) (or (and .cse20 .cse21 .cse22 .cse23) .cse24 .cse25) (or .cse1 .cse16 .cse15 .cse25 .cse19 .cse11) (or .cse14 .cse0 .cse2 .cse17 .cse26) (or .cse27 .cse26 .cse8) (or .cse26 .cse28 (or .cse17 .cse29)) (or (not (<= 2 |old(~a2~0)|)) (or .cse1 .cse30 .cse31) (not (<= 280404 |old(~a29~0)|)) (and .cse22 .cse32 .cse23)) (or (or .cse33 .cse29) (and (and (and .cse21 .cse34) .cse20) .cse23)) (or .cse31 .cse27 .cse8) (or .cse8 .cse1 .cse35 .cse25 .cse30 .cse31) (or .cse1 (or (and .cse36 .cse3) .cse37) .cse29 .cse28) (or .cse37 .cse8 (or .cse33 .cse3)) (or (or .cse38 .cse3) .cse1 .cse35 .cse9 .cse8) (or .cse39 .cse8 .cse31) (or .cse18 .cse16 .cse7 .cse39) (or .cse40 (or (forall ((v_~a4~0_777 Int)) (or (not (<= (+ v_~a4~0_777 42) 0)) (not (= 0 (mod (+ v_~a4~0_777 2) 5))) (not (<= |old(~a4~0)| (* 5 (div (+ v_~a4~0_777 (- 172293)) 5)))))) .cse24)) (or (or .cse17 .cse41) .cse7 .cse42) (or .cse42 (or (or .cse33 .cse38) .cse3)) (or .cse1 .cse11 .cse9 .cse28 .cse29) (or .cse18 (or .cse0 .cse33) (and .cse21 (and .cse20 .cse43) .cse23) .cse5) (or .cse1 .cse26 .cse8 (or .cse14 .cse6 .cse44 .cse30)) (or .cse17 (or .cse37 .cse38) .cse40) (or .cse0 .cse1 .cse37 .cse7 .cse5 .cse2 .cse18) (or .cse1 .cse8 (or .cse6 .cse30 .cse4)) (or .cse16 .cse14 .cse15 .cse25 .cse17 .cse19) (or (or .cse10 .cse41 .cse1 .cse31) (and .cse32 .cse22 .cse23) .cse9) (or .cse0 .cse1 .cse37 .cse5 .cse25 .cse2) (or .cse8 .cse1 .cse37 .cse9 .cse30) (or .cse6 .cse1 .cse30 .cse11 .cse35 .cse9 .cse8))))) [2019-09-07 20:28:57,504 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-09-07 20:28:57,504 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-09-07 20:28:57,504 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-09-07 20:28:57,505 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-09-07 20:28:57,505 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-09-07 20:28:57,505 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-09-07 20:28:57,505 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-09-07 20:28:57,505 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-09-07 20:28:57,505 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-09-07 20:28:57,505 INFO L443 ceAbstractionStarter]: For program point calculate_output2FINAL(lines 1658 1758) no Hoare annotation was computed. [2019-09-07 20:28:57,505 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-09-07 20:28:57,505 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-09-07 20:28:57,505 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-09-07 20:28:57,505 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-09-07 20:28:57,505 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-09-07 20:28:57,505 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-09-07 20:28:57,506 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-09-07 20:28:57,506 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,506 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,506 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,506 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,506 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,506 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,506 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,506 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,506 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-09-07 20:28:57,506 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-09-07 20:28:57,506 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-09-07 20:28:57,506 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-09-07 20:28:57,506 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-09-07 20:28:57,507 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,507 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,507 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,507 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,507 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,507 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,507 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,507 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,507 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,508 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,508 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-09-07 20:28:57,508 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-09-07 20:28:57,508 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-09-07 20:28:57,508 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,508 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,508 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,508 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,508 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,508 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,509 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,509 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,509 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,509 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-09-07 20:28:57,509 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,509 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-09-07 20:28:57,509 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,509 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,509 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,509 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-09-07 20:28:57,510 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,510 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-09-07 20:28:57,510 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-09-07 20:28:57,510 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-09-07 20:28:57,510 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-09-07 20:28:57,510 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,510 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,510 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,510 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,510 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,511 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,511 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,511 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,511 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,511 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,511 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,511 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-09-07 20:28:57,511 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-09-07 20:28:57,511 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-09-07 20:28:57,511 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,512 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,512 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-09-07 20:28:57,512 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,512 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-09-07 20:28:57,512 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,512 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,512 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,512 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-09-07 20:28:57,512 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-09-07 20:28:57,512 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,512 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,513 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,513 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,513 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,513 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,513 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,513 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,513 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,513 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-09-07 20:28:57,513 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,514 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-09-07 20:28:57,514 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-09-07 20:28:57,514 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,514 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,514 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,514 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,514 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,514 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,514 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,515 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,515 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,515 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,515 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,515 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,515 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-09-07 20:28:57,515 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,515 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-09-07 20:28:57,515 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-09-07 20:28:57,515 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-09-07 20:28:57,515 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-09-07 20:28:57,515 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-09-07 20:28:57,515 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-09-07 20:28:57,515 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,516 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,516 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,516 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,516 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,516 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,516 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,516 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,516 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,516 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,516 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,516 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,516 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,516 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,516 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-09-07 20:28:57,516 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,517 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-09-07 20:28:57,517 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-09-07 20:28:57,517 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,517 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,517 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,517 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,517 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,517 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,517 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,517 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-09-07 20:28:57,517 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,517 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,517 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,518 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-09-07 20:28:57,518 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-09-07 20:28:57,518 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,518 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-09-07 20:28:57,518 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,518 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,518 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,518 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-09-07 20:28:57,518 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-09-07 20:28:57,518 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-09-07 20:28:57,518 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-09-07 20:28:57,518 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,519 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 23 1656) the Hoare annotation is: (let ((.cse34 (not (< 0 (+ |old(~a29~0)| 144)))) (.cse7 (= 2 |old(~a2~0)|)) (.cse28 (not (= 3 |old(~a2~0)|))) (.cse30 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse40 (= 4 |old(~a2~0)|)) (.cse44 (+ |old(~a0~0)| 147))) (let ((.cse2 (= ~a2~0 |old(~a2~0)|)) (.cse31 (= 4 ~a2~0)) (.cse42 (+ |old(~a4~0)| 86)) (.cse45 (not (< 0 .cse44))) (.cse41 (+ |old(~a29~0)| 127)) (.cse0 (= ~a29~0 |old(~a29~0)|)) (.cse3 (= ~a0~0 |old(~a0~0)|)) (.cse1 (= ~a4~0 |old(~a4~0)|)) (.cse13 (or .cse30 .cse40)) (.cse39 (= 1 |old(~a2~0)|)) (.cse36 (not (<= (+ |old(~a0~0)| 216075) 0))) (.cse17 (not (<= |old(~a2~0)| 2))) (.cse18 (and (not .cse7) .cse28)) (.cse46 (or .cse30 .cse34 .cse40))) (let ((.cse25 (or .cse7 .cse46)) (.cse6 (not (<= |old(~a29~0)| 41))) (.cse14 (or (or .cse46 .cse17) .cse18)) (.cse26 (not (<= 280404 |old(~a29~0)|))) (.cse37 (or .cse34 .cse7 .cse39 .cse36)) (.cse4 (not .cse39)) (.cse24 (not (<= (+ |old(~a0~0)| 98) 0))) (.cse33 (or (or .cse13 .cse17) .cse18)) (.cse29 (not (<= 0 (+ |old(~a29~0)| 599999)))) (.cse16 (and .cse0 (= 2 ~a2~0) .cse3 .cse1)) (.cse19 (not (<= 0 (+ |old(~a0~0)| 60)))) (.cse38 (not (<= 0 (+ |old(~a29~0)| 192415)))) (.cse35 (not (<= .cse41 0))) (.cse10 (not (<= (+ |old(~a0~0)| 99) 0))) (.cse12 (and (not (< 0 (+ |old(~a29~0)| 16))) .cse45)) (.cse20 (not .cse40)) (.cse32 (and (not (< 0 .cse42)) .cse45 .cse40)) (.cse21 (and .cse0 .cse31 .cse3 .cse1)) (.cse11 (and .cse0 .cse2 .cse3 .cse1)) (.cse8 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse23 (not (<= .cse44 0))) (.cse15 (forall ((v_~a29~0_903 Int)) (let ((.cse43 (mod v_~a29~0_903 29))) (or (not (= .cse43 0)) (not (< 43 v_~a29~0_903)) (not (= (mod .cse43 5) 0)) (not (<= (div (+ .cse43 15) 5) (+ |old(~a29~0)| 16))) (= (mod (+ .cse43 1) 5) 0) (not (< .cse43 14)))))) (.cse9 (or .cse34 .cse40)) (.cse5 (not (<= .cse42 0))) (.cse22 (not (<= 0 .cse41))) (.cse27 (and .cse0 .cse3 (= 3 ~a2~0) .cse1))) (and (or (and (and .cse0 .cse1) .cse2 .cse3) (or .cse4 .cse5) .cse6) (or .cse7 .cse8 .cse9 .cse10 .cse6 .cse11 .cse12) (or .cse13 .cse11 .cse10) (or (and .cse3 .cse0 .cse2 .cse1) .cse14 .cse15) (or .cse8 .cse16 .cse17 .cse15 .cse18 .cse10) (or .cse19 .cse20 .cse21 .cse5 .cse22) (or .cse16 (or .cse8 .cse23 .cse17 .cse18) .cse12) (or .cse24 .cse25 .cse11) (or .cse25 .cse22 .cse11) (or (not (<= 2 |old(~a2~0)|)) (or .cse8 .cse9 .cse24) .cse26 (and .cse2 (and .cse0 .cse3) .cse1)) (or .cse8 .cse27 .cse10 .cse28) (or .cse29 (or .cse20 .cse30) (and (and .cse0 .cse31 .cse3) .cse1) .cse32) (or .cse29 .cse16 .cse33 (not (<= (+ |old(~a29~0)| 192406) 0))) (or (or .cse4 .cse34) .cse8 .cse6 .cse12 .cse11) (or .cse11 .cse8 .cse6 .cse15 .cse9 .cse24) (or .cse23 .cse11 (or .cse30 .cse34)) (or .cse33 .cse11 .cse24) (or .cse27 (or .cse30 .cse28)) (or .cse19 .cse17 .cse35 .cse16 .cse5 .cse29 .cse18) (or .cse8 (or .cse7 .cse9 .cse36) .cse11) (or (and (and .cse0 .cse2 .cse1) .cse3) (or (forall ((v_~a4~0_777 Int)) (or (not (<= (+ v_~a4~0_777 42) 0)) (not (= 0 (mod (+ v_~a4~0_777 2) 5))) (not (<= |old(~a4~0)| (* 5 (div (+ v_~a4~0_777 (- 172293)) 5)))))) .cse14)) (or .cse20 .cse8 .cse21 .cse26 .cse37) (or .cse20 .cse8 .cse21 .cse37 .cse32) (or (and (and (and .cse0 .cse2) .cse3) .cse1) (or .cse38 .cse4 .cse8 .cse24) .cse12) (or .cse38 .cse35 .cse33 .cse16) (or .cse8 .cse22 .cse11 (or .cse19 .cse7 .cse39 .cse9)) (or .cse20 .cse8 .cse23 .cse35 .cse32 .cse21 .cse29) (or .cse16 .cse19 .cse17 .cse15 .cse5 .cse18) (or .cse38 .cse7 .cse8 .cse35 .cse10 .cse11 .cse12 .cse40) (or .cse20 .cse8 .cse23 .cse32 .cse15 .cse21) (or .cse11 .cse8 .cse23 .cse15 .cse9) (or (or .cse5 .cse28) .cse22 .cse27))))) [2019-09-07 20:28:57,519 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,519 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,519 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,519 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,519 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,519 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,519 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,519 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,519 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-09-07 20:28:57,520 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-09-07 20:28:57,520 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-09-07 20:28:57,520 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,520 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-09-07 20:28:57,520 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-09-07 20:28:57,520 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,520 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,520 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,520 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,520 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,521 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,521 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,521 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,521 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,521 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,521 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,521 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,521 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,521 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-09-07 20:28:57,521 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-09-07 20:28:57,522 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-09-07 20:28:57,522 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,522 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,522 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,522 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,522 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,522 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,522 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,522 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,523 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,523 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,523 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,523 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-09-07 20:28:57,523 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,523 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-09-07 20:28:57,523 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,523 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-09-07 20:28:57,523 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-09-07 20:28:57,523 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-09-07 20:28:57,523 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,524 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-09-07 20:28:57,524 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-09-07 20:28:57,524 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,524 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-09-07 20:28:57,524 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-09-07 20:28:57,524 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,524 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-09-07 20:28:57,524 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-09-07 20:28:57,524 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,524 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,525 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,525 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,525 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,525 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,525 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,525 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,526 INFO L439 ceAbstractionStarter]: At program point L1655(line 1655) the Hoare annotation is: (let ((.cse24 (= 3 ~a2~0)) (.cse15 (= 2 |old(~a2~0)|)) (.cse23 (not (= 3 |old(~a2~0)|))) (.cse57 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse59 (not (< 0 (+ |old(~a29~0)| 144)))) (.cse42 (= 4 |old(~a2~0)|))) (let ((.cse73 (+ |old(~a4~0)| 86)) (.cse61 (= 1 |old(~a2~0)|)) (.cse16 (or .cse57 .cse59 .cse42)) (.cse51 (not (<= |old(~a2~0)| 2))) (.cse30 (and (not .cse15) .cse23)) (.cse71 (+ ~a4~0 86)) (.cse66 (<= ~a29~0 43)) (.cse67 (not .cse24)) (.cse78 (< 0 (+ ~a29~0 16))) (.cse34 (= 4 ~a2~0)) (.cse75 (+ |old(~a0~0)| 147)) (.cse2 (= ~a29~0 |old(~a29~0)|)) (.cse55 (= ~a2~0 |old(~a2~0)|)) (.cse6 (= ~a0~0 |old(~a0~0)|))) (let ((.cse60 (and .cse2 .cse55 .cse6)) (.cse74 (not (< 0 .cse75))) (.cse62 (= 1 ~a2~0)) (.cse40 (not (<= (+ |old(~a0~0)| 216075) 0))) (.cse69 (not (= 4 calculate_output_~input))) (.cse65 (not (= 5 calculate_output_~input))) (.cse68 (not (= 6 calculate_output_~input))) (.cse70 (not (= 2 calculate_output_~input))) (.cse4 (< 0 (+ ~a29~0 144))) (.cse77 (and (or .cse66 .cse67) (or .cse78 (not .cse34)))) (.cse56 (not (= 1 calculate_output_~input))) (.cse54 (< 0 (+ ~a0~0 147))) (.cse25 (or .cse57 .cse42)) (.cse76 (+ |old(~a29~0)| 127)) (.cse9 (< 0 .cse71)) (.cse5 (<= (+ ~a0~0 61) 0)) (.cse45 (forall ((v_~a4~0_777 Int)) (or (not (<= (+ v_~a4~0_777 42) 0)) (not (= 0 (mod (+ v_~a4~0_777 2) 5))) (not (<= |old(~a4~0)| (* 5 (div (+ v_~a4~0_777 (- 172293)) 5))))))) (.cse63 (or (or .cse16 .cse51) .cse30)) (.cse19 (= |calculate_output_#in~input| calculate_output_~input)) (.cse7 (= ~a4~0 |old(~a4~0)|)) (.cse48 (= 2 ~a2~0)) (.cse58 (not .cse61)) (.cse22 (not (<= .cse73 0)))) (let ((.cse0 (or .cse58 .cse22)) (.cse44 (and .cse19 .cse7 (and (and (<= (+ ~a4~0 89) 0) .cse48 .cse2 .cse55) .cse6))) (.cse20 (or .cse45 .cse63)) (.cse47 (or (not .cse48) .cse78 .cse9 (not (= calculate_output_~input 4)) .cse5)) (.cse1 (not (<= .cse76 0))) (.cse50 (and .cse2 .cse19 .cse34 .cse6 .cse7)) (.cse28 (and .cse2 .cse7 .cse55 .cse19 .cse6)) (.cse43 (or (or .cse25 .cse51) .cse30)) (.cse33 (or .cse77 .cse56 .cse54)) (.cse8 (and .cse4 .cse2 .cse55 (<= (+ ~a0~0 216075) 0) .cse6 .cse7)) (.cse35 (or .cse77 .cse54 .cse70)) (.cse36 (or .cse77 .cse68 .cse54)) (.cse37 (or .cse77 .cse65 .cse54)) (.cse38 (or .cse77 .cse69 .cse54)) (.cse12 (or .cse59 .cse15 .cse61 .cse40)) (.cse3 (and (<= ~a2~0 |old(~a2~0)|) .cse62)) (.cse13 (not (<= 280404 |old(~a29~0)|))) (.cse26 (and .cse2 .cse55 .cse6 .cse7)) (.cse17 (not (<= 0 .cse76))) (.cse41 (not (<= 0 (+ |old(~a29~0)| 192415)))) (.cse52 (not (<= |old(~a29~0)| 41))) (.cse18 (and (not (< 0 (+ |old(~a29~0)| 16))) .cse74)) (.cse14 (and .cse19 .cse60 .cse7)) (.cse53 (not (<= (+ |old(~a0~0)| 98) 0))) (.cse27 (not (<= (+ |old(~a0~0)| 99) 0))) (.cse11 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse31 (not (<= .cse75 0))) (.cse39 (or .cse59 .cse42)) (.cse21 (not (<= 0 (+ |old(~a29~0)| 599999)))) (.cse10 (not .cse42)) (.cse32 (and (not (< 0 .cse73)) .cse74 .cse42)) (.cse49 (not (<= 0 (+ |old(~a0~0)| 60)))) (.cse29 (forall ((v_~a29~0_903 Int)) (let ((.cse72 (mod v_~a29~0_903 29))) (or (not (= .cse72 0)) (not (< 43 v_~a29~0_903)) (not (= (mod .cse72 5) 0)) (not (<= (div (+ .cse72 15) 5) (+ |old(~a29~0)| 16))) (= (mod (+ .cse72 1) 5) 0) (not (< .cse72 14))))))) (and (or .cse0 .cse1 (and .cse2 .cse3 (or .cse4 .cse5) .cse6 .cse7)) (or (and .cse8 .cse9) (or .cse10 .cse11 .cse12) .cse13) (or .cse14 (or .cse15 .cse16) .cse17 .cse18) (or .cse19 .cse17 .cse20) (or .cse21 .cse0 .cse1 .cse19) (or (or .cse22 .cse23) (and .cse2 .cse19 .cse6 .cse24 .cse7) .cse17) (or .cse25 .cse26 .cse27) (or .cse11 .cse28 .cse29 .cse30 .cse27) (or .cse10 .cse11 .cse31 .cse1 .cse32 .cse21 (and .cse2 .cse33 .cse19 .cse34 .cse35 .cse36 .cse37 .cse38 .cse6 .cse7)) (or .cse11 .cse14 (or .cse15 .cse39 .cse40)) (or .cse41 .cse15 .cse11 .cse1 .cse28 .cse27 .cse18 .cse42) (or .cse21 .cse43 .cse44 .cse18 (not (<= (+ |old(~a29~0)| 192406) 0))) (or .cse10 (or .cse45 .cse31) (forall ((v_~a29~0_904 Int) (v_~a29~0_905 Int)) (let ((.cse46 (mod (+ v_~a29~0_904 17705) 299928))) (or (not (<= .cse46 (+ v_~a29~0_905 599999))) (= 0 .cse46) (not (< (+ v_~a29~0_904 317633) 0)) (not (<= (+ (div v_~a29~0_905 5) 340362) |old(~a29~0)|)) (not (= (mod v_~a29~0_905 5) 0)))))) (or .cse41 .cse44 .cse1 .cse43 .cse18) (or .cse20 (and .cse47 (and .cse48 .cse2 .cse6) .cse7)) (or .cse49 .cse10 .cse50 .cse22 .cse17) (or .cse49 (and .cse2 .cse19 .cse47 .cse48 .cse6 .cse7) .cse51 .cse1 .cse22 .cse21 .cse30) (or .cse11 .cse52 .cse29 .cse28 .cse39 .cse53) (or (or .cse9 .cse54 .cse4) .cse11 .cse27 .cse23) (or .cse10 .cse11 .cse31 .cse50 .cse32 .cse29) (or .cse11 .cse31 .cse51 .cse18 .cse28) (or .cse43 .cse53 (and (and .cse2 .cse55 .cse7) .cse6)) (or .cse10 (and .cse33 .cse8 .cse19 .cse35 .cse36 .cse37 .cse38) .cse11 .cse12 .cse32) (or (and (and (and (and .cse2 (or .cse56 .cse4 .cse5)) .cse24) .cse6) .cse19 .cse7) (or .cse57 .cse23)) (or (and .cse2 .cse19 .cse3 .cse6 .cse7) (or .cse58 .cse59) .cse11 .cse52 .cse18) (or .cse10 .cse45 .cse19 .cse52 .cse59) (or (not (<= 2 |old(~a2~0)|)) (or .cse11 .cse39 .cse53) .cse13 (and .cse19 .cse7 .cse60)) (or .cse22 (or .cse31 .cse58) .cse26) (or .cse11 (and (and .cse2 .cse55) .cse19 .cse6 .cse7) .cse17 (or .cse49 .cse15 .cse61 .cse39)) (or (and .cse2 .cse19 .cse7 (and .cse62 .cse6)) (or .cse41 .cse58 .cse11 .cse53) .cse18) (or .cse15 (and .cse2 .cse55 .cse19 .cse6 .cse7) .cse11 .cse39 .cse27 .cse52 .cse18) (or .cse14 .cse63 .cse29) (or (and (and (and .cse2 .cse7) .cse55) .cse6) (or .cse57 .cse59) .cse53) (or .cse11 (and .cse19 .cse2 .cse6 .cse24 .cse7) .cse27 .cse23) (or .cse11 .cse31 (let ((.cse64 (<= .cse71 0))) (and .cse2 (or .cse64 .cse65 .cse66 .cse67) (or .cse64 .cse68 .cse66 .cse67) .cse7 .cse55 .cse19 (or .cse64 .cse69 .cse66 .cse67) (or .cse64 .cse56 .cse66 .cse67) .cse6 (or .cse64 .cse66 .cse70 .cse67))) .cse29 .cse39) (or (and (and .cse2 .cse7 .cse6 .cse34) .cse19) .cse21 (or .cse10 .cse57) .cse32) (or .cse49 .cse51 .cse29 (and .cse2 .cse19 .cse48 .cse6 .cse7) .cse22 .cse30)))))) [2019-09-07 20:28:57,526 INFO L443 ceAbstractionStarter]: For program point L1655-1(line 1655) no Hoare annotation was computed. [2019-09-07 20:28:57,527 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,527 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-09-07 20:28:57,527 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-09-07 20:28:57,527 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-09-07 20:28:57,527 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,527 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,527 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,527 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,528 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,528 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,528 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,529 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,529 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,529 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,529 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-09-07 20:28:57,530 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-09-07 20:28:57,530 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,530 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,530 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-09-07 20:28:57,530 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-09-07 20:28:57,530 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-09-07 20:28:57,530 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,530 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,530 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,530 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-09-07 20:28:57,531 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-09-07 20:28:57,531 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,531 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,531 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,531 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,531 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,531 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,531 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,531 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,531 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,532 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-09-07 20:28:57,532 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-09-07 20:28:57,532 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,532 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,532 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,532 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,532 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,533 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,533 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,533 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-09-07 20:28:57,533 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,533 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-09-07 20:28:57,533 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,533 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-09-07 20:28:57,533 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,533 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-09-07 20:28:57,534 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,534 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-09-07 20:28:57,534 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-09-07 20:28:57,534 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,534 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,534 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,534 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,534 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,534 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,534 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,534 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,534 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,535 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,535 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,535 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,535 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-09-07 20:28:57,535 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-09-07 20:28:57,535 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,535 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,535 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,535 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,535 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,535 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,535 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,535 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,535 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,535 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,536 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,536 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-09-07 20:28:57,536 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-09-07 20:28:57,536 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,536 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,536 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-09-07 20:28:57,536 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-09-07 20:28:57,536 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,536 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,536 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,536 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,536 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,536 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,536 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,536 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,536 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,537 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,537 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,537 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,537 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,537 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,537 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-09-07 20:28:57,537 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-09-07 20:28:57,537 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-09-07 20:28:57,537 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,537 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-09-07 20:28:57,537 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,537 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,537 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,537 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,537 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,537 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,538 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,538 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-09-07 20:28:57,538 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,538 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,538 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,538 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,538 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-09-07 20:28:57,538 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-09-07 20:28:57,538 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-09-07 20:28:57,538 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,538 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,538 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,538 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,538 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,538 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,538 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,538 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,539 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,539 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,539 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,539 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-09-07 20:28:57,539 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-09-07 20:28:57,539 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,539 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-09-07 20:28:57,539 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,539 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-09-07 20:28:57,539 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,539 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,539 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-09-07 20:28:57,539 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-09-07 20:28:57,539 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-09-07 20:28:57,540 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,540 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,540 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,540 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,540 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,540 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,540 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,540 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-09-07 20:28:57,540 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-09-07 20:28:57,540 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-09-07 20:28:57,541 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-09-07 20:28:57,541 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,541 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,541 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,541 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,541 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,541 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,541 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-09-07 20:28:57,541 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-09-07 20:28:57,541 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-09-07 20:28:57,541 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,542 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,542 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,542 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,542 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,542 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-09-07 20:28:57,542 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-09-07 20:28:57,542 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,542 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,542 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,542 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:28:57,542 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-09-07 20:28:57,543 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-09-07 20:28:57,543 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,543 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-09-07 20:28:57,543 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-09-07 20:28:57,543 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,543 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-09-07 20:28:57,543 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,543 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,543 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,544 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,544 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,544 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,544 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-09-07 20:28:57,544 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,544 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-09-07 20:28:57,544 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-09-07 20:28:57,545 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 20:28:57,545 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= (+ ~a4~0 89) 0) (<= 0 (+ ~a0~0 60)) (= 1 ~a2~0) (= (+ ~a29~0 127) 0)) [2019-09-07 20:28:57,545 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 20:28:57,545 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 20:28:57,545 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1760 1776) the Hoare annotation is: (or (not (<= 0 (+ |old(~a0~0)| 60))) (not (= 1 |old(~a2~0)|)) (not (= 0 (+ |old(~a29~0)| 127))) (and (= 1 ~a2~0) (= ~a0~0 |old(~a0~0)|) (= ~a4~0 |old(~a4~0)|) (= (+ ~a29~0 127) 0)) (not (<= (+ |old(~a4~0)| 89) 0))) [2019-09-07 20:28:57,545 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1760 1776) no Hoare annotation was computed. [2019-09-07 20:28:57,546 INFO L439 ceAbstractionStarter]: At program point L1774(line 1774) the Hoare annotation is: (let ((.cse26 (= 4 ~a2~0))) (let ((.cse38 (= 2 ~a2~0)) (.cse3 (= 3 ~a2~0)) (.cse19 (< 0 (+ ~a29~0 144))) (.cse25 (<= (+ ~a4~0 89) 0)) (.cse13 (not .cse26))) (let ((.cse36 (+ ~a0~0 147)) (.cse20 (and .cse25 .cse13)) (.cse32 (<= ~a2~0 2)) (.cse34 (and .cse25 .cse19 .cse13)) (.cse0 (= 1 |old(~a2~0)|)) (.cse17 (or .cse38 .cse3)) (.cse37 (+ ~a4~0 86)) (.cse35 (+ ~a29~0 127)) (.cse14 (= 1 ~a2~0))) (let ((.cse10 (<= (+ ~a0~0 216075) 0)) (.cse22 (and .cse19 .cse14)) (.cse2 (<= 0 .cse35)) (.cse23 (and (= ~a2~0 |old(~a2~0)|) .cse14)) (.cse9 (<= 280404 ~a29~0)) (.cse1 (<= .cse37 0)) (.cse16 (<= 0 (+ ~a0~0 60))) (.cse30 (and (and (and .cse32 .cse34) .cse0 .cse17) (<= 0 (+ |old(~a0~0)| 97)))) (.cse8 (exists ((v_~a29~0_903 Int)) (let ((.cse39 (mod v_~a29~0_903 29))) (and (< 43 v_~a29~0_903) (< .cse39 14) (not (= (mod (+ .cse39 1) 5) 0)) (<= (div (+ .cse39 15) 5) (+ ~a29~0 16)) (= (mod .cse39 5) 0) (= .cse39 0))))) (.cse31 (<= 0 (+ ~a29~0 599999))) (.cse27 (and .cse0 .cse20 .cse38)) (.cse11 (<= ~a29~0 41)) (.cse15 (not (= ~a2~0 2))) (.cse18 (<= (+ ~a0~0 99) 0)) (.cse28 (<= 0 (+ ~a29~0 192415))) (.cse21 (or (< 0 (+ ~a29~0 16)) (< 0 .cse36))) (.cse4 (< 0 .cse37)) (.cse5 (<= .cse36 0)) (.cse6 (or (= 3 main_~input~0) (= 1 main_~input~0) (= 4 main_~input~0) (= 5 main_~input~0) (= 6 main_~input~0) (= 2 main_~input~0))) (.cse7 (<= (+ ~a4~0 42) 0)) (.cse24 (<= .cse35 0)) (.cse29 (+ |old(~a29~0)| 127)) (.cse12 (<= (+ ~a0~0 98) 0))) (or (not .cse0) (and .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse7 .cse10) (and .cse11 .cse12 .cse7 .cse13 .cse8) (and (not .cse14) .cse2 .cse15 .cse7 .cse16 .cse13) (and .cse7 (and .cse17 .cse18) .cse8) (and .cse7 .cse18 .cse3) (and .cse4 .cse6 .cse15 .cse7 .cse19 .cse10) (and .cse20 .cse18) (and .cse7 (and .cse5 .cse13) .cse21) (and .cse15 .cse7 .cse10 .cse19 .cse13) (and .cse11 .cse7 .cse22 .cse21) (and (and .cse1 .cse23) .cse24) (and .cse25 .cse2 .cse15) (and .cse1 .cse5 .cse22) (and .cse1 .cse16 .cse17 .cse8) (and .cse1 .cse26 .cse2 .cse16) (and .cse25 .cse3) (and .cse12 .cse27) (and (and .cse7 (and .cse12 .cse23) .cse28) .cse21) (not (<= .cse29 0)) (and (exists ((v_~a4~0_777 Int)) (and (<= (+ v_~a4~0_777 42) 0) (= 0 (mod (+ v_~a4~0_777 2) 5)) (<= ~a4~0 (* 5 (div (+ v_~a4~0_777 (- 172293)) 5))))) .cse30) (and (and .cse26 .cse25) .cse31 .cse21) (not (<= 0 (+ |old(~a0~0)| 60))) (and (<= 2 ~a2~0) (and .cse12 .cse7 .cse13) .cse9) (and .cse1 .cse16 .cse17 .cse32 .cse31 .cse24) (and .cse30 .cse8) (and .cse31 .cse24 .cse27) (and .cse11 .cse15 .cse7 .cse18 .cse13 .cse28 .cse21) (and .cse25 .cse5 .cse19) (and (exists ((v_~a29~0_904 Int)) (let ((.cse33 (mod (+ v_~a29~0_904 17705) 299928))) (and (<= .cse33 (+ ~a29~0 599999)) (< (+ v_~a29~0_904 317633) 0) (not (= 0 .cse33))))) .cse4 .cse5 .cse6 .cse26 .cse7 .cse24) (not (<= (+ |old(~a4~0)| 89) 0)) (not (<= 0 .cse29)) (and .cse12 .cse34)))))) [2019-09-07 20:28:57,546 INFO L443 ceAbstractionStarter]: For program point L1774-1(line 1774) no Hoare annotation was computed. [2019-09-07 20:28:57,546 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-09-07 20:28:57,546 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse25 (= 4 ~a2~0))) (let ((.cse37 (= 2 ~a2~0)) (.cse3 (= 3 ~a2~0)) (.cse20 (< 0 (+ ~a29~0 144))) (.cse24 (<= (+ ~a4~0 89) 0)) (.cse12 (not .cse25))) (let ((.cse34 (+ ~a0~0 147)) (.cse18 (and .cse24 .cse12)) (.cse31 (<= ~a2~0 2)) (.cse33 (and .cse24 .cse20 .cse12)) (.cse0 (= 1 |old(~a2~0)|)) (.cse16 (or .cse37 .cse3)) (.cse36 (+ ~a4~0 86)) (.cse35 (+ ~a29~0 127)) (.cse13 (= 1 ~a2~0))) (let ((.cse21 (and .cse20 .cse13)) (.cse2 (<= 0 .cse35)) (.cse9 (<= (+ ~a0~0 216075) 0)) (.cse22 (and (= ~a2~0 |old(~a2~0)|) .cse13)) (.cse8 (<= 280404 ~a29~0)) (.cse1 (<= .cse36 0)) (.cse15 (<= 0 (+ ~a0~0 60))) (.cse29 (and (and (and .cse31 .cse33) .cse0 .cse16) (<= 0 (+ |old(~a0~0)| 97)))) (.cse7 (exists ((v_~a29~0_903 Int)) (let ((.cse38 (mod v_~a29~0_903 29))) (and (< 43 v_~a29~0_903) (< .cse38 14) (not (= (mod (+ .cse38 1) 5) 0)) (<= (div (+ .cse38 15) 5) (+ ~a29~0 16)) (= (mod .cse38 5) 0) (= .cse38 0))))) (.cse30 (<= 0 (+ ~a29~0 599999))) (.cse26 (and .cse0 .cse18 .cse37)) (.cse4 (< 0 .cse36)) (.cse23 (<= .cse35 0)) (.cse10 (<= ~a29~0 41)) (.cse14 (not (= ~a2~0 2))) (.cse6 (<= (+ ~a4~0 42) 0)) (.cse17 (<= (+ ~a0~0 99) 0)) (.cse27 (<= 0 (+ ~a29~0 192415))) (.cse19 (or (< 0 (+ ~a29~0 16)) (< 0 .cse34))) (.cse5 (<= .cse34 0)) (.cse28 (+ |old(~a29~0)| 127)) (.cse11 (<= (+ ~a0~0 98) 0))) (or (not .cse0) (and .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse6 .cse9) (and .cse10 .cse11 .cse6 .cse12 .cse7) (and (not .cse13) .cse2 .cse14 .cse6 .cse15 .cse12) (and .cse6 (and .cse16 .cse17) .cse7) (and .cse6 .cse17 .cse3) (and .cse18 .cse17) (and .cse6 (and .cse5 .cse12) .cse19) (and .cse14 .cse6 .cse9 .cse20 .cse12) (and .cse10 .cse6 .cse21 .cse19) (and (and .cse1 .cse22) .cse23) (and .cse24 .cse2 .cse14) (and .cse1 .cse5 .cse21) (and .cse1 .cse15 .cse16 .cse7) (and .cse1 .cse25 .cse2 .cse15) (and .cse24 .cse3) (and .cse11 .cse26) (and .cse4 .cse14 .cse6 .cse20 .cse9) (and (and .cse6 (and .cse11 .cse22) .cse27) .cse19) (not (<= .cse28 0)) (and (exists ((v_~a4~0_777 Int)) (and (<= (+ v_~a4~0_777 42) 0) (= 0 (mod (+ v_~a4~0_777 2) 5)) (<= ~a4~0 (* 5 (div (+ v_~a4~0_777 (- 172293)) 5))))) .cse29) (and (and .cse25 .cse24) .cse30 .cse19) (not (<= 0 (+ |old(~a0~0)| 60))) (and (<= 2 ~a2~0) (and .cse11 .cse6 .cse12) .cse8) (and .cse1 .cse15 .cse16 .cse31 .cse30 .cse23) (and .cse29 .cse7) (and .cse30 .cse23 .cse26) (and (exists ((v_~a29~0_904 Int)) (let ((.cse32 (mod (+ v_~a29~0_904 17705) 299928))) (and (<= .cse32 (+ ~a29~0 599999)) (< (+ v_~a29~0_904 317633) 0) (not (= 0 .cse32))))) .cse4 .cse5 .cse25 .cse6 .cse23) (and .cse10 .cse14 .cse6 .cse17 .cse12 .cse27 .cse19) (and .cse24 .cse5 .cse20) (not (<= (+ |old(~a4~0)| 89) 0)) (not (<= 0 .cse28)) (and .cse11 .cse33)))))) [2019-09-07 20:28:57,546 INFO L443 ceAbstractionStarter]: For program point L1766-3(lines 1760 1776) no Hoare annotation was computed. [2019-09-07 20:28:57,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,562 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,562 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,563 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,563 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,566 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,566 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,568 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,568 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,569 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,569 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,570 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,570 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a4~0_777,QUANTIFIED] [2019-09-07 20:28:57,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a4~0_777,QUANTIFIED] [2019-09-07 20:28:57,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a4~0_777,QUANTIFIED] [2019-09-07 20:28:57,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:28:57,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:28:57,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:28:57,591 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,591 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,592 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,592 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,593 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,593 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,593 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,594 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,594 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,596 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,596 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,596 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a4~0_777,QUANTIFIED] [2019-09-07 20:28:57,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a4~0_777,QUANTIFIED] [2019-09-07 20:28:57,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a4~0_777,QUANTIFIED] [2019-09-07 20:28:57,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,603 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,603 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:28:57,603 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:28:57,603 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:28:57,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 08:28:57 BoogieIcfgContainer [2019-09-07 20:28:57,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 20:28:57,611 INFO L168 Benchmark]: Toolchain (without parser) took 509261.12 ms. Allocated memory was 133.2 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 83.0 MB in the beginning and 346.9 MB in the end (delta: -263.8 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-09-07 20:28:57,611 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory was 106.4 MB in the beginning and 106.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 20:28:57,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1637.37 ms. Allocated memory was 133.2 MB in the beginning and 203.4 MB in the end (delta: 70.3 MB). Free memory was 82.8 MB in the beginning and 108.4 MB in the end (delta: -25.6 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-09-07 20:28:57,613 INFO L168 Benchmark]: Boogie Preprocessor took 228.92 ms. Allocated memory is still 203.4 MB. Free memory was 108.4 MB in the beginning and 95.5 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2019-09-07 20:28:57,613 INFO L168 Benchmark]: RCFGBuilder took 4805.78 ms. Allocated memory was 203.4 MB in the beginning and 274.7 MB in the end (delta: 71.3 MB). Free memory was 95.5 MB in the beginning and 89.2 MB in the end (delta: 6.4 MB). Peak memory consumption was 77.7 MB. Max. memory is 7.1 GB. [2019-09-07 20:28:57,614 INFO L168 Benchmark]: TraceAbstraction took 502584.50 ms. Allocated memory was 274.7 MB in the beginning and 2.8 GB in the end (delta: 2.5 GB). Free memory was 89.2 MB in the beginning and 346.9 MB in the end (delta: -257.7 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-09-07 20:28:57,618 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.22 ms. Allocated memory is still 133.2 MB. Free memory was 106.4 MB in the beginning and 106.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1637.37 ms. Allocated memory was 133.2 MB in the beginning and 203.4 MB in the end (delta: 70.3 MB). Free memory was 82.8 MB in the beginning and 108.4 MB in the end (delta: -25.6 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 228.92 ms. Allocated memory is still 203.4 MB. Free memory was 108.4 MB in the beginning and 95.5 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4805.78 ms. Allocated memory was 203.4 MB in the beginning and 274.7 MB in the end (delta: 71.3 MB). Free memory was 95.5 MB in the beginning and 89.2 MB in the end (delta: 6.4 MB). Peak memory consumption was 77.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 502584.50 ms. Allocated memory was 274.7 MB in the beginning and 2.8 GB in the end (delta: 2.5 GB). Free memory was 89.2 MB in the beginning and 346.9 MB in the end (delta: -257.7 MB). Peak memory consumption was 2.4 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_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a4~0_777,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a4~0_777,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a4~0_777,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a4~0_777,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a4~0_777,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a4~0_777,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 172]: 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: 1766]: Loop Invariant [2019-09-07 20:28:57,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,637 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,637 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,637 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,639 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,639 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,639 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,640 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,640 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,640 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,641 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a4~0_777,QUANTIFIED] [2019-09-07 20:28:57,641 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a4~0_777,QUANTIFIED] [2019-09-07 20:28:57,641 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a4~0_777,QUANTIFIED] [2019-09-07 20:28:57,641 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,642 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,642 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,642 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,642 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:28:57,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:28:57,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:28:57,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,654 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,654 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a4~0_777,QUANTIFIED] [2019-09-07 20:28:57,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a4~0_777,QUANTIFIED] [2019-09-07 20:28:57,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a4~0_777,QUANTIFIED] [2019-09-07 20:28:57,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-09-07 20:28:57,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:28:57,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] [2019-09-07 20:28:57,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_904,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((!(1 == \old(a2)) || ((a4 + 86 <= 0 && 0 <= a29 + 127) && 3 == a2)) || (((0 < a4 + 86 && a0 + 147 <= 0) && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: ((((43 < v_~a29~0_903 && v_~a29~0_903 % 29 < 14) && !((v_~a29~0_903 % 29 + 1) % 5 == 0)) && (v_~a29~0_903 % 29 + 15) / 5 <= a29 + 16) && v_~a29~0_903 % 29 % 5 == 0) && v_~a29~0_903 % 29 == 0))) || ((280404 <= a29 && a4 + 42 <= 0) && a0 + 216075 <= 0)) || ((((a29 <= 41 && a0 + 98 <= 0) && a4 + 42 <= 0) && !(4 == a2)) && (\exists v_~a29~0_903 : int :: ((((43 < v_~a29~0_903 && v_~a29~0_903 % 29 < 14) && !((v_~a29~0_903 % 29 + 1) % 5 == 0)) && (v_~a29~0_903 % 29 + 15) / 5 <= a29 + 16) && v_~a29~0_903 % 29 % 5 == 0) && v_~a29~0_903 % 29 == 0))) || (((((!(1 == a2) && 0 <= a29 + 127) && !(a2 == 2)) && a4 + 42 <= 0) && 0 <= a0 + 60) && !(4 == a2))) || ((a4 + 42 <= 0 && (2 == a2 || 3 == a2) && a0 + 99 <= 0) && (\exists v_~a29~0_903 : int :: ((((43 < v_~a29~0_903 && v_~a29~0_903 % 29 < 14) && !((v_~a29~0_903 % 29 + 1) % 5 == 0)) && (v_~a29~0_903 % 29 + 15) / 5 <= a29 + 16) && v_~a29~0_903 % 29 % 5 == 0) && v_~a29~0_903 % 29 == 0))) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2)) || ((a4 + 89 <= 0 && !(4 == a2)) && a0 + 99 <= 0)) || ((a4 + 42 <= 0 && a0 + 147 <= 0 && !(4 == a2)) && (0 < a29 + 16 || 0 < a0 + 147))) || ((((!(a2 == 2) && a4 + 42 <= 0) && a0 + 216075 <= 0) && 0 < a29 + 144) && !(4 == a2))) || (((a29 <= 41 && a4 + 42 <= 0) && 0 < a29 + 144 && 1 == a2) && (0 < a29 + 16 || 0 < a0 + 147))) || ((a4 + 86 <= 0 && a2 == \old(a2) && 1 == a2) && a29 + 127 <= 0)) || ((a4 + 89 <= 0 && 0 <= a29 + 127) && !(a2 == 2))) || ((a4 + 86 <= 0 && a0 + 147 <= 0) && 0 < a29 + 144 && 1 == a2)) || (((a4 + 86 <= 0 && 0 <= a0 + 60) && (2 == a2 || 3 == a2)) && (\exists v_~a29~0_903 : int :: ((((43 < v_~a29~0_903 && v_~a29~0_903 % 29 < 14) && !((v_~a29~0_903 % 29 + 1) % 5 == 0)) && (v_~a29~0_903 % 29 + 15) / 5 <= a29 + 16) && v_~a29~0_903 % 29 % 5 == 0) && v_~a29~0_903 % 29 == 0))) || (((a4 + 86 <= 0 && 4 == a2) && 0 <= a29 + 127) && 0 <= a0 + 60)) || (a4 + 89 <= 0 && 3 == a2)) || (a0 + 98 <= 0 && (1 == \old(a2) && a4 + 89 <= 0 && !(4 == a2)) && 2 == a2)) || ((((0 < a4 + 86 && !(a2 == 2)) && a4 + 42 <= 0) && 0 < a29 + 144) && a0 + 216075 <= 0)) || (((a4 + 42 <= 0 && a0 + 98 <= 0 && a2 == \old(a2) && 1 == a2) && 0 <= a29 + 192415) && (0 < a29 + 16 || 0 < a0 + 147))) || !(\old(a29) + 127 <= 0)) || ((\exists v_~a4~0_777 : int :: (v_~a4~0_777 + 42 <= 0 && 0 == (v_~a4~0_777 + 2) % 5) && a4 <= 5 * ((v_~a4~0_777 + -172293) / 5)) && (((a2 <= 2 && (a4 + 89 <= 0 && 0 < a29 + 144) && !(4 == a2)) && 1 == \old(a2)) && (2 == a2 || 3 == a2)) && 0 <= \old(a0) + 97)) || (((4 == a2 && a4 + 89 <= 0) && 0 <= a29 + 599999) && (0 < a29 + 16 || 0 < a0 + 147))) || !(0 <= \old(a0) + 60)) || ((2 <= a2 && (a0 + 98 <= 0 && a4 + 42 <= 0) && !(4 == a2)) && 280404 <= a29)) || (((((a4 + 86 <= 0 && 0 <= a0 + 60) && (2 == a2 || 3 == a2)) && a2 <= 2) && 0 <= a29 + 599999) && a29 + 127 <= 0)) || (((((a2 <= 2 && (a4 + 89 <= 0 && 0 < a29 + 144) && !(4 == a2)) && 1 == \old(a2)) && (2 == a2 || 3 == a2)) && 0 <= \old(a0) + 97) && (\exists v_~a29~0_903 : int :: ((((43 < v_~a29~0_903 && v_~a29~0_903 % 29 < 14) && !((v_~a29~0_903 % 29 + 1) % 5 == 0)) && (v_~a29~0_903 % 29 + 15) / 5 <= a29 + 16) && v_~a29~0_903 % 29 % 5 == 0) && v_~a29~0_903 % 29 == 0))) || ((0 <= a29 + 599999 && a29 + 127 <= 0) && (1 == \old(a2) && a4 + 89 <= 0 && !(4 == a2)) && 2 == a2)) || ((((((\exists v_~a29~0_904 : int :: ((v_~a29~0_904 + 17705) % 299928 <= a29 + 599999 && v_~a29~0_904 + 317633 < 0) && !(0 == (v_~a29~0_904 + 17705) % 299928)) && 0 < a4 + 86) && a0 + 147 <= 0) && 4 == a2) && a4 + 42 <= 0) && a29 + 127 <= 0)) || ((((((a29 <= 41 && !(a2 == 2)) && a4 + 42 <= 0) && a0 + 99 <= 0) && !(4 == a2)) && 0 <= a29 + 192415) && (0 < a29 + 16 || 0 < a0 + 147))) || ((a4 + 89 <= 0 && a0 + 147 <= 0) && 0 < a29 + 144)) || !(\old(a4) + 89 <= 0)) || !(0 <= \old(a29) + 127)) || (a0 + 98 <= 0 && (a4 + 89 <= 0 && 0 < a29 + 144) && !(4 == a2)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 437 locations, 1 error locations. SAFE Result, 502.4s OverallTime, 14 OverallIterations, 9 TraceHistogramMax, 334.3s AutomataDifference, 0.0s DeadEndRemovalTime, 111.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1494 SDtfs, 49611 SDslu, 4851 SDs, 0 SdLazy, 83014 SolverSat, 13022 SolverUnsat, 57 SolverUnknown, 0 SolverNotchecked, 226.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11609 GetRequests, 10965 SyntacticMatches, 9 SemanticMatches, 635 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 25535 ImplicationChecksByTransitivity, 101.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41180occurred in iteration=13, 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: 4.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 20076 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 2780 PreInvPairs, 3383 NumberOfFragments, 8032 HoareAnnotationTreeSize, 2780 FomulaSimplifications, 6742285 FormulaSimplificationTreeSizeReduction, 9.8s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2945891 FormulaSimplificationTreeSizeReductionInter, 101.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 34.8s InterpolantComputationTime, 21694 NumberOfCodeBlocks, 21694 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 21669 ConstructedInterpolants, 53 QuantifiedInterpolants, 117775590 SizeOfPredicates, 22 NumberOfNonLiveVariables, 13976 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 25 InterpolantComputations, 5 PerfectInterpolantSequences, 35843/41532 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...