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/Problem16_label12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:32:00,150 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:32:00,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:32:00,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:32:00,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:32:00,172 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:32:00,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:32:00,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:32:00,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:32:00,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:32:00,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:32:00,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:32:00,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:32:00,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:32:00,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:32:00,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:32:00,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:32:00,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:32:00,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:32:00,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:32:00,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:32:00,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:32:00,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:32:00,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:32:00,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:32:00,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:32:00,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:32:00,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:32:00,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:32:00,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:32:00,229 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:32:00,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:32:00,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:32:00,231 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:32:00,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:32:00,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:32:00,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:32:00,233 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:32:00,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:32:00,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:32:00,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:32:00,235 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-10-02 01:32:00,249 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:32:00,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:32:00,250 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:32:00,251 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:32:00,251 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:32:00,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:32:00,251 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:32:00,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:32:00,252 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:32:00,252 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:32:00,252 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:32:00,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:32:00,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:32:00,252 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:32:00,253 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:32:00,253 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:32:00,253 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:32:00,253 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:32:00,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:32:00,254 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:32:00,254 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:32:00,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:32:00,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:32:00,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:32:00,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:32:00,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:32:00,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:32:00,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:32:00,257 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:32:00,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:32:00,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:32:00,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:32:00,315 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:32:00,316 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:32:00,316 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label12.c [2019-10-02 01:32:00,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7920b94ba/75d58880b4854d249cdfe533db237a33/FLAG3c1d3efbc [2019-10-02 01:32:01,061 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:32:01,063 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label12.c [2019-10-02 01:32:01,085 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7920b94ba/75d58880b4854d249cdfe533db237a33/FLAG3c1d3efbc [2019-10-02 01:32:01,214 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7920b94ba/75d58880b4854d249cdfe533db237a33 [2019-10-02 01:32:01,226 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:32:01,228 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:32:01,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:32:01,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:32:01,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:32:01,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:32:01" (1/1) ... [2019-10-02 01:32:01,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@af48675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:01, skipping insertion in model container [2019-10-02 01:32:01,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:32:01" (1/1) ... [2019-10-02 01:32:01,243 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:32:01,316 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:32:02,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:32:02,191 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:32:02,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:32:02,575 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:32:02,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:02 WrapperNode [2019-10-02 01:32:02,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:32:02,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:32:02,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:32:02,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:32:02,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:02" (1/1) ... [2019-10-02 01:32:02,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:02" (1/1) ... [2019-10-02 01:32:02,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:02" (1/1) ... [2019-10-02 01:32:02,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:02" (1/1) ... [2019-10-02 01:32:02,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:02" (1/1) ... [2019-10-02 01:32:02,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:02" (1/1) ... [2019-10-02 01:32:02,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:02" (1/1) ... [2019-10-02 01:32:02,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:32:02,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:32:02,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:32:02,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:32:02,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:32:02,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:32:02,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:32:02,823 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 01:32:02,823 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-02 01:32:02,823 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:32:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 01:32:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-02 01:32:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:32:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:32:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:32:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:32:02,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:32:02,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:32:05,265 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:32:05,266 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 01:32:05,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:32:05 BoogieIcfgContainer [2019-10-02 01:32:05,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:32:05,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:32:05,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:32:05,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:32:05,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:32:01" (1/3) ... [2019-10-02 01:32:05,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151e1e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:32:05, skipping insertion in model container [2019-10-02 01:32:05,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:32:02" (2/3) ... [2019-10-02 01:32:05,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151e1e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:32:05, skipping insertion in model container [2019-10-02 01:32:05,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:32:05" (3/3) ... [2019-10-02 01:32:05,278 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label12.c [2019-10-02 01:32:05,289 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:32:05,300 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 01:32:05,317 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 01:32:05,367 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:32:05,369 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:32:05,369 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:32:05,369 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:32:05,369 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:32:05,369 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:32:05,369 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:32:05,370 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:32:05,370 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:32:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-10-02 01:32:05,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 01:32:05,415 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:05,416 INFO L411 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] [2019-10-02 01:32:05,418 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:05,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:05,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1524372618, now seen corresponding path program 1 times [2019-10-02 01:32:05,427 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:05,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:05,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:05,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:05,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:32:05,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:32:05,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:32:05,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:32:05,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:32:05,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:32:05,837 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 3 states. [2019-10-02 01:32:08,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:32:08,376 INFO L93 Difference]: Finished difference Result 1153 states and 2141 transitions. [2019-10-02 01:32:08,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:32:08,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-02 01:32:08,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:32:08,399 INFO L225 Difference]: With dead ends: 1153 [2019-10-02 01:32:08,399 INFO L226 Difference]: Without dead ends: 682 [2019-10-02 01:32:08,409 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:32:08,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-10-02 01:32:08,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2019-10-02 01:32:08,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-10-02 01:32:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1184 transitions. [2019-10-02 01:32:08,513 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1184 transitions. Word has length 45 [2019-10-02 01:32:08,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:32:08,513 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1184 transitions. [2019-10-02 01:32:08,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:32:08,514 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1184 transitions. [2019-10-02 01:32:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 01:32:08,520 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:08,520 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:32:08,520 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:08,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:08,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1650431575, now seen corresponding path program 1 times [2019-10-02 01:32:08,521 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:08,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:08,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:08,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:08,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:08,724 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:32:08,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:32:08,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 01:32:08,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 01:32:08,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 01:32:08,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 01:32:08,728 INFO L87 Difference]: Start difference. First operand 682 states and 1184 transitions. Second operand 5 states. [2019-10-02 01:32:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:32:11,428 INFO L93 Difference]: Finished difference Result 2066 states and 3624 transitions. [2019-10-02 01:32:11,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:32:11,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-10-02 01:32:11,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:32:11,437 INFO L225 Difference]: With dead ends: 2066 [2019-10-02 01:32:11,438 INFO L226 Difference]: Without dead ends: 1390 [2019-10-02 01:32:11,440 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:32:11,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-10-02 01:32:11,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1372. [2019-10-02 01:32:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-10-02 01:32:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 2268 transitions. [2019-10-02 01:32:11,519 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 2268 transitions. Word has length 114 [2019-10-02 01:32:11,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:32:11,521 INFO L475 AbstractCegarLoop]: Abstraction has 1372 states and 2268 transitions. [2019-10-02 01:32:11,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 01:32:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2268 transitions. [2019-10-02 01:32:11,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 01:32:11,535 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:11,536 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:32:11,536 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:11,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:11,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1950133058, now seen corresponding path program 1 times [2019-10-02 01:32:11,537 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:11,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:11,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:11,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:11,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:32:11,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:32:11,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:32:11,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:32:11,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:32:11,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:32:11,747 INFO L87 Difference]: Start difference. First operand 1372 states and 2268 transitions. Second operand 6 states. [2019-10-02 01:32:14,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:32:14,861 INFO L93 Difference]: Finished difference Result 3472 states and 5791 transitions. [2019-10-02 01:32:14,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:32:14,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-02 01:32:14,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:32:14,877 INFO L225 Difference]: With dead ends: 3472 [2019-10-02 01:32:14,877 INFO L226 Difference]: Without dead ends: 2106 [2019-10-02 01:32:14,881 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:32:14,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2019-10-02 01:32:14,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 2081. [2019-10-02 01:32:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2019-10-02 01:32:14,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 3263 transitions. [2019-10-02 01:32:14,974 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 3263 transitions. Word has length 143 [2019-10-02 01:32:14,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:32:14,984 INFO L475 AbstractCegarLoop]: Abstraction has 2081 states and 3263 transitions. [2019-10-02 01:32:14,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:32:14,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 3263 transitions. [2019-10-02 01:32:14,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 01:32:14,989 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:14,990 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:32:14,990 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:14,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:14,991 INFO L82 PathProgramCache]: Analyzing trace with hash 903433606, now seen corresponding path program 1 times [2019-10-02 01:32:14,991 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:14,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:14,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:14,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:14,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:32:15,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:32:15,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:32:15,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:32:15,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:32:15,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:32:15,248 INFO L87 Difference]: Start difference. First operand 2081 states and 3263 transitions. Second operand 6 states. [2019-10-02 01:32:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:32:17,777 INFO L93 Difference]: Finished difference Result 5241 states and 8253 transitions. [2019-10-02 01:32:17,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:32:17,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-10-02 01:32:17,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:32:17,795 INFO L225 Difference]: With dead ends: 5241 [2019-10-02 01:32:17,795 INFO L226 Difference]: Without dead ends: 3166 [2019-10-02 01:32:17,800 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:32:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states. [2019-10-02 01:32:17,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 3140. [2019-10-02 01:32:17,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2019-10-02 01:32:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 4128 transitions. [2019-10-02 01:32:17,882 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 4128 transitions. Word has length 161 [2019-10-02 01:32:17,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:32:17,883 INFO L475 AbstractCegarLoop]: Abstraction has 3140 states and 4128 transitions. [2019-10-02 01:32:17,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:32:17,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 4128 transitions. [2019-10-02 01:32:17,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-02 01:32:17,886 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:17,887 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:32:17,887 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:17,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:17,888 INFO L82 PathProgramCache]: Analyzing trace with hash 582436338, now seen corresponding path program 1 times [2019-10-02 01:32:17,888 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:17,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:17,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:17,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:17,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:18,088 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 104 proven. 37 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 01:32:18,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:32:18,088 INFO L224 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-10-02 01:32:18,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:18,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:32:18,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:32:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-02 01:32:18,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:32:18,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-10-02 01:32:18,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:32:18,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:32:18,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:32:18,345 INFO L87 Difference]: Start difference. First operand 3140 states and 4128 transitions. Second operand 6 states. [2019-10-02 01:32:22,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:32:22,149 INFO L93 Difference]: Finished difference Result 8358 states and 11154 transitions. [2019-10-02 01:32:22,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:32:22,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 243 [2019-10-02 01:32:22,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:32:22,181 INFO L225 Difference]: With dead ends: 8358 [2019-10-02 01:32:22,181 INFO L226 Difference]: Without dead ends: 5224 [2019-10-02 01:32:22,190 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:32:22,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5224 states. [2019-10-02 01:32:22,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5224 to 4863. [2019-10-02 01:32:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4863 states. [2019-10-02 01:32:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4863 states to 4863 states and 6273 transitions. [2019-10-02 01:32:22,335 INFO L78 Accepts]: Start accepts. Automaton has 4863 states and 6273 transitions. Word has length 243 [2019-10-02 01:32:22,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:32:22,336 INFO L475 AbstractCegarLoop]: Abstraction has 4863 states and 6273 transitions. [2019-10-02 01:32:22,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:32:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 4863 states and 6273 transitions. [2019-10-02 01:32:22,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-10-02 01:32:22,350 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:22,350 INFO L411 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:32:22,351 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:22,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:22,351 INFO L82 PathProgramCache]: Analyzing trace with hash 948882286, now seen corresponding path program 1 times [2019-10-02 01:32:22,351 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:22,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:22,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:22,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:22,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:22,954 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 231 proven. 115 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-10-02 01:32:22,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:32:22,955 INFO L224 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-10-02 01:32:22,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:23,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:32:23,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:32:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 432 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 01:32:23,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:32:23,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:32:23,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:32:23,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:32:23,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:32:23,272 INFO L87 Difference]: Start difference. First operand 4863 states and 6273 transitions. Second operand 9 states. [2019-10-02 01:32:28,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:32:28,659 INFO L93 Difference]: Finished difference Result 14363 states and 19306 transitions. [2019-10-02 01:32:28,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 01:32:28,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 487 [2019-10-02 01:32:28,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:32:28,715 INFO L225 Difference]: With dead ends: 14363 [2019-10-02 01:32:28,715 INFO L226 Difference]: Without dead ends: 9506 [2019-10-02 01:32:28,730 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-10-02 01:32:28,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9506 states. [2019-10-02 01:32:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9506 to 8439. [2019-10-02 01:32:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8439 states. [2019-10-02 01:32:29,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8439 states to 8439 states and 10958 transitions. [2019-10-02 01:32:29,020 INFO L78 Accepts]: Start accepts. Automaton has 8439 states and 10958 transitions. Word has length 487 [2019-10-02 01:32:29,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:32:29,022 INFO L475 AbstractCegarLoop]: Abstraction has 8439 states and 10958 transitions. [2019-10-02 01:32:29,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:32:29,022 INFO L276 IsEmpty]: Start isEmpty. Operand 8439 states and 10958 transitions. [2019-10-02 01:32:29,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2019-10-02 01:32:29,061 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:29,063 INFO L411 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 01:32:29,064 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:29,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:29,064 INFO L82 PathProgramCache]: Analyzing trace with hash 263331490, now seen corresponding path program 1 times [2019-10-02 01:32:29,064 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:29,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:29,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:29,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:29,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:29,861 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 152 proven. 343 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-10-02 01:32:29,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:32:29,861 INFO L224 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-10-02 01:32:29,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:30,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 01:32:30,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:32:30,348 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2019-10-02 01:32:30,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:32:30,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 01:32:30,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:32:30,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:32:30,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:32:30,356 INFO L87 Difference]: Start difference. First operand 8439 states and 10958 transitions. Second operand 9 states. [2019-10-02 01:32:34,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:32:34,195 INFO L93 Difference]: Finished difference Result 16933 states and 22103 transitions. [2019-10-02 01:32:34,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 01:32:34,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 619 [2019-10-02 01:32:34,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:32:34,245 INFO L225 Difference]: With dead ends: 16933 [2019-10-02 01:32:34,245 INFO L226 Difference]: Without dead ends: 8500 [2019-10-02 01:32:34,274 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 627 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2019-10-02 01:32:34,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8500 states. [2019-10-02 01:32:34,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8500 to 8480. [2019-10-02 01:32:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8480 states. [2019-10-02 01:32:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8480 states to 8480 states and 10665 transitions. [2019-10-02 01:32:34,482 INFO L78 Accepts]: Start accepts. Automaton has 8480 states and 10665 transitions. Word has length 619 [2019-10-02 01:32:34,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:32:34,483 INFO L475 AbstractCegarLoop]: Abstraction has 8480 states and 10665 transitions. [2019-10-02 01:32:34,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:32:34,483 INFO L276 IsEmpty]: Start isEmpty. Operand 8480 states and 10665 transitions. [2019-10-02 01:32:34,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2019-10-02 01:32:34,516 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:34,518 INFO L411 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 01:32:34,518 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:34,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:34,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2085332038, now seen corresponding path program 1 times [2019-10-02 01:32:34,519 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:34,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:34,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:34,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:34,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:35,058 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2019-10-02 01:32:35,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:32:35,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:32:35,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:32:35,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:32:35,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:32:35,061 INFO L87 Difference]: Start difference. First operand 8480 states and 10665 transitions. Second operand 3 states. [2019-10-02 01:32:37,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:32:37,069 INFO L93 Difference]: Finished difference Result 22480 states and 28846 transitions. [2019-10-02 01:32:37,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:32:37,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 649 [2019-10-02 01:32:37,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:32:37,122 INFO L225 Difference]: With dead ends: 22480 [2019-10-02 01:32:37,123 INFO L226 Difference]: Without dead ends: 14006 [2019-10-02 01:32:37,145 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:32:37,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14006 states. [2019-10-02 01:32:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14006 to 14004. [2019-10-02 01:32:37,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14004 states. [2019-10-02 01:32:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14004 states to 14004 states and 17412 transitions. [2019-10-02 01:32:37,521 INFO L78 Accepts]: Start accepts. Automaton has 14004 states and 17412 transitions. Word has length 649 [2019-10-02 01:32:37,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:32:37,522 INFO L475 AbstractCegarLoop]: Abstraction has 14004 states and 17412 transitions. [2019-10-02 01:32:37,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:32:37,523 INFO L276 IsEmpty]: Start isEmpty. Operand 14004 states and 17412 transitions. [2019-10-02 01:32:37,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 769 [2019-10-02 01:32:37,600 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:37,601 INFO L411 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:32:37,602 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:37,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:37,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1173099973, now seen corresponding path program 1 times [2019-10-02 01:32:37,603 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:37,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:37,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:37,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:37,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 511 proven. 2 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-10-02 01:32:38,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:32:38,575 INFO L224 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-10-02 01:32:38,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:38,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:32:38,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:32:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 511 proven. 2 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-10-02 01:32:39,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:32:39,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:32:39,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:32:39,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:32:39,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:32:39,440 INFO L87 Difference]: Start difference. First operand 14004 states and 17412 transitions. Second operand 9 states. [2019-10-02 01:32:45,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:32:45,234 INFO L93 Difference]: Finished difference Result 35273 states and 47120 transitions. [2019-10-02 01:32:45,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 01:32:45,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 768 [2019-10-02 01:32:45,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:32:45,326 INFO L225 Difference]: With dead ends: 35273 [2019-10-02 01:32:45,326 INFO L226 Difference]: Without dead ends: 16282 [2019-10-02 01:32:45,381 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 775 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-10-02 01:32:45,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16282 states. [2019-10-02 01:32:45,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16282 to 16010. [2019-10-02 01:32:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16010 states. [2019-10-02 01:32:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16010 states to 16010 states and 18876 transitions. [2019-10-02 01:32:45,813 INFO L78 Accepts]: Start accepts. Automaton has 16010 states and 18876 transitions. Word has length 768 [2019-10-02 01:32:45,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:32:45,814 INFO L475 AbstractCegarLoop]: Abstraction has 16010 states and 18876 transitions. [2019-10-02 01:32:45,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:32:45,814 INFO L276 IsEmpty]: Start isEmpty. Operand 16010 states and 18876 transitions. [2019-10-02 01:32:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2019-10-02 01:32:45,840 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:45,841 INFO L411 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:32:45,841 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:45,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:45,842 INFO L82 PathProgramCache]: Analyzing trace with hash -217823714, now seen corresponding path program 1 times [2019-10-02 01:32:45,842 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:45,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:45,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:45,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:45,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:47,048 INFO L134 CoverageAnalysis]: Checked inductivity of 916 backedges. 371 proven. 115 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2019-10-02 01:32:47,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:32:47,049 INFO L224 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-10-02 01:32:47,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:47,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 1115 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:32:47,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:32:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 916 backedges. 783 proven. 2 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-10-02 01:32:47,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:32:47,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:32:47,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:32:47,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:32:47,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:32:47,647 INFO L87 Difference]: Start difference. First operand 16010 states and 18876 transitions. Second operand 9 states. [2019-10-02 01:32:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:32:50,782 INFO L93 Difference]: Finished difference Result 30984 states and 35610 transitions. [2019-10-02 01:32:50,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 01:32:50,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 831 [2019-10-02 01:32:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:32:50,834 INFO L225 Difference]: With dead ends: 30984 [2019-10-02 01:32:50,834 INFO L226 Difference]: Without dead ends: 14984 [2019-10-02 01:32:50,888 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 848 GetRequests, 835 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:32:50,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14984 states. [2019-10-02 01:32:51,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14984 to 14932. [2019-10-02 01:32:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14932 states. [2019-10-02 01:32:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14932 states to 14932 states and 16172 transitions. [2019-10-02 01:32:51,138 INFO L78 Accepts]: Start accepts. Automaton has 14932 states and 16172 transitions. Word has length 831 [2019-10-02 01:32:51,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:32:51,139 INFO L475 AbstractCegarLoop]: Abstraction has 14932 states and 16172 transitions. [2019-10-02 01:32:51,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:32:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 14932 states and 16172 transitions. [2019-10-02 01:32:51,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 807 [2019-10-02 01:32:51,161 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:51,162 INFO L411 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:32:51,163 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:51,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:51,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1231801209, now seen corresponding path program 1 times [2019-10-02 01:32:51,163 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:51,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:51,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:51,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:51,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 537 proven. 230 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-02 01:32:52,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:32:52,744 INFO L224 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) [2019-10-02 01:32:52,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:32:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:52,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:32:52,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:32:53,296 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2019-10-02 01:32:53,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:32:53,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-10-02 01:32:53,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:32:53,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:32:53,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:32:53,302 INFO L87 Difference]: Start difference. First operand 14932 states and 16172 transitions. Second operand 9 states. [2019-10-02 01:32:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:32:56,678 INFO L93 Difference]: Finished difference Result 31248 states and 33858 transitions. [2019-10-02 01:32:56,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 01:32:56,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 806 [2019-10-02 01:32:56,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:32:56,725 INFO L225 Difference]: With dead ends: 31248 [2019-10-02 01:32:56,725 INFO L226 Difference]: Without dead ends: 18683 [2019-10-02 01:32:56,752 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 829 GetRequests, 816 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-10-02 01:32:56,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18683 states. [2019-10-02 01:32:57,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18683 to 15604. [2019-10-02 01:32:57,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15604 states. [2019-10-02 01:32:57,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15604 states to 15604 states and 16689 transitions. [2019-10-02 01:32:57,191 INFO L78 Accepts]: Start accepts. Automaton has 15604 states and 16689 transitions. Word has length 806 [2019-10-02 01:32:57,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:32:57,192 INFO L475 AbstractCegarLoop]: Abstraction has 15604 states and 16689 transitions. [2019-10-02 01:32:57,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:32:57,195 INFO L276 IsEmpty]: Start isEmpty. Operand 15604 states and 16689 transitions. [2019-10-02 01:32:57,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 961 [2019-10-02 01:32:57,224 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:57,225 INFO L411 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:32:57,226 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:57,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:57,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1916439717, now seen corresponding path program 1 times [2019-10-02 01:32:57,227 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:57,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:57,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:57,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:57,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 747 proven. 2 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-10-02 01:32:58,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:32:58,502 INFO L224 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-10-02 01:32:58,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:58,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:32:58,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:32:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 747 proven. 2 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-10-02 01:32:59,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:32:59,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:32:59,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:32:59,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:32:59,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:32:59,132 INFO L87 Difference]: Start difference. First operand 15604 states and 16689 transitions. Second operand 9 states. [2019-10-02 01:33:03,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:33:03,219 INFO L93 Difference]: Finished difference Result 33617 states and 36659 transitions. [2019-10-02 01:33:03,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 01:33:03,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 960 [2019-10-02 01:33:03,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:33:03,282 INFO L225 Difference]: With dead ends: 33617 [2019-10-02 01:33:03,283 INFO L226 Difference]: Without dead ends: 18023 [2019-10-02 01:33:03,320 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 977 GetRequests, 964 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:33:03,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18023 states. [2019-10-02 01:33:03,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18023 to 17325. [2019-10-02 01:33:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17325 states. [2019-10-02 01:33:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17325 states to 17325 states and 18713 transitions. [2019-10-02 01:33:03,677 INFO L78 Accepts]: Start accepts. Automaton has 17325 states and 18713 transitions. Word has length 960 [2019-10-02 01:33:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:33:03,678 INFO L475 AbstractCegarLoop]: Abstraction has 17325 states and 18713 transitions. [2019-10-02 01:33:03,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:33:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 17325 states and 18713 transitions. [2019-10-02 01:33:03,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2019-10-02 01:33:03,711 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:33:03,712 INFO L411 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:33:03,712 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:33:03,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:33:03,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1235213546, now seen corresponding path program 1 times [2019-10-02 01:33:03,713 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:33:03,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:33:03,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:03,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:03,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:04,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2055 backedges. 927 proven. 2 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2019-10-02 01:33:04,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:33:04,703 INFO L224 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-10-02 01:33:04,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:04,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 1327 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:33:04,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:33:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2055 backedges. 927 proven. 2 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2019-10-02 01:33:05,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:33:05,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:33:05,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:33:05,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:33:05,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:33:05,338 INFO L87 Difference]: Start difference. First operand 17325 states and 18713 transitions. Second operand 9 states. [2019-10-02 01:33:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:33:10,196 INFO L93 Difference]: Finished difference Result 33733 states and 36179 transitions. [2019-10-02 01:33:10,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 01:33:10,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 983 [2019-10-02 01:33:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:33:10,236 INFO L225 Difference]: With dead ends: 33733 [2019-10-02 01:33:10,236 INFO L226 Difference]: Without dead ends: 16016 [2019-10-02 01:33:10,276 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1010 GetRequests, 991 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2019-10-02 01:33:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16016 states. [2019-10-02 01:33:10,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16016 to 15860. [2019-10-02 01:33:10,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15860 states. [2019-10-02 01:33:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15860 states to 15860 states and 16474 transitions. [2019-10-02 01:33:10,576 INFO L78 Accepts]: Start accepts. Automaton has 15860 states and 16474 transitions. Word has length 983 [2019-10-02 01:33:10,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:33:10,578 INFO L475 AbstractCegarLoop]: Abstraction has 15860 states and 16474 transitions. [2019-10-02 01:33:10,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:33:10,578 INFO L276 IsEmpty]: Start isEmpty. Operand 15860 states and 16474 transitions. [2019-10-02 01:33:10,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1535 [2019-10-02 01:33:10,624 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:33:10,625 INFO L411 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, 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, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:33:10,625 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:33:10,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:33:10,626 INFO L82 PathProgramCache]: Analyzing trace with hash 927887082, now seen corresponding path program 1 times [2019-10-02 01:33:10,627 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:33:10,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:33:10,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:10,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:10,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4188 backedges. 1313 proven. 684 refuted. 0 times theorem prover too weak. 2191 trivial. 0 not checked. [2019-10-02 01:33:12,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:33:12,959 INFO L224 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-10-02 01:33:12,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:13,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 1976 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:33:13,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:33:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4188 backedges. 1184 proven. 0 refuted. 0 times theorem prover too weak. 3004 trivial. 0 not checked. [2019-10-02 01:33:14,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:33:14,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 16 [2019-10-02 01:33:14,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 01:33:14,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 01:33:14,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-10-02 01:33:14,419 INFO L87 Difference]: Start difference. First operand 15860 states and 16474 transitions. Second operand 16 states. [2019-10-02 01:33:30,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:33:30,655 INFO L93 Difference]: Finished difference Result 41822 states and 43699 transitions. [2019-10-02 01:33:30,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-02 01:33:30,655 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1534 [2019-10-02 01:33:30,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:33:30,656 INFO L225 Difference]: With dead ends: 41822 [2019-10-02 01:33:30,657 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 01:33:30,723 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1684 GetRequests, 1602 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2358 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1046, Invalid=5926, Unknown=0, NotChecked=0, Total=6972 [2019-10-02 01:33:30,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 01:33:30,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 01:33:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 01:33:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 01:33:30,724 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1534 [2019-10-02 01:33:30,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:33:30,724 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 01:33:30,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 01:33:30,725 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 01:33:30,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 01:33:30,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 01:33:33,411 WARN L191 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 572 DAG size of output: 438 [2019-10-02 01:33:35,632 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 572 DAG size of output: 438 [2019-10-02 01:33:41,184 WARN L191 SmtUtils]: Spent 5.52 s on a formula simplification. DAG size of input: 418 DAG size of output: 119 [2019-10-02 01:33:45,408 WARN L191 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 358 DAG size of output: 131 [2019-10-02 01:33:49,582 WARN L191 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 361 DAG size of output: 131 [2019-10-02 01:33:53,909 WARN L191 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 360 DAG size of output: 131 [2019-10-02 01:33:59,600 WARN L191 SmtUtils]: Spent 5.68 s on a formula simplification. DAG size of input: 418 DAG size of output: 119 [2019-10-02 01:33:59,603 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:33:59,604 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a18~0 |old(~a18~0)|) (= ~a15~0 |old(~a15~0)|)) [2019-10-02 01:33:59,604 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:33:59,604 INFO L443 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,604 INFO L443 ceAbstractionStarter]: For program point calculate_output2EXIT(lines 1494 1765) no Hoare annotation was computed. [2019-10-02 01:33:59,604 INFO L443 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,604 INFO L443 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,604 INFO L443 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,605 INFO L443 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,605 INFO L443 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,605 INFO L443 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,605 INFO L443 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,605 INFO L443 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,605 INFO L443 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,605 INFO L443 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,606 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,606 INFO L443 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,606 INFO L443 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,606 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,606 INFO L443 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,606 INFO L443 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,606 INFO L443 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,606 INFO L443 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,606 INFO L443 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,607 INFO L443 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,607 INFO L443 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,607 INFO L443 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,607 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,607 INFO L443 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,607 INFO L443 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,607 INFO L443 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,607 INFO L443 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,608 INFO L439 ceAbstractionStarter]: At program point calculate_output2ENTRY(lines 1494 1765) the Hoare annotation is: (let ((.cse16 (= 7 |old(~a12~0)|))) (let ((.cse30 (= 8 |old(~a12~0)|)) (.cse21 (= 8 |old(~a16~0)|)) (.cse34 (= ~a12~0 7)) (.cse26 (= ~a16~0 12)) (.cse29 (= 6 |old(~a12~0)|)) (.cse20 (= 12 |old(~a16~0)|)) (.cse1 (= 4 |old(~a15~0)|)) (.cse7 (not .cse16)) (.cse36 (= ~a12~0 |old(~a12~0)|)) (.cse39 (= ~a12~0 8)) (.cse24 (= ~a15~0 |old(~a15~0)|)) (.cse37 (= ~a16~0 |old(~a16~0)|)) (.cse25 (= ~a18~0 |old(~a18~0)|)) (.cse27 (= ~a12~0 6))) (let ((.cse18 (not (= 10 |old(~a16~0)|))) (.cse10 (not (= 9 |old(~a16~0)|))) (.cse31 (and .cse24 .cse37 .cse25 .cse27)) (.cse33 (not (<= 6 |old(~a12~0)|))) (.cse15 (<= (+ ~a18~0 156) 0)) (.cse19 (and .cse24 .cse37 .cse39 .cse25)) (.cse12 (and .cse36 .cse24 .cse37 .cse25)) (.cse13 (not (<= |old(~a12~0)| 5))) (.cse35 (or .cse20 .cse1 .cse7)) (.cse4 (not (<= 0 (+ |old(~a18~0)| 154)))) (.cse38 (and .cse37 .cse25 .cse24 .cse27)) (.cse28 (not .cse29)) (.cse23 (not (= 3 |old(~a15~0)|))) (.cse0 (and .cse39 .cse25 .cse26 .cse24)) (.cse5 (not .cse1)) (.cse9 (and .cse24 .cse34 .cse37 .cse25)) (.cse11 (not (<= (+ |old(~a18~0)| 156) 0))) (.cse2 (not .cse20)) (.cse14 (and .cse36 .cse25 .cse26 .cse24)) (.cse8 (not (< 0 (+ |old(~a18~0)| 79)))) (.cse6 (not .cse21)) (.cse17 (or .cse29 .cse20 .cse1 .cse30)) (.cse32 (and .cse36 .cse37 .cse24)) (.cse3 (not .cse30)) (.cse22 (and .cse37 .cse39 .cse25 .cse24))) (and (or .cse0 (or .cse1 .cse2 .cse3) .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse5 .cse10 .cse11 .cse12) (or (or .cse1 .cse2 .cse13) .cse14 .cse4) (or .cse15 .cse16 .cse17 .cse18 .cse11) (or .cse5 .cse6 .cse3 .cse19 .cse11) (or .cse5 .cse4 .cse12 .cse10) (or .cse20 .cse12 (not (= (+ |old(~a18~0)| 87) 0)) .cse13 .cse21) (or .cse3 .cse22 .cse10) (or .cse23 .cse2 .cse8 (and .cse24 .cse25 .cse26 .cse27) .cse28) (or .cse5 .cse29 .cse6 .cse16 .cse12 .cse30 .cse4) (or .cse5 .cse20 .cse13 .cse12 .cse11) (or .cse6 .cse31 .cse8 .cse28) (or .cse32 .cse17 .cse10) (or (or .cse5 .cse7) .cse9 .cse10) (or .cse5 .cse20 .cse4 .cse13 .cse12) (or .cse1 .cse13 .cse8 .cse21 .cse12) (or (or .cse29 .cse16 .cse1 .cse2 .cse30 .cse11) .cse33 .cse14) (or (not (<= |old(~a18~0)| 132)) (and .cse24 .cse34 .cse25 .cse26) (not (<= 0 (+ |old(~a18~0)| 139))) (or .cse1 .cse2 .cse7)) (or .cse1 .cse18 .cse32) (or .cse15 .cse35 .cse10 .cse11) (or .cse6 .cse28 .cse11 .cse31) (or (or .cse23 .cse16 .cse33 .cse17) (and .cse36 .cse37 .cse25 .cse24)) (or .cse6 .cse16 .cse17 .cse15 .cse11) (or (or .cse20 .cse1) .cse38 .cse28) (or .cse6 .cse19 .cse3 .cse8) (or .cse5 .cse6 .cse12 .cse13) (or .cse23 .cse35 .cse4 .cse9) (or .cse20 .cse38 .cse28 .cse21) (or .cse23 .cse2 .cse3 .cse0 .cse11) (or .cse5 .cse6 .cse7 .cse9 .cse11) (or (or .cse29 .cse16 .cse1 .cse2) .cse14 .cse8) (or .cse6 .cse17 .cse32) (or (or .cse20 .cse1 .cse3 .cse21) .cse22))))) [2019-10-02 01:33:59,609 INFO L443 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,609 INFO L443 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,609 INFO L443 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,609 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,609 INFO L443 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,609 INFO L443 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,609 INFO L443 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,609 INFO L443 ceAbstractionStarter]: For program point calculate_output2FINAL(lines 1494 1765) no Hoare annotation was computed. [2019-10-02 01:33:59,610 INFO L443 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,610 INFO L443 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,610 INFO L443 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,610 INFO L443 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,610 INFO L443 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,610 INFO L443 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,610 INFO L443 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,610 INFO L443 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,610 INFO L443 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2019-10-02 01:33:59,611 INFO L443 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,611 INFO L443 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,611 INFO L443 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,611 INFO L443 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,611 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,611 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,611 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,611 INFO L443 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,611 INFO L443 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,611 INFO L443 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,612 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,612 INFO L443 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,612 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,612 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-10-02 01:33:59,612 INFO L443 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,612 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-10-02 01:33:59,612 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-02 01:33:59,613 INFO L439 ceAbstractionStarter]: At program point L1491(line 1491) the Hoare annotation is: (let ((.cse16 (= 7 |old(~a12~0)|))) (let ((.cse30 (= 8 |old(~a12~0)|)) (.cse21 (= 8 |old(~a16~0)|)) (.cse34 (= ~a12~0 7)) (.cse26 (= ~a16~0 12)) (.cse29 (= 6 |old(~a12~0)|)) (.cse20 (= 12 |old(~a16~0)|)) (.cse1 (= 4 |old(~a15~0)|)) (.cse7 (not .cse16)) (.cse36 (= ~a12~0 |old(~a12~0)|)) (.cse39 (= ~a12~0 8)) (.cse24 (= ~a15~0 |old(~a15~0)|)) (.cse37 (= ~a16~0 |old(~a16~0)|)) (.cse25 (= ~a18~0 |old(~a18~0)|)) (.cse27 (= ~a12~0 6))) (let ((.cse18 (not (= 10 |old(~a16~0)|))) (.cse10 (not (= 9 |old(~a16~0)|))) (.cse31 (and .cse24 .cse37 .cse25 .cse27)) (.cse33 (not (<= 6 |old(~a12~0)|))) (.cse15 (<= (+ ~a18~0 156) 0)) (.cse19 (and .cse24 .cse37 .cse39 .cse25)) (.cse12 (and .cse36 .cse24 .cse37 .cse25)) (.cse13 (not (<= |old(~a12~0)| 5))) (.cse35 (or .cse20 .cse1 .cse7)) (.cse4 (not (<= 0 (+ |old(~a18~0)| 154)))) (.cse38 (and .cse37 .cse25 .cse24 .cse27)) (.cse28 (not .cse29)) (.cse23 (not (= 3 |old(~a15~0)|))) (.cse0 (and .cse39 .cse25 .cse26 .cse24)) (.cse5 (not .cse1)) (.cse9 (and .cse24 .cse34 .cse37 .cse25)) (.cse11 (not (<= (+ |old(~a18~0)| 156) 0))) (.cse2 (not .cse20)) (.cse14 (and .cse36 .cse25 .cse26 .cse24)) (.cse8 (not (< 0 (+ |old(~a18~0)| 79)))) (.cse6 (not .cse21)) (.cse17 (or .cse29 .cse20 .cse1 .cse30)) (.cse32 (and .cse36 .cse37 .cse24)) (.cse3 (not .cse30)) (.cse22 (and .cse37 .cse39 .cse25 .cse24))) (and (or .cse0 (or .cse1 .cse2 .cse3) .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse5 .cse10 .cse11 .cse12) (or (or .cse1 .cse2 .cse13) .cse14 .cse4) (or .cse15 .cse16 .cse17 .cse18 .cse11) (or .cse5 .cse6 .cse3 .cse19 .cse11) (or .cse5 .cse4 .cse12 .cse10) (or .cse20 .cse12 (not (= (+ |old(~a18~0)| 87) 0)) .cse13 .cse21) (or .cse3 .cse22 .cse10) (or .cse23 .cse2 .cse8 (and .cse24 .cse25 .cse26 .cse27) .cse28) (or .cse5 .cse29 .cse6 .cse16 .cse12 .cse30 .cse4) (or .cse5 .cse20 .cse13 .cse12 .cse11) (or .cse6 .cse31 .cse8 .cse28) (or .cse32 .cse17 .cse10) (or (or .cse5 .cse7) .cse9 .cse10) (or .cse5 .cse20 .cse4 .cse13 .cse12) (or .cse1 .cse13 .cse8 .cse21 .cse12) (or (or .cse29 .cse16 .cse1 .cse2 .cse30 .cse11) .cse33 .cse14) (or (not (<= |old(~a18~0)| 132)) (and .cse24 .cse34 .cse25 .cse26) (not (<= 0 (+ |old(~a18~0)| 139))) (or .cse1 .cse2 .cse7)) (or .cse1 .cse18 .cse32) (or .cse15 .cse35 .cse10 .cse11) (or .cse6 .cse28 .cse11 .cse31) (or (or .cse23 .cse16 .cse33 .cse17) (and .cse36 .cse37 .cse25 .cse24)) (or .cse6 .cse16 .cse17 .cse15 .cse11) (or (or .cse20 .cse1) .cse38 .cse28) (or .cse6 .cse19 .cse3 .cse8) (or .cse5 .cse6 .cse12 .cse13) (or .cse23 .cse35 .cse4 .cse9) (or .cse20 .cse38 .cse28 .cse21) (or .cse23 .cse2 .cse3 .cse0 .cse11) (or .cse5 .cse6 .cse7 .cse9 .cse11) (or (or .cse29 .cse16 .cse1 .cse2) .cse14 .cse8) (or .cse6 .cse17 .cse32) (or (or .cse20 .cse1 .cse3 .cse21) .cse22))))) [2019-10-02 01:33:59,613 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,613 INFO L443 ceAbstractionStarter]: For program point L1491-1(line 1491) no Hoare annotation was computed. [2019-10-02 01:33:59,613 INFO L443 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,613 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,614 INFO L443 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,614 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,614 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,614 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,614 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,614 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-02 01:33:59,614 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-02 01:33:59,614 INFO L443 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,614 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-10-02 01:33:59,614 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,615 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,615 INFO L443 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,615 INFO L443 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,615 INFO L443 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,615 INFO L443 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,615 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,615 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,615 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,615 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,616 INFO L443 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,616 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,616 INFO L443 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,616 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,616 INFO L443 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,616 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-10-02 01:33:59,616 INFO L443 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,616 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-02 01:33:59,616 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-02 01:33:59,616 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,617 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,617 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,617 INFO L443 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,617 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,617 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,617 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,617 INFO L443 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,617 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,617 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,618 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-10-02 01:33:59,618 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-02 01:33:59,618 INFO L443 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,618 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-02 01:33:59,618 INFO L443 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,618 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,618 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,618 INFO L443 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,618 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,618 INFO L443 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,619 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,619 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,619 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,619 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,619 INFO L443 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,619 INFO L443 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,619 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-10-02 01:33:59,619 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,619 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-02 01:33:59,620 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-10-02 01:33:59,620 INFO L443 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,620 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,620 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,620 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,620 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,620 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,620 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,621 INFO L443 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,621 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,621 INFO L443 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,621 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,621 INFO L443 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,621 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-02 01:33:59,621 INFO L443 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,621 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-02 01:33:59,621 INFO L443 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,621 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-10-02 01:33:59,622 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,622 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,622 INFO L443 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,622 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,622 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,622 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,622 INFO L443 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,622 INFO L443 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,622 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,622 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,623 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,623 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,623 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,623 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-10-02 01:33:59,623 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-02 01:33:59,623 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-10-02 01:33:59,623 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,623 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,623 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,623 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,624 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,624 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,624 INFO L443 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,624 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,624 INFO L443 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,624 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,624 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,624 INFO L443 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,624 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-10-02 01:33:59,624 INFO L443 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,624 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-02 01:33:59,625 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-10-02 01:33:59,625 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,625 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,625 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,625 INFO L443 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,625 INFO L443 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,625 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,626 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 23 1492) the Hoare annotation is: (let ((.cse16 (= 7 |old(~a12~0)|))) (let ((.cse30 (= 8 |old(~a12~0)|)) (.cse21 (= 8 |old(~a16~0)|)) (.cse34 (= ~a12~0 7)) (.cse26 (= ~a16~0 12)) (.cse29 (= 6 |old(~a12~0)|)) (.cse20 (= 12 |old(~a16~0)|)) (.cse1 (= 4 |old(~a15~0)|)) (.cse7 (not .cse16)) (.cse36 (= ~a12~0 |old(~a12~0)|)) (.cse39 (= ~a12~0 8)) (.cse24 (= ~a15~0 |old(~a15~0)|)) (.cse37 (= ~a16~0 |old(~a16~0)|)) (.cse25 (= ~a18~0 |old(~a18~0)|)) (.cse27 (= ~a12~0 6))) (let ((.cse18 (not (= 10 |old(~a16~0)|))) (.cse10 (not (= 9 |old(~a16~0)|))) (.cse31 (and .cse24 .cse37 .cse25 .cse27)) (.cse33 (not (<= 6 |old(~a12~0)|))) (.cse15 (<= (+ ~a18~0 156) 0)) (.cse19 (and .cse24 .cse37 .cse39 .cse25)) (.cse12 (and .cse36 .cse24 .cse37 .cse25)) (.cse13 (not (<= |old(~a12~0)| 5))) (.cse35 (or .cse20 .cse1 .cse7)) (.cse4 (not (<= 0 (+ |old(~a18~0)| 154)))) (.cse38 (and .cse37 .cse25 .cse24 .cse27)) (.cse28 (not .cse29)) (.cse23 (not (= 3 |old(~a15~0)|))) (.cse0 (and .cse39 .cse25 .cse26 .cse24)) (.cse5 (not .cse1)) (.cse9 (and .cse24 .cse34 .cse37 .cse25)) (.cse11 (not (<= (+ |old(~a18~0)| 156) 0))) (.cse2 (not .cse20)) (.cse14 (and .cse36 .cse25 .cse26 .cse24)) (.cse8 (not (< 0 (+ |old(~a18~0)| 79)))) (.cse6 (not .cse21)) (.cse17 (or .cse29 .cse20 .cse1 .cse30)) (.cse32 (and .cse36 .cse37 .cse24)) (.cse3 (not .cse30)) (.cse22 (and .cse37 .cse39 .cse25 .cse24))) (and (or .cse0 (or .cse1 .cse2 .cse3) .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse5 .cse10 .cse11 .cse12) (or (or .cse1 .cse2 .cse13) .cse14 .cse4) (or .cse15 .cse16 .cse17 .cse18 .cse11) (or .cse5 .cse6 .cse3 .cse19 .cse11) (or .cse5 .cse4 .cse12 .cse10) (or .cse20 .cse12 (not (= (+ |old(~a18~0)| 87) 0)) .cse13 .cse21) (or .cse3 .cse22 .cse10) (or .cse23 .cse2 .cse8 (and .cse24 .cse25 .cse26 .cse27) .cse28) (or .cse5 .cse29 .cse6 .cse16 .cse12 .cse30 .cse4) (or .cse5 .cse20 .cse13 .cse12 .cse11) (or .cse6 .cse31 .cse8 .cse28) (or .cse32 .cse17 .cse10) (or (or .cse5 .cse7) .cse9 .cse10) (or .cse5 .cse20 .cse4 .cse13 .cse12) (or .cse1 .cse13 .cse8 .cse21 .cse12) (or (or .cse29 .cse16 .cse1 .cse2 .cse30 .cse11) .cse33 .cse14) (or (not (<= |old(~a18~0)| 132)) (and .cse24 .cse34 .cse25 .cse26) (not (<= 0 (+ |old(~a18~0)| 139))) (or .cse1 .cse2 .cse7)) (or .cse1 .cse18 .cse32) (or .cse15 .cse35 .cse10 .cse11) (or .cse6 .cse28 .cse11 .cse31) (or (or .cse23 .cse16 .cse33 .cse17) (and .cse36 .cse37 .cse25 .cse24)) (or .cse6 .cse16 .cse17 .cse15 .cse11) (or (or .cse20 .cse1) .cse38 .cse28) (or .cse6 .cse19 .cse3 .cse8) (or .cse5 .cse6 .cse12 .cse13) (or .cse23 .cse35 .cse4 .cse9) (or .cse20 .cse38 .cse28 .cse21) (or .cse23 .cse2 .cse3 .cse0 .cse11) (or .cse5 .cse6 .cse7 .cse9 .cse11) (or (or .cse29 .cse16 .cse1 .cse2) .cse14 .cse8) (or .cse6 .cse17 .cse32) (or (or .cse20 .cse1 .cse3 .cse21) .cse22))))) [2019-10-02 01:33:59,626 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,626 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,626 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,626 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,626 INFO L443 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,626 INFO L443 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,627 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,627 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,627 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,627 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-10-02 01:33:59,627 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-02 01:33:59,627 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-10-02 01:33:59,627 INFO L443 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,627 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,627 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,628 INFO L443 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,628 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,628 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,628 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,628 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,628 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,628 INFO L443 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,628 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,628 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-10-02 01:33:59,628 INFO L443 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,629 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-02 01:33:59,629 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-02 01:33:59,629 INFO L443 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,629 INFO L443 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,629 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,629 INFO L443 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,629 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,629 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,629 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,629 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,629 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,630 INFO L443 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,630 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,630 INFO L443 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,630 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-10-02 01:33:59,630 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-02 01:33:59,630 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-02 01:33:59,630 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,630 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,630 INFO L443 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,630 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,630 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,630 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,630 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,630 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,630 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,630 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,631 INFO L443 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,631 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,631 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-02 01:33:59,631 INFO L443 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,631 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-02 01:33:59,631 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-10-02 01:33:59,631 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,631 INFO L443 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,631 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,631 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 124) no Hoare annotation was computed. [2019-10-02 01:33:59,632 INFO L443 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,632 INFO L443 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,632 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,632 INFO L443 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,632 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,632 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,632 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,632 INFO L443 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,632 INFO L443 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,633 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-10-02 01:33:59,633 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-02 01:33:59,633 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-02 01:33:59,633 INFO L443 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,633 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,633 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,633 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,633 INFO L443 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,633 INFO L443 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,634 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,634 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,634 INFO L443 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,634 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,634 INFO L443 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,634 INFO L443 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,634 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,634 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-02 01:33:59,634 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-10-02 01:33:59,635 INFO L443 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,635 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,635 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,635 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,635 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,635 INFO L443 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,635 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,635 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,635 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,636 INFO L443 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,636 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-10-02 01:33:59,636 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-02 01:33:59,636 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,636 INFO L443 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,636 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,636 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,636 INFO L443 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,636 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,637 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,637 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,637 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,637 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,637 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,637 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,637 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,637 INFO L443 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,637 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-02 01:33:59,638 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-02 01:33:59,638 INFO L443 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,638 INFO L443 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,638 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,638 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,638 INFO L443 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,638 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,638 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,638 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,638 INFO L443 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,639 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,639 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-10-02 01:33:59,639 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-10-02 01:33:59,639 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,639 INFO L443 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,639 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,639 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,639 INFO L443 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,639 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,639 INFO L443 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,639 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,640 INFO L443 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,640 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,640 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,640 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,640 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,640 INFO L443 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,640 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,640 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-02 01:33:59,640 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-02 01:33:59,640 INFO L443 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,641 INFO L443 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,641 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,641 INFO L443 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,641 INFO L443 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,641 INFO L443 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,641 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,641 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,641 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-10-02 01:33:59,641 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,641 INFO L443 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,641 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,642 INFO L443 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,642 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-02 01:33:59,642 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-02 01:33:59,642 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-02 01:33:59,642 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,642 INFO L443 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,642 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,642 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,642 INFO L443 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,642 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,643 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,643 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,643 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,643 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,643 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,643 INFO L443 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,643 INFO L443 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,643 INFO L443 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,643 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-02 01:33:59,643 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-10-02 01:33:59,644 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-02 01:33:59,644 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,644 INFO L443 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,644 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,644 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,644 INFO L443 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,644 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,644 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,644 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,644 INFO L443 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,644 INFO L443 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,645 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,645 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,645 INFO L443 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,645 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,645 INFO L443 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,645 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-02 01:33:59,645 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-02 01:33:59,645 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-02 01:33:59,645 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,645 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,645 INFO L443 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,646 INFO L443 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,646 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,646 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,646 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,646 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,646 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:33:59,646 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-10-02 01:33:59,646 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-02 01:33:59,646 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-02 01:33:59,646 INFO L443 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,646 INFO L443 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,647 INFO L443 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2019-10-02 01:33:59,647 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:33:59,647 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a16~0 8)) (not (= 12 ~a16~0)) (<= ~a12~0 5) (= (+ ~a18~0 87) 0) (not (= 4 ~a15~0))) [2019-10-02 01:33:59,647 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 01:33:59,647 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:33:59,647 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1767 1783) the Hoare annotation is: (or (= 12 |old(~a16~0)|) (and (= ~a12~0 |old(~a12~0)|) (= ~a15~0 |old(~a15~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a18~0 |old(~a18~0)|)) (= 4 |old(~a15~0)|) (not (= (+ |old(~a18~0)| 87) 0)) (not (<= |old(~a12~0)| 5)) (= 8 |old(~a16~0)|)) [2019-10-02 01:33:59,647 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1767 1783) no Hoare annotation was computed. [2019-10-02 01:33:59,648 INFO L439 ceAbstractionStarter]: At program point L1781(line 1781) the Hoare annotation is: (let ((.cse9 (= ~a12~0 8)) (.cse18 (= ~a12~0 6))) (let ((.cse19 (= ~a16~0 8)) (.cse24 (not .cse18)) (.cse17 (not (= 12 ~a16~0))) (.cse31 (not .cse9))) (let ((.cse20 (and .cse24 .cse17 .cse31)) (.cse16 (not .cse19)) (.cse12 (not (= 4 ~a15~0)))) (let ((.cse6 (<= 10 |old(~a16~0)|)) (.cse25 (not (= 7 ~a12~0))) (.cse28 (and .cse24 .cse16 .cse17 .cse12)) (.cse1 (= 3 |old(~a15~0)|)) (.cse32 (= ~a12~0 7)) (.cse7 (and .cse20 .cse12))) (let ((.cse3 (and .cse16 .cse20)) (.cse15 (and .cse32 .cse7)) (.cse0 (= ~a15~0 4)) (.cse5 (<= ~a12~0 5)) (.cse8 (< 0 (+ ~a18~0 79))) (.cse21 (<= ~a12~0 8)) (.cse14 (= ~a15~0 |old(~a15~0)|)) (.cse13 (= ~a16~0 |old(~a16~0)|)) (.cse29 (= 10 |old(~a16~0)|)) (.cse27 (and .cse17 .cse31 .cse12)) (.cse30 (and .cse28 .cse1 .cse9)) (.cse26 (= ~a16~0 9)) (.cse22 (and .cse7 .cse6 .cse25)) (.cse11 (<= 0 (+ ~a18~0 154))) (.cse4 (<= (+ ~a18~0 156) 0)) (.cse23 (<= 6 ~a12~0)) (.cse2 (= 5 |old(~a12~0)|)) (.cse10 (= ~a16~0 12))) (or (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5) .cse6) (and .cse1 .cse2 (and (and .cse7 .cse5) .cse6) .cse8) (and .cse1 .cse2 .cse9 .cse10 .cse6 .cse11 .cse12) (and (= ~a12~0 |old(~a12~0)|) .cse13 (= (+ ~a18~0 87) 0) .cse14) (not (= (+ |old(~a18~0)| 87) 0)) (and .cse1 .cse2 .cse15 .cse6 .cse11 .cse14) (and .cse1 .cse2 .cse16 .cse17 .cse6 .cse18) (and .cse19 .cse1 .cse2 .cse6 .cse8) (and .cse19 .cse1 .cse4 .cse2 .cse20 .cse21 .cse6) (and .cse1 .cse2 .cse6 .cse14 .cse18 .cse8) (and (and .cse0 .cse1 (and .cse3 .cse5 .cse6) .cse2) .cse11) (and .cse1 .cse2 .cse22 .cse14 .cse23) (and .cse1 .cse2 .cse5 .cse10 .cse6 .cse11 .cse12) (and .cse1 .cse2 .cse24 .cse10 .cse25 .cse6 .cse12 .cse8) (and .cse26 .cse1 .cse15 .cse6) (and .cse19 .cse0 .cse4 .cse6 .cse1 .cse2 .cse9) (not (<= |old(~a12~0)| 5)) (and .cse19 .cse1 .cse2 .cse5 .cse6) (and .cse6 (and .cse1 (and .cse19 .cse12)) .cse8) (and .cse19 .cse6 .cse27) (= 4 |old(~a15~0)|) (and (and .cse26 .cse1 .cse2 .cse6) .cse11) (and .cse28 .cse13 .cse29) (and (and .cse1 .cse21) .cse26 .cse2 .cse6 .cse23) (and .cse1 .cse4 .cse2 .cse9 .cse10 .cse6 .cse14) (and .cse2 .cse30 .cse6) (and .cse13 .cse29 .cse27) (= 8 |old(~a16~0)|) (and .cse26 .cse30 .cse6) (and .cse26 .cse1 .cse4 .cse2 .cse6) (and .cse4 .cse6 .cse1 .cse2 (<= ~a16~0 9) .cse18) (= 12 |old(~a16~0)|) (and .cse26 .cse1 .cse22) (and .cse19 .cse1 .cse2 .cse20 .cse6 .cse25 .cse11) (and .cse4 .cse1 .cse2 .cse24 .cse10 .cse25 .cse6 .cse31 .cse12 .cse23) (and (<= 0 (+ ~a18~0 139)) .cse1 .cse2 .cse32 .cse6 .cse10 .cse12 (<= ~a18~0 132)))))))) [2019-10-02 01:33:59,648 INFO L443 ceAbstractionStarter]: For program point L1781-1(line 1781) no Hoare annotation was computed. [2019-10-02 01:33:59,648 INFO L443 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2019-10-02 01:33:59,649 INFO L439 ceAbstractionStarter]: At program point L1773-2(lines 1773 1782) the Hoare annotation is: (let ((.cse9 (= ~a12~0 8)) (.cse18 (= ~a12~0 6))) (let ((.cse19 (= ~a16~0 8)) (.cse24 (not .cse18)) (.cse17 (not (= 12 ~a16~0))) (.cse31 (not .cse9))) (let ((.cse20 (and .cse24 .cse17 .cse31)) (.cse16 (not .cse19)) (.cse12 (not (= 4 ~a15~0)))) (let ((.cse6 (<= 10 |old(~a16~0)|)) (.cse25 (not (= 7 ~a12~0))) (.cse28 (and .cse24 .cse16 .cse17 .cse12)) (.cse1 (= 3 |old(~a15~0)|)) (.cse32 (= ~a12~0 7)) (.cse7 (and .cse20 .cse12))) (let ((.cse3 (and .cse16 .cse20)) (.cse15 (and .cse32 .cse7)) (.cse0 (= ~a15~0 4)) (.cse5 (<= ~a12~0 5)) (.cse8 (< 0 (+ ~a18~0 79))) (.cse21 (<= ~a12~0 8)) (.cse14 (= ~a15~0 |old(~a15~0)|)) (.cse13 (= ~a16~0 |old(~a16~0)|)) (.cse29 (= 10 |old(~a16~0)|)) (.cse27 (and .cse17 .cse31 .cse12)) (.cse30 (and .cse28 .cse1 .cse9)) (.cse26 (= ~a16~0 9)) (.cse22 (and .cse7 .cse6 .cse25)) (.cse11 (<= 0 (+ ~a18~0 154))) (.cse4 (<= (+ ~a18~0 156) 0)) (.cse23 (<= 6 ~a12~0)) (.cse2 (= 5 |old(~a12~0)|)) (.cse10 (= ~a16~0 12))) (or (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5) .cse6) (and .cse1 .cse2 (and (and .cse7 .cse5) .cse6) .cse8) (and .cse1 .cse2 .cse9 .cse10 .cse6 .cse11 .cse12) (and (= ~a12~0 |old(~a12~0)|) .cse13 (= (+ ~a18~0 87) 0) .cse14) (not (= (+ |old(~a18~0)| 87) 0)) (and .cse1 .cse2 .cse15 .cse6 .cse11 .cse14) (and .cse1 .cse2 .cse16 .cse17 .cse6 .cse18) (and .cse19 .cse1 .cse2 .cse6 .cse8) (and .cse19 .cse1 .cse4 .cse2 .cse20 .cse21 .cse6) (and .cse1 .cse2 .cse6 .cse14 .cse18 .cse8) (and (and .cse0 .cse1 (and .cse3 .cse5 .cse6) .cse2) .cse11) (and .cse1 .cse2 .cse22 .cse14 .cse23) (and .cse1 .cse2 .cse5 .cse10 .cse6 .cse11 .cse12) (and .cse1 .cse2 .cse24 .cse10 .cse25 .cse6 .cse12 .cse8) (and .cse26 .cse1 .cse15 .cse6) (and .cse19 .cse0 .cse4 .cse6 .cse1 .cse2 .cse9) (not (<= |old(~a12~0)| 5)) (and .cse19 .cse1 .cse2 .cse5 .cse6) (and .cse6 (and .cse1 (and .cse19 .cse12)) .cse8) (and .cse19 .cse6 .cse27) (= 4 |old(~a15~0)|) (and (and .cse26 .cse1 .cse2 .cse6) .cse11) (and .cse28 .cse13 .cse29) (and (and .cse1 .cse21) .cse26 .cse2 .cse6 .cse23) (and .cse1 .cse4 .cse2 .cse9 .cse10 .cse6 .cse14) (and .cse2 .cse30 .cse6) (and .cse13 .cse29 .cse27) (= 8 |old(~a16~0)|) (and .cse26 .cse30 .cse6) (and .cse26 .cse1 .cse4 .cse2 .cse6) (and .cse4 .cse6 .cse1 .cse2 (<= ~a16~0 9) .cse18) (= 12 |old(~a16~0)|) (and .cse26 .cse1 .cse22) (and .cse19 .cse1 .cse2 .cse20 .cse6 .cse25 .cse11) (and .cse4 .cse1 .cse2 .cse24 .cse10 .cse25 .cse6 .cse31 .cse12 .cse23) (and (<= 0 (+ ~a18~0 139)) .cse1 .cse2 .cse32 .cse6 .cse10 .cse12 (<= ~a18~0 132)))))))) [2019-10-02 01:33:59,649 INFO L443 ceAbstractionStarter]: For program point L1773-3(lines 1767 1783) no Hoare annotation was computed. [2019-10-02 01:33:59,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 01:33:59 BoogieIcfgContainer [2019-10-02 01:33:59,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 01:33:59,686 INFO L168 Benchmark]: Toolchain (without parser) took 118457.88 ms. Allocated memory was 139.5 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 81.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-10-02 01:33:59,687 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 104.2 MB in the beginning and 104.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 01:33:59,688 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1348.16 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 81.3 MB in the beginning and 122.4 MB in the end (delta: -41.1 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. [2019-10-02 01:33:59,688 INFO L168 Benchmark]: Boogie Preprocessor took 173.53 ms. Allocated memory is still 202.9 MB. Free memory was 122.4 MB in the beginning and 111.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-10-02 01:33:59,689 INFO L168 Benchmark]: RCFGBuilder took 2516.85 ms. Allocated memory was 202.9 MB in the beginning and 270.0 MB in the end (delta: 67.1 MB). Free memory was 111.7 MB in the beginning and 138.7 MB in the end (delta: -27.0 MB). Peak memory consumption was 75.9 MB. Max. memory is 7.1 GB. [2019-10-02 01:33:59,690 INFO L168 Benchmark]: TraceAbstraction took 114414.83 ms. Allocated memory was 270.0 MB in the beginning and 2.7 GB in the end (delta: 2.4 GB). Free memory was 138.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-10-02 01:33:59,694 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 139.5 MB. Free memory was 104.2 MB in the beginning and 104.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1348.16 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 81.3 MB in the beginning and 122.4 MB in the end (delta: -41.1 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 173.53 ms. Allocated memory is still 202.9 MB. Free memory was 122.4 MB in the beginning and 111.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2516.85 ms. Allocated memory was 202.9 MB in the beginning and 270.0 MB in the end (delta: 67.1 MB). Free memory was 111.7 MB in the beginning and 138.7 MB in the end (delta: -27.0 MB). Peak memory consumption was 75.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 114414.83 ms. Allocated memory was 270.0 MB in the beginning and 2.7 GB in the end (delta: 2.4 GB). Free memory was 138.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 124]: 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: 1773]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((a15 == 4 && 3 == \old(a15)) && 5 == \old(a12)) && ((!(a16 == 8) && (!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && a18 + 156 <= 0) && a12 <= 5) && 10 <= \old(a16)) || (((3 == \old(a15) && 5 == \old(a12)) && ((((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && a12 <= 5) && 10 <= \old(a16)) && 0 < a18 + 79)) || ((((((3 == \old(a15) && 5 == \old(a12)) && a12 == 8) && a16 == 12) && 10 <= \old(a16)) && 0 <= a18 + 154) && !(4 == a15))) || (((a12 == \old(a12) && a16 == \old(a16)) && a18 + 87 == 0) && a15 == \old(a15))) || !(\old(a18) + 87 == 0)) || (((((3 == \old(a15) && 5 == \old(a12)) && a12 == 7 && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && 10 <= \old(a16)) && 0 <= a18 + 154) && a15 == \old(a15))) || (((((3 == \old(a15) && 5 == \old(a12)) && !(a16 == 8)) && !(12 == a16)) && 10 <= \old(a16)) && a12 == 6)) || ((((a16 == 8 && 3 == \old(a15)) && 5 == \old(a12)) && 10 <= \old(a16)) && 0 < a18 + 79)) || ((((((a16 == 8 && 3 == \old(a15)) && a18 + 156 <= 0) && 5 == \old(a12)) && (!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && a12 <= 8) && 10 <= \old(a16))) || (((((3 == \old(a15) && 5 == \old(a12)) && 10 <= \old(a16)) && a15 == \old(a15)) && a12 == 6) && 0 < a18 + 79)) || ((((a15 == 4 && 3 == \old(a15)) && ((!(a16 == 8) && (!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && a12 <= 5) && 10 <= \old(a16)) && 5 == \old(a12)) && 0 <= a18 + 154)) || ((((3 == \old(a15) && 5 == \old(a12)) && ((((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && 10 <= \old(a16)) && !(7 == a12)) && a15 == \old(a15)) && 6 <= a12)) || ((((((3 == \old(a15) && 5 == \old(a12)) && a12 <= 5) && a16 == 12) && 10 <= \old(a16)) && 0 <= a18 + 154) && !(4 == a15))) || (((((((3 == \old(a15) && 5 == \old(a12)) && !(a12 == 6)) && a16 == 12) && !(7 == a12)) && 10 <= \old(a16)) && !(4 == a15)) && 0 < a18 + 79)) || (((a16 == 9 && 3 == \old(a15)) && a12 == 7 && ((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && 10 <= \old(a16))) || ((((((a16 == 8 && a15 == 4) && a18 + 156 <= 0) && 10 <= \old(a16)) && 3 == \old(a15)) && 5 == \old(a12)) && a12 == 8)) || !(\old(a12) <= 5)) || ((((a16 == 8 && 3 == \old(a15)) && 5 == \old(a12)) && a12 <= 5) && 10 <= \old(a16))) || ((10 <= \old(a16) && 3 == \old(a15) && a16 == 8 && !(4 == a15)) && 0 < a18 + 79)) || ((a16 == 8 && 10 <= \old(a16)) && (!(12 == a16) && !(a12 == 8)) && !(4 == a15))) || 4 == \old(a15)) || ((((a16 == 9 && 3 == \old(a15)) && 5 == \old(a12)) && 10 <= \old(a16)) && 0 <= a18 + 154)) || (((((!(a12 == 6) && !(a16 == 8)) && !(12 == a16)) && !(4 == a15)) && a16 == \old(a16)) && 10 == \old(a16))) || (((((3 == \old(a15) && a12 <= 8) && a16 == 9) && 5 == \old(a12)) && 10 <= \old(a16)) && 6 <= a12)) || ((((((3 == \old(a15) && a18 + 156 <= 0) && 5 == \old(a12)) && a12 == 8) && a16 == 12) && 10 <= \old(a16)) && a15 == \old(a15))) || ((5 == \old(a12) && ((((!(a12 == 6) && !(a16 == 8)) && !(12 == a16)) && !(4 == a15)) && 3 == \old(a15)) && a12 == 8) && 10 <= \old(a16))) || ((a16 == \old(a16) && 10 == \old(a16)) && (!(12 == a16) && !(a12 == 8)) && !(4 == a15))) || 8 == \old(a16)) || ((a16 == 9 && ((((!(a12 == 6) && !(a16 == 8)) && !(12 == a16)) && !(4 == a15)) && 3 == \old(a15)) && a12 == 8) && 10 <= \old(a16))) || ((((a16 == 9 && 3 == \old(a15)) && a18 + 156 <= 0) && 5 == \old(a12)) && 10 <= \old(a16))) || (((((a18 + 156 <= 0 && 10 <= \old(a16)) && 3 == \old(a15)) && 5 == \old(a12)) && a16 <= 9) && a12 == 6)) || 12 == \old(a16)) || ((a16 == 9 && 3 == \old(a15)) && ((((!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && !(4 == a15)) && 10 <= \old(a16)) && !(7 == a12))) || ((((((a16 == 8 && 3 == \old(a15)) && 5 == \old(a12)) && (!(a12 == 6) && !(12 == a16)) && !(a12 == 8)) && 10 <= \old(a16)) && !(7 == a12)) && 0 <= a18 + 154)) || (((((((((a18 + 156 <= 0 && 3 == \old(a15)) && 5 == \old(a12)) && !(a12 == 6)) && a16 == 12) && !(7 == a12)) && 10 <= \old(a16)) && !(a12 == 8)) && !(4 == a15)) && 6 <= a12)) || (((((((0 <= a18 + 139 && 3 == \old(a15)) && 5 == \old(a12)) && a12 == 7) && 10 <= \old(a16)) && a16 == 12) && !(4 == a15)) && a18 <= 132) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 409 locations, 1 error locations. SAFE Result, 114.2s OverallTime, 14 OverallIterations, 9 TraceHistogramMax, 64.3s AutomataDifference, 0.0s DeadEndRemovalTime, 28.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1232 SDtfs, 25890 SDslu, 1683 SDs, 0 SdLazy, 51206 SolverSat, 7936 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7585 GetRequests, 7365 SyntacticMatches, 4 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2647 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17325occurred in iteration=12, 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: 3.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 5776 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 2559 PreInvPairs, 3195 NumberOfFragments, 4868 HoareAnnotationTreeSize, 2559 FomulaSimplifications, 245614 FormulaSimplificationTreeSizeReduction, 4.8s HoareSimplificationTime, 9 FomulaSimplificationsInter, 197236 FormulaSimplificationTreeSizeReductionInter, 23.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 15574 NumberOfCodeBlocks, 15574 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 15551 ConstructedInterpolants, 0 QuantifiedInterpolants, 28744183 SizeOfPredicates, 6 NumberOfNonLiveVariables, 9766 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 23 InterpolantComputations, 9 PerfectInterpolantSequences, 22453/23993 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...