/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label00.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:53:22,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:53:22,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:53:22,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:53:22,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:53:22,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:53:22,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:53:22,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:53:22,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:53:22,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:53:22,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:53:22,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:53:22,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:53:22,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:53:22,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:53:22,094 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:53:22,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:53:22,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:53:22,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:53:22,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:53:22,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:53:22,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:53:22,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:53:22,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:53:22,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:53:22,116 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:53:22,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:53:22,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:53:22,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:53:22,121 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:53:22,121 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:53:22,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:53:22,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:53:22,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:53:22,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:53:22,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:53:22,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:53:22,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:53:22,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:53:22,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:53:22,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:53:22,129 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-11-23 20:53:22,142 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:53:22,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:53:22,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:53:22,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:53:22,144 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:53:22,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:53:22,144 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:53:22,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:53:22,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:53:22,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:53:22,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:53:22,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:53:22,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:53:22,145 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:53:22,146 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:53:22,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:53:22,146 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:53:22,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:53:22,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:53:22,147 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:53:22,147 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:53:22,147 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:53:22,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:53:22,147 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:53:22,147 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:53:22,148 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:53:22,148 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:53:22,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:53:22,148 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:53:22,148 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:53:22,413 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:53:22,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:53:22,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:53:22,438 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:53:22,439 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:53:22,440 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label00.c [2019-11-23 20:53:22,500 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42be5aec2/510bce1cb0c34bd4bdd76b473dfdb563/FLAG232a86ffa [2019-11-23 20:53:23,068 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:53:23,069 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label00.c [2019-11-23 20:53:23,085 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42be5aec2/510bce1cb0c34bd4bdd76b473dfdb563/FLAG232a86ffa [2019-11-23 20:53:23,312 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42be5aec2/510bce1cb0c34bd4bdd76b473dfdb563 [2019-11-23 20:53:23,321 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:53:23,322 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:53:23,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:53:23,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:53:23,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:53:23,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:53:23" (1/1) ... [2019-11-23 20:53:23,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ceb8032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:23, skipping insertion in model container [2019-11-23 20:53:23,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:53:23" (1/1) ... [2019-11-23 20:53:23,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:53:23,386 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:53:23,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:53:23,934 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:53:24,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:53:24,110 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:53:24,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:24 WrapperNode [2019-11-23 20:53:24,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:53:24,112 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:53:24,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:53:24,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:53:24,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:24" (1/1) ... [2019-11-23 20:53:24,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:24" (1/1) ... [2019-11-23 20:53:24,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:53:24,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:53:24,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:53:24,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:53:24,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:24" (1/1) ... [2019-11-23 20:53:24,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:24" (1/1) ... [2019-11-23 20:53:24,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:24" (1/1) ... [2019-11-23 20:53:24,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:24" (1/1) ... [2019-11-23 20:53:24,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:24" (1/1) ... [2019-11-23 20:53:24,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:24" (1/1) ... [2019-11-23 20:53:24,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:24" (1/1) ... [2019-11-23 20:53:24,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:53:24,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:53:24,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:53:24,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:53:24,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:24" (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-11-23 20:53:24,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:53:24,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:53:25,699 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:53:25,699 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:53:25,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:53:25 BoogieIcfgContainer [2019-11-23 20:53:25,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:53:25,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:53:25,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:53:25,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:53:25,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:53:23" (1/3) ... [2019-11-23 20:53:25,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5969ba91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:53:25, skipping insertion in model container [2019-11-23 20:53:25,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:24" (2/3) ... [2019-11-23 20:53:25,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5969ba91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:53:25, skipping insertion in model container [2019-11-23 20:53:25,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:53:25" (3/3) ... [2019-11-23 20:53:25,710 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label00.c [2019-11-23 20:53:25,721 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:53:25,729 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:53:25,741 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:53:25,770 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:53:25,770 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:53:25,770 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:53:25,770 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:53:25,771 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:53:25,771 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:53:25,771 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:53:25,771 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:53:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-23 20:53:25,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-23 20:53:25,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:25,809 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 20:53:25,810 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:25,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:25,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1162953203, now seen corresponding path program 1 times [2019-11-23 20:53:25,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:25,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074637180] [2019-11-23 20:53:25,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:53:26,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074637180] [2019-11-23 20:53:26,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:26,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:53:26,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463027919] [2019-11-23 20:53:26,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:26,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:26,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:26,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:26,360 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-11-23 20:53:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:27,719 INFO L93 Difference]: Finished difference Result 775 states and 1353 transitions. [2019-11-23 20:53:27,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:53:27,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-23 20:53:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:27,738 INFO L225 Difference]: With dead ends: 775 [2019-11-23 20:53:27,738 INFO L226 Difference]: Without dead ends: 460 [2019-11-23 20:53:27,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-23 20:53:27,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-11-23 20:53:27,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 308. [2019-11-23 20:53:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-11-23 20:53:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 451 transitions. [2019-11-23 20:53:27,809 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 451 transitions. Word has length 115 [2019-11-23 20:53:27,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:27,810 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 451 transitions. [2019-11-23 20:53:27,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:27,810 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 451 transitions. [2019-11-23 20:53:27,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-23 20:53:27,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:27,814 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 20:53:27,814 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:27,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:27,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1399875752, now seen corresponding path program 1 times [2019-11-23 20:53:27,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:27,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833085887] [2019-11-23 20:53:27,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:53:27,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833085887] [2019-11-23 20:53:27,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:27,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:53:27,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647613099] [2019-11-23 20:53:27,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:53:27,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:27,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:53:27,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:53:27,970 INFO L87 Difference]: Start difference. First operand 308 states and 451 transitions. Second operand 3 states. [2019-11-23 20:53:28,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:28,574 INFO L93 Difference]: Finished difference Result 903 states and 1331 transitions. [2019-11-23 20:53:28,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:28,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-23 20:53:28,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:28,581 INFO L225 Difference]: With dead ends: 903 [2019-11-23 20:53:28,582 INFO L226 Difference]: Without dead ends: 597 [2019-11-23 20:53:28,584 INFO L630 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-11-23 20:53:28,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-11-23 20:53:28,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 592. [2019-11-23 20:53:28,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-23 20:53:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 825 transitions. [2019-11-23 20:53:28,618 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 825 transitions. Word has length 119 [2019-11-23 20:53:28,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:28,618 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 825 transitions. [2019-11-23 20:53:28,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:53:28,619 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 825 transitions. [2019-11-23 20:53:28,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-23 20:53:28,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:28,624 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 20:53:28,624 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:28,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:28,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1868435191, now seen corresponding path program 1 times [2019-11-23 20:53:28,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:28,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278200541] [2019-11-23 20:53:28,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:53:28,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278200541] [2019-11-23 20:53:28,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:28,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:53:28,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747129119] [2019-11-23 20:53:28,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:53:28,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:28,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:53:28,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:53:28,733 INFO L87 Difference]: Start difference. First operand 592 states and 825 transitions. Second operand 3 states. [2019-11-23 20:53:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:29,309 INFO L93 Difference]: Finished difference Result 1742 states and 2434 transitions. [2019-11-23 20:53:29,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:29,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-23 20:53:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:29,316 INFO L225 Difference]: With dead ends: 1742 [2019-11-23 20:53:29,317 INFO L226 Difference]: Without dead ends: 1152 [2019-11-23 20:53:29,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-23 20:53:29,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2019-11-23 20:53:29,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1152. [2019-11-23 20:53:29,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2019-11-23 20:53:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1520 transitions. [2019-11-23 20:53:29,370 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1520 transitions. Word has length 125 [2019-11-23 20:53:29,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:29,370 INFO L462 AbstractCegarLoop]: Abstraction has 1152 states and 1520 transitions. [2019-11-23 20:53:29,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:53:29,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1520 transitions. [2019-11-23 20:53:29,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-23 20:53:29,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:29,380 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 20:53:29,382 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:29,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:29,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1256805806, now seen corresponding path program 1 times [2019-11-23 20:53:29,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:29,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157995197] [2019-11-23 20:53:29,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:53:29,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157995197] [2019-11-23 20:53:29,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:29,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:53:29,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545855993] [2019-11-23 20:53:29,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:29,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:29,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:29,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:29,531 INFO L87 Difference]: Start difference. First operand 1152 states and 1520 transitions. Second operand 4 states. [2019-11-23 20:53:30,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:30,165 INFO L93 Difference]: Finished difference Result 2306 states and 3045 transitions. [2019-11-23 20:53:30,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:30,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-23 20:53:30,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:30,171 INFO L225 Difference]: With dead ends: 2306 [2019-11-23 20:53:30,171 INFO L226 Difference]: Without dead ends: 1156 [2019-11-23 20:53:30,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-23 20:53:30,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2019-11-23 20:53:30,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1151. [2019-11-23 20:53:30,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2019-11-23 20:53:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1466 transitions. [2019-11-23 20:53:30,204 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1466 transitions. Word has length 133 [2019-11-23 20:53:30,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:30,205 INFO L462 AbstractCegarLoop]: Abstraction has 1151 states and 1466 transitions. [2019-11-23 20:53:30,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:30,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1466 transitions. [2019-11-23 20:53:30,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-23 20:53:30,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:30,209 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:53:30,210 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:30,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:30,210 INFO L82 PathProgramCache]: Analyzing trace with hash -848335417, now seen corresponding path program 1 times [2019-11-23 20:53:30,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:30,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821995772] [2019-11-23 20:53:30,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:53:30,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821995772] [2019-11-23 20:53:30,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:30,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:53:30,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256685767] [2019-11-23 20:53:30,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:30,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:30,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:30,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:30,337 INFO L87 Difference]: Start difference. First operand 1151 states and 1466 transitions. Second operand 4 states. [2019-11-23 20:53:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:31,347 INFO L93 Difference]: Finished difference Result 3563 states and 4486 transitions. [2019-11-23 20:53:31,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:53:31,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-11-23 20:53:31,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:31,358 INFO L225 Difference]: With dead ends: 3563 [2019-11-23 20:53:31,358 INFO L226 Difference]: Without dead ends: 2414 [2019-11-23 20:53:31,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-11-23 20:53:31,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2411. [2019-11-23 20:53:31,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2019-11-23 20:53:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2847 transitions. [2019-11-23 20:53:31,412 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2847 transitions. Word has length 137 [2019-11-23 20:53:31,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:31,412 INFO L462 AbstractCegarLoop]: Abstraction has 2411 states and 2847 transitions. [2019-11-23 20:53:31,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:31,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2847 transitions. [2019-11-23 20:53:31,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-23 20:53:31,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:31,418 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 20:53:31,418 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:31,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:31,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1795097999, now seen corresponding path program 1 times [2019-11-23 20:53:31,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:31,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717345551] [2019-11-23 20:53:31,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:31,575 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 20:53:31,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717345551] [2019-11-23 20:53:31,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:31,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:53:31,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178221835] [2019-11-23 20:53:31,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:31,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:31,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:31,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:31,578 INFO L87 Difference]: Start difference. First operand 2411 states and 2847 transitions. Second operand 4 states. [2019-11-23 20:53:32,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:32,193 INFO L93 Difference]: Finished difference Result 4820 states and 5692 transitions. [2019-11-23 20:53:32,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:32,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-23 20:53:32,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:32,204 INFO L225 Difference]: With dead ends: 4820 [2019-11-23 20:53:32,204 INFO L226 Difference]: Without dead ends: 2411 [2019-11-23 20:53:32,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-23 20:53:32,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2019-11-23 20:53:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2131. [2019-11-23 20:53:32,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-11-23 20:53:32,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2410 transitions. [2019-11-23 20:53:32,248 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2410 transitions. Word has length 142 [2019-11-23 20:53:32,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:32,249 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 2410 transitions. [2019-11-23 20:53:32,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2410 transitions. [2019-11-23 20:53:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-23 20:53:32,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:32,255 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 20:53:32,255 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:32,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:32,256 INFO L82 PathProgramCache]: Analyzing trace with hash 487075866, now seen corresponding path program 1 times [2019-11-23 20:53:32,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:32,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131289745] [2019-11-23 20:53:32,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:32,423 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 20:53:32,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131289745] [2019-11-23 20:53:32,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:32,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:53:32,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371547566] [2019-11-23 20:53:32,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:53:32,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:32,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:53:32,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:53:32,433 INFO L87 Difference]: Start difference. First operand 2131 states and 2410 transitions. Second operand 3 states. [2019-11-23 20:53:32,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:32,935 INFO L93 Difference]: Finished difference Result 4257 states and 4810 transitions. [2019-11-23 20:53:32,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:32,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-11-23 20:53:32,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:32,942 INFO L225 Difference]: With dead ends: 4257 [2019-11-23 20:53:32,943 INFO L226 Difference]: Without dead ends: 1848 [2019-11-23 20:53:32,946 INFO L630 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-11-23 20:53:32,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2019-11-23 20:53:32,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1568. [2019-11-23 20:53:32,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2019-11-23 20:53:32,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 1706 transitions. [2019-11-23 20:53:32,976 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 1706 transitions. Word has length 208 [2019-11-23 20:53:32,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:32,977 INFO L462 AbstractCegarLoop]: Abstraction has 1568 states and 1706 transitions. [2019-11-23 20:53:32,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:53:32,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 1706 transitions. [2019-11-23 20:53:32,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-23 20:53:32,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:32,982 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 20:53:32,982 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:32,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:32,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1239133772, now seen corresponding path program 1 times [2019-11-23 20:53:32,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:32,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649821789] [2019-11-23 20:53:32,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:33,052 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-23 20:53:33,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649821789] [2019-11-23 20:53:33,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:33,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:53:33,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136548856] [2019-11-23 20:53:33,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:33,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:33,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:33,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:33,055 INFO L87 Difference]: Start difference. First operand 1568 states and 1706 transitions. Second operand 4 states. [2019-11-23 20:53:33,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:33,546 INFO L93 Difference]: Finished difference Result 3263 states and 3549 transitions. [2019-11-23 20:53:33,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:53:33,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-11-23 20:53:33,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:33,551 INFO L225 Difference]: With dead ends: 3263 [2019-11-23 20:53:33,552 INFO L226 Difference]: Without dead ends: 1275 [2019-11-23 20:53:33,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-23 20:53:33,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-11-23 20:53:33,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1275. [2019-11-23 20:53:33,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-11-23 20:53:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1362 transitions. [2019-11-23 20:53:33,574 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1362 transitions. Word has length 210 [2019-11-23 20:53:33,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:33,574 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 1362 transitions. [2019-11-23 20:53:33,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1362 transitions. [2019-11-23 20:53:33,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-11-23 20:53:33,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:33,579 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-23 20:53:33,579 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:33,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:33,580 INFO L82 PathProgramCache]: Analyzing trace with hash -192429443, now seen corresponding path program 1 times [2019-11-23 20:53:33,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:33,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765095933] [2019-11-23 20:53:33,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:33,758 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-23 20:53:33,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765095933] [2019-11-23 20:53:33,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670192590] [2019-11-23 20:53:33,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:53:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:33,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-23 20:53:33,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:53:33,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:53:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-23 20:53:34,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:53:34,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2019-11-23 20:53:34,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178529327] [2019-11-23 20:53:34,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:53:34,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:34,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:53:34,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:53:34,006 INFO L87 Difference]: Start difference. First operand 1275 states and 1362 transitions. Second operand 5 states. [2019-11-23 20:53:35,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:35,052 INFO L93 Difference]: Finished difference Result 2712 states and 2899 transitions. [2019-11-23 20:53:35,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 20:53:35,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2019-11-23 20:53:35,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:35,058 INFO L225 Difference]: With dead ends: 2712 [2019-11-23 20:53:35,059 INFO L226 Difference]: Without dead ends: 1439 [2019-11-23 20:53:35,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-23 20:53:35,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2019-11-23 20:53:35,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1275. [2019-11-23 20:53:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-11-23 20:53:35,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1349 transitions. [2019-11-23 20:53:35,095 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1349 transitions. Word has length 222 [2019-11-23 20:53:35,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:35,095 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 1349 transitions. [2019-11-23 20:53:35,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:53:35,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1349 transitions. [2019-11-23 20:53:35,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-11-23 20:53:35,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:35,102 INFO L410 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 20:53:35,308 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:53:35,308 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:35,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:35,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1835643882, now seen corresponding path program 1 times [2019-11-23 20:53:35,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:35,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459951990] [2019-11-23 20:53:35,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-23 20:53:35,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459951990] [2019-11-23 20:53:35,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:35,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:53:35,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015534808] [2019-11-23 20:53:35,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:53:35,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:35,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:53:35,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:53:35,428 INFO L87 Difference]: Start difference. First operand 1275 states and 1349 transitions. Second operand 3 states. [2019-11-23 20:53:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:35,912 INFO L93 Difference]: Finished difference Result 3109 states and 3312 transitions. [2019-11-23 20:53:35,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:35,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-11-23 20:53:35,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:35,919 INFO L225 Difference]: With dead ends: 3109 [2019-11-23 20:53:35,919 INFO L226 Difference]: Without dead ends: 1696 [2019-11-23 20:53:35,921 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:53:35,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2019-11-23 20:53:35,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1556. [2019-11-23 20:53:35,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1556 states. [2019-11-23 20:53:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1631 transitions. [2019-11-23 20:53:35,946 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1631 transitions. Word has length 250 [2019-11-23 20:53:35,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:35,947 INFO L462 AbstractCegarLoop]: Abstraction has 1556 states and 1631 transitions. [2019-11-23 20:53:35,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:53:35,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1631 transitions. [2019-11-23 20:53:35,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-11-23 20:53:35,952 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:35,952 INFO L410 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 20:53:35,953 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:35,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:35,953 INFO L82 PathProgramCache]: Analyzing trace with hash -546420939, now seen corresponding path program 1 times [2019-11-23 20:53:35,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:35,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753486235] [2019-11-23 20:53:35,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 177 proven. 9 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-23 20:53:36,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753486235] [2019-11-23 20:53:36,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677625898] [2019-11-23 20:53:36,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:53:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:36,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:53:36,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:53:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 20:53:36,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:53:36,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-23 20:53:36,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472839225] [2019-11-23 20:53:36,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:53:36,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:36,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:53:36,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-23 20:53:36,625 INFO L87 Difference]: Start difference. First operand 1556 states and 1631 transitions. Second operand 3 states. [2019-11-23 20:53:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:37,245 INFO L93 Difference]: Finished difference Result 3108 states and 3267 transitions. [2019-11-23 20:53:37,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:37,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-11-23 20:53:37,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:37,247 INFO L225 Difference]: With dead ends: 3108 [2019-11-23 20:53:37,247 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:53:37,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-23 20:53:37,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:53:37,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:53:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:53:37,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:53:37,253 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 255 [2019-11-23 20:53:37,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:37,254 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:53:37,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:53:37,254 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:53:37,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:53:37,467 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:53:37,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:53:37,929 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-11-23 20:53:38,261 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-11-23 20:53:38,265 INFO L444 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,265 INFO L444 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,265 INFO L444 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,265 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 20:53:38,266 INFO L444 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-23 20:53:38,266 INFO L444 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-23 20:53:38,266 INFO L444 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-23 20:53:38,266 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 20:53:38,267 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 20:53:38,267 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 20:53:38,267 INFO L444 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,267 INFO L444 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,267 INFO L444 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,268 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 20:53:38,268 INFO L444 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-23 20:53:38,268 INFO L444 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-23 20:53:38,268 INFO L444 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-23 20:53:38,268 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-23 20:53:38,269 INFO L444 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-23 20:53:38,269 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 20:53:38,269 INFO L444 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,269 INFO L444 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,269 INFO L444 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,273 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 20:53:38,273 INFO L444 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-23 20:53:38,273 INFO L444 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-23 20:53:38,273 INFO L444 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-23 20:53:38,273 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 20:53:38,273 INFO L444 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,273 INFO L444 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,274 INFO L444 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,274 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 20:53:38,274 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 20:53:38,274 INFO L444 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-23 20:53:38,274 INFO L444 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-23 20:53:38,274 INFO L444 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-23 20:53:38,274 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 20:53:38,275 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 20:53:38,275 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 20:53:38,275 INFO L444 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,275 INFO L444 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,275 INFO L444 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,275 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 20:53:38,275 INFO L444 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-23 20:53:38,275 INFO L444 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-23 20:53:38,275 INFO L444 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-23 20:53:38,276 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 20:53:38,276 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 20:53:38,276 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 20:53:38,276 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 20:53:38,276 INFO L444 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,276 INFO L444 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,276 INFO L444 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,276 INFO L444 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-23 20:53:38,277 INFO L444 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-23 20:53:38,277 INFO L444 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-23 20:53:38,277 INFO L444 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-23 20:53:38,280 INFO L444 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-23 20:53:38,280 INFO L444 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-23 20:53:38,280 INFO L444 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-23 20:53:38,280 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 20:53:38,280 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 20:53:38,280 INFO L444 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,280 INFO L444 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,281 INFO L444 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,281 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 20:53:38,281 INFO L444 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-23 20:53:38,281 INFO L444 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-23 20:53:38,281 INFO L444 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-23 20:53:38,281 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 20:53:38,281 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 20:53:38,281 INFO L444 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,282 INFO L444 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,287 INFO L444 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,287 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 20:53:38,287 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 20:53:38,288 INFO L444 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-23 20:53:38,288 INFO L444 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-23 20:53:38,288 INFO L444 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-23 20:53:38,288 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:53:38,288 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 20:53:38,288 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 20:53:38,288 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 20:53:38,288 INFO L444 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,289 INFO L444 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,289 INFO L444 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,289 INFO L444 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-23 20:53:38,289 INFO L444 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-23 20:53:38,289 INFO L444 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-23 20:53:38,289 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 20:53:38,289 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 20:53:38,289 INFO L444 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,289 INFO L444 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,290 INFO L444 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,290 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 20:53:38,290 INFO L444 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-23 20:53:38,290 INFO L444 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-23 20:53:38,290 INFO L444 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-23 20:53:38,290 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 20:53:38,290 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 20:53:38,290 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-23 20:53:38,290 INFO L444 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-23 20:53:38,290 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 20:53:38,291 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 20:53:38,291 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:53:38,291 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 517) no Hoare annotation was computed. [2019-11-23 20:53:38,291 INFO L444 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-23 20:53:38,291 INFO L444 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,291 INFO L444 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,291 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 20:53:38,291 INFO L444 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-23 20:53:38,292 INFO L444 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-23 20:53:38,292 INFO L444 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-23 20:53:38,292 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 20:53:38,292 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 20:53:38,292 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-23 20:53:38,292 INFO L444 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-23 20:53:38,292 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 20:53:38,294 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1))) (let ((.cse9 (not (= ~a28~0 11))) (.cse1 (<= ~a19~0 0)) (.cse11 (<= ~a25~0 0)) (.cse8 (not .cse3))) (let ((.cse4 (or (and .cse1 .cse11 .cse9) (and .cse1 .cse11 .cse8))) (.cse0 (= ~a28~0 9)) (.cse7 (= ~a21~0 1)) (.cse10 (<= 10 ~a28~0)) (.cse5 (= ~a17~0 8)) (.cse12 (= ~a28~0 7)) (.cse6 (= ~a19~0 1)) (.cse2 (= ~a25~0 1)) (.cse13 (<= ~a17~0 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse3) (and (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse5 .cse6 .cse7 .cse2 .cse8) (and .cse5 .cse6 .cse2 .cse9) (and .cse4 .cse5) (and .cse10 .cse5 .cse6 .cse7 .cse11 .cse9) (and .cse1 .cse10 .cse5 .cse2 .cse8 .cse9) (and .cse5 .cse6 .cse12 .cse7 .cse11 .cse8) (and .cse0 .cse6 .cse5 .cse11 .cse3) (and .cse0 .cse5 .cse6 .cse7 .cse11) (and .cse10 .cse6 .cse11 .cse3 .cse13) (and .cse1 .cse5 .cse12 .cse2 .cse8) (and .cse6 .cse2 .cse13 .cse3 .cse9))))) [2019-11-23 20:53:38,295 INFO L444 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,295 INFO L444 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,295 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 20:53:38,295 INFO L444 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-23 20:53:38,295 INFO L444 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-23 20:53:38,295 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 20:53:38,295 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-23 20:53:38,295 INFO L444 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-23 20:53:38,295 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 20:53:38,296 INFO L444 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,296 INFO L444 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,296 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 20:53:38,296 INFO L444 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-23 20:53:38,296 INFO L444 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-23 20:53:38,296 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 20:53:38,296 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 20:53:38,296 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 20:53:38,296 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-23 20:53:38,297 INFO L444 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-23 20:53:38,297 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 20:53:38,297 INFO L444 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,297 INFO L444 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,297 INFO L444 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-23 20:53:38,297 INFO L444 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-23 20:53:38,297 INFO L444 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-23 20:53:38,297 INFO L444 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-23 20:53:38,297 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 20:53:38,298 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 20:53:38,298 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1))) (let ((.cse9 (not (= ~a28~0 11))) (.cse1 (<= ~a19~0 0)) (.cse11 (<= ~a25~0 0)) (.cse8 (not .cse3))) (let ((.cse4 (or (and .cse1 .cse11 .cse9) (and .cse1 .cse11 .cse8))) (.cse0 (= ~a28~0 9)) (.cse7 (= ~a21~0 1)) (.cse10 (<= 10 ~a28~0)) (.cse5 (= ~a17~0 8)) (.cse12 (= ~a28~0 7)) (.cse6 (= ~a19~0 1)) (.cse2 (= ~a25~0 1)) (.cse13 (<= ~a17~0 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse3) (and (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse5 .cse6 .cse7 .cse2 .cse8) (and .cse5 .cse6 .cse2 .cse9) (and .cse4 .cse5) (and .cse10 .cse5 .cse6 .cse7 .cse11 .cse9) (and .cse1 .cse10 .cse5 .cse2 .cse8 .cse9) (and .cse5 .cse6 .cse12 .cse7 .cse11 .cse8) (and .cse0 .cse6 .cse5 .cse11 .cse3) (and .cse0 .cse5 .cse6 .cse7 .cse11) (and .cse10 .cse6 .cse11 .cse3 .cse13) (and .cse1 .cse5 .cse12 .cse2 .cse8) (and .cse6 .cse2 .cse13 .cse3 .cse9))))) [2019-11-23 20:53:38,298 INFO L444 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,298 INFO L444 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,299 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 20:53:38,299 INFO L444 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-23 20:53:38,299 INFO L444 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-23 20:53:38,299 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 20:53:38,299 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 20:53:38,299 INFO L444 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,299 INFO L444 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,299 INFO L444 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-23 20:53:38,299 INFO L444 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-23 20:53:38,300 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 20:53:38,300 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 20:53:38,300 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 20:53:38,300 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 20:53:38,300 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 20:53:38,300 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-23 20:53:38,300 INFO L444 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-23 20:53:38,300 INFO L444 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,300 INFO L444 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,301 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-23 20:53:38,301 INFO L444 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,301 INFO L444 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-23 20:53:38,301 INFO L444 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-23 20:53:38,301 INFO L444 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-23 20:53:38,301 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 20:53:38,301 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 20:53:38,301 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:53:38,301 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 20:53:38,301 INFO L444 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,302 INFO L444 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,302 INFO L444 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,302 INFO L444 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-23 20:53:38,302 INFO L444 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-23 20:53:38,302 INFO L444 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-23 20:53:38,302 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 20:53:38,302 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 20:53:38,302 INFO L444 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,302 INFO L444 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,303 INFO L444 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,303 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 20:53:38,303 INFO L444 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-23 20:53:38,303 INFO L444 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-23 20:53:38,303 INFO L444 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-23 20:53:38,303 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 20:53:38,303 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 20:53:38,303 INFO L444 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,303 INFO L444 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,304 INFO L444 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,304 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 20:53:38,304 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 20:53:38,304 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 20:53:38,304 INFO L444 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-23 20:53:38,304 INFO L444 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-23 20:53:38,304 INFO L444 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-23 20:53:38,304 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:53:38,304 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 20:53:38,305 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 20:53:38,305 INFO L444 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,305 INFO L444 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,305 INFO L444 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,305 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 20:53:38,305 INFO L444 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-23 20:53:38,305 INFO L444 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-23 20:53:38,305 INFO L444 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-23 20:53:38,305 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 20:53:38,306 INFO L444 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,306 INFO L444 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,306 INFO L444 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:53:38,306 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 20:53:38,306 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 20:53:38,306 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 20:53:38,306 INFO L444 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-23 20:53:38,306 INFO L444 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-23 20:53:38,306 INFO L444 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-23 20:53:38,307 INFO L444 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-23 20:53:38,307 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 20:53:38,307 INFO L444 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-23 20:53:38,307 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 20:53:38,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:53:38 BoogieIcfgContainer [2019-11-23 20:53:38,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:53:38,364 INFO L168 Benchmark]: Toolchain (without parser) took 15041.73 ms. Allocated memory was 138.9 MB in the beginning and 496.0 MB in the end (delta: 357.0 MB). Free memory was 100.6 MB in the beginning and 249.6 MB in the end (delta: -149.0 MB). Peak memory consumption was 208.1 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:38,365 INFO L168 Benchmark]: CDTParser took 1.37 ms. Allocated memory is still 138.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-23 20:53:38,369 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.65 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 100.4 MB in the beginning and 170.4 MB in the end (delta: -70.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:38,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 154.93 ms. Allocated memory is still 204.5 MB. Free memory was 170.4 MB in the beginning and 165.0 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:38,370 INFO L168 Benchmark]: Boogie Preprocessor took 88.62 ms. Allocated memory is still 204.5 MB. Free memory was 165.0 MB in the beginning and 160.1 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:38,373 INFO L168 Benchmark]: RCFGBuilder took 1345.68 ms. Allocated memory was 204.5 MB in the beginning and 238.6 MB in the end (delta: 34.1 MB). Free memory was 160.1 MB in the beginning and 173.9 MB in the end (delta: -13.8 MB). Peak memory consumption was 77.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:38,374 INFO L168 Benchmark]: TraceAbstraction took 12659.72 ms. Allocated memory was 238.6 MB in the beginning and 496.0 MB in the end (delta: 257.4 MB). Free memory was 173.9 MB in the beginning and 249.6 MB in the end (delta: -75.7 MB). Peak memory consumption was 181.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:38,382 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.37 ms. Allocated memory is still 138.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 787.65 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 100.4 MB in the beginning and 170.4 MB in the end (delta: -70.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 154.93 ms. Allocated memory is still 204.5 MB. Free memory was 170.4 MB in the beginning and 165.0 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 88.62 ms. Allocated memory is still 204.5 MB. Free memory was 165.0 MB in the beginning and 160.1 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1345.68 ms. Allocated memory was 204.5 MB in the beginning and 238.6 MB in the end (delta: 34.1 MB). Free memory was 160.1 MB in the beginning and 173.9 MB in the end (delta: -13.8 MB). Peak memory consumption was 77.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12659.72 ms. Allocated memory was 238.6 MB in the beginning and 496.0 MB in the end (delta: 257.4 MB). Free memory was 173.9 MB in the beginning and 249.6 MB in the end (delta: -75.7 MB). Peak memory consumption was 181.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 517]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((((a28 == 9 && a19 <= 0) && a25 == 1) && a11 == 1) || ((((a19 <= 0 && a25 <= 0) && !(a28 == 11)) || ((a19 <= 0 && a25 <= 0) && !(a11 == 1))) && a11 == 1)) || (((((!(3 == input) && a17 == 8) && a19 == 1) && a21 == 1) && a25 == 1) && !(a11 == 1))) || (((a17 == 8 && a19 == 1) && a25 == 1) && !(a28 == 11))) || ((((a19 <= 0 && a25 <= 0) && !(a28 == 11)) || ((a19 <= 0 && a25 <= 0) && !(a11 == 1))) && a17 == 8)) || (((((10 <= a28 && a17 == 8) && a19 == 1) && a21 == 1) && a25 <= 0) && !(a28 == 11))) || (((((a19 <= 0 && 10 <= a28) && a17 == 8) && a25 == 1) && !(a11 == 1)) && !(a28 == 11))) || (((((a17 == 8 && a19 == 1) && a28 == 7) && a21 == 1) && a25 <= 0) && !(a11 == 1))) || ((((a28 == 9 && a19 == 1) && a17 == 8) && a25 <= 0) && a11 == 1)) || ((((a28 == 9 && a17 == 8) && a19 == 1) && a21 == 1) && a25 <= 0)) || ((((10 <= a28 && a19 == 1) && a25 <= 0) && a11 == 1) && a17 <= 8)) || ((((a19 <= 0 && a17 == 8) && a28 == 7) && a25 == 1) && !(a11 == 1))) || ((((a19 == 1 && a25 == 1) && a17 <= 8) && a11 == 1) && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((((a28 == 9 && a19 <= 0) && a25 == 1) && a11 == 1) || ((((a19 <= 0 && a25 <= 0) && !(a28 == 11)) || ((a19 <= 0 && a25 <= 0) && !(a11 == 1))) && a11 == 1)) || (((((!(3 == input) && a17 == 8) && a19 == 1) && a21 == 1) && a25 == 1) && !(a11 == 1))) || (((a17 == 8 && a19 == 1) && a25 == 1) && !(a28 == 11))) || ((((a19 <= 0 && a25 <= 0) && !(a28 == 11)) || ((a19 <= 0 && a25 <= 0) && !(a11 == 1))) && a17 == 8)) || (((((10 <= a28 && a17 == 8) && a19 == 1) && a21 == 1) && a25 <= 0) && !(a28 == 11))) || (((((a19 <= 0 && 10 <= a28) && a17 == 8) && a25 == 1) && !(a11 == 1)) && !(a28 == 11))) || (((((a17 == 8 && a19 == 1) && a28 == 7) && a21 == 1) && a25 <= 0) && !(a11 == 1))) || ((((a28 == 9 && a19 == 1) && a17 == 8) && a25 <= 0) && a11 == 1)) || ((((a28 == 9 && a17 == 8) && a19 == 1) && a21 == 1) && a25 <= 0)) || ((((10 <= a28 && a19 == 1) && a25 <= 0) && a11 == 1) && a17 <= 8)) || ((((a19 <= 0 && a17 == 8) && a28 == 7) && a25 == 1) && !(a11 == 1))) || ((((a19 == 1 && a25 == 1) && a17 <= 8) && a11 == 1) && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 12.5s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 1298 SDtfs, 2205 SDslu, 262 SDs, 0 SdLazy, 5499 SolverSat, 885 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 488 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2411occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1029 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 493 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1184 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 436 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2393 NumberOfCodeBlocks, 2393 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2380 ConstructedInterpolants, 0 QuantifiedInterpolants, 1162816 SizeOfPredicates, 6 NumberOfNonLiveVariables, 773 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 1366/1378 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...