java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label53.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:28:11,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:28:11,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:28:11,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:28:11,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:28:11,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:28:11,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:28:11,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:28:11,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:28:11,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:28:11,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:28:11,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:28:11,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:28:11,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:28:11,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:28:11,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:28:11,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:28:11,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:28:11,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:28:11,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:28:11,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:28:11,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:28:11,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:28:11,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:28:11,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:28:11,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:28:11,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:28:11,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:28:11,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:28:11,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:28:11,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:28:11,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:28:11,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:28:11,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:28:11,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:28:11,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:28:11,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:28:11,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:28:11,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:28:11,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:28:11,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:28:11,231 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:28:11,257 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:28:11,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:28:11,258 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:28:11,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:28:11,259 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:28:11,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:28:11,260 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:28:11,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:28:11,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:28:11,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:28:11,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:28:11,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:28:11,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:28:11,261 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:28:11,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:28:11,261 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:28:11,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:28:11,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:28:11,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:28:11,262 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:28:11,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:28:11,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:28:11,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:28:11,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:28:11,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:28:11,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:28:11,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:28:11,265 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:28:11,265 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:28:11,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:28:11,321 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:28:11,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:28:11,329 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:28:11,330 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:28:11,330 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label53.c [2019-10-02 01:28:11,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038ce0fce/2e9cb32a28be49048d89937a5c6102e1/FLAG268ac2e2a [2019-10-02 01:28:12,038 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:28:12,041 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label53.c [2019-10-02 01:28:12,062 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038ce0fce/2e9cb32a28be49048d89937a5c6102e1/FLAG268ac2e2a [2019-10-02 01:28:12,217 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038ce0fce/2e9cb32a28be49048d89937a5c6102e1 [2019-10-02 01:28:12,225 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:28:12,227 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:28:12,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:28:12,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:28:12,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:28:12,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:28:12" (1/1) ... [2019-10-02 01:28:12,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f2b4d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:12, skipping insertion in model container [2019-10-02 01:28:12,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:28:12" (1/1) ... [2019-10-02 01:28:12,243 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:28:12,318 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:28:13,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:28:13,228 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:28:13,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:28:13,607 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:28:13,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:13 WrapperNode [2019-10-02 01:28:13,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:28:13,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:28:13,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:28:13,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:28:13,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:13" (1/1) ... [2019-10-02 01:28:13,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:13" (1/1) ... [2019-10-02 01:28:13,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:13" (1/1) ... [2019-10-02 01:28:13,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:13" (1/1) ... [2019-10-02 01:28:13,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:13" (1/1) ... [2019-10-02 01:28:13,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:13" (1/1) ... [2019-10-02 01:28:13,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:13" (1/1) ... [2019-10-02 01:28:13,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:28:13,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:28:13,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:28:13,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:28:13,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:13" (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:28:13,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:28:13,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:28:13,892 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 01:28:13,893 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-02 01:28:13,893 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:28:13,893 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 01:28:13,894 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-02 01:28:13,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:28:13,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:28:13,894 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:28:13,895 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:28:13,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:28:13,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:28:17,139 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:28:17,140 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 01:28:17,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:28:17 BoogieIcfgContainer [2019-10-02 01:28:17,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:28:17,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:28:17,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:28:17,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:28:17,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:28:12" (1/3) ... [2019-10-02 01:28:17,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c19044c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:28:17, skipping insertion in model container [2019-10-02 01:28:17,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:13" (2/3) ... [2019-10-02 01:28:17,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c19044c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:28:17, skipping insertion in model container [2019-10-02 01:28:17,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:28:17" (3/3) ... [2019-10-02 01:28:17,149 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label53.c [2019-10-02 01:28:17,158 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:28:17,166 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 01:28:17,182 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 01:28:17,215 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:28:17,216 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:28:17,216 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:28:17,216 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:28:17,217 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:28:17,217 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:28:17,217 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:28:17,217 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:28:17,217 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:28:17,244 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-10-02 01:28:17,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 01:28:17,252 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:28:17,253 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:28:17,255 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:28:17,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:28:17,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1056547171, now seen corresponding path program 1 times [2019-10-02 01:28:17,262 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:28:17,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:28:17,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:17,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:17,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:17,602 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:28:17,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:28:17,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:28:17,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:28:17,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:28:17,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:28:17,627 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 4 states. [2019-10-02 01:28:21,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:28:21,996 INFO L93 Difference]: Finished difference Result 1546 states and 2831 transitions. [2019-10-02 01:28:21,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:28:21,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-10-02 01:28:21,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:28:22,024 INFO L225 Difference]: With dead ends: 1546 [2019-10-02 01:28:22,024 INFO L226 Difference]: Without dead ends: 1028 [2019-10-02 01:28:22,036 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:28:22,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-10-02 01:28:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 700. [2019-10-02 01:28:22,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-10-02 01:28:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1110 transitions. [2019-10-02 01:28:22,134 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1110 transitions. Word has length 53 [2019-10-02 01:28:22,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:28:22,135 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 1110 transitions. [2019-10-02 01:28:22,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:28:22,136 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1110 transitions. [2019-10-02 01:28:22,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 01:28:22,146 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:28:22,147 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:28:22,149 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:28:22,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:28:22,150 INFO L82 PathProgramCache]: Analyzing trace with hash -602725951, now seen corresponding path program 1 times [2019-10-02 01:28:22,151 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:28:22,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:28:22,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:22,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:22,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:22,407 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:28:22,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:28:22,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 01:28:22,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 01:28:22,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 01:28:22,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 01:28:22,410 INFO L87 Difference]: Start difference. First operand 700 states and 1110 transitions. Second operand 5 states. [2019-10-02 01:28:26,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:28:26,311 INFO L93 Difference]: Finished difference Result 2057 states and 3297 transitions. [2019-10-02 01:28:26,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 01:28:26,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-10-02 01:28:26,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:28:26,323 INFO L225 Difference]: With dead ends: 2057 [2019-10-02 01:28:26,323 INFO L226 Difference]: Without dead ends: 1363 [2019-10-02 01:28:26,326 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:28:26,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-10-02 01:28:26,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1333. [2019-10-02 01:28:26,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-10-02 01:28:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1846 transitions. [2019-10-02 01:28:26,379 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1846 transitions. Word has length 125 [2019-10-02 01:28:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:28:26,380 INFO L475 AbstractCegarLoop]: Abstraction has 1333 states and 1846 transitions. [2019-10-02 01:28:26,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 01:28:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1846 transitions. [2019-10-02 01:28:26,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 01:28:26,382 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:28:26,383 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, 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] [2019-10-02 01:28:26,383 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:28:26,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:28:26,384 INFO L82 PathProgramCache]: Analyzing trace with hash 741212625, now seen corresponding path program 1 times [2019-10-02 01:28:26,384 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:28:26,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:28:26,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:26,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:26,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:26,630 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:28:26,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:28:26,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:28:26,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:28:26,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:28:26,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:28:26,636 INFO L87 Difference]: Start difference. First operand 1333 states and 1846 transitions. Second operand 6 states. [2019-10-02 01:28:33,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:28:33,816 INFO L93 Difference]: Finished difference Result 6402 states and 9367 transitions. [2019-10-02 01:28:33,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 01:28:33,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-10-02 01:28:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:28:33,843 INFO L225 Difference]: With dead ends: 6402 [2019-10-02 01:28:33,843 INFO L226 Difference]: Without dead ends: 5075 [2019-10-02 01:28:33,847 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:28:33,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5075 states. [2019-10-02 01:28:33,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5075 to 4748. [2019-10-02 01:28:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4748 states. [2019-10-02 01:28:33,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4748 states to 4748 states and 6574 transitions. [2019-10-02 01:28:33,975 INFO L78 Accepts]: Start accepts. Automaton has 4748 states and 6574 transitions. Word has length 133 [2019-10-02 01:28:33,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:28:33,976 INFO L475 AbstractCegarLoop]: Abstraction has 4748 states and 6574 transitions. [2019-10-02 01:28:33,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:28:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 4748 states and 6574 transitions. [2019-10-02 01:28:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 01:28:33,981 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:28:33,982 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:28:33,982 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:28:33,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:28:33,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1520888321, now seen corresponding path program 1 times [2019-10-02 01:28:33,983 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:28:33,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:28:33,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:33,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:33,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-02 01:28:34,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:28:34,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:28:34,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:28:34,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:28:34,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:28:34,209 INFO L87 Difference]: Start difference. First operand 4748 states and 6574 transitions. Second operand 4 states. [2019-10-02 01:28:38,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:28:38,294 INFO L93 Difference]: Finished difference Result 18433 states and 26449 transitions. [2019-10-02 01:28:38,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:28:38,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-10-02 01:28:38,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:28:38,361 INFO L225 Difference]: With dead ends: 18433 [2019-10-02 01:28:38,361 INFO L226 Difference]: Without dead ends: 13691 [2019-10-02 01:28:38,376 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:28:38,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13691 states. [2019-10-02 01:28:38,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13691 to 11845. [2019-10-02 01:28:38,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11845 states. [2019-10-02 01:28:38,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11845 states to 11845 states and 15841 transitions. [2019-10-02 01:28:38,742 INFO L78 Accepts]: Start accepts. Automaton has 11845 states and 15841 transitions. Word has length 211 [2019-10-02 01:28:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:28:38,744 INFO L475 AbstractCegarLoop]: Abstraction has 11845 states and 15841 transitions. [2019-10-02 01:28:38,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:28:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 11845 states and 15841 transitions. [2019-10-02 01:28:38,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-10-02 01:28:38,762 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:28:38,762 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:28:38,763 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:28:38,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:28:38,764 INFO L82 PathProgramCache]: Analyzing trace with hash 888259648, now seen corresponding path program 1 times [2019-10-02 01:28:38,764 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:28:38,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:28:38,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:38,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:38,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:39,302 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-10-02 01:28:39,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:28:39,303 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:28:39,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:39,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 01:28:39,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:28:39,793 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-10-02 01:28:39,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:28:39,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-10-02 01:28:39,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:28:39,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:28:39,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:28:39,800 INFO L87 Difference]: Start difference. First operand 11845 states and 15841 transitions. Second operand 6 states. [2019-10-02 01:28:43,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:28:43,717 INFO L93 Difference]: Finished difference Result 29669 states and 40846 transitions. [2019-10-02 01:28:43,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 01:28:43,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 446 [2019-10-02 01:28:43,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:28:43,810 INFO L225 Difference]: With dead ends: 29669 [2019-10-02 01:28:43,811 INFO L226 Difference]: Without dead ends: 17830 [2019-10-02 01:28:43,845 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:28:43,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17830 states. [2019-10-02 01:28:44,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17830 to 14712. [2019-10-02 01:28:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14712 states. [2019-10-02 01:28:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14712 states to 14712 states and 19369 transitions. [2019-10-02 01:28:44,391 INFO L78 Accepts]: Start accepts. Automaton has 14712 states and 19369 transitions. Word has length 446 [2019-10-02 01:28:44,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:28:44,393 INFO L475 AbstractCegarLoop]: Abstraction has 14712 states and 19369 transitions. [2019-10-02 01:28:44,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:28:44,393 INFO L276 IsEmpty]: Start isEmpty. Operand 14712 states and 19369 transitions. [2019-10-02 01:28:44,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-10-02 01:28:44,410 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:28:44,410 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:28:44,411 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:28:44,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:28:44,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1074642115, now seen corresponding path program 1 times [2019-10-02 01:28:44,411 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:28:44,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:28:44,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:44,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:44,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:44,753 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-10-02 01:28:44,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:28:44,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:28:44,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:28:44,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:28:44,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:28:44,755 INFO L87 Difference]: Start difference. First operand 14712 states and 19369 transitions. Second operand 3 states. [2019-10-02 01:28:46,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:28:46,811 INFO L93 Difference]: Finished difference Result 34048 states and 45399 transitions. [2019-10-02 01:28:46,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:28:46,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 453 [2019-10-02 01:28:46,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:28:46,873 INFO L225 Difference]: With dead ends: 34048 [2019-10-02 01:28:46,873 INFO L226 Difference]: Without dead ends: 18059 [2019-10-02 01:28:46,913 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:28:46,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18059 states. [2019-10-02 01:28:47,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18059 to 16520. [2019-10-02 01:28:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16520 states. [2019-10-02 01:28:47,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16520 states to 16520 states and 20323 transitions. [2019-10-02 01:28:47,248 INFO L78 Accepts]: Start accepts. Automaton has 16520 states and 20323 transitions. Word has length 453 [2019-10-02 01:28:47,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:28:47,249 INFO L475 AbstractCegarLoop]: Abstraction has 16520 states and 20323 transitions. [2019-10-02 01:28:47,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:28:47,250 INFO L276 IsEmpty]: Start isEmpty. Operand 16520 states and 20323 transitions. [2019-10-02 01:28:47,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2019-10-02 01:28:47,277 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:28:47,277 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, 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, 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] [2019-10-02 01:28:47,281 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:28:47,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:28:47,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1709235391, now seen corresponding path program 1 times [2019-10-02 01:28:47,283 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:28:47,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:28:47,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:47,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:47,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 333 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-02 01:28:47,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:28:47,720 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:28:47,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:47,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:28:47,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:28:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 333 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-02 01:28:48,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:28:48,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:28:48,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:28:48,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:28:48,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:28:48,139 INFO L87 Difference]: Start difference. First operand 16520 states and 20323 transitions. Second operand 9 states. [2019-10-02 01:28:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:28:53,821 INFO L93 Difference]: Finished difference Result 48125 states and 65622 transitions. [2019-10-02 01:28:53,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 01:28:53,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 463 [2019-10-02 01:28:53,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:28:53,951 INFO L225 Difference]: With dead ends: 48125 [2019-10-02 01:28:53,951 INFO L226 Difference]: Without dead ends: 31611 [2019-10-02 01:28:54,003 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-10-02 01:28:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31611 states. [2019-10-02 01:28:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31611 to 29087. [2019-10-02 01:28:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29087 states. [2019-10-02 01:28:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29087 states to 29087 states and 38614 transitions. [2019-10-02 01:28:55,791 INFO L78 Accepts]: Start accepts. Automaton has 29087 states and 38614 transitions. Word has length 463 [2019-10-02 01:28:55,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:28:55,792 INFO L475 AbstractCegarLoop]: Abstraction has 29087 states and 38614 transitions. [2019-10-02 01:28:55,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:28:55,792 INFO L276 IsEmpty]: Start isEmpty. Operand 29087 states and 38614 transitions. [2019-10-02 01:28:55,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2019-10-02 01:28:55,828 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:28:55,829 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:55,829 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:28:55,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:28:55,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1934472879, now seen corresponding path program 1 times [2019-10-02 01:28:55,831 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:28:55,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:28:55,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:55,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:55,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:56,230 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 198 proven. 2 refuted. 0 times theorem prover too weak. 623 trivial. 0 not checked. [2019-10-02 01:28:56,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:28:56,231 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) [2019-10-02 01:28:56,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:28:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:56,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 01:28:56,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:28:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 432 proven. 0 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 01:28:56,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:28:56,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-10-02 01:28:56,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:28:56,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:28:56,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:28:56,801 INFO L87 Difference]: Start difference. First operand 29087 states and 38614 transitions. Second operand 3 states. [2019-10-02 01:28:58,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:28:58,657 INFO L93 Difference]: Finished difference Result 58475 states and 77580 transitions. [2019-10-02 01:28:58,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:28:58,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 591 [2019-10-02 01:28:58,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:28:58,777 INFO L225 Difference]: With dead ends: 58475 [2019-10-02 01:28:58,778 INFO L226 Difference]: Without dead ends: 29394 [2019-10-02 01:28:58,838 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 592 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:28:58,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29394 states. [2019-10-02 01:28:59,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29394 to 29083. [2019-10-02 01:28:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29083 states. [2019-10-02 01:28:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29083 states to 29083 states and 38551 transitions. [2019-10-02 01:28:59,477 INFO L78 Accepts]: Start accepts. Automaton has 29083 states and 38551 transitions. Word has length 591 [2019-10-02 01:28:59,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:28:59,478 INFO L475 AbstractCegarLoop]: Abstraction has 29083 states and 38551 transitions. [2019-10-02 01:28:59,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:28:59,478 INFO L276 IsEmpty]: Start isEmpty. Operand 29083 states and 38551 transitions. [2019-10-02 01:28:59,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2019-10-02 01:28:59,528 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:28:59,528 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 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:28:59,529 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:28:59,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:28:59,529 INFO L82 PathProgramCache]: Analyzing trace with hash 993982487, now seen corresponding path program 1 times [2019-10-02 01:28:59,529 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:28:59,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:28:59,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:59,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:59,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1118 backedges. 483 proven. 79 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2019-10-02 01:29:00,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:29:00,435 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:29:00,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:29:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:00,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:29:00,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:29:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1118 backedges. 786 proven. 2 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-10-02 01:29:01,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:29:01,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:29:01,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:29:01,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:29:01,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:29:01,147 INFO L87 Difference]: Start difference. First operand 29083 states and 38551 transitions. Second operand 9 states. [2019-10-02 01:29:06,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:29:06,471 INFO L93 Difference]: Finished difference Result 60432 states and 87656 transitions. [2019-10-02 01:29:06,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 01:29:06,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 633 [2019-10-02 01:29:06,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:29:06,643 INFO L225 Difference]: With dead ends: 60432 [2019-10-02 01:29:06,643 INFO L226 Difference]: Without dead ends: 31355 [2019-10-02 01:29:07,704 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 638 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-10-02 01:29:07,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31355 states. [2019-10-02 01:29:08,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31355 to 29811. [2019-10-02 01:29:08,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29811 states. [2019-10-02 01:29:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29811 states to 29811 states and 42441 transitions. [2019-10-02 01:29:08,409 INFO L78 Accepts]: Start accepts. Automaton has 29811 states and 42441 transitions. Word has length 633 [2019-10-02 01:29:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:29:08,411 INFO L475 AbstractCegarLoop]: Abstraction has 29811 states and 42441 transitions. [2019-10-02 01:29:08,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:29:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 29811 states and 42441 transitions. [2019-10-02 01:29:08,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2019-10-02 01:29:08,458 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:29:08,458 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, 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:08,459 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:29:08,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:29:08,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1458395629, now seen corresponding path program 1 times [2019-10-02 01:29:08,459 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:29:08,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:29:08,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:29:08,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:29:08,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:29:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:09,159 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 477 proven. 97 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2019-10-02 01:29:09,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:29:09,160 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:29:09,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:29:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:09,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 01:29:09,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:29:09,704 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 432 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2019-10-02 01:29:09,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:29:09,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-10-02 01:29:09,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 01:29:09,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 01:29:09,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:29:09,719 INFO L87 Difference]: Start difference. First operand 29811 states and 42441 transitions. Second operand 8 states. [2019-10-02 01:29:14,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:29:14,685 INFO L93 Difference]: Finished difference Result 68629 states and 99094 transitions. [2019-10-02 01:29:14,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 01:29:14,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 640 [2019-10-02 01:29:14,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:29:14,877 INFO L225 Difference]: With dead ends: 68629 [2019-10-02 01:29:14,878 INFO L226 Difference]: Without dead ends: 38828 [2019-10-02 01:29:15,003 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 644 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-10-02 01:29:15,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38828 states. [2019-10-02 01:29:16,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38828 to 35305. [2019-10-02 01:29:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35305 states. [2019-10-02 01:29:16,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35305 states to 35305 states and 49872 transitions. [2019-10-02 01:29:16,307 INFO L78 Accepts]: Start accepts. Automaton has 35305 states and 49872 transitions. Word has length 640 [2019-10-02 01:29:16,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:29:16,308 INFO L475 AbstractCegarLoop]: Abstraction has 35305 states and 49872 transitions. [2019-10-02 01:29:16,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 01:29:16,308 INFO L276 IsEmpty]: Start isEmpty. Operand 35305 states and 49872 transitions. [2019-10-02 01:29:16,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2019-10-02 01:29:16,364 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:29:16,364 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:29:16,365 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:29:16,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:29:16,365 INFO L82 PathProgramCache]: Analyzing trace with hash 672558166, now seen corresponding path program 1 times [2019-10-02 01:29:16,365 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:29:16,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:29:16,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:29:16,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:29:16,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:29:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 748 proven. 440 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-02 01:29:17,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:29:17,311 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:29:17,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:29:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:17,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 01:29:17,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:29:18,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 910 proven. 2 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2019-10-02 01:29:18,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:29:18,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-10-02 01:29:18,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 01:29:18,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 01:29:18,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-02 01:29:18,318 INFO L87 Difference]: Start difference. First operand 35305 states and 49872 transitions. Second operand 17 states. [2019-10-02 01:29:54,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:29:54,200 INFO L93 Difference]: Finished difference Result 111983 states and 170120 transitions. [2019-10-02 01:29:54,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-10-02 01:29:54,201 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 703 [2019-10-02 01:29:54,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:29:54,526 INFO L225 Difference]: With dead ends: 111983 [2019-10-02 01:29:54,526 INFO L226 Difference]: Without dead ends: 59455 [2019-10-02 01:29:54,730 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 908 GetRequests, 784 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6038 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2306, Invalid=13444, Unknown=0, NotChecked=0, Total=15750 [2019-10-02 01:29:54,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59455 states. [2019-10-02 01:29:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59455 to 52065. [2019-10-02 01:29:55,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52065 states. [2019-10-02 01:29:56,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52065 states to 52065 states and 65418 transitions. [2019-10-02 01:29:56,031 INFO L78 Accepts]: Start accepts. Automaton has 52065 states and 65418 transitions. Word has length 703 [2019-10-02 01:29:56,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:29:56,032 INFO L475 AbstractCegarLoop]: Abstraction has 52065 states and 65418 transitions. [2019-10-02 01:29:56,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 01:29:56,032 INFO L276 IsEmpty]: Start isEmpty. Operand 52065 states and 65418 transitions. [2019-10-02 01:29:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2019-10-02 01:29:56,084 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:29:56,085 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:56,085 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:29:56,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:29:56,086 INFO L82 PathProgramCache]: Analyzing trace with hash -313073638, now seen corresponding path program 1 times [2019-10-02 01:29:56,086 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:29:56,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:29:56,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:29:56,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:29:56,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:29:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 549 proven. 97 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2019-10-02 01:29:57,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:29:57,834 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:29:57,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:29:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:58,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:29:58,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:29:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 860 proven. 2 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2019-10-02 01:29:58,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:29:58,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:29:58,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:29:58,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:29:58,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:29:58,386 INFO L87 Difference]: Start difference. First operand 52065 states and 65418 transitions. Second operand 9 states. [2019-10-02 01:30:04,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:30:04,227 INFO L93 Difference]: Finished difference Result 109623 states and 149358 transitions. [2019-10-02 01:30:04,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 01:30:04,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 790 [2019-10-02 01:30:04,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:30:04,578 INFO L225 Difference]: With dead ends: 109623 [2019-10-02 01:30:04,579 INFO L226 Difference]: Without dead ends: 57875 [2019-10-02 01:30:04,766 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 799 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-10-02 01:30:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57875 states. [2019-10-02 01:30:06,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57875 to 55996. [2019-10-02 01:30:06,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55996 states. [2019-10-02 01:30:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55996 states to 55996 states and 75889 transitions. [2019-10-02 01:30:06,465 INFO L78 Accepts]: Start accepts. Automaton has 55996 states and 75889 transitions. Word has length 790 [2019-10-02 01:30:06,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:30:06,466 INFO L475 AbstractCegarLoop]: Abstraction has 55996 states and 75889 transitions. [2019-10-02 01:30:06,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:30:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 55996 states and 75889 transitions. [2019-10-02 01:30:06,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 813 [2019-10-02 01:30:06,539 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:30:06,540 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:06,540 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:30:06,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:30:06,541 INFO L82 PathProgramCache]: Analyzing trace with hash 717328061, now seen corresponding path program 1 times [2019-10-02 01:30:06,541 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:30:06,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:30:06,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:30:06,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:30:06,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:30:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:30:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 819 proven. 90 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2019-10-02 01:30:07,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:30:07,796 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:30:07,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:30:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:30:08,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 1110 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:30:08,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:30:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2019-10-02 01:30:08,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:30:08,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-10-02 01:30:08,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:30:08,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:30:08,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:30:08,260 INFO L87 Difference]: Start difference. First operand 55996 states and 75889 transitions. Second operand 4 states. [2019-10-02 01:30:12,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:30:12,657 INFO L93 Difference]: Finished difference Result 107231 states and 145891 transitions. [2019-10-02 01:30:12,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 01:30:12,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 812 [2019-10-02 01:30:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:30:12,891 INFO L225 Difference]: With dead ends: 107231 [2019-10-02 01:30:12,891 INFO L226 Difference]: Without dead ends: 56732 [2019-10-02 01:30:13,051 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 822 GetRequests, 817 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 01:30:13,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56732 states. [2019-10-02 01:30:13,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56732 to 55025. [2019-10-02 01:30:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55025 states. [2019-10-02 01:30:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55025 states to 55025 states and 74339 transitions. [2019-10-02 01:30:14,314 INFO L78 Accepts]: Start accepts. Automaton has 55025 states and 74339 transitions. Word has length 812 [2019-10-02 01:30:14,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:30:14,315 INFO L475 AbstractCegarLoop]: Abstraction has 55025 states and 74339 transitions. [2019-10-02 01:30:14,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:30:14,315 INFO L276 IsEmpty]: Start isEmpty. Operand 55025 states and 74339 transitions. [2019-10-02 01:30:14,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1052 [2019-10-02 01:30:14,456 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:30:14,457 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:14,457 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:30:14,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:30:14,458 INFO L82 PathProgramCache]: Analyzing trace with hash 431152531, now seen corresponding path program 1 times [2019-10-02 01:30:14,458 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:30:14,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:30:14,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:30:14,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:30:14,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:30:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:30:16,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2549 backedges. 1428 proven. 93 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2019-10-02 01:30:16,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:30:16,427 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:30:16,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:30:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:30:16,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 01:30:16,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:30:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2549 backedges. 1480 proven. 2 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2019-10-02 01:30:18,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:30:18,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-10-02 01:30:18,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 01:30:18,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 01:30:18,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 01:30:18,398 INFO L87 Difference]: Start difference. First operand 55025 states and 74339 transitions. Second operand 10 states. [2019-10-02 01:30:25,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:30:25,390 INFO L93 Difference]: Finished difference Result 107475 states and 136847 transitions. [2019-10-02 01:30:25,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 01:30:25,390 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1051 [2019-10-02 01:30:25,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:30:25,531 INFO L225 Difference]: With dead ends: 107475 [2019-10-02 01:30:25,531 INFO L226 Difference]: Without dead ends: 50184 [2019-10-02 01:30:25,708 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1119 GetRequests, 1079 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=409, Invalid=1313, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 01:30:25,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50184 states. [2019-10-02 01:30:26,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50184 to 45090. [2019-10-02 01:30:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45090 states. [2019-10-02 01:30:26,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45090 states to 45090 states and 48534 transitions. [2019-10-02 01:30:26,308 INFO L78 Accepts]: Start accepts. Automaton has 45090 states and 48534 transitions. Word has length 1051 [2019-10-02 01:30:26,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:30:26,309 INFO L475 AbstractCegarLoop]: Abstraction has 45090 states and 48534 transitions. [2019-10-02 01:30:26,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 01:30:26,309 INFO L276 IsEmpty]: Start isEmpty. Operand 45090 states and 48534 transitions. [2019-10-02 01:30:26,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1429 [2019-10-02 01:30:26,553 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:30:26,554 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:30:26,554 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:30:26,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:30:26,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1781803810, now seen corresponding path program 1 times [2019-10-02 01:30:26,555 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:30:26,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:30:26,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:30:26,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:30:26,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:30:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:30:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4262 backedges. 1252 proven. 294 refuted. 0 times theorem prover too weak. 2716 trivial. 0 not checked. [2019-10-02 01:30:28,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:30:28,120 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:30:28,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:30:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:30:28,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 1907 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 01:30:28,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:30:29,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4262 backedges. 2792 proven. 2 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2019-10-02 01:30:29,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:30:29,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-10-02 01:30:29,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 01:30:29,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 01:30:29,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:30:29,311 INFO L87 Difference]: Start difference. First operand 45090 states and 48534 transitions. Second operand 8 states. [2019-10-02 01:30:31,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:30:31,605 INFO L93 Difference]: Finished difference Result 84530 states and 90848 transitions. [2019-10-02 01:30:31,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 01:30:31,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1428 [2019-10-02 01:30:31,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:30:31,607 INFO L225 Difference]: With dead ends: 84530 [2019-10-02 01:30:31,607 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 01:30:31,690 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1439 GetRequests, 1431 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-02 01:30:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 01:30:31,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 01:30:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 01:30:31,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 01:30:31,692 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1428 [2019-10-02 01:30:31,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:30:31,693 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 01:30:31,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 01:30:31,693 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 01:30:31,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 01:30:31,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 01:30:47,077 WARN L191 SmtUtils]: Spent 12.02 s on a formula simplification. DAG size of input: 2355 DAG size of output: 1527 [2019-10-02 01:30:58,829 WARN L191 SmtUtils]: Spent 11.74 s on a formula simplification. DAG size of input: 2355 DAG size of output: 1527 [2019-10-02 01:31:09,443 WARN L191 SmtUtils]: Spent 8.08 s on a formula simplification. DAG size of input: 951 DAG size of output: 196 [2019-10-02 01:31:17,551 WARN L191 SmtUtils]: Spent 8.06 s on a formula simplification. DAG size of input: 951 DAG size of output: 196 [2019-10-02 01:31:43,055 WARN L191 SmtUtils]: Spent 25.48 s on a formula simplification. DAG size of input: 1465 DAG size of output: 128 [2019-10-02 01:32:08,523 WARN L191 SmtUtils]: Spent 25.46 s on a formula simplification. DAG size of input: 1465 DAG size of output: 128 [2019-10-02 01:32:16,706 WARN L191 SmtUtils]: Spent 8.03 s on a formula simplification. DAG size of input: 951 DAG size of output: 196 [2019-10-02 01:32:16,710 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:32:16,711 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a29~0 |old(~a29~0)|) (= ~a2~0 |old(~a2~0)|) (= ~a0~0 |old(~a0~0)|) (= ~a4~0 |old(~a4~0)|)) [2019-10-02 01:32:16,711 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:32:16,711 INFO L443 ceAbstractionStarter]: For program point calculate_output2EXIT(lines 1658 1758) no Hoare annotation was computed. [2019-10-02 01:32:16,711 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-10-02 01:32:16,711 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-10-02 01:32:16,712 INFO L439 ceAbstractionStarter]: At program point calculate_output2ENTRY(lines 1658 1758) the Hoare annotation is: (let ((.cse43 (+ |old(~a4~0)| 86)) (.cse36 (not (< 43 |old(~a29~0)|))) (.cse44 (+ |old(~a0~0)| 98)) (.cse42 (+ |old(~a29~0)| 16))) (let ((.cse30 (= ~a2~0 |old(~a2~0)|)) (.cse41 (+ |old(~a0~0)| 61)) (.cse27 (= 3 ~a2~0)) (.cse40 (= 4 |old(~a2~0)|)) (.cse2 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse18 (not (= 1 |old(~a2~0)|))) (.cse46 (= 5 ~a2~0)) (.cse17 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse45 (= 2 ~a2~0)) (.cse25 (= ~a29~0 |old(~a29~0)|)) (.cse37 (= 4 ~a2~0)) (.cse26 (= ~a0~0 |old(~a0~0)|)) (.cse24 (= ~a4~0 |old(~a4~0)|)) (.cse3 (not (<= .cse42 0))) (.cse39 (and (not (< 0 .cse43)) .cse36 (not (<= .cse44 0))))) (let ((.cse4 (not (<= (+ |old(~a0~0)| 104) 0))) (.cse9 (or .cse3 .cse39)) (.cse13 (not (<= 0 (+ (* 9 |old(~a29~0)|) (* 10 |old(~a0~0)|) 2248)))) (.cse14 (and .cse25 .cse37 .cse26 .cse24)) (.cse16 (not (<= (+ |old(~a0~0)| 108) (+ |old(~a4~0)| |old(~a29~0)|)))) (.cse20 (and .cse25 .cse26 .cse45 .cse24)) (.cse15 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse31 (and (or (<= (+ ~a0~0 98) 0) (< 43 ~a29~0)) .cse24)) (.cse33 (or .cse17 .cse39)) (.cse34 (and .cse25 .cse26 .cse46 .cse24)) (.cse10 (and .cse25 .cse46 .cse26 .cse24)) (.cse11 (not (= 5 |old(~a2~0)|))) (.cse28 (or .cse2 (or .cse18 .cse39))) (.cse1 (not .cse40)) (.cse29 (not (<= (+ |old(~a0~0)| 142) 0))) (.cse0 (and .cse25 .cse26 .cse37 .cse24)) (.cse21 (not (= 2 |old(~a2~0)|))) (.cse38 (and .cse25 .cse45 .cse26 .cse24)) (.cse12 (not (< 0 .cse44))) (.cse5 (not (<= 0 (+ |old(~a4~0)| 85)))) (.cse23 (not (<= .cse43 0))) (.cse22 (not (< 0 .cse42))) (.cse6 (and .cse25 .cse26 .cse27 .cse24)) (.cse7 (not (= 3 |old(~a2~0)|))) (.cse35 (not (< 0 .cse41))) (.cse8 (not (<= .cse41 0))) (.cse32 (not (<= 2 |old(~a2~0)|))) (.cse19 (and .cse25 .cse30 .cse26 .cse24))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse2 .cse5 (not (<= (+ |old(~a0~0)| 99) 0)) .cse6 .cse7) (or .cse8 .cse9 .cse10 .cse2 .cse11 .cse12 .cse13) (or .cse14 .cse1 .cse2 .cse15 .cse5 .cse16) (or (<= (+ ~a0~0 108) (+ ~a4~0 ~a29~0)) (or .cse17 .cse16) .cse15) (or (or .cse8 .cse18 .cse2) .cse5 .cse19) (or .cse8 .cse9 .cse2 .cse12 .cse6 .cse13 .cse7) (or .cse2 .cse20 .cse5 .cse4 .cse21) (or .cse8 .cse1 .cse2 .cse22 .cse12 .cse5 .cse14) (or .cse23 (or .cse8 .cse3 .cse7) (and .cse24 (and .cse25 .cse26 .cse27))) (or .cse23 .cse18 .cse19 .cse3) (or .cse19 (or .cse28 .cse29)) (or .cse8 (and .cse25 .cse30 .cse31 .cse26) .cse32 .cse33) (or .cse34 (or .cse11 (or .cse9 .cse2 .cse4))) (or .cse1 .cse17 (not (<= 0 (+ |old(~a0~0)| 44))) .cse0) (or .cse23 .cse22 .cse11 .cse10 .cse35) (or (and .cse25 (= 1 ~a2~0) .cse26 .cse24) (or .cse17 .cse18)) (or .cse23 .cse3 .cse21 .cse20 .cse35) (or .cse1 (or .cse8 .cse2 .cse12 .cse36) (and (and .cse25 .cse26) .cse37 .cse24)) (or .cse8 .cse9 .cse1 .cse2 .cse12 .cse13 .cse14) (or .cse23 .cse1 .cse0 .cse22 .cse35) (or (or (or .cse15 .cse16) .cse2 .cse7) .cse6) (or .cse15 (<= (+ ~a29~0 16) 0) (or .cse17 .cse3)) (or (not (<= (+ |old(~a4~0)| 415425) 0)) .cse1 .cse3 .cse0) (or .cse8 .cse2 .cse22 .cse5 .cse20 .cse21) (or .cse15 (and .cse31 .cse26) .cse33) (or .cse2 .cse11 .cse36 .cse34) (or .cse10 .cse5 (or .cse8 .cse2 .cse22 .cse11)) (or .cse28 .cse22 .cse5 (and .cse25 (and .cse30 .cse26 .cse24))) (or .cse1 .cse2 .cse29 .cse36 .cse5 .cse0) (or .cse8 .cse19 .cse32 .cse17 .cse3) (or .cse23 .cse38 .cse39 .cse21 .cse35) (or (or .cse17 .cse21) .cse38) (or (or .cse8 .cse2 .cse22 .cse12 .cse7) .cse6 .cse5) (or .cse17 .cse6 .cse7) (or .cse23 .cse22 .cse6 .cse7 .cse35) (or .cse8 .cse32 (or .cse17 .cse40) .cse19))))) [2019-10-02 01:32:16,712 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-10-02 01:32:16,712 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-10-02 01:32:16,712 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-10-02 01:32:16,712 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-10-02 01:32:16,712 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-10-02 01:32:16,712 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-10-02 01:32:16,712 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-10-02 01:32:16,712 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-10-02 01:32:16,712 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-10-02 01:32:16,712 INFO L443 ceAbstractionStarter]: For program point calculate_output2FINAL(lines 1658 1758) no Hoare annotation was computed. [2019-10-02 01:32:16,713 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-10-02 01:32:16,713 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-10-02 01:32:16,713 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-10-02 01:32:16,713 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-10-02 01:32:16,713 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-10-02 01:32:16,713 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-10-02 01:32:16,713 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-10-02 01:32:16,713 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,713 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,713 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,713 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,713 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,714 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,714 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,714 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,714 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-10-02 01:32:16,714 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-10-02 01:32:16,714 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-02 01:32:16,714 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-10-02 01:32:16,714 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-10-02 01:32:16,714 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,715 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,715 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,715 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,715 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,715 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,715 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,715 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,715 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,715 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,715 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-02 01:32:16,715 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-02 01:32:16,715 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-10-02 01:32:16,715 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,716 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,716 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,716 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,716 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,716 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,716 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,716 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,716 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,716 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-10-02 01:32:16,716 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,716 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-10-02 01:32:16,716 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,716 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,716 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,717 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-10-02 01:32:16,717 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,717 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-10-02 01:32:16,717 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-10-02 01:32:16,717 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-02 01:32:16,717 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-02 01:32:16,717 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,717 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,717 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,717 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,717 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,717 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,717 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,717 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,718 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,718 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,718 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,718 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-10-02 01:32:16,718 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-02 01:32:16,718 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-02 01:32:16,718 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,718 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,718 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-10-02 01:32:16,718 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,718 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-10-02 01:32:16,718 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,718 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,719 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,719 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-10-02 01:32:16,719 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-10-02 01:32:16,719 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,719 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,719 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,719 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,719 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,719 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,719 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,719 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,719 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,720 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-10-02 01:32:16,720 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,720 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-02 01:32:16,720 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-10-02 01:32:16,720 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,720 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,720 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,720 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,720 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,720 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,720 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,720 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,720 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,721 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,721 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,721 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,721 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-10-02 01:32:16,721 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,721 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-10-02 01:32:16,721 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-10-02 01:32:16,721 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-10-02 01:32:16,721 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-02 01:32:16,721 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-02 01:32:16,722 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-10-02 01:32:16,722 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,722 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,722 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,722 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,722 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,722 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,722 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,722 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,723 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,723 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,723 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,723 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,723 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,723 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,723 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-10-02 01:32:16,723 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,723 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-02 01:32:16,723 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-10-02 01:32:16,724 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,724 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,724 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,724 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,724 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,724 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,724 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,724 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,724 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,724 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,724 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-10-02 01:32:16,725 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-02 01:32:16,725 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,725 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-10-02 01:32:16,725 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,725 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,725 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,725 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-10-02 01:32:16,725 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-10-02 01:32:16,725 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-10-02 01:32:16,725 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-10-02 01:32:16,726 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,726 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 23 1656) the Hoare annotation is: (let ((.cse43 (+ |old(~a4~0)| 86)) (.cse36 (not (< 43 |old(~a29~0)|))) (.cse44 (+ |old(~a0~0)| 98)) (.cse42 (+ |old(~a29~0)| 16))) (let ((.cse30 (= ~a2~0 |old(~a2~0)|)) (.cse41 (+ |old(~a0~0)| 61)) (.cse27 (= 3 ~a2~0)) (.cse40 (= 4 |old(~a2~0)|)) (.cse2 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse18 (not (= 1 |old(~a2~0)|))) (.cse46 (= 5 ~a2~0)) (.cse17 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse45 (= 2 ~a2~0)) (.cse25 (= ~a29~0 |old(~a29~0)|)) (.cse37 (= 4 ~a2~0)) (.cse26 (= ~a0~0 |old(~a0~0)|)) (.cse24 (= ~a4~0 |old(~a4~0)|)) (.cse3 (not (<= .cse42 0))) (.cse39 (and (not (< 0 .cse43)) .cse36 (not (<= .cse44 0))))) (let ((.cse4 (not (<= (+ |old(~a0~0)| 104) 0))) (.cse9 (or .cse3 .cse39)) (.cse13 (not (<= 0 (+ (* 9 |old(~a29~0)|) (* 10 |old(~a0~0)|) 2248)))) (.cse14 (and .cse25 .cse37 .cse26 .cse24)) (.cse16 (not (<= (+ |old(~a0~0)| 108) (+ |old(~a4~0)| |old(~a29~0)|)))) (.cse20 (and .cse25 .cse26 .cse45 .cse24)) (.cse15 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse31 (and (or (<= (+ ~a0~0 98) 0) (< 43 ~a29~0)) .cse24)) (.cse33 (or .cse17 .cse39)) (.cse34 (and .cse25 .cse26 .cse46 .cse24)) (.cse10 (and .cse25 .cse46 .cse26 .cse24)) (.cse11 (not (= 5 |old(~a2~0)|))) (.cse28 (or .cse2 (or .cse18 .cse39))) (.cse1 (not .cse40)) (.cse29 (not (<= (+ |old(~a0~0)| 142) 0))) (.cse0 (and .cse25 .cse26 .cse37 .cse24)) (.cse21 (not (= 2 |old(~a2~0)|))) (.cse38 (and .cse25 .cse45 .cse26 .cse24)) (.cse12 (not (< 0 .cse44))) (.cse5 (not (<= 0 (+ |old(~a4~0)| 85)))) (.cse23 (not (<= .cse43 0))) (.cse22 (not (< 0 .cse42))) (.cse6 (and .cse25 .cse26 .cse27 .cse24)) (.cse7 (not (= 3 |old(~a2~0)|))) (.cse35 (not (< 0 .cse41))) (.cse8 (not (<= .cse41 0))) (.cse32 (not (<= 2 |old(~a2~0)|))) (.cse19 (and .cse25 .cse30 .cse26 .cse24))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse2 .cse5 (not (<= (+ |old(~a0~0)| 99) 0)) .cse6 .cse7) (or .cse8 .cse9 .cse10 .cse2 .cse11 .cse12 .cse13) (or .cse14 .cse1 .cse2 .cse15 .cse5 .cse16) (or (<= (+ ~a0~0 108) (+ ~a4~0 ~a29~0)) (or .cse17 .cse16) .cse15) (or (or .cse8 .cse18 .cse2) .cse5 .cse19) (or .cse8 .cse9 .cse2 .cse12 .cse6 .cse13 .cse7) (or .cse2 .cse20 .cse5 .cse4 .cse21) (or .cse8 .cse1 .cse2 .cse22 .cse12 .cse5 .cse14) (or .cse23 (or .cse8 .cse3 .cse7) (and .cse24 (and .cse25 .cse26 .cse27))) (or .cse23 .cse18 .cse19 .cse3) (or .cse19 (or .cse28 .cse29)) (or .cse8 (and .cse25 .cse30 .cse31 .cse26) .cse32 .cse33) (or .cse34 (or .cse11 (or .cse9 .cse2 .cse4))) (or .cse1 .cse17 (not (<= 0 (+ |old(~a0~0)| 44))) .cse0) (or .cse23 .cse22 .cse11 .cse10 .cse35) (or (and .cse25 (= 1 ~a2~0) .cse26 .cse24) (or .cse17 .cse18)) (or .cse23 .cse3 .cse21 .cse20 .cse35) (or .cse1 (or .cse8 .cse2 .cse12 .cse36) (and (and .cse25 .cse26) .cse37 .cse24)) (or .cse8 .cse9 .cse1 .cse2 .cse12 .cse13 .cse14) (or .cse23 .cse1 .cse0 .cse22 .cse35) (or (or (or .cse15 .cse16) .cse2 .cse7) .cse6) (or .cse15 (<= (+ ~a29~0 16) 0) (or .cse17 .cse3)) (or (not (<= (+ |old(~a4~0)| 415425) 0)) .cse1 .cse3 .cse0) (or .cse8 .cse2 .cse22 .cse5 .cse20 .cse21) (or .cse15 (and .cse31 .cse26) .cse33) (or .cse2 .cse11 .cse36 .cse34) (or .cse10 .cse5 (or .cse8 .cse2 .cse22 .cse11)) (or .cse28 .cse22 .cse5 (and .cse25 (and .cse30 .cse26 .cse24))) (or .cse1 .cse2 .cse29 .cse36 .cse5 .cse0) (or .cse8 .cse19 .cse32 .cse17 .cse3) (or .cse23 .cse38 .cse39 .cse21 .cse35) (or (or .cse17 .cse21) .cse38) (or (or .cse8 .cse2 .cse22 .cse12 .cse7) .cse6 .cse5) (or .cse17 .cse6 .cse7) (or .cse23 .cse22 .cse6 .cse7 .cse35) (or .cse8 .cse32 (or .cse17 .cse40) .cse19))))) [2019-10-02 01:32:16,726 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,726 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,727 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,727 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,727 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,727 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,727 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,727 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,727 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-10-02 01:32:16,727 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-10-02 01:32:16,727 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-10-02 01:32:16,727 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,728 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-02 01:32:16,728 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-10-02 01:32:16,728 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,728 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,728 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,728 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,728 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,728 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,728 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,728 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,729 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,729 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,729 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,729 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,729 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,729 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-10-02 01:32:16,729 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-02 01:32:16,729 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-02 01:32:16,729 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,729 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,729 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2019-10-02 01:32:16,729 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,729 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,729 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,730 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,730 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,730 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,730 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,730 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,730 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,730 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-10-02 01:32:16,730 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,730 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-10-02 01:32:16,730 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,730 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-10-02 01:32:16,730 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-10-02 01:32:16,730 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-10-02 01:32:16,730 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,730 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-02 01:32:16,730 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-02 01:32:16,731 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,731 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-10-02 01:32:16,731 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-10-02 01:32:16,731 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,731 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-10-02 01:32:16,731 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-10-02 01:32:16,731 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,731 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,731 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,731 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,731 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,731 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,731 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,731 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,732 INFO L439 ceAbstractionStarter]: At program point L1655(line 1655) the Hoare annotation is: (let ((.cse43 (+ |old(~a4~0)| 86)) (.cse36 (not (< 43 |old(~a29~0)|))) (.cse44 (+ |old(~a0~0)| 98)) (.cse42 (+ |old(~a29~0)| 16))) (let ((.cse30 (= ~a2~0 |old(~a2~0)|)) (.cse41 (+ |old(~a0~0)| 61)) (.cse27 (= 3 ~a2~0)) (.cse40 (= 4 |old(~a2~0)|)) (.cse2 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse18 (not (= 1 |old(~a2~0)|))) (.cse46 (= 5 ~a2~0)) (.cse17 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse45 (= 2 ~a2~0)) (.cse25 (= ~a29~0 |old(~a29~0)|)) (.cse37 (= 4 ~a2~0)) (.cse26 (= ~a0~0 |old(~a0~0)|)) (.cse24 (= ~a4~0 |old(~a4~0)|)) (.cse3 (not (<= .cse42 0))) (.cse39 (and (not (< 0 .cse43)) .cse36 (not (<= .cse44 0))))) (let ((.cse4 (not (<= (+ |old(~a0~0)| 104) 0))) (.cse9 (or .cse3 .cse39)) (.cse13 (not (<= 0 (+ (* 9 |old(~a29~0)|) (* 10 |old(~a0~0)|) 2248)))) (.cse14 (and .cse25 .cse37 .cse26 .cse24)) (.cse16 (not (<= (+ |old(~a0~0)| 108) (+ |old(~a4~0)| |old(~a29~0)|)))) (.cse20 (and .cse25 .cse26 .cse45 .cse24)) (.cse15 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse31 (and (or (<= (+ ~a0~0 98) 0) (< 43 ~a29~0)) .cse24)) (.cse33 (or .cse17 .cse39)) (.cse34 (and .cse25 .cse26 .cse46 .cse24)) (.cse10 (and .cse25 .cse46 .cse26 .cse24)) (.cse11 (not (= 5 |old(~a2~0)|))) (.cse28 (or .cse2 (or .cse18 .cse39))) (.cse1 (not .cse40)) (.cse29 (not (<= (+ |old(~a0~0)| 142) 0))) (.cse0 (and .cse25 .cse26 .cse37 .cse24)) (.cse21 (not (= 2 |old(~a2~0)|))) (.cse38 (and .cse25 .cse45 .cse26 .cse24)) (.cse12 (not (< 0 .cse44))) (.cse5 (not (<= 0 (+ |old(~a4~0)| 85)))) (.cse23 (not (<= .cse43 0))) (.cse22 (not (< 0 .cse42))) (.cse6 (and .cse25 .cse26 .cse27 .cse24)) (.cse7 (not (= 3 |old(~a2~0)|))) (.cse35 (not (< 0 .cse41))) (.cse8 (not (<= .cse41 0))) (.cse32 (not (<= 2 |old(~a2~0)|))) (.cse19 (and .cse25 .cse30 .cse26 .cse24))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse2 .cse5 (not (<= (+ |old(~a0~0)| 99) 0)) .cse6 .cse7) (or .cse8 .cse9 .cse10 .cse2 .cse11 .cse12 .cse13) (or .cse14 .cse1 .cse2 .cse15 .cse5 .cse16) (or (<= (+ ~a0~0 108) (+ ~a4~0 ~a29~0)) (or .cse17 .cse16) .cse15) (or (or .cse8 .cse18 .cse2) .cse5 .cse19) (or .cse8 .cse9 .cse2 .cse12 .cse6 .cse13 .cse7) (or .cse2 .cse20 .cse5 .cse4 .cse21) (or .cse8 .cse1 .cse2 .cse22 .cse12 .cse5 .cse14) (or .cse23 (or .cse8 .cse3 .cse7) (and .cse24 (and .cse25 .cse26 .cse27))) (or .cse23 .cse18 .cse19 .cse3) (or .cse19 (or .cse28 .cse29)) (or .cse8 (and .cse25 .cse30 .cse31 .cse26) .cse32 .cse33) (or .cse34 (or .cse11 (or .cse9 .cse2 .cse4))) (or .cse1 .cse17 (not (<= 0 (+ |old(~a0~0)| 44))) .cse0) (or .cse23 .cse22 .cse11 .cse10 .cse35) (or (and .cse25 (= 1 ~a2~0) .cse26 .cse24) (or .cse17 .cse18)) (or .cse23 .cse3 .cse21 .cse20 .cse35) (or .cse1 (or .cse8 .cse2 .cse12 .cse36) (and (and .cse25 .cse26) .cse37 .cse24)) (or .cse8 .cse9 .cse1 .cse2 .cse12 .cse13 .cse14) (or .cse23 .cse1 .cse0 .cse22 .cse35) (or (or (or .cse15 .cse16) .cse2 .cse7) .cse6) (or .cse15 (<= (+ ~a29~0 16) 0) (or .cse17 .cse3)) (or (not (<= (+ |old(~a4~0)| 415425) 0)) .cse1 .cse3 .cse0) (or .cse8 .cse2 .cse22 .cse5 .cse20 .cse21) (or .cse15 (and .cse31 .cse26) .cse33) (or .cse2 .cse11 .cse36 .cse34) (or .cse10 .cse5 (or .cse8 .cse2 .cse22 .cse11)) (or .cse28 .cse22 .cse5 (and .cse25 (and .cse30 .cse26 .cse24))) (or .cse1 .cse2 .cse29 .cse36 .cse5 .cse0) (or .cse8 .cse19 .cse32 .cse17 .cse3) (or .cse23 .cse38 .cse39 .cse21 .cse35) (or (or .cse17 .cse21) .cse38) (or (or .cse8 .cse2 .cse22 .cse12 .cse7) .cse6 .cse5) (or .cse17 .cse6 .cse7) (or .cse23 .cse22 .cse6 .cse7 .cse35) (or .cse8 .cse32 (or .cse17 .cse40) .cse19))))) [2019-10-02 01:32:16,732 INFO L443 ceAbstractionStarter]: For program point L1655-1(line 1655) no Hoare annotation was computed. [2019-10-02 01:32:16,732 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,732 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-02 01:32:16,733 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-02 01:32:16,733 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-10-02 01:32:16,733 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,733 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,733 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,733 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,733 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,733 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,733 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,734 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,734 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,734 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,734 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-10-02 01:32:16,734 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-10-02 01:32:16,734 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,734 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,734 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-10-02 01:32:16,734 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-02 01:32:16,735 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-02 01:32:16,735 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,735 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,735 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,735 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-10-02 01:32:16,735 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-10-02 01:32:16,735 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,735 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,736 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,736 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,736 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,736 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,736 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,736 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,736 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,736 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-02 01:32:16,736 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-10-02 01:32:16,736 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,736 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,737 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,737 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,737 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,737 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,737 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,737 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-10-02 01:32:16,737 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,737 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-10-02 01:32:16,737 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,737 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-10-02 01:32:16,737 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,737 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-10-02 01:32:16,737 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,738 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-10-02 01:32:16,738 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-02 01:32:16,738 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,738 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,738 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,738 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,738 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,738 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,738 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,738 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,738 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,738 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,738 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,738 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,738 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-02 01:32:16,738 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-02 01:32:16,738 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,739 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,739 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,739 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,739 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,739 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,739 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,739 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,739 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,739 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,739 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,739 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-10-02 01:32:16,739 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-10-02 01:32:16,740 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,740 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,740 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-10-02 01:32:16,740 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-10-02 01:32:16,740 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,740 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,740 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,740 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,740 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,741 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,741 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,741 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,741 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,741 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,741 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,741 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,741 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,741 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,741 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-10-02 01:32:16,742 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-02 01:32:16,742 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-10-02 01:32:16,742 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,742 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-02 01:32:16,742 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,742 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,742 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,742 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,742 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,743 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,743 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,743 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-10-02 01:32:16,743 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,743 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,743 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,743 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,743 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-02 01:32:16,743 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-02 01:32:16,743 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-02 01:32:16,744 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,744 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,744 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,744 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,744 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,744 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,744 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,744 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,745 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,745 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,745 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,745 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-10-02 01:32:16,745 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-10-02 01:32:16,745 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,745 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-10-02 01:32:16,745 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,745 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-10-02 01:32:16,745 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,746 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,746 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-02 01:32:16,746 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-10-02 01:32:16,746 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-02 01:32:16,746 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,746 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,746 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,746 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,746 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,746 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,747 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,747 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-10-02 01:32:16,747 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-10-02 01:32:16,747 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-10-02 01:32:16,747 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-10-02 01:32:16,747 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,747 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,747 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,747 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,747 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,748 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,748 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-02 01:32:16,748 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-02 01:32:16,748 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-02 01:32:16,748 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,748 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,748 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,748 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,748 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,748 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-10-02 01:32:16,748 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-10-02 01:32:16,749 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,749 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,749 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,749 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-10-02 01:32:16,749 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-10-02 01:32:16,749 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-10-02 01:32:16,749 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,749 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-10-02 01:32:16,749 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-02 01:32:16,749 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,749 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-02 01:32:16,750 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,750 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,750 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,750 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,750 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,750 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,750 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-10-02 01:32:16,750 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,750 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-10-02 01:32:16,750 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-10-02 01:32:16,751 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:32:16,751 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= (+ ~a4~0 89) 0) (= 1 ~a2~0) (<= 0 (+ ~a0~0 44)) (<= (+ ~a29~0 127) 0)) [2019-10-02 01:32:16,751 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 01:32:16,751 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:32:16,751 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1760 1776) the Hoare annotation is: (or (not (<= (+ |old(~a4~0)| 89) 0)) (not (= 1 |old(~a2~0)|)) (not (<= 0 (+ |old(~a0~0)| 44))) (not (<= (+ |old(~a29~0)| 127) 0)) (and (= ~a29~0 |old(~a29~0)|) (= ~a2~0 |old(~a2~0)|) (= ~a0~0 |old(~a0~0)|) (= ~a4~0 |old(~a4~0)|))) [2019-10-02 01:32:16,751 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1760 1776) no Hoare annotation was computed. [2019-10-02 01:32:16,752 INFO L439 ceAbstractionStarter]: At program point L1774(line 1774) the Hoare annotation is: (let ((.cse22 (+ ~a0~0 98))) (let ((.cse7 (<= (+ ~a4~0 89) 0)) (.cse21 (<= .cse22 0)) (.cse3 (< 43 ~a29~0)) (.cse24 (+ ~a29~0 16)) (.cse6 (<= (+ ~a4~0 42) 0)) (.cse2 (= 2 ~a2~0)) (.cse23 (+ ~a0~0 61))) (let ((.cse0 (<= (+ ~a4~0 86) 0)) (.cse1 (< 0 .cse23)) (.cse18 (<= (+ ~a0~0 142) 0)) (.cse13 (= 4 ~a2~0)) (.cse20 (and .cse6 .cse2)) (.cse4 (< 0 .cse24)) (.cse11 (= 1 ~a2~0)) (.cse19 (<= (+ ~a0~0 104) 0)) (.cse15 (<= .cse24 0)) (.cse5 (= 5 ~a2~0)) (.cse17 (<= 0 (+ ~a4~0 85))) (.cse9 (<= (+ ~a0~0 147) 0)) (.cse16 (<= (+ ~a0~0 108) (+ ~a4~0 ~a29~0))) (.cse8 (= 3 ~a2~0)) (.cse12 (<= 2 ~a2~0)) (.cse10 (and .cse7 (or .cse21 .cse3))) (.cse14 (<= .cse23 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5) (and .cse6 .cse5 .cse3) (and .cse7 .cse8) (and .cse9 .cse10) (and .cse7 .cse11) (and .cse12 .cse7 (not .cse13) .cse14) (and .cse0 .cse1 .cse15 .cse2) (not (<= 0 (+ |old(~a0~0)| 44))) (and .cse16 .cse17 .cse6 .cse9 .cse13) (and .cse0 (and .cse4 .cse1 .cse8)) (and .cse17 .cse6 .cse4 .cse5 .cse14) (and .cse6 .cse11 .cse18) (and (and .cse19 .cse20) .cse17) (and (and .cse19 (and .cse6 .cse15)) .cse13) (and .cse0 (and .cse15 .cse8 .cse14)) (not (<= (+ |old(~a29~0)| 127) 0)) (and .cse0 .cse11 .cse15) (and (and .cse7 (<= 0 (+ ~a0~0 44))) .cse13) (and .cse0 (and .cse4 .cse1 .cse13)) (and (<= (+ ~a4~0 415425) 0) .cse15 .cse13) (and .cse17 .cse6 .cse18 .cse13 .cse3) (not (= 1 |old(~a2~0)|)) (and .cse17 .cse20 .cse4 .cse21) (and .cse7 .cse2) (and .cse17 (and (<= (+ ~a0~0 43) |old(~a0~0)|) .cse6 .cse4 .cse8 .cse14 (< 0 .cse22))) (and .cse17 .cse6 .cse11 .cse4) (and .cse6 .cse11 .cse15 .cse14) (and (and .cse12 .cse7 .cse15) .cse14) (and (and .cse6 .cse19 .cse15) .cse5) (and .cse17 .cse6 (<= (+ ~a0~0 99) 0) .cse8) (and .cse9 .cse6 .cse16 .cse8) (and (and .cse12 .cse10) .cse14) (not (<= (+ |old(~a4~0)| 89) 0)))))) [2019-10-02 01:32:16,752 INFO L443 ceAbstractionStarter]: For program point L1774-1(line 1774) no Hoare annotation was computed. [2019-10-02 01:32:16,752 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-10-02 01:32:16,752 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse22 (+ ~a0~0 98))) (let ((.cse7 (<= (+ ~a4~0 89) 0)) (.cse21 (<= .cse22 0)) (.cse3 (< 43 ~a29~0)) (.cse24 (+ ~a29~0 16)) (.cse6 (<= (+ ~a4~0 42) 0)) (.cse2 (= 2 ~a2~0)) (.cse23 (+ ~a0~0 61))) (let ((.cse0 (<= (+ ~a4~0 86) 0)) (.cse1 (< 0 .cse23)) (.cse18 (<= (+ ~a0~0 142) 0)) (.cse13 (= 4 ~a2~0)) (.cse20 (and .cse6 .cse2)) (.cse4 (< 0 .cse24)) (.cse11 (= 1 ~a2~0)) (.cse19 (<= (+ ~a0~0 104) 0)) (.cse15 (<= .cse24 0)) (.cse5 (= 5 ~a2~0)) (.cse17 (<= 0 (+ ~a4~0 85))) (.cse9 (<= (+ ~a0~0 147) 0)) (.cse16 (<= (+ ~a0~0 108) (+ ~a4~0 ~a29~0))) (.cse8 (= 3 ~a2~0)) (.cse12 (<= 2 ~a2~0)) (.cse10 (and .cse7 (or .cse21 .cse3))) (.cse14 (<= .cse23 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5) (and .cse6 .cse5 .cse3) (and .cse7 .cse8) (and .cse9 .cse10) (and .cse7 .cse11) (and .cse12 .cse7 (not .cse13) .cse14) (and .cse0 .cse1 .cse15 .cse2) (not (<= 0 (+ |old(~a0~0)| 44))) (and .cse16 .cse17 .cse6 .cse9 .cse13) (and .cse0 (and .cse4 .cse1 .cse8)) (and .cse17 .cse6 .cse4 .cse5 .cse14) (and .cse6 .cse11 .cse18) (and (and .cse19 .cse20) .cse17) (and (and .cse19 (and .cse6 .cse15)) .cse13) (and .cse0 (and .cse15 .cse8 .cse14)) (not (<= (+ |old(~a29~0)| 127) 0)) (and .cse0 .cse11 .cse15) (and (and .cse7 (<= 0 (+ ~a0~0 44))) .cse13) (and .cse0 (and .cse4 .cse1 .cse13)) (and (<= (+ ~a4~0 415425) 0) .cse15 .cse13) (and .cse17 .cse6 .cse18 .cse13 .cse3) (not (= 1 |old(~a2~0)|)) (and .cse17 .cse20 .cse4 .cse21) (and .cse7 .cse2) (and .cse17 (and (<= (+ ~a0~0 43) |old(~a0~0)|) .cse6 .cse4 .cse8 .cse14 (< 0 .cse22))) (and .cse17 .cse6 .cse11 .cse4) (and .cse6 .cse11 .cse15 .cse14) (and (and .cse12 .cse7 .cse15) .cse14) (and (and .cse6 .cse19 .cse15) .cse5) (and .cse17 .cse6 (<= (+ ~a0~0 99) 0) .cse8) (and .cse9 .cse6 .cse16 .cse8) (and (and .cse12 .cse10) .cse14) (not (<= (+ |old(~a4~0)| 89) 0)))))) [2019-10-02 01:32:16,752 INFO L443 ceAbstractionStarter]: For program point L1766-3(lines 1760 1776) no Hoare annotation was computed. [2019-10-02 01:32:16,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 01:32:16 BoogieIcfgContainer [2019-10-02 01:32:16,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 01:32:16,780 INFO L168 Benchmark]: Toolchain (without parser) took 244552.74 ms. Allocated memory was 136.8 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 82.2 MB in the beginning and 598.9 MB in the end (delta: -516.7 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-10-02 01:32:16,781 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 105.8 MB in the beginning and 105.6 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:32:16,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1381.02 ms. Allocated memory was 136.8 MB in the beginning and 217.1 MB in the end (delta: 80.2 MB). Free memory was 81.8 MB in the beginning and 128.7 MB in the end (delta: -46.9 MB). Peak memory consumption was 43.4 MB. Max. memory is 7.1 GB. [2019-10-02 01:32:16,782 INFO L168 Benchmark]: Boogie Preprocessor took 201.89 ms. Allocated memory is still 217.1 MB. Free memory was 128.7 MB in the beginning and 115.9 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2019-10-02 01:32:16,783 INFO L168 Benchmark]: RCFGBuilder took 3329.99 ms. Allocated memory was 217.1 MB in the beginning and 279.4 MB in the end (delta: 62.4 MB). Free memory was 115.9 MB in the beginning and 159.0 MB in the end (delta: -43.1 MB). Peak memory consumption was 106.6 MB. Max. memory is 7.1 GB. [2019-10-02 01:32:16,784 INFO L168 Benchmark]: TraceAbstraction took 239635.46 ms. Allocated memory was 279.4 MB in the beginning and 3.2 GB in the end (delta: 2.9 GB). Free memory was 156.6 MB in the beginning and 598.9 MB in the end (delta: -442.4 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-10-02 01:32:16,788 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 136.8 MB. Free memory was 105.8 MB in the beginning and 105.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1381.02 ms. Allocated memory was 136.8 MB in the beginning and 217.1 MB in the end (delta: 80.2 MB). Free memory was 81.8 MB in the beginning and 128.7 MB in the end (delta: -46.9 MB). Peak memory consumption was 43.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 201.89 ms. Allocated memory is still 217.1 MB. Free memory was 128.7 MB in the beginning and 115.9 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3329.99 ms. Allocated memory was 217.1 MB in the beginning and 279.4 MB in the end (delta: 62.4 MB). Free memory was 115.9 MB in the beginning and 159.0 MB in the end (delta: -43.1 MB). Peak memory consumption was 106.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239635.46 ms. Allocated memory was 279.4 MB in the beginning and 3.2 GB in the end (delta: 2.9 GB). Free memory was 156.6 MB in the beginning and 598.9 MB in the end (delta: -442.4 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1766]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && 0 < a0 + 61) && 2 == a2) && 43 < a29) || (((a4 + 86 <= 0 && 0 < a29 + 16) && 0 < a0 + 61) && 5 == a2)) || ((a4 + 42 <= 0 && 5 == a2) && 43 < a29)) || (a4 + 89 <= 0 && 3 == a2)) || (a0 + 147 <= 0 && a4 + 89 <= 0 && (a0 + 98 <= 0 || 43 < a29))) || (a4 + 89 <= 0 && 1 == a2)) || (((2 <= a2 && a4 + 89 <= 0) && !(4 == a2)) && a0 + 61 <= 0)) || (((a4 + 86 <= 0 && 0 < a0 + 61) && a29 + 16 <= 0) && 2 == a2)) || !(0 <= \old(a0) + 44)) || ((((a0 + 108 <= a4 + a29 && 0 <= a4 + 85) && a4 + 42 <= 0) && a0 + 147 <= 0) && 4 == a2)) || (a4 + 86 <= 0 && (0 < a29 + 16 && 0 < a0 + 61) && 3 == a2)) || ((((0 <= a4 + 85 && a4 + 42 <= 0) && 0 < a29 + 16) && 5 == a2) && a0 + 61 <= 0)) || ((a4 + 42 <= 0 && 1 == a2) && a0 + 142 <= 0)) || ((a0 + 104 <= 0 && a4 + 42 <= 0 && 2 == a2) && 0 <= a4 + 85)) || ((a0 + 104 <= 0 && a4 + 42 <= 0 && a29 + 16 <= 0) && 4 == a2)) || (a4 + 86 <= 0 && (a29 + 16 <= 0 && 3 == a2) && a0 + 61 <= 0)) || !(\old(a29) + 127 <= 0)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 16 <= 0)) || ((a4 + 89 <= 0 && 0 <= a0 + 44) && 4 == a2)) || (a4 + 86 <= 0 && (0 < a29 + 16 && 0 < a0 + 61) && 4 == a2)) || ((a4 + 415425 <= 0 && a29 + 16 <= 0) && 4 == a2)) || ((((0 <= a4 + 85 && a4 + 42 <= 0) && a0 + 142 <= 0) && 4 == a2) && 43 < a29)) || !(1 == \old(a2))) || (((0 <= a4 + 85 && a4 + 42 <= 0 && 2 == a2) && 0 < a29 + 16) && a0 + 98 <= 0)) || (a4 + 89 <= 0 && 2 == a2)) || (0 <= a4 + 85 && ((((a0 + 43 <= \old(a0) && a4 + 42 <= 0) && 0 < a29 + 16) && 3 == a2) && a0 + 61 <= 0) && 0 < a0 + 98)) || (((0 <= a4 + 85 && a4 + 42 <= 0) && 1 == a2) && 0 < a29 + 16)) || (((a4 + 42 <= 0 && 1 == a2) && a29 + 16 <= 0) && a0 + 61 <= 0)) || (((2 <= a2 && a4 + 89 <= 0) && a29 + 16 <= 0) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && a0 + 104 <= 0) && a29 + 16 <= 0) && 5 == a2)) || (((0 <= a4 + 85 && a4 + 42 <= 0) && a0 + 99 <= 0) && 3 == a2)) || (((a0 + 147 <= 0 && a4 + 42 <= 0) && a0 + 108 <= a4 + a29) && 3 == a2)) || ((2 <= a2 && a4 + 89 <= 0 && (a0 + 98 <= 0 || 43 < a29)) && a0 + 61 <= 0)) || !(\old(a4) + 89 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 437 locations, 1 error locations. SAFE Result, 239.5s OverallTime, 15 OverallIterations, 10 TraceHistogramMax, 102.9s AutomataDifference, 0.0s DeadEndRemovalTime, 105.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2809 SDtfs, 24744 SDslu, 3803 SDs, 0 SdLazy, 69174 SolverSat, 10478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 72.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7979 GetRequests, 7720 SyntacticMatches, 2 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6621 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55996occurred 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: 10.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 31160 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 12206 PreInvPairs, 14150 NumberOfFragments, 5809 HoareAnnotationTreeSize, 12206 FomulaSimplifications, 746324 FormulaSimplificationTreeSizeReduction, 29.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 476434 FormulaSimplificationTreeSizeReductionInter, 75.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 16089 NumberOfCodeBlocks, 16089 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 16064 ConstructedInterpolants, 0 QuantifiedInterpolants, 21849391 SizeOfPredicates, 10 NumberOfNonLiveVariables, 10520 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 25 InterpolantComputations, 8 PerfectInterpolantSequences, 27774/29152 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...