java -Xss4m -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label55_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-71425fa [2018-07-22 13:09:37,262 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-22 13:09:37,264 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-22 13:09:37,281 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-22 13:09:37,281 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-22 13:09:37,282 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-22 13:09:37,283 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-22 13:09:37,290 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-22 13:09:37,292 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-22 13:09:37,295 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-22 13:09:37,296 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-22 13:09:37,296 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-22 13:09:37,297 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-22 13:09:37,297 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-22 13:09:37,301 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-22 13:09:37,302 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-22 13:09:37,302 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-22 13:09:37,311 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-22 13:09:37,313 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-22 13:09:37,314 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-22 13:09:37,315 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-22 13:09:37,318 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-22 13:09:37,320 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-22 13:09:37,320 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-22 13:09:37,320 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-22 13:09:37,321 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-22 13:09:37,323 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-22 13:09:37,324 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-22 13:09:37,325 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-22 13:09:37,325 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-22 13:09:37,326 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-22 13:09:37,326 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-22 13:09:37,326 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-22 13:09:37,326 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-22 13:09:37,330 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-22 13:09:37,331 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-22 13:09:37,331 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-22 13:09:37,357 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-22 13:09:37,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-22 13:09:37,358 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-22 13:09:37,358 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-22 13:09:37,358 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-22 13:09:37,358 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-22 13:09:37,359 INFO L133 SettingsManager]: * Use SBE=true [2018-07-22 13:09:37,359 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-22 13:09:37,359 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-22 13:09:37,359 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-22 13:09:37,359 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-22 13:09:37,360 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-22 13:09:37,361 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-22 13:09:37,361 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-22 13:09:37,361 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-22 13:09:37,361 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-22 13:09:37,361 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-22 13:09:37,362 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-22 13:09:37,362 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-22 13:09:37,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-22 13:09:37,362 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-22 13:09:37,362 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-07-22 13:09:37,362 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-22 13:09:37,363 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-22 13:09:37,363 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-22 13:09:37,363 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-22 13:09:37,363 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-22 13:09:37,363 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-22 13:09:37,363 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-22 13:09:37,412 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-22 13:09:37,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-22 13:09:37,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-22 13:09:37,435 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-22 13:09:37,436 INFO L276 PluginConnector]: CDTParser initialized [2018-07-22 13:09:37,436 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label55_true-unreach-call_false-termination.c [2018-07-22 13:09:37,766 INFO L220 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/f3dd0cc47/9afea10ec74e4b35b775414b36bdc0aa/FLAG8e403872f [2018-07-22 13:09:38,031 INFO L276 CDTParser]: Found 1 translation units. [2018-07-22 13:09:38,032 INFO L158 CDTParser]: Scanning /storage/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label55_true-unreach-call_false-termination.c [2018-07-22 13:09:38,075 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/f3dd0cc47/9afea10ec74e4b35b775414b36bdc0aa/FLAG8e403872f [2018-07-22 13:09:38,094 INFO L332 CDTParser]: Successfully deleted /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/f3dd0cc47/9afea10ec74e4b35b775414b36bdc0aa [2018-07-22 13:09:38,105 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-22 13:09:38,112 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-22 13:09:38,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-22 13:09:38,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-22 13:09:38,122 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-22 13:09:38,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:09:38" (1/1) ... [2018-07-22 13:09:38,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464c5600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:09:38, skipping insertion in model container [2018-07-22 13:09:38,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:09:38" (1/1) ... [2018-07-22 13:09:38,368 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-22 13:09:38,684 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-22 13:09:38,701 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-22 13:09:38,890 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-22 13:09:38,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:09:38 WrapperNode [2018-07-22 13:09:38,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-22 13:09:38,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-22 13:09:38,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-22 13:09:38,986 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-22 13:09:38,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:09:38" (1/1) ... [2018-07-22 13:09:39,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:09:38" (1/1) ... [2018-07-22 13:09:39,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-22 13:09:39,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-22 13:09:39,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-22 13:09:39,145 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-22 13:09:39,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:09:38" (1/1) ... [2018-07-22 13:09:39,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:09:38" (1/1) ... [2018-07-22 13:09:39,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:09:38" (1/1) ... [2018-07-22 13:09:39,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:09:38" (1/1) ... [2018-07-22 13:09:39,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:09:38" (1/1) ... [2018-07-22 13:09:39,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:09:38" (1/1) ... [2018-07-22 13:09:39,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:09:38" (1/1) ... [2018-07-22 13:09:39,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-22 13:09:39,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-22 13:09:39,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-22 13:09:39,334 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-22 13:09:39,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:09:38" (1/1) ... No working directory specified, using /storage/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 [2018-07-22 13:09:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-22 13:09:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-22 13:09:39,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-22 13:09:43,133 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-22 13:09:43,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:09:43 BoogieIcfgContainer [2018-07-22 13:09:43,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-22 13:09:43,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-22 13:09:43,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-22 13:09:43,142 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-22 13:09:43,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 01:09:38" (1/3) ... [2018-07-22 13:09:43,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254b50cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:09:43, skipping insertion in model container [2018-07-22 13:09:43,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:09:38" (2/3) ... [2018-07-22 13:09:43,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254b50cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:09:43, skipping insertion in model container [2018-07-22 13:09:43,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:09:43" (3/3) ... [2018-07-22 13:09:43,146 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label55_true-unreach-call_false-termination.c [2018-07-22 13:09:43,160 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-22 13:09:43,171 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-22 13:09:43,241 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-22 13:09:43,242 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-22 13:09:43,242 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-22 13:09:43,242 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-22 13:09:43,243 INFO L376 AbstractCegarLoop]: Backedges is TWOTRACK [2018-07-22 13:09:43,243 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-22 13:09:43,243 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-22 13:09:43,243 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-22 13:09:43,243 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-22 13:09:43,279 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2018-07-22 13:09:43,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-22 13:09:43,295 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:09:43,296 INFO L358 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] [2018-07-22 13:09:43,296 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:09:43,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1482679290, now seen corresponding path program 1 times [2018-07-22 13:09:43,305 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:09:43,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:09:43,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:09:43,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:09:43,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:09:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:09:43,962 WARN L169 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-07-22 13:09:44,435 WARN L169 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2018-07-22 13:09:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 13:09:44,561 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:09:44,561 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-22 13:09:44,564 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-22 13:09:44,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-22 13:09:44,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-07-22 13:09:44,583 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 6 states. [2018-07-22 13:09:48,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:09:48,280 INFO L93 Difference]: Finished difference Result 1038 states and 1923 transitions. [2018-07-22 13:09:48,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-22 13:09:48,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-07-22 13:09:48,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:09:48,303 INFO L225 Difference]: With dead ends: 1038 [2018-07-22 13:09:48,303 INFO L226 Difference]: Without dead ends: 782 [2018-07-22 13:09:48,308 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-07-22 13:09:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-07-22 13:09:48,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2018-07-22 13:09:48,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-07-22 13:09:48,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1281 transitions. [2018-07-22 13:09:48,403 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1281 transitions. Word has length 58 [2018-07-22 13:09:48,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:09:48,404 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 1281 transitions. [2018-07-22 13:09:48,404 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-22 13:09:48,405 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1281 transitions. [2018-07-22 13:09:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-22 13:09:48,413 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:09:48,414 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:09:48,414 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:09:48,414 INFO L82 PathProgramCache]: Analyzing trace with hash -943623214, now seen corresponding path program 1 times [2018-07-22 13:09:48,415 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:09:48,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:09:48,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:09:48,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:09:48,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:09:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:09:48,623 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-07-22 13:09:48,624 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:09:48,624 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-22 13:09:48,626 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 13:09:48,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 13:09:48,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:09:48,627 INFO L87 Difference]: Start difference. First operand 782 states and 1281 transitions. Second operand 4 states. [2018-07-22 13:09:50,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:09:50,115 INFO L93 Difference]: Finished difference Result 1918 states and 3226 transitions. [2018-07-22 13:09:50,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:09:50,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2018-07-22 13:09:50,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:09:50,122 INFO L225 Difference]: With dead ends: 1918 [2018-07-22 13:09:50,122 INFO L226 Difference]: Without dead ends: 1138 [2018-07-22 13:09:50,126 INFO L578 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 [2018-07-22 13:09:50,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2018-07-22 13:09:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2018-07-22 13:09:50,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2018-07-22 13:09:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1701 transitions. [2018-07-22 13:09:50,179 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1701 transitions. Word has length 208 [2018-07-22 13:09:50,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:09:50,179 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1701 transitions. [2018-07-22 13:09:50,180 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 13:09:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1701 transitions. [2018-07-22 13:09:50,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-07-22 13:09:50,193 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:09:50,194 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:09:50,194 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:09:50,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1675318972, now seen corresponding path program 1 times [2018-07-22 13:09:50,194 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:09:50,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:09:50,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:09:50,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:09:50,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:09:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:09:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 160 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-07-22 13:09:50,562 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 13:09:50,562 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-22 13:09:50,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:09:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:09:50,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 13:09:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-07-22 13:09:50,812 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-22 13:09:50,812 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-07-22 13:09:50,813 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-22 13:09:50,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-22 13:09:50,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-22 13:09:50,814 INFO L87 Difference]: Start difference. First operand 1138 states and 1701 transitions. Second operand 6 states. [2018-07-22 13:09:56,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:09:56,756 INFO L93 Difference]: Finished difference Result 5329 states and 8321 transitions. [2018-07-22 13:09:56,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-22 13:09:56,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 231 [2018-07-22 13:09:56,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:09:56,779 INFO L225 Difference]: With dead ends: 5329 [2018-07-22 13:09:56,779 INFO L226 Difference]: Without dead ends: 4012 [2018-07-22 13:09:56,782 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-07-22 13:09:56,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4012 states. [2018-07-22 13:09:56,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4012 to 3106. [2018-07-22 13:09:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3106 states. [2018-07-22 13:09:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 3519 transitions. [2018-07-22 13:09:56,905 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 3519 transitions. Word has length 231 [2018-07-22 13:09:56,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:09:56,906 INFO L471 AbstractCegarLoop]: Abstraction has 3106 states and 3519 transitions. [2018-07-22 13:09:56,906 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-22 13:09:56,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 3519 transitions. [2018-07-22 13:09:56,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-07-22 13:09:56,923 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:09:56,924 INFO L358 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-07-22 13:09:56,924 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:09:56,925 INFO L82 PathProgramCache]: Analyzing trace with hash -592921663, now seen corresponding path program 1 times [2018-07-22 13:09:56,925 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:09:56,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:09:56,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:09:56,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:09:56,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:09:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:09:57,610 WARN L169 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-07-22 13:09:57,729 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-07-22 13:09:57,730 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:09:57,730 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 13:09:57,731 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 13:09:57,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 13:09:57,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:09:57,731 INFO L87 Difference]: Start difference. First operand 3106 states and 3519 transitions. Second operand 4 states. [2018-07-22 13:09:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:09:58,873 INFO L93 Difference]: Finished difference Result 8000 states and 9397 transitions. [2018-07-22 13:09:58,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:09:58,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 530 [2018-07-22 13:09:58,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:09:58,935 INFO L225 Difference]: With dead ends: 8000 [2018-07-22 13:09:58,936 INFO L226 Difference]: Without dead ends: 5075 [2018-07-22 13:09:58,941 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:09:58,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5075 states. [2018-07-22 13:09:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5075 to 5075. [2018-07-22 13:09:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5075 states. [2018-07-22 13:09:59,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5075 states to 5075 states and 5725 transitions. [2018-07-22 13:09:59,078 INFO L78 Accepts]: Start accepts. Automaton has 5075 states and 5725 transitions. Word has length 530 [2018-07-22 13:09:59,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:09:59,080 INFO L471 AbstractCegarLoop]: Abstraction has 5075 states and 5725 transitions. [2018-07-22 13:09:59,081 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 13:09:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 5075 states and 5725 transitions. [2018-07-22 13:09:59,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2018-07-22 13:09:59,102 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:09:59,102 INFO L358 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:09:59,103 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:09:59,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1042866775, now seen corresponding path program 1 times [2018-07-22 13:09:59,103 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:09:59,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:09:59,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:09:59,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:09:59,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:09:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:10:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1127 backedges. 690 proven. 46 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-07-22 13:10:00,048 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 13:10:00,049 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-22 13:10:00,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:10:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:10:00,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 13:10:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1127 backedges. 713 proven. 23 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-07-22 13:10:00,864 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-22 13:10:00,865 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-07-22 13:10:00,865 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-22 13:10:00,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-22 13:10:00,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-07-22 13:10:00,866 INFO L87 Difference]: Start difference. First operand 5075 states and 5725 transitions. Second operand 9 states. [2018-07-22 13:10:06,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:10:06,210 INFO L93 Difference]: Finished difference Result 10228 states and 11531 transitions. [2018-07-22 13:10:06,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-22 13:10:06,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 557 [2018-07-22 13:10:06,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:10:06,239 INFO L225 Difference]: With dead ends: 10228 [2018-07-22 13:10:06,239 INFO L226 Difference]: Without dead ends: 5154 [2018-07-22 13:10:06,248 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-07-22 13:10:06,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5154 states. [2018-07-22 13:10:06,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5154 to 4895. [2018-07-22 13:10:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4895 states. [2018-07-22 13:10:06,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4895 states to 4895 states and 5521 transitions. [2018-07-22 13:10:06,387 INFO L78 Accepts]: Start accepts. Automaton has 4895 states and 5521 transitions. Word has length 557 [2018-07-22 13:10:06,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:10:06,388 INFO L471 AbstractCegarLoop]: Abstraction has 4895 states and 5521 transitions. [2018-07-22 13:10:06,389 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-22 13:10:06,389 INFO L276 IsEmpty]: Start isEmpty. Operand 4895 states and 5521 transitions. [2018-07-22 13:10:06,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2018-07-22 13:10:06,414 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:10:06,415 INFO L358 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:10:06,415 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:10:06,416 INFO L82 PathProgramCache]: Analyzing trace with hash -624405341, now seen corresponding path program 1 times [2018-07-22 13:10:06,416 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:10:06,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:10:06,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:10:06,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:10:06,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:10:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:10:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1253 backedges. 880 proven. 0 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2018-07-22 13:10:07,304 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:10:07,304 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-22 13:10:07,304 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 13:10:07,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 13:10:07,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 13:10:07,305 INFO L87 Difference]: Start difference. First operand 4895 states and 5521 transitions. Second operand 3 states. [2018-07-22 13:10:09,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:10:09,576 INFO L93 Difference]: Finished difference Result 11757 states and 13499 transitions. [2018-07-22 13:10:09,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 13:10:09,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 644 [2018-07-22 13:10:09,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:10:09,606 INFO L225 Difference]: With dead ends: 11757 [2018-07-22 13:10:09,607 INFO L226 Difference]: Without dead ends: 7043 [2018-07-22 13:10:09,613 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 13:10:09,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7043 states. [2018-07-22 13:10:09,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7043 to 7043. [2018-07-22 13:10:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7043 states. [2018-07-22 13:10:09,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7043 states to 7043 states and 8056 transitions. [2018-07-22 13:10:09,755 INFO L78 Accepts]: Start accepts. Automaton has 7043 states and 8056 transitions. Word has length 644 [2018-07-22 13:10:09,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:10:09,756 INFO L471 AbstractCegarLoop]: Abstraction has 7043 states and 8056 transitions. [2018-07-22 13:10:09,756 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 13:10:09,756 INFO L276 IsEmpty]: Start isEmpty. Operand 7043 states and 8056 transitions. [2018-07-22 13:10:09,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2018-07-22 13:10:09,770 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:10:09,770 INFO L358 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:10:09,771 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:10:09,771 INFO L82 PathProgramCache]: Analyzing trace with hash 97336899, now seen corresponding path program 1 times [2018-07-22 13:10:09,771 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:10:09,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:10:09,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:10:09,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:10:09,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:10:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:10:10,276 WARN L169 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-07-22 13:10:10,496 WARN L169 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2018-07-22 13:10:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 1141 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-07-22 13:10:10,735 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:10:10,735 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 13:10:10,735 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 13:10:10,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 13:10:10,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:10:10,736 INFO L87 Difference]: Start difference. First operand 7043 states and 8056 transitions. Second operand 4 states. [2018-07-22 13:10:11,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:10:11,758 INFO L93 Difference]: Finished difference Result 14800 states and 16978 transitions. [2018-07-22 13:10:11,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:10:11,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 647 [2018-07-22 13:10:11,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:10:11,795 INFO L225 Difference]: With dead ends: 14800 [2018-07-22 13:10:11,795 INFO L226 Difference]: Without dead ends: 7938 [2018-07-22 13:10:11,806 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:10:11,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7938 states. [2018-07-22 13:10:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7938 to 7938. [2018-07-22 13:10:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7938 states. [2018-07-22 13:10:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7938 states to 7938 states and 8869 transitions. [2018-07-22 13:10:11,963 INFO L78 Accepts]: Start accepts. Automaton has 7938 states and 8869 transitions. Word has length 647 [2018-07-22 13:10:11,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:10:11,964 INFO L471 AbstractCegarLoop]: Abstraction has 7938 states and 8869 transitions. [2018-07-22 13:10:11,964 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 13:10:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 7938 states and 8869 transitions. [2018-07-22 13:10:11,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2018-07-22 13:10:11,978 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:10:11,979 INFO L358 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:10:11,979 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:10:11,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1177209843, now seen corresponding path program 1 times [2018-07-22 13:10:11,979 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:10:11,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:10:11,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:10:11,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:10:11,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:10:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:10:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2018-07-22 13:10:12,835 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:10:12,835 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-22 13:10:12,836 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-22 13:10:12,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-22 13:10:12,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-22 13:10:12,836 INFO L87 Difference]: Start difference. First operand 7938 states and 8869 transitions. Second operand 7 states. [2018-07-22 13:10:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:10:14,269 INFO L93 Difference]: Finished difference Result 16437 states and 18364 transitions. [2018-07-22 13:10:14,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-22 13:10:14,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 692 [2018-07-22 13:10:14,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:10:14,287 INFO L225 Difference]: With dead ends: 16437 [2018-07-22 13:10:14,287 INFO L226 Difference]: Without dead ends: 8114 [2018-07-22 13:10:14,295 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-22 13:10:14,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8114 states. [2018-07-22 13:10:14,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8114 to 7935. [2018-07-22 13:10:14,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7935 states. [2018-07-22 13:10:14,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7935 states to 7935 states and 8791 transitions. [2018-07-22 13:10:14,429 INFO L78 Accepts]: Start accepts. Automaton has 7935 states and 8791 transitions. Word has length 692 [2018-07-22 13:10:14,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:10:14,430 INFO L471 AbstractCegarLoop]: Abstraction has 7935 states and 8791 transitions. [2018-07-22 13:10:14,430 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-22 13:10:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 7935 states and 8791 transitions. [2018-07-22 13:10:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2018-07-22 13:10:14,444 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:10:14,445 INFO L358 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:10:14,445 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:10:14,445 INFO L82 PathProgramCache]: Analyzing trace with hash 506532314, now seen corresponding path program 1 times [2018-07-22 13:10:14,446 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:10:14,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:10:14,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:10:14,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:10:14,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:10:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:10:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1673 backedges. 1161 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-07-22 13:10:14,965 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:10:14,965 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-22 13:10:14,966 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 13:10:14,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 13:10:14,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 13:10:14,966 INFO L87 Difference]: Start difference. First operand 7935 states and 8791 transitions. Second operand 3 states. [2018-07-22 13:10:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:10:16,118 INFO L93 Difference]: Finished difference Result 17837 states and 19800 transitions. [2018-07-22 13:10:16,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 13:10:16,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 717 [2018-07-22 13:10:16,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:10:16,134 INFO L225 Difference]: With dead ends: 17837 [2018-07-22 13:10:16,134 INFO L226 Difference]: Without dead ends: 10083 [2018-07-22 13:10:16,142 INFO L578 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 [2018-07-22 13:10:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10083 states. [2018-07-22 13:10:16,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10083 to 10083. [2018-07-22 13:10:16,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10083 states. [2018-07-22 13:10:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10083 states to 10083 states and 11084 transitions. [2018-07-22 13:10:16,277 INFO L78 Accepts]: Start accepts. Automaton has 10083 states and 11084 transitions. Word has length 717 [2018-07-22 13:10:16,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:10:16,278 INFO L471 AbstractCegarLoop]: Abstraction has 10083 states and 11084 transitions. [2018-07-22 13:10:16,278 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 13:10:16,278 INFO L276 IsEmpty]: Start isEmpty. Operand 10083 states and 11084 transitions. [2018-07-22 13:10:16,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 874 [2018-07-22 13:10:16,293 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:10:16,294 INFO L358 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:10:16,294 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:10:16,295 INFO L82 PathProgramCache]: Analyzing trace with hash -985633233, now seen corresponding path program 1 times [2018-07-22 13:10:16,295 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:10:16,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:10:16,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:10:16,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:10:16,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:10:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:10:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2367 backedges. 1529 proven. 0 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2018-07-22 13:10:17,078 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:10:17,078 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 13:10:17,078 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 13:10:17,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 13:10:17,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:10:17,079 INFO L87 Difference]: Start difference. First operand 10083 states and 11084 transitions. Second operand 4 states. [2018-07-22 13:10:17,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:10:17,919 INFO L93 Difference]: Finished difference Result 20522 states and 22734 transitions. [2018-07-22 13:10:17,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:10:17,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 873 [2018-07-22 13:10:17,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:10:17,933 INFO L225 Difference]: With dead ends: 20522 [2018-07-22 13:10:17,934 INFO L226 Difference]: Without dead ends: 10620 [2018-07-22 13:10:17,941 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:10:17,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10620 states. [2018-07-22 13:10:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10620 to 10620. [2018-07-22 13:10:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10620 states. [2018-07-22 13:10:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10620 states to 10620 states and 11492 transitions. [2018-07-22 13:10:18,077 INFO L78 Accepts]: Start accepts. Automaton has 10620 states and 11492 transitions. Word has length 873 [2018-07-22 13:10:18,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:10:18,078 INFO L471 AbstractCegarLoop]: Abstraction has 10620 states and 11492 transitions. [2018-07-22 13:10:18,078 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 13:10:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 10620 states and 11492 transitions. [2018-07-22 13:10:18,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2018-07-22 13:10:18,091 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:10:18,092 INFO L358 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:10:18,092 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:10:18,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1704338394, now seen corresponding path program 1 times [2018-07-22 13:10:18,092 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:10:18,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:10:18,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:10:18,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:10:18,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:10:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:10:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2981 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 2534 trivial. 0 not checked. [2018-07-22 13:10:19,346 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:10:19,375 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 13:10:19,376 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 13:10:19,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 13:10:19,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:10:19,377 INFO L87 Difference]: Start difference. First operand 10620 states and 11492 transitions. Second operand 4 states. [2018-07-22 13:10:20,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:10:20,281 INFO L93 Difference]: Finished difference Result 21059 states and 22802 transitions. [2018-07-22 13:10:20,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:10:20,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 969 [2018-07-22 13:10:20,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:10:20,295 INFO L225 Difference]: With dead ends: 21059 [2018-07-22 13:10:20,295 INFO L226 Difference]: Without dead ends: 10620 [2018-07-22 13:10:20,306 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:10:20,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10620 states. [2018-07-22 13:10:20,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10620 to 10620. [2018-07-22 13:10:20,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10620 states. [2018-07-22 13:10:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10620 states to 10620 states and 11337 transitions. [2018-07-22 13:10:20,411 INFO L78 Accepts]: Start accepts. Automaton has 10620 states and 11337 transitions. Word has length 969 [2018-07-22 13:10:20,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:10:20,412 INFO L471 AbstractCegarLoop]: Abstraction has 10620 states and 11337 transitions. [2018-07-22 13:10:20,412 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 13:10:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 10620 states and 11337 transitions. [2018-07-22 13:10:20,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1079 [2018-07-22 13:10:20,427 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:10:20,428 INFO L358 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:10:20,428 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:10:20,429 INFO L82 PathProgramCache]: Analyzing trace with hash 598154360, now seen corresponding path program 1 times [2018-07-22 13:10:20,429 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:10:20,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:10:20,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:10:20,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:10:20,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:10:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:10:21,262 WARN L169 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-07-22 13:10:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3785 backedges. 1288 proven. 0 refuted. 0 times theorem prover too weak. 2497 trivial. 0 not checked. [2018-07-22 13:10:21,734 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:10:21,734 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 13:10:21,735 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 13:10:21,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 13:10:21,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:10:21,735 INFO L87 Difference]: Start difference. First operand 10620 states and 11337 transitions. Second operand 4 states. [2018-07-22 13:10:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:10:22,518 INFO L93 Difference]: Finished difference Result 21596 states and 23093 transitions. [2018-07-22 13:10:22,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:10:22,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1078 [2018-07-22 13:10:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:10:22,530 INFO L225 Difference]: With dead ends: 21596 [2018-07-22 13:10:22,530 INFO L226 Difference]: Without dead ends: 10437 [2018-07-22 13:10:22,542 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:10:22,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10437 states. [2018-07-22 13:10:22,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10437 to 10258. [2018-07-22 13:10:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10258 states. [2018-07-22 13:10:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10258 states to 10258 states and 10704 transitions. [2018-07-22 13:10:22,648 INFO L78 Accepts]: Start accepts. Automaton has 10258 states and 10704 transitions. Word has length 1078 [2018-07-22 13:10:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:10:22,649 INFO L471 AbstractCegarLoop]: Abstraction has 10258 states and 10704 transitions. [2018-07-22 13:10:22,649 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 13:10:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 10258 states and 10704 transitions. [2018-07-22 13:10:22,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1127 [2018-07-22 13:10:22,660 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:10:22,661 INFO L358 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:10:22,661 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:10:22,661 INFO L82 PathProgramCache]: Analyzing trace with hash -830247680, now seen corresponding path program 1 times [2018-07-22 13:10:22,661 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:10:22,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:10:22,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:10:22,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:10:22,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:10:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:10:23,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4022 backedges. 2648 proven. 0 refuted. 0 times theorem prover too weak. 1374 trivial. 0 not checked. [2018-07-22 13:10:23,903 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:10:23,903 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-22 13:10:23,904 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-22 13:10:23,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-22 13:10:23,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 13:10:23,904 INFO L87 Difference]: Start difference. First operand 10258 states and 10704 transitions. Second operand 5 states. [2018-07-22 13:10:24,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:10:24,885 INFO L93 Difference]: Finished difference Result 21416 states and 22361 transitions. [2018-07-22 13:10:24,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-22 13:10:24,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1126 [2018-07-22 13:10:24,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:10:24,928 INFO L225 Difference]: With dead ends: 21416 [2018-07-22 13:10:24,929 INFO L226 Difference]: Without dead ends: 11339 [2018-07-22 13:10:24,936 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 13:10:24,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11339 states. [2018-07-22 13:10:25,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11339 to 10437. [2018-07-22 13:10:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10437 states. [2018-07-22 13:10:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10437 states to 10437 states and 10887 transitions. [2018-07-22 13:10:25,033 INFO L78 Accepts]: Start accepts. Automaton has 10437 states and 10887 transitions. Word has length 1126 [2018-07-22 13:10:25,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:10:25,034 INFO L471 AbstractCegarLoop]: Abstraction has 10437 states and 10887 transitions. [2018-07-22 13:10:25,034 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-22 13:10:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 10437 states and 10887 transitions. [2018-07-22 13:10:25,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1668 [2018-07-22 13:10:25,050 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:10:25,051 INFO L358 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:10:25,051 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:10:25,052 INFO L82 PathProgramCache]: Analyzing trace with hash -942637433, now seen corresponding path program 1 times [2018-07-22 13:10:25,052 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:10:25,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:10:25,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:10:25,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:10:25,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:10:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:10:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 8851 backedges. 3726 proven. 504 refuted. 0 times theorem prover too weak. 4621 trivial. 0 not checked. [2018-07-22 13:10:27,879 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 13:10:27,879 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-22 13:10:27,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:10:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:10:28,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 13:10:37,595 WARN L169 SmtUtils]: Spent 8.20 s on a formula simplification. DAG size of input: 53 DAG size of output: 26 [2018-07-22 13:10:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8851 backedges. 3876 proven. 354 refuted. 0 times theorem prover too weak. 4621 trivial. 0 not checked. [2018-07-22 13:10:39,921 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-22 13:10:39,922 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-07-22 13:10:39,923 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-22 13:10:39,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-22 13:10:39,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-07-22 13:10:39,923 INFO L87 Difference]: Start difference. First operand 10437 states and 10887 transitions. Second operand 12 states. [2018-07-22 13:10:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:10:45,817 INFO L93 Difference]: Finished difference Result 22693 states and 23710 transitions. [2018-07-22 13:10:45,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-22 13:10:45,817 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1667 [2018-07-22 13:10:45,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:10:45,826 INFO L225 Difference]: With dead ends: 22693 [2018-07-22 13:10:45,826 INFO L226 Difference]: Without dead ends: 12059 [2018-07-22 13:10:45,832 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 1689 GetRequests, 1671 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-07-22 13:10:45,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12059 states. [2018-07-22 13:10:45,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12059 to 11879. [2018-07-22 13:10:45,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11879 states. [2018-07-22 13:10:45,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11879 states to 11879 states and 12292 transitions. [2018-07-22 13:10:45,961 INFO L78 Accepts]: Start accepts. Automaton has 11879 states and 12292 transitions. Word has length 1667 [2018-07-22 13:10:45,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:10:45,963 INFO L471 AbstractCegarLoop]: Abstraction has 11879 states and 12292 transitions. [2018-07-22 13:10:45,963 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-22 13:10:45,963 INFO L276 IsEmpty]: Start isEmpty. Operand 11879 states and 12292 transitions. [2018-07-22 13:10:45,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1842 [2018-07-22 13:10:45,986 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 13:10:45,987 INFO L358 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 9, 9, 9, 9, 9, 9, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 13:10:45,987 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 13:10:45,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1395705905, now seen corresponding path program 1 times [2018-07-22 13:10:45,988 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 13:10:45,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 13:10:45,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:10:45,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 13:10:45,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 13:10:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 13:10:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 10494 backedges. 4634 proven. 0 refuted. 0 times theorem prover too weak. 5860 trivial. 0 not checked. [2018-07-22 13:10:48,479 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 13:10:48,480 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 13:10:48,480 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 13:10:48,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 13:10:48,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:10:48,481 INFO L87 Difference]: Start difference. First operand 11879 states and 12292 transitions. Second operand 4 states. [2018-07-22 13:10:49,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 13:10:49,192 INFO L93 Difference]: Finished difference Result 20692 states and 21369 transitions. [2018-07-22 13:10:49,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 13:10:49,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1841 [2018-07-22 13:10:49,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 13:10:49,194 INFO L225 Difference]: With dead ends: 20692 [2018-07-22 13:10:49,194 INFO L226 Difference]: Without dead ends: 0 [2018-07-22 13:10:49,200 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 13:10:49,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-22 13:10:49,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-22 13:10:49,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-22 13:10:49,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-22 13:10:49,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1841 [2018-07-22 13:10:49,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 13:10:49,204 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-22 13:10:49,204 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 13:10:49,204 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-22 13:10:49,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-22 13:10:49,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-22 13:10:49,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:10:49,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:10:49,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:10:49,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:10:49,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:10:49,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:10:49,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:10:49,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:10:49,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:10:49,431 WARN L169 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 156 [2018-07-22 13:10:49,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:10:49,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:10:49,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:10:49,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:10:49,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:10:49,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:10:49,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:10:49,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:10:49,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 13:10:49,586 WARN L169 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 156 [2018-07-22 13:10:51,567 WARN L169 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 139 DAG size of output: 89 [2018-07-22 13:10:52,524 WARN L169 SmtUtils]: Spent 955.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 89 [2018-07-22 13:10:52,526 INFO L421 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-07-22 13:10:52,527 INFO L421 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-07-22 13:10:52,527 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-22 13:10:52,527 INFO L421 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-07-22 13:10:52,527 INFO L421 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-07-22 13:10:52,527 INFO L421 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-07-22 13:10:52,527 INFO L421 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-07-22 13:10:52,527 INFO L421 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-07-22 13:10:52,527 INFO L421 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-07-22 13:10:52,527 INFO L421 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-07-22 13:10:52,527 INFO L421 ceAbstractionStarter]: For program point L174'(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,527 INFO L421 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-07-22 13:10:52,527 INFO L421 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-07-22 13:10:52,527 INFO L421 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-07-22 13:10:52,527 INFO L421 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-07-22 13:10:52,527 INFO L421 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-07-22 13:10:52,528 INFO L421 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-07-22 13:10:52,528 INFO L421 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-07-22 13:10:52,528 INFO L421 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-07-22 13:10:52,528 INFO L421 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-07-22 13:10:52,528 INFO L421 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-07-22 13:10:52,528 INFO L421 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-07-22 13:10:52,528 INFO L421 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-07-22 13:10:52,528 INFO L421 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-07-22 13:10:52,528 INFO L421 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-07-22 13:10:52,528 INFO L421 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-07-22 13:10:52,528 INFO L421 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-07-22 13:10:52,528 INFO L421 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-07-22 13:10:52,528 INFO L421 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-07-22 13:10:52,528 INFO L421 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-07-22 13:10:52,529 INFO L421 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-07-22 13:10:52,529 INFO L421 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-07-22 13:10:52,529 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-22 13:10:52,529 INFO L421 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-07-22 13:10:52,529 INFO L421 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-07-22 13:10:52,529 INFO L421 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-07-22 13:10:52,529 INFO L421 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-07-22 13:10:52,529 INFO L421 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-07-22 13:10:52,529 INFO L421 ceAbstractionStarter]: For program point L102(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,529 INFO L421 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-07-22 13:10:52,529 INFO L421 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-07-22 13:10:52,529 INFO L421 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-07-22 13:10:52,529 INFO L421 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-07-22 13:10:52,530 INFO L421 ceAbstractionStarter]: For program point L105(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,530 INFO L421 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-07-22 13:10:52,530 INFO L421 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-07-22 13:10:52,530 INFO L421 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-07-22 13:10:52,530 INFO L421 ceAbstractionStarter]: For program point L108(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,530 INFO L421 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-07-22 13:10:52,530 INFO L421 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-07-22 13:10:52,530 INFO L421 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-07-22 13:10:52,530 INFO L421 ceAbstractionStarter]: For program point L120(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,530 INFO L421 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-07-22 13:10:52,530 INFO L421 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-07-22 13:10:52,530 INFO L421 ceAbstractionStarter]: For program point L123(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,531 INFO L421 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-07-22 13:10:52,531 INFO L421 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-07-22 13:10:52,531 INFO L421 ceAbstractionStarter]: For program point L126(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,531 INFO L421 ceAbstractionStarter]: For program point L129(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,531 INFO L421 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-07-22 13:10:52,531 INFO L421 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-07-22 13:10:52,531 INFO L421 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-07-22 13:10:52,531 INFO L421 ceAbstractionStarter]: For program point L111(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,531 INFO L421 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-07-22 13:10:52,531 INFO L421 ceAbstractionStarter]: For program point L117(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,532 INFO L421 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-07-22 13:10:52,532 INFO L421 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-07-22 13:10:52,532 INFO L421 ceAbstractionStarter]: For program point L114(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,532 INFO L421 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-07-22 13:10:52,532 INFO L421 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-07-22 13:10:52,532 INFO L421 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-07-22 13:10:52,532 INFO L421 ceAbstractionStarter]: For program point L141(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,532 INFO L421 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-07-22 13:10:52,532 INFO L421 ceAbstractionStarter]: For program point L144(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,532 INFO L421 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-07-22 13:10:52,532 INFO L421 ceAbstractionStarter]: For program point L147(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,532 INFO L421 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-07-22 13:10:52,533 INFO L421 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-07-22 13:10:52,533 INFO L421 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-07-22 13:10:52,533 INFO L421 ceAbstractionStarter]: For program point L135(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,533 INFO L421 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-07-22 13:10:52,533 INFO L421 ceAbstractionStarter]: For program point L132(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,533 INFO L421 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-07-22 13:10:52,533 INFO L421 ceAbstractionStarter]: For program point L138(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,533 INFO L421 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-07-22 13:10:52,533 INFO L421 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-07-22 13:10:52,533 INFO L421 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-07-22 13:10:52,533 INFO L421 ceAbstractionStarter]: For program point L162(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,533 INFO L421 ceAbstractionStarter]: For program point L168(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,533 INFO L421 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-07-22 13:10:52,534 INFO L421 ceAbstractionStarter]: For program point L165(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,534 INFO L421 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-07-22 13:10:52,534 INFO L421 ceAbstractionStarter]: For program point L171(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,534 INFO L421 ceAbstractionStarter]: For program point L153(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,534 INFO L421 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-07-22 13:10:52,534 INFO L421 ceAbstractionStarter]: For program point L150(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,534 INFO L421 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-07-22 13:10:52,534 INFO L421 ceAbstractionStarter]: For program point L156(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,534 INFO L421 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-07-22 13:10:52,534 INFO L421 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-07-22 13:10:52,534 INFO L421 ceAbstractionStarter]: For program point L159(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,534 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-22 13:10:52,534 INFO L421 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-07-22 13:10:52,535 INFO L421 ceAbstractionStarter]: For program point L186(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,535 INFO L421 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-07-22 13:10:52,535 INFO L421 ceAbstractionStarter]: For program point L183(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,535 INFO L421 ceAbstractionStarter]: For program point L189(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,535 INFO L421 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-07-22 13:10:52,535 INFO L421 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-07-22 13:10:52,535 INFO L421 ceAbstractionStarter]: For program point L192(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,535 INFO L421 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-07-22 13:10:52,535 INFO L421 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-07-22 13:10:52,535 INFO L421 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-07-22 13:10:52,535 INFO L421 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-07-22 13:10:52,535 INFO L421 ceAbstractionStarter]: For program point L177(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,535 INFO L421 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-07-22 13:10:52,536 INFO L421 ceAbstractionStarter]: For program point L180(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,536 INFO L421 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-07-22 13:10:52,536 INFO L421 ceAbstractionStarter]: For program point L195(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,536 INFO L421 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-07-22 13:10:52,536 INFO L421 ceAbstractionStarter]: For program point L198(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,536 INFO L421 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-07-22 13:10:52,536 INFO L421 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-07-22 13:10:52,536 INFO L421 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-07-22 13:10:52,536 INFO L421 ceAbstractionStarter]: For program point L24(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,536 INFO L421 ceAbstractionStarter]: For program point L27(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,536 INFO L421 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-07-22 13:10:52,536 INFO L421 ceAbstractionStarter]: For program point L30(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,536 INFO L421 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-07-22 13:10:52,537 INFO L421 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-07-22 13:10:52,537 INFO L421 ceAbstractionStarter]: For program point L33(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,537 INFO L421 ceAbstractionStarter]: For program point L36(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,537 INFO L421 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-07-22 13:10:52,537 INFO L421 ceAbstractionStarter]: For program point L39(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,537 INFO L421 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-07-22 13:10:52,537 INFO L421 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-07-22 13:10:52,537 INFO L421 ceAbstractionStarter]: For program point L42(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,537 INFO L421 ceAbstractionStarter]: For program point L45(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,537 INFO L421 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-07-22 13:10:52,537 INFO L421 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-07-22 13:10:52,537 INFO L421 ceAbstractionStarter]: For program point L48(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,537 INFO L421 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-07-22 13:10:52,537 INFO L421 ceAbstractionStarter]: For program point L51(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,537 INFO L421 ceAbstractionStarter]: For program point L54(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,537 INFO L421 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-07-22 13:10:52,537 INFO L421 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-07-22 13:10:52,538 INFO L421 ceAbstractionStarter]: For program point L57(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,538 INFO L421 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-07-22 13:10:52,538 INFO L421 ceAbstractionStarter]: For program point L60(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,538 INFO L421 ceAbstractionStarter]: For program point L63(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,538 INFO L421 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-07-22 13:10:52,538 INFO L421 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-07-22 13:10:52,538 INFO L421 ceAbstractionStarter]: For program point L66(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,538 INFO L421 ceAbstractionStarter]: For program point L69(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,538 INFO L421 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-07-22 13:10:52,538 INFO L421 ceAbstractionStarter]: For program point L72(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,538 INFO L421 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-07-22 13:10:52,538 INFO L421 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-07-22 13:10:52,538 INFO L421 ceAbstractionStarter]: For program point L75(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,538 INFO L421 ceAbstractionStarter]: For program point L78(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,539 INFO L421 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-07-22 13:10:52,539 INFO L421 ceAbstractionStarter]: For program point L81(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,539 INFO L421 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-07-22 13:10:52,539 INFO L421 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-07-22 13:10:52,539 INFO L421 ceAbstractionStarter]: For program point L84(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,539 INFO L421 ceAbstractionStarter]: For program point L87(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,539 INFO L421 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-07-22 13:10:52,539 INFO L421 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-07-22 13:10:52,539 INFO L421 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-07-22 13:10:52,539 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-22 13:10:52,539 INFO L421 ceAbstractionStarter]: For program point L90(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,540 INFO L421 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-07-22 13:10:52,540 INFO L421 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-07-22 13:10:52,540 INFO L421 ceAbstractionStarter]: For program point L93(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,540 INFO L421 ceAbstractionStarter]: For program point L96(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,540 INFO L421 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-07-22 13:10:52,540 INFO L421 ceAbstractionStarter]: For program point L99(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,540 INFO L421 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-07-22 13:10:52,540 INFO L421 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-07-22 13:10:52,540 INFO L421 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-07-22 13:10:52,540 INFO L421 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-07-22 13:10:52,541 INFO L421 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-07-22 13:10:52,541 INFO L421 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-07-22 13:10:52,541 INFO L421 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-07-22 13:10:52,541 INFO L421 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-07-22 13:10:52,541 INFO L421 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-07-22 13:10:52,541 INFO L421 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-07-22 13:10:52,541 INFO L421 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-07-22 13:10:52,541 INFO L421 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-07-22 13:10:52,541 INFO L421 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-07-22 13:10:52,541 INFO L421 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-07-22 13:10:52,541 INFO L421 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-07-22 13:10:52,542 INFO L421 ceAbstractionStarter]: For program point L880(lines 880 889) no Hoare annotation was computed. [2018-07-22 13:10:52,542 INFO L421 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-07-22 13:10:52,542 INFO L421 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-07-22 13:10:52,542 INFO L421 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-07-22 13:10:52,542 INFO L421 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-07-22 13:10:52,543 INFO L417 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse13 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 8)) (.cse11 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 7)) (.cse1 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 43))) (let ((.cse17 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 95434)) (.cse4 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 11)) (.cse5 (< 0 .cse1)) (.cse8 (not .cse11)) (.cse10 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 7)) (.cse16 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 10)) (.cse14 (< 80 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (.cse6 (not .cse13)) (.cse3 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 8)) (.cse7 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 72)) (.cse2 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 8)) (.cse9 (<= 19 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (.cse15 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 9)) (.cse0 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0 1)) (.cse12 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 6))) (or (and (and .cse0 (<= .cse1 0) .cse2) .cse3) (and .cse0 .cse4 .cse3 .cse5) (and .cse0 (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 526767) 0) .cse3) (and .cse0 .cse6 .cse7 .cse2 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse12) (and .cse0 .cse13 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 73282) .cse3) (and .cse0 .cse14 .cse6 .cse15) (and .cse0 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 5) (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 6)) (and .cse0 .cse11 .cse3) (and .cse0 .cse14 .cse16) (and .cse0 .cse6 .cse7 .cse2 .cse9 .cse16) (and .cse0 .cse13 (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 49) 0) .cse10) (and .cse0 .cse7 .cse3 .cse9) (and .cse0 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 80) .cse2 .cse8 .cse15) (and .cse6 .cse4 (and .cse2 .cse12 .cse8)) (and .cse0 .cse17 .cse2 .cse12) (and .cse0 .cse17 .cse12 (<= 95381 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (and .cse0 (exists ((v_prenex_2 Int)) (let ((.cse18 (* 9 v_prenex_2))) (and (<= 0 .cse18) (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 546123) (div .cse18 10)) (< 80 v_prenex_2) (<= v_prenex_2 95434)))) .cse11 .cse10) (and .cse0 .cse4 .cse16) (and .cse0 .cse13 .cse4 .cse5 .cse10) (and .cse0 .cse14 .cse8 .cse10) (and .cse0 .cse11 .cse16) (and .cse0 .cse14 .cse6 .cse3) (and .cse0 .cse7 .cse2 .cse9 .cse15) (and .cse0 .cse13 .cse12)))) [2018-07-22 13:10:52,543 INFO L421 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-07-22 13:10:52,543 INFO L424 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2018-07-22 13:10:52,543 INFO L421 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-07-22 13:10:52,543 INFO L421 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-07-22 13:10:52,543 INFO L421 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-07-22 13:10:52,543 INFO L421 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-07-22 13:10:52,543 INFO L421 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-07-22 13:10:52,544 INFO L417 ceAbstractionStarter]: At program point L880''(lines 880 889) the Hoare annotation is: (let ((.cse13 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 8)) (.cse11 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 7)) (.cse1 (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 43))) (let ((.cse17 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 95434)) (.cse4 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 11)) (.cse5 (< 0 .cse1)) (.cse8 (not .cse11)) (.cse10 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 7)) (.cse16 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 10)) (.cse14 (< 80 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (.cse6 (not .cse13)) (.cse3 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 8)) (.cse7 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 72)) (.cse2 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 8)) (.cse9 (<= 19 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (.cse15 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 9)) (.cse0 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0 1)) (.cse12 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 6))) (or (and (and .cse0 (<= .cse1 0) .cse2) .cse3) (and .cse0 .cse4 .cse3 .cse5) (and .cse0 (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 526767) 0) .cse3) (and .cse0 .cse6 .cse7 .cse2 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse12) (and .cse0 .cse13 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 73282) .cse3) (and .cse0 .cse14 .cse6 .cse15) (and .cse0 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 5) (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 6)) (and .cse0 .cse11 .cse3) (and .cse0 .cse14 .cse16) (and .cse0 .cse6 .cse7 .cse2 .cse9 .cse16) (and .cse0 .cse13 (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 49) 0) .cse10) (and .cse0 .cse7 .cse3 .cse9) (and .cse0 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 80) .cse2 .cse8 .cse15) (and .cse6 .cse4 (and .cse2 .cse12 .cse8)) (and .cse0 .cse17 .cse2 .cse12) (and .cse0 .cse17 .cse12 (<= 95381 ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (and .cse0 (exists ((v_prenex_2 Int)) (let ((.cse18 (* 9 v_prenex_2))) (and (<= 0 .cse18) (<= (+ ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 546123) (div .cse18 10)) (< 80 v_prenex_2) (<= v_prenex_2 95434)))) .cse11 .cse10) (and .cse0 .cse4 .cse16) (and .cse0 .cse13 .cse4 .cse5 .cse10) (and .cse0 .cse14 .cse8 .cse10) (and .cse0 .cse11 .cse16) (and .cse0 .cse14 .cse6 .cse3) (and .cse0 .cse7 .cse2 .cse9 .cse15) (and .cse0 .cse13 .cse12)))) [2018-07-22 13:10:52,544 INFO L421 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-07-22 13:10:52,544 INFO L421 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-07-22 13:10:52,544 INFO L421 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-07-22 13:10:52,544 INFO L421 ceAbstractionStarter]: For program point L201(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,544 INFO L421 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-07-22 13:10:52,544 INFO L421 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-07-22 13:10:52,544 INFO L421 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-07-22 13:10:52,545 INFO L421 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-07-22 13:10:52,545 INFO L421 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-07-22 13:10:52,545 INFO L421 ceAbstractionStarter]: For program point L21'(lines 20 872) no Hoare annotation was computed. [2018-07-22 13:10:52,545 INFO L421 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-07-22 13:10:52,545 INFO L421 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-07-22 13:10:52,545 INFO L421 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-07-22 13:10:52,545 INFO L421 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-07-22 13:10:52,545 INFO L421 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-07-22 13:10:52,545 INFO L421 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-07-22 13:10:52,545 INFO L421 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-07-22 13:10:52,545 INFO L421 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-07-22 13:10:52,545 INFO L421 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-07-22 13:10:52,545 INFO L421 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-07-22 13:10:52,545 INFO L421 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-07-22 13:10:52,546 INFO L421 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-07-22 13:10:52,546 INFO L421 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-07-22 13:10:52,546 INFO L421 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-07-22 13:10:52,546 INFO L421 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-07-22 13:10:52,546 INFO L421 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-07-22 13:10:52,546 INFO L421 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-07-22 13:10:52,546 INFO L421 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-07-22 13:10:52,546 INFO L421 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-07-22 13:10:52,546 INFO L421 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-07-22 13:10:52,546 INFO L421 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-07-22 13:10:52,546 INFO L421 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-07-22 13:10:52,546 INFO L421 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-07-22 13:10:52,546 INFO L421 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-07-22 13:10:52,546 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-07-22 13:10:52,546 INFO L421 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-07-22 13:10:52,546 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-07-22 13:10:52,546 INFO L421 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-07-22 13:10:52,546 INFO L421 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-07-22 13:10:52,547 INFO L421 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-07-22 13:10:52,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,572 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,573 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,573 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,573 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,593 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,593 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,593 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,594 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,598 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,598 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,598 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,598 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 01:10:52 BoogieIcfgContainer [2018-07-22 13:10:52,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-22 13:10:52,608 INFO L168 Benchmark]: Toolchain (without parser) took 74502.68 ms. Allocated memory was 308.3 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 249.7 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-07-22 13:10:52,609 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 308.3 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-07-22 13:10:52,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 871.66 ms. Allocated memory is still 308.3 MB. Free memory was 248.7 MB in the beginning and 205.9 MB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 5.3 GB. [2018-07-22 13:10:52,610 INFO L168 Benchmark]: Boogie Procedure Inliner took 158.94 ms. Allocated memory is still 308.3 MB. Free memory was 205.9 MB in the beginning and 195.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-07-22 13:10:52,611 INFO L168 Benchmark]: Boogie Preprocessor took 189.12 ms. Allocated memory was 308.3 MB in the beginning and 348.1 MB in the end (delta: 39.8 MB). Free memory was 195.9 MB in the beginning and 303.1 MB in the end (delta: -107.1 MB). Peak memory consumption was 29.3 MB. Max. memory is 5.3 GB. [2018-07-22 13:10:52,612 INFO L168 Benchmark]: RCFGBuilder took 3803.61 ms. Allocated memory was 348.1 MB in the beginning and 447.7 MB in the end (delta: 99.6 MB). Free memory was 303.1 MB in the beginning and 280.1 MB in the end (delta: 23.0 MB). Peak memory consumption was 138.8 MB. Max. memory is 5.3 GB. [2018-07-22 13:10:52,612 INFO L168 Benchmark]: TraceAbstraction took 69469.12 ms. Allocated memory was 447.7 MB in the beginning and 2.2 GB in the end (delta: 1.7 GB). Free memory was 280.1 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-07-22 13:10:52,618 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 308.3 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 871.66 ms. Allocated memory is still 308.3 MB. Free memory was 248.7 MB in the beginning and 205.9 MB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 5.3 GB. * Boogie Procedure Inliner took 158.94 ms. Allocated memory is still 308.3 MB. Free memory was 205.9 MB in the beginning and 195.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 189.12 ms. Allocated memory was 308.3 MB in the beginning and 348.1 MB in the end (delta: 39.8 MB). Free memory was 195.9 MB in the beginning and 303.1 MB in the end (delta: -107.1 MB). Peak memory consumption was 29.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 3803.61 ms. Allocated memory was 348.1 MB in the beginning and 447.7 MB in the end (delta: 99.6 MB). Free memory was 303.1 MB in the beginning and 280.1 MB in the end (delta: 23.0 MB). Peak memory consumption was 138.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 69469.12 ms. Allocated memory was 447.7 MB in the beginning and 2.2 GB in the end (delta: 1.7 GB). Free memory was 280.1 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 20]: Loop Invariant [2018-07-22 13:10:52,631 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,631 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,631 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,631 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 11) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 526767 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8)) || ((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 72) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7)) && 19 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 73282) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 80 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 6)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 80 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10)) || (((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 72) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && 19 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 49 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 72) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8) && 19 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 80) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9)) || ((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 11) && (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7))) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 95434) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 95434) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6) && 95381 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && (\exists v_prenex_2 : int :: ((0 <= 9 * v_prenex_2 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 546123 <= 9 * v_prenex_2 / 10) && 80 < v_prenex_2) && v_prenex_2 <= 95434)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 11) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 11) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 80 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 80 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 72) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && 19 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6) - InvariantResult [Line: 880]: Loop Invariant [2018-07-22 13:10:52,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,643 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,644 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,644 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-07-22 13:10:52,644 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 11) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 526767 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8)) || ((((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 72) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7)) && 19 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 73282) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 80 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 6)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 80 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10)) || (((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 72) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && 19 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 49 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 72) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8) && 19 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 80) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9)) || ((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 11) && (__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7))) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 95434) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 95434) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6) && 95381 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && (\exists v_prenex_2 : int :: ((0 <= 9 * v_prenex_2 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 546123 <= 9 * v_prenex_2 / 10) && 80 < v_prenex_2) && v_prenex_2 <= 95434)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 11) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 11) && 0 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 43) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 80 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 80 < __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 72) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8) && 19 <= __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9)) || ((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 6) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 246 locations, 1 error locations. SAFE Result, 69.3s OverallTime, 15 OverallIterations, 15 TraceHistogramMax, 34.0s AutomataDifference, 0.0s DeadEndRemovalTime, 3.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 2421 SDtfs, 8238 SDslu, 1988 SDs, 0 SdLazy, 27009 SolverSat, 3200 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2554 GetRequests, 2481 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11879occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 2605 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 133 NumberOfFragments, 739 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5040 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2768 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 21.6s InterpolantComputationTime, 14293 NumberOfCodeBlocks, 14293 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 14275 ConstructedInterpolants, 18 QuantifiedInterpolants, 36969425 SizeOfPredicates, 9 NumberOfNonLiveVariables, 3019 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 50252/51184 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Problem14_label55_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-22_13-10-52-658.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Problem14_label55_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-22_13-10-52-658.csv Received shutdown request...