java -Xmx8000000000 -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 csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label19_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 02:58:27,335 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 02:58:27,337 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 02:58:27,356 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 02:58:27,356 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 02:58:27,357 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 02:58:27,358 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 02:58:27,361 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 02:58:27,363 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 02:58:27,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 02:58:27,368 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 02:58:27,369 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 02:58:27,370 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 02:58:27,370 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 02:58:27,372 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 02:58:27,375 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 02:58:27,376 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 02:58:27,384 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 02:58:27,386 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 02:58:27,391 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 02:58:27,392 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 02:58:27,393 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 02:58:27,395 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 02:58:27,395 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 02:58:27,395 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 02:58:27,396 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 02:58:27,397 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 02:58:27,398 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 02:58:27,398 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 02:58:27,399 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 02:58:27,400 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 02:58:27,400 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 02:58:27,401 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 02:58:27,401 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 02:58:27,402 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 02:58:27,402 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 02:58:27,403 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-24 02:58:27,427 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 02:58:27,427 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 02:58:27,428 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 02:58:27,429 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-24 02:58:27,430 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-24 02:58:27,430 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-24 02:58:27,430 INFO L133 SettingsManager]: * Use SBE=true [2018-07-24 02:58:27,430 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 02:58:27,431 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 02:58:27,431 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 02:58:27,431 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 02:58:27,431 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 02:58:27,431 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 02:58:27,432 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 02:58:27,432 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 02:58:27,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 02:58:27,433 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 02:58:27,433 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 02:58:27,434 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 02:58:27,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 02:58:27,434 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 02:58:27,434 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 02:58:27,434 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 02:58:27,435 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-24 02:58:27,435 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 02:58:27,435 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 02:58:27,435 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 02:58:27,436 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 02:58:27,496 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 02:58:27,512 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 02:58:27,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 02:58:27,520 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 02:58:27,520 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 02:58:27,521 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label19_true-unreach-call_false-termination.c [2018-07-24 02:58:27,871 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebf5a5f8/5195535c4ba74db19d6a58be343a0a4e/FLAG876014663 [2018-07-24 02:58:28,168 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 02:58:28,170 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label19_true-unreach-call_false-termination.c [2018-07-24 02:58:28,190 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebf5a5f8/5195535c4ba74db19d6a58be343a0a4e/FLAG876014663 [2018-07-24 02:58:28,205 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebf5a5f8/5195535c4ba74db19d6a58be343a0a4e [2018-07-24 02:58:28,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 02:58:28,218 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 02:58:28,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 02:58:28,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 02:58:28,226 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 02:58:28,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 02:58:28" (1/1) ... [2018-07-24 02:58:28,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ede2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:28, skipping insertion in model container [2018-07-24 02:58:28,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 02:58:28" (1/1) ... [2018-07-24 02:58:28,463 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 02:58:28,791 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 02:58:28,812 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 02:58:28,954 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 02:58:29,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:29 WrapperNode [2018-07-24 02:58:29,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 02:58:29,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 02:58:29,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 02:58:29,012 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 02:58:29,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:29" (1/1) ... [2018-07-24 02:58:29,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:29" (1/1) ... [2018-07-24 02:58:29,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 02:58:29,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 02:58:29,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 02:58:29,158 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 02:58:29,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:29" (1/1) ... [2018-07-24 02:58:29,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:29" (1/1) ... [2018-07-24 02:58:29,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:29" (1/1) ... [2018-07-24 02:58:29,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:29" (1/1) ... [2018-07-24 02:58:29,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:29" (1/1) ... [2018-07-24 02:58:29,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:29" (1/1) ... [2018-07-24 02:58:29,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:29" (1/1) ... [2018-07-24 02:58:29,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 02:58:29,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 02:58:29,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 02:58:29,434 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 02:58:29,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 02:58:29,501 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-24 02:58:29,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 02:58:29,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 02:58:33,286 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 02:58:33,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 02:58:33 BoogieIcfgContainer [2018-07-24 02:58:33,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 02:58:33,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 02:58:33,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 02:58:33,292 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 02:58:33,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 02:58:28" (1/3) ... [2018-07-24 02:58:33,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cef9d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 02:58:33, skipping insertion in model container [2018-07-24 02:58:33,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 02:58:29" (2/3) ... [2018-07-24 02:58:33,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cef9d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 02:58:33, skipping insertion in model container [2018-07-24 02:58:33,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 02:58:33" (3/3) ... [2018-07-24 02:58:33,296 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label19_true-unreach-call_false-termination.c [2018-07-24 02:58:33,306 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 02:58:33,316 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 02:58:33,373 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 02:58:33,374 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 02:58:33,375 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 02:58:33,375 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 02:58:33,375 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 02:58:33,375 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 02:58:33,375 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 02:58:33,376 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 02:58:33,376 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 02:58:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2018-07-24 02:58:33,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-24 02:58:33,410 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:58:33,411 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:58:33,412 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:58:33,417 INFO L82 PathProgramCache]: Analyzing trace with hash 265969354, now seen corresponding path program 1 times [2018-07-24 02:58:33,419 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:58:33,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:58:33,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:58:33,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:58:33,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:58:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:58:33,872 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-24 02:58:33,875 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:58:33,875 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 02:58:33,881 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:58:33,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:58:33,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:58:33,899 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 4 states. [2018-07-24 02:58:37,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:58:37,049 INFO L93 Difference]: Finished difference Result 854 states and 1562 transitions. [2018-07-24 02:58:37,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:58:37,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-07-24 02:58:37,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:58:37,076 INFO L225 Difference]: With dead ends: 854 [2018-07-24 02:58:37,076 INFO L226 Difference]: Without dead ends: 601 [2018-07-24 02:58:37,081 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:58:37,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-07-24 02:58:37,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2018-07-24 02:58:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-07-24 02:58:37,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 997 transitions. [2018-07-24 02:58:37,175 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 997 transitions. Word has length 63 [2018-07-24 02:58:37,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:58:37,176 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 997 transitions. [2018-07-24 02:58:37,176 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:58:37,176 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 997 transitions. [2018-07-24 02:58:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-24 02:58:37,187 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:58:37,187 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:58:37,187 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:58:37,188 INFO L82 PathProgramCache]: Analyzing trace with hash -168766405, now seen corresponding path program 1 times [2018-07-24 02:58:37,188 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:58:37,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:58:37,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:58:37,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:58:37,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:58:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:58:37,447 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 02:58:37,448 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:58:37,448 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 02:58:37,450 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:58:37,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:58:37,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:58:37,451 INFO L87 Difference]: Start difference. First operand 601 states and 997 transitions. Second operand 4 states. [2018-07-24 02:58:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:58:40,602 INFO L93 Difference]: Finished difference Result 2274 states and 3860 transitions. [2018-07-24 02:58:40,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:58:40,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2018-07-24 02:58:40,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:58:40,613 INFO L225 Difference]: With dead ends: 2274 [2018-07-24 02:58:40,613 INFO L226 Difference]: Without dead ends: 1675 [2018-07-24 02:58:40,621 INFO L573 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-24 02:58:40,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2018-07-24 02:58:40,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1675. [2018-07-24 02:58:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1675 states. [2018-07-24 02:58:40,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2493 transitions. [2018-07-24 02:58:40,695 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2493 transitions. Word has length 130 [2018-07-24 02:58:40,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:58:40,696 INFO L471 AbstractCegarLoop]: Abstraction has 1675 states and 2493 transitions. [2018-07-24 02:58:40,696 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:58:40,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2493 transitions. [2018-07-24 02:58:40,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-24 02:58:40,708 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:58:40,709 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:58:40,709 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:58:40,709 INFO L82 PathProgramCache]: Analyzing trace with hash -179099360, now seen corresponding path program 1 times [2018-07-24 02:58:40,709 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:58:40,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:58:40,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:58:40,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:58:40,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:58:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:58:40,974 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 02:58:40,975 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:58:40,975 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 02:58:40,975 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:58:40,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:58:40,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:58:40,976 INFO L87 Difference]: Start difference. First operand 1675 states and 2493 transitions. Second operand 4 states. [2018-07-24 02:58:43,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:58:43,426 INFO L93 Difference]: Finished difference Result 5513 states and 8130 transitions. [2018-07-24 02:58:43,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:58:43,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2018-07-24 02:58:43,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:58:43,447 INFO L225 Difference]: With dead ends: 5513 [2018-07-24 02:58:43,448 INFO L226 Difference]: Without dead ends: 3840 [2018-07-24 02:58:43,452 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:58:43,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3840 states. [2018-07-24 02:58:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3840 to 3838. [2018-07-24 02:58:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3838 states. [2018-07-24 02:58:43,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3838 states to 3838 states and 5092 transitions. [2018-07-24 02:58:43,531 INFO L78 Accepts]: Start accepts. Automaton has 3838 states and 5092 transitions. Word has length 132 [2018-07-24 02:58:43,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:58:43,532 INFO L471 AbstractCegarLoop]: Abstraction has 3838 states and 5092 transitions. [2018-07-24 02:58:43,532 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:58:43,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3838 states and 5092 transitions. [2018-07-24 02:58:43,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-24 02:58:43,534 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:58:43,535 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 02:58:43,535 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:58:43,535 INFO L82 PathProgramCache]: Analyzing trace with hash 45957758, now seen corresponding path program 1 times [2018-07-24 02:58:43,535 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:58:43,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:58:43,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:58:43,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:58:43,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:58:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:58:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 55 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 02:58:43,942 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 02:58:43,942 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 02:58:43,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:58:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:58:44,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 02:58:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 02:58:44,230 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 02:58:44,230 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-07-24 02:58:44,231 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 02:58:44,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 02:58:44,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 02:58:44,232 INFO L87 Difference]: Start difference. First operand 3838 states and 5092 transitions. Second operand 6 states. [2018-07-24 02:58:50,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:58:50,889 INFO L93 Difference]: Finished difference Result 11261 states and 14846 transitions. [2018-07-24 02:58:50,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-24 02:58:50,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2018-07-24 02:58:50,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:58:50,913 INFO L225 Difference]: With dead ends: 11261 [2018-07-24 02:58:50,913 INFO L226 Difference]: Without dead ends: 5617 [2018-07-24 02:58:50,920 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-07-24 02:58:50,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5617 states. [2018-07-24 02:58:50,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5617 to 4710. [2018-07-24 02:58:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4710 states. [2018-07-24 02:58:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4710 states to 4710 states and 5364 transitions. [2018-07-24 02:58:51,000 INFO L78 Accepts]: Start accepts. Automaton has 4710 states and 5364 transitions. Word has length 144 [2018-07-24 02:58:51,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:58:51,001 INFO L471 AbstractCegarLoop]: Abstraction has 4710 states and 5364 transitions. [2018-07-24 02:58:51,001 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 02:58:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 4710 states and 5364 transitions. [2018-07-24 02:58:51,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-07-24 02:58:51,014 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:58:51,014 INFO L353 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, 5, 5, 5, 5, 5, 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, 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-24 02:58:51,015 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:58:51,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1152570629, now seen corresponding path program 1 times [2018-07-24 02:58:51,015 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:58:51,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:58:51,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:58:51,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:58:51,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:58:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:58:51,612 WARN L169 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-07-24 02:58:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 503 proven. 46 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-07-24 02:58:52,028 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 02:58:52,028 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 02:58:52,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:58:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:58:52,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 02:58:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2018-07-24 02:58:52,416 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 02:58:52,416 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-07-24 02:58:52,417 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-24 02:58:52,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-24 02:58:52,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-07-24 02:58:52,418 INFO L87 Difference]: Start difference. First operand 4710 states and 5364 transitions. Second operand 8 states. [2018-07-24 02:58:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:58:56,455 INFO L93 Difference]: Finished difference Result 10958 states and 12514 transitions. [2018-07-24 02:58:56,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-24 02:58:56,456 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 462 [2018-07-24 02:58:56,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:58:56,480 INFO L225 Difference]: With dead ends: 10958 [2018-07-24 02:58:56,481 INFO L226 Difference]: Without dead ends: 6429 [2018-07-24 02:58:56,486 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-07-24 02:58:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6429 states. [2018-07-24 02:58:56,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6429 to 6142. [2018-07-24 02:58:56,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6142 states. [2018-07-24 02:58:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6142 states to 6142 states and 6865 transitions. [2018-07-24 02:58:56,593 INFO L78 Accepts]: Start accepts. Automaton has 6142 states and 6865 transitions. Word has length 462 [2018-07-24 02:58:56,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:58:56,594 INFO L471 AbstractCegarLoop]: Abstraction has 6142 states and 6865 transitions. [2018-07-24 02:58:56,594 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-24 02:58:56,595 INFO L276 IsEmpty]: Start isEmpty. Operand 6142 states and 6865 transitions. [2018-07-24 02:58:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2018-07-24 02:58:56,614 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:58:56,615 INFO L353 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, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:58:56,615 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:58:56,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1843167295, now seen corresponding path program 1 times [2018-07-24 02:58:56,616 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:58:56,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:58:56,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:58:56,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:58:56,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:58:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:58:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1635 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2018-07-24 02:58:57,576 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:58:57,576 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 02:58:57,577 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-24 02:58:57,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-24 02:58:57,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-24 02:58:57,578 INFO L87 Difference]: Start difference. First operand 6142 states and 6865 transitions. Second operand 7 states. [2018-07-24 02:58:59,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:58:59,276 INFO L93 Difference]: Finished difference Result 12345 states and 13810 transitions. [2018-07-24 02:58:59,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 02:58:59,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 640 [2018-07-24 02:58:59,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:58:59,295 INFO L225 Difference]: With dead ends: 12345 [2018-07-24 02:58:59,295 INFO L226 Difference]: Without dead ends: 5781 [2018-07-24 02:58:59,299 INFO L573 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-24 02:58:59,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5781 states. [2018-07-24 02:58:59,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5781 to 5781. [2018-07-24 02:58:59,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5781 states. [2018-07-24 02:58:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5781 states to 5781 states and 6397 transitions. [2018-07-24 02:58:59,396 INFO L78 Accepts]: Start accepts. Automaton has 5781 states and 6397 transitions. Word has length 640 [2018-07-24 02:58:59,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:58:59,397 INFO L471 AbstractCegarLoop]: Abstraction has 5781 states and 6397 transitions. [2018-07-24 02:58:59,397 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-24 02:58:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 5781 states and 6397 transitions. [2018-07-24 02:58:59,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 768 [2018-07-24 02:58:59,423 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:58:59,424 INFO L353 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, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:58:59,424 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:58:59,425 INFO L82 PathProgramCache]: Analyzing trace with hash -975096003, now seen corresponding path program 1 times [2018-07-24 02:58:59,425 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:58:59,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:58:59,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:58:59,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:58:59,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:58:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:00,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1818 backedges. 1179 proven. 330 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2018-07-24 02:59:00,956 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 02:59:00,956 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 02:59:00,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:01,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 02:59:02,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1818 backedges. 1215 proven. 93 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-07-24 02:59:02,049 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 02:59:02,049 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 10 [2018-07-24 02:59:02,051 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-24 02:59:02,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-24 02:59:02,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-07-24 02:59:02,052 INFO L87 Difference]: Start difference. First operand 5781 states and 6397 transitions. Second operand 11 states. [2018-07-24 02:59:05,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:05,049 INFO L93 Difference]: Finished difference Result 11993 states and 13298 transitions. [2018-07-24 02:59:05,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-24 02:59:05,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 767 [2018-07-24 02:59:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:05,077 INFO L225 Difference]: With dead ends: 11993 [2018-07-24 02:59:05,078 INFO L226 Difference]: Without dead ends: 6393 [2018-07-24 02:59:05,083 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 766 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-07-24 02:59:05,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6393 states. [2018-07-24 02:59:05,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6393 to 6317. [2018-07-24 02:59:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6317 states. [2018-07-24 02:59:05,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6317 states to 6317 states and 6943 transitions. [2018-07-24 02:59:05,171 INFO L78 Accepts]: Start accepts. Automaton has 6317 states and 6943 transitions. Word has length 767 [2018-07-24 02:59:05,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:05,172 INFO L471 AbstractCegarLoop]: Abstraction has 6317 states and 6943 transitions. [2018-07-24 02:59:05,172 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-24 02:59:05,172 INFO L276 IsEmpty]: Start isEmpty. Operand 6317 states and 6943 transitions. [2018-07-24 02:59:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2018-07-24 02:59:05,182 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:05,183 INFO L353 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, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-07-24 02:59:05,183 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:05,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1786571172, now seen corresponding path program 1 times [2018-07-24 02:59:05,184 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:05,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:05,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:05,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:05,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1844 backedges. 1310 proven. 156 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-07-24 02:59:06,005 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 02:59:06,005 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 02:59:06,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:06,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 02:59:06,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1844 backedges. 719 proven. 0 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2018-07-24 02:59:06,631 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 02:59:06,632 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-07-24 02:59:06,633 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 02:59:06,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 02:59:06,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-24 02:59:06,633 INFO L87 Difference]: Start difference. First operand 6317 states and 6943 transitions. Second operand 6 states. [2018-07-24 02:59:09,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:09,187 INFO L93 Difference]: Finished difference Result 18731 states and 20888 transitions. [2018-07-24 02:59:09,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-24 02:59:09,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 793 [2018-07-24 02:59:09,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:09,212 INFO L225 Difference]: With dead ends: 18731 [2018-07-24 02:59:09,212 INFO L226 Difference]: Without dead ends: 11875 [2018-07-24 02:59:09,220 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 797 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-07-24 02:59:09,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11875 states. [2018-07-24 02:59:09,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11875 to 10252. [2018-07-24 02:59:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10252 states. [2018-07-24 02:59:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10252 states to 10252 states and 11071 transitions. [2018-07-24 02:59:09,366 INFO L78 Accepts]: Start accepts. Automaton has 10252 states and 11071 transitions. Word has length 793 [2018-07-24 02:59:09,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:09,367 INFO L471 AbstractCegarLoop]: Abstraction has 10252 states and 11071 transitions. [2018-07-24 02:59:09,367 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 02:59:09,367 INFO L276 IsEmpty]: Start isEmpty. Operand 10252 states and 11071 transitions. [2018-07-24 02:59:09,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 922 [2018-07-24 02:59:09,385 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:09,385 INFO L353 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, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:59:09,386 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:09,386 INFO L82 PathProgramCache]: Analyzing trace with hash -500707500, now seen corresponding path program 1 times [2018-07-24 02:59:09,386 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:09,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:09,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:09,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:09,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:10,294 WARN L169 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-07-24 02:59:10,554 WARN L169 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-07-24 02:59:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 1779 proven. 0 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2018-07-24 02:59:11,684 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:59:11,684 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 02:59:11,685 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 02:59:11,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 02:59:11,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-07-24 02:59:11,685 INFO L87 Difference]: Start difference. First operand 10252 states and 11071 transitions. Second operand 6 states. [2018-07-24 02:59:13,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:13,831 INFO L93 Difference]: Finished difference Result 20590 states and 22229 transitions. [2018-07-24 02:59:13,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 02:59:13,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 921 [2018-07-24 02:59:13,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:13,851 INFO L225 Difference]: With dead ends: 20590 [2018-07-24 02:59:13,851 INFO L226 Difference]: Without dead ends: 10519 [2018-07-24 02:59:13,861 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-07-24 02:59:13,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10519 states. [2018-07-24 02:59:13,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10519 to 10252. [2018-07-24 02:59:13,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10252 states. [2018-07-24 02:59:13,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10252 states to 10252 states and 11060 transitions. [2018-07-24 02:59:13,992 INFO L78 Accepts]: Start accepts. Automaton has 10252 states and 11060 transitions. Word has length 921 [2018-07-24 02:59:13,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:13,993 INFO L471 AbstractCegarLoop]: Abstraction has 10252 states and 11060 transitions. [2018-07-24 02:59:13,993 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 02:59:13,994 INFO L276 IsEmpty]: Start isEmpty. Operand 10252 states and 11060 transitions. [2018-07-24 02:59:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1039 [2018-07-24 02:59:14,010 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:14,011 INFO L353 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, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 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, 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, 1] [2018-07-24 02:59:14,011 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:14,012 INFO L82 PathProgramCache]: Analyzing trace with hash 585448616, now seen corresponding path program 1 times [2018-07-24 02:59:14,012 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:14,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:14,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:14,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:14,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:14,763 WARN L169 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-07-24 02:59:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1115 proven. 0 refuted. 0 times theorem prover too weak. 2497 trivial. 0 not checked. [2018-07-24 02:59:15,527 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:59:15,528 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 02:59:15,529 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 02:59:15,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 02:59:15,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 02:59:15,529 INFO L87 Difference]: Start difference. First operand 10252 states and 11060 transitions. Second operand 4 states. [2018-07-24 02:59:17,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:17,255 INFO L93 Difference]: Finished difference Result 21039 states and 22788 transitions. [2018-07-24 02:59:17,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 02:59:17,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1038 [2018-07-24 02:59:17,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:17,278 INFO L225 Difference]: With dead ends: 21039 [2018-07-24 02:59:17,278 INFO L226 Difference]: Without dead ends: 10249 [2018-07-24 02:59:17,289 INFO L573 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-24 02:59:17,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10249 states. [2018-07-24 02:59:17,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10249 to 10249. [2018-07-24 02:59:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10249 states. [2018-07-24 02:59:17,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 10885 transitions. [2018-07-24 02:59:17,420 INFO L78 Accepts]: Start accepts. Automaton has 10249 states and 10885 transitions. Word has length 1038 [2018-07-24 02:59:17,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:17,422 INFO L471 AbstractCegarLoop]: Abstraction has 10249 states and 10885 transitions. [2018-07-24 02:59:17,422 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 02:59:17,422 INFO L276 IsEmpty]: Start isEmpty. Operand 10249 states and 10885 transitions. [2018-07-24 02:59:17,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1087 [2018-07-24 02:59:17,452 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:17,453 INFO L353 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, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:59:17,453 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:17,453 INFO L82 PathProgramCache]: Analyzing trace with hash -257408720, now seen corresponding path program 1 times [2018-07-24 02:59:17,453 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:17,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:17,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:17,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:17,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3809 backedges. 2430 proven. 0 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2018-07-24 02:59:18,966 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 02:59:18,966 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 02:59:18,967 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 02:59:18,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 02:59:18,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 02:59:18,967 INFO L87 Difference]: Start difference. First operand 10249 states and 10885 transitions. Second operand 5 states. [2018-07-24 02:59:20,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:20,832 INFO L93 Difference]: Finished difference Result 22295 states and 23651 transitions. [2018-07-24 02:59:20,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 02:59:20,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1086 [2018-07-24 02:59:20,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:20,852 INFO L225 Difference]: With dead ends: 22295 [2018-07-24 02:59:20,853 INFO L226 Difference]: Without dead ends: 12227 [2018-07-24 02:59:20,862 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 02:59:20,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12227 states. [2018-07-24 02:59:20,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12227 to 11328. [2018-07-24 02:59:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11328 states. [2018-07-24 02:59:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11328 states to 11328 states and 12012 transitions. [2018-07-24 02:59:20,999 INFO L78 Accepts]: Start accepts. Automaton has 11328 states and 12012 transitions. Word has length 1086 [2018-07-24 02:59:21,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:21,000 INFO L471 AbstractCegarLoop]: Abstraction has 11328 states and 12012 transitions. [2018-07-24 02:59:21,000 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 02:59:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 11328 states and 12012 transitions. [2018-07-24 02:59:21,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1088 [2018-07-24 02:59:21,021 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:21,021 INFO L353 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, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:59:21,022 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:21,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1459211883, now seen corresponding path program 1 times [2018-07-24 02:59:21,022 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:21,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:21,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:21,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:21,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:23,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3458 backedges. 1817 proven. 323 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2018-07-24 02:59:23,230 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 02:59:23,230 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 02:59:23,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:23,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 02:59:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3458 backedges. 2133 proven. 7 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2018-07-24 02:59:25,756 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 02:59:25,756 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-07-24 02:59:25,758 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-24 02:59:25,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-24 02:59:25,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-07-24 02:59:25,758 INFO L87 Difference]: Start difference. First operand 11328 states and 12012 transitions. Second operand 8 states. [2018-07-24 02:59:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:28,886 INFO L93 Difference]: Finished difference Result 28668 states and 30313 transitions. [2018-07-24 02:59:28,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-24 02:59:28,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1087 [2018-07-24 02:59:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:28,907 INFO L225 Difference]: With dead ends: 28668 [2018-07-24 02:59:28,907 INFO L226 Difference]: Without dead ends: 17217 [2018-07-24 02:59:28,915 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1096 GetRequests, 1086 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-07-24 02:59:28,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17217 states. [2018-07-24 02:59:29,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17217 to 12875. [2018-07-24 02:59:29,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12875 states. [2018-07-24 02:59:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12875 states to 12875 states and 13635 transitions. [2018-07-24 02:59:29,089 INFO L78 Accepts]: Start accepts. Automaton has 12875 states and 13635 transitions. Word has length 1087 [2018-07-24 02:59:29,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:29,090 INFO L471 AbstractCegarLoop]: Abstraction has 12875 states and 13635 transitions. [2018-07-24 02:59:29,090 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-24 02:59:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 12875 states and 13635 transitions. [2018-07-24 02:59:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1498 [2018-07-24 02:59:29,113 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 02:59:29,114 INFO L353 BasicCegarLoop]: trace histogram [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, 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, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 02:59:29,114 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 02:59:29,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1325061522, now seen corresponding path program 1 times [2018-07-24 02:59:29,115 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 02:59:29,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 02:59:29,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:29,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:29,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 02:59:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:31,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6544 backedges. 1862 proven. 61 refuted. 0 times theorem prover too weak. 4621 trivial. 0 not checked. [2018-07-24 02:59:31,058 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 02:59:31,058 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 02:59:31,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 02:59:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 02:59:31,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 02:59:42,566 WARN L169 SmtUtils]: Spent 10.34 s on a formula simplification. DAG size of input: 655 DAG size of output: 35 [2018-07-24 02:59:44,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6544 backedges. 1897 proven. 26 refuted. 0 times theorem prover too weak. 4621 trivial. 0 not checked. [2018-07-24 02:59:44,771 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 02:59:44,771 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-07-24 02:59:44,772 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-24 02:59:44,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-24 02:59:44,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-07-24 02:59:44,773 INFO L87 Difference]: Start difference. First operand 12875 states and 13635 transitions. Second operand 8 states. [2018-07-24 02:59:49,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 02:59:49,528 INFO L93 Difference]: Finished difference Result 25499 states and 27037 transitions. [2018-07-24 02:59:49,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 02:59:49,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1497 [2018-07-24 02:59:49,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 02:59:49,531 INFO L225 Difference]: With dead ends: 25499 [2018-07-24 02:59:49,531 INFO L226 Difference]: Without dead ends: 0 [2018-07-24 02:59:49,542 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1506 GetRequests, 1497 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-07-24 02:59:49,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-24 02:59:49,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-24 02:59:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-24 02:59:49,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-24 02:59:49,543 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1497 [2018-07-24 02:59:49,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 02:59:49,544 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-24 02:59:49,544 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-24 02:59:49,544 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-24 02:59:49,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-24 02:59:49,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-24 02:59:49,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:49,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:49,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:49,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:49,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:49,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:49,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:49,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:49,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,450 WARN L169 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 601 DAG size of output: 335 [2018-07-24 02:59:50,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:50,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 02:59:51,267 WARN L169 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 607 DAG size of output: 337 [2018-07-24 02:59:55,527 WARN L169 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 279 DAG size of output: 74 [2018-07-24 02:59:57,548 WARN L169 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 279 DAG size of output: 74 [2018-07-24 02:59:57,552 INFO L421 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-07-24 02:59:57,552 INFO L421 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-07-24 02:59:57,552 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-24 02:59:57,552 INFO L421 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-07-24 02:59:57,552 INFO L421 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-07-24 02:59:57,552 INFO L421 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-07-24 02:59:57,552 INFO L421 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-07-24 02:59:57,552 INFO L421 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-07-24 02:59:57,552 INFO L421 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-07-24 02:59:57,552 INFO L421 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-07-24 02:59:57,553 INFO L421 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-07-24 02:59:57,553 INFO L421 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-07-24 02:59:57,553 INFO L421 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-07-24 02:59:57,553 INFO L421 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-07-24 02:59:57,553 INFO L421 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-07-24 02:59:57,553 INFO L421 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-07-24 02:59:57,553 INFO L421 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-07-24 02:59:57,553 INFO L421 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-07-24 02:59:57,553 INFO L421 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-07-24 02:59:57,553 INFO L421 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-07-24 02:59:57,553 INFO L421 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-07-24 02:59:57,553 INFO L421 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-07-24 02:59:57,553 INFO L421 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-07-24 02:59:57,553 INFO L421 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-07-24 02:59:57,554 INFO L421 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-07-24 02:59:57,554 INFO L421 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-07-24 02:59:57,554 INFO L421 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-07-24 02:59:57,554 INFO L421 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-07-24 02:59:57,554 INFO L421 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-07-24 02:59:57,554 INFO L421 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-07-24 02:59:57,554 INFO L421 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-07-24 02:59:57,554 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-24 02:59:57,554 INFO L421 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-07-24 02:59:57,554 INFO L421 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-07-24 02:59:57,554 INFO L421 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-07-24 02:59:57,554 INFO L421 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-07-24 02:59:57,555 INFO L421 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-07-24 02:59:57,555 INFO L421 ceAbstractionStarter]: For program point L102(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,555 INFO L421 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-07-24 02:59:57,555 INFO L421 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-07-24 02:59:57,555 INFO L421 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-07-24 02:59:57,555 INFO L421 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-07-24 02:59:57,555 INFO L421 ceAbstractionStarter]: For program point L105(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,555 INFO L421 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-07-24 02:59:57,555 INFO L421 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-07-24 02:59:57,556 INFO L421 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-07-24 02:59:57,556 INFO L421 ceAbstractionStarter]: For program point L108(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,556 INFO L421 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-07-24 02:59:57,556 INFO L421 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-07-24 02:59:57,556 INFO L421 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-07-24 02:59:57,556 INFO L421 ceAbstractionStarter]: For program point L120(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,556 INFO L421 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-07-24 02:59:57,556 INFO L421 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-07-24 02:59:57,557 INFO L421 ceAbstractionStarter]: For program point L123(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,557 INFO L421 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-07-24 02:59:57,557 INFO L421 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-07-24 02:59:57,557 INFO L421 ceAbstractionStarter]: For program point L126(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,557 INFO L421 ceAbstractionStarter]: For program point L129(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,557 INFO L421 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-07-24 02:59:57,557 INFO L421 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-07-24 02:59:57,557 INFO L421 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-07-24 02:59:57,557 INFO L421 ceAbstractionStarter]: For program point L111(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,558 INFO L421 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-07-24 02:59:57,558 INFO L421 ceAbstractionStarter]: For program point L117(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,558 INFO L421 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-07-24 02:59:57,558 INFO L421 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-07-24 02:59:57,558 INFO L421 ceAbstractionStarter]: For program point L114(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,558 INFO L421 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-07-24 02:59:57,558 INFO L421 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-07-24 02:59:57,558 INFO L421 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-07-24 02:59:57,558 INFO L421 ceAbstractionStarter]: For program point L141(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,559 INFO L421 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-07-24 02:59:57,559 INFO L421 ceAbstractionStarter]: For program point L144(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,559 INFO L421 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-07-24 02:59:57,559 INFO L421 ceAbstractionStarter]: For program point L147(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,559 INFO L421 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-07-24 02:59:57,559 INFO L421 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-07-24 02:59:57,559 INFO L421 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-07-24 02:59:57,559 INFO L421 ceAbstractionStarter]: For program point L135(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,559 INFO L421 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-07-24 02:59:57,560 INFO L421 ceAbstractionStarter]: For program point L132(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,560 INFO L421 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-07-24 02:59:57,560 INFO L421 ceAbstractionStarter]: For program point L138(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,560 INFO L421 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-07-24 02:59:57,560 INFO L421 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-07-24 02:59:57,560 INFO L421 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-07-24 02:59:57,560 INFO L421 ceAbstractionStarter]: For program point L162(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,560 INFO L421 ceAbstractionStarter]: For program point L168(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,560 INFO L421 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-07-24 02:59:57,561 INFO L421 ceAbstractionStarter]: For program point L165(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,561 INFO L421 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-07-24 02:59:57,561 INFO L421 ceAbstractionStarter]: For program point L171(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,561 INFO L421 ceAbstractionStarter]: For program point L153(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,561 INFO L421 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-07-24 02:59:57,561 INFO L421 ceAbstractionStarter]: For program point L150(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,561 INFO L421 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-07-24 02:59:57,561 INFO L421 ceAbstractionStarter]: For program point L156(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,561 INFO L421 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-07-24 02:59:57,562 INFO L421 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-07-24 02:59:57,562 INFO L421 ceAbstractionStarter]: For program point L159(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,562 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-24 02:59:57,562 INFO L421 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-07-24 02:59:57,562 INFO L421 ceAbstractionStarter]: For program point L186(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,562 INFO L421 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-07-24 02:59:57,562 INFO L421 ceAbstractionStarter]: For program point L183(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,562 INFO L421 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-07-24 02:59:57,562 INFO L421 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-07-24 02:59:57,563 INFO L421 ceAbstractionStarter]: For program point L192(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,563 INFO L421 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-07-24 02:59:57,563 INFO L421 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-07-24 02:59:57,563 INFO L421 ceAbstractionStarter]: For program point L174(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,563 INFO L421 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-07-24 02:59:57,563 INFO L421 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-07-24 02:59:57,563 INFO L421 ceAbstractionStarter]: For program point L177(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,563 INFO L421 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-07-24 02:59:57,563 INFO L421 ceAbstractionStarter]: For program point L180(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,563 INFO L421 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-07-24 02:59:57,564 INFO L421 ceAbstractionStarter]: For program point L195(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,564 INFO L421 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-07-24 02:59:57,564 INFO L421 ceAbstractionStarter]: For program point L198(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,564 INFO L421 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-07-24 02:59:57,564 INFO L421 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-07-24 02:59:57,564 INFO L421 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-07-24 02:59:57,564 INFO L421 ceAbstractionStarter]: For program point L24(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,564 INFO L421 ceAbstractionStarter]: For program point L27(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,564 INFO L421 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-07-24 02:59:57,565 INFO L421 ceAbstractionStarter]: For program point L30(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,565 INFO L421 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-07-24 02:59:57,565 INFO L421 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-07-24 02:59:57,565 INFO L421 ceAbstractionStarter]: For program point L33(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,565 INFO L421 ceAbstractionStarter]: For program point L36(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,565 INFO L421 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-07-24 02:59:57,565 INFO L421 ceAbstractionStarter]: For program point L39(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,565 INFO L421 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-07-24 02:59:57,565 INFO L421 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-07-24 02:59:57,565 INFO L421 ceAbstractionStarter]: For program point L42(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,566 INFO L421 ceAbstractionStarter]: For program point L45(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,566 INFO L421 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-07-24 02:59:57,566 INFO L421 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-07-24 02:59:57,566 INFO L421 ceAbstractionStarter]: For program point L48(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,566 INFO L421 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-07-24 02:59:57,566 INFO L421 ceAbstractionStarter]: For program point L51(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,566 INFO L421 ceAbstractionStarter]: For program point L54(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,566 INFO L421 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-07-24 02:59:57,566 INFO L421 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-07-24 02:59:57,566 INFO L421 ceAbstractionStarter]: For program point L57(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,567 INFO L421 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-07-24 02:59:57,567 INFO L421 ceAbstractionStarter]: For program point L60(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,567 INFO L421 ceAbstractionStarter]: For program point L63(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,567 INFO L421 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-07-24 02:59:57,567 INFO L421 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-07-24 02:59:57,567 INFO L421 ceAbstractionStarter]: For program point L66(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,567 INFO L421 ceAbstractionStarter]: For program point L69(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,567 INFO L421 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-07-24 02:59:57,567 INFO L421 ceAbstractionStarter]: For program point L72(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,567 INFO L421 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-07-24 02:59:57,568 INFO L421 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-07-24 02:59:57,568 INFO L421 ceAbstractionStarter]: For program point L75(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,568 INFO L421 ceAbstractionStarter]: For program point L78(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,568 INFO L421 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-07-24 02:59:57,568 INFO L421 ceAbstractionStarter]: For program point L81(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,568 INFO L421 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-07-24 02:59:57,568 INFO L421 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-07-24 02:59:57,568 INFO L421 ceAbstractionStarter]: For program point L84(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,568 INFO L421 ceAbstractionStarter]: For program point L87(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,569 INFO L421 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-07-24 02:59:57,569 INFO L421 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-07-24 02:59:57,569 INFO L421 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-07-24 02:59:57,569 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-24 02:59:57,569 INFO L421 ceAbstractionStarter]: For program point L90(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,569 INFO L421 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-07-24 02:59:57,569 INFO L421 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-07-24 02:59:57,569 INFO L421 ceAbstractionStarter]: For program point L93(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,569 INFO L421 ceAbstractionStarter]: For program point L96(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,569 INFO L421 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-07-24 02:59:57,570 INFO L421 ceAbstractionStarter]: For program point L99(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,570 INFO L421 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-07-24 02:59:57,570 INFO L421 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-07-24 02:59:57,570 INFO L421 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-07-24 02:59:57,570 INFO L421 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-07-24 02:59:57,570 INFO L421 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-07-24 02:59:57,570 INFO L421 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-07-24 02:59:57,570 INFO L421 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-07-24 02:59:57,570 INFO L421 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-07-24 02:59:57,571 INFO L421 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-07-24 02:59:57,571 INFO L421 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-07-24 02:59:57,571 INFO L421 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-07-24 02:59:57,571 INFO L421 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-07-24 02:59:57,571 INFO L421 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-07-24 02:59:57,571 INFO L421 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-07-24 02:59:57,571 INFO L421 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-07-24 02:59:57,571 INFO L421 ceAbstractionStarter]: For program point L880(lines 880 889) no Hoare annotation was computed. [2018-07-24 02:59:57,571 INFO L421 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-07-24 02:59:57,571 INFO L421 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-07-24 02:59:57,572 INFO L421 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-07-24 02:59:57,572 INFO L421 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-07-24 02:59:57,572 INFO L417 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse9 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 6))) (let ((.cse7 (not .cse9)) (.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 7)) (.cse3 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 5)) (.cse1 (<= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)) (.cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 8)) (.cse6 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 73282)) (.cse4 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 8)) (.cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0 1)) (.cse8 (< 80 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0))) (or (and .cse0 .cse1 (<= 12849 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (and .cse0 .cse2 .cse3) (and .cse4 .cse1 .cse0) (and .cse5 .cse3) (and .cse0 .cse6 .cse7 .cse3) (and .cse0 .cse7 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 11)) (and .cse0 .cse8 (and .cse1 .cse7)) (and .cse5 .cse0 .cse8) (and (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 49) 0) .cse3) (and .cse1 .cse0 .cse2) (and .cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 5) .cse9) (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 6) .cse0 (exists ((v_prenex_26 Int)) (let ((.cse11 (+ (* 10 v_prenex_26) 2779120))) (let ((.cse10 (div .cse11 9))) (and (<= (div (+ (* (- 1) .cse10) 437300) 10) ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0) (<= v_prenex_26 11) (< 0 (+ v_prenex_26 43)) (<= .cse10 437300) (<= .cse10 437299) (<= 0 .cse11))))) .cse6 .cse9) (and .cse0 (and .cse4 (< 11 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 80))) (and .cse0 .cse8 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 9))))) [2018-07-24 02:59:57,572 INFO L421 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-07-24 02:59:57,573 INFO L424 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2018-07-24 02:59:57,573 INFO L421 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-07-24 02:59:57,573 INFO L421 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-07-24 02:59:57,573 INFO L421 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-07-24 02:59:57,573 INFO L421 ceAbstractionStarter]: For program point L189'(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,573 INFO L421 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-07-24 02:59:57,573 INFO L421 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-07-24 02:59:57,573 INFO L417 ceAbstractionStarter]: At program point L880''(lines 880 889) the Hoare annotation is: (let ((.cse9 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 6))) (let ((.cse7 (not .cse9)) (.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 7)) (.cse3 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 5)) (.cse1 (<= 7 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)) (.cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 8)) (.cse6 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 73282)) (.cse4 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 8)) (.cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0 1)) (.cse8 (< 80 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0))) (or (and .cse0 .cse1 (<= 12849 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)) (and .cse0 .cse2 .cse3) (and .cse4 .cse1 .cse0) (and .cse5 .cse3) (and .cse0 .cse6 .cse7 .cse3) (and .cse0 .cse7 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 11)) (and .cse0 .cse8 (and .cse1 .cse7)) (and .cse5 .cse0 .cse8) (and (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 49) 0) .cse3) (and .cse1 .cse0 .cse2) (and .cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 5) .cse9) (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 6) .cse0 (exists ((v_prenex_26 Int)) (let ((.cse11 (+ (* 10 v_prenex_26) 2779120))) (let ((.cse10 (div .cse11 9))) (and (<= (div (+ (* (- 1) .cse10) 437300) 10) ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0) (<= v_prenex_26 11) (< 0 (+ v_prenex_26 43)) (<= .cse10 437300) (<= .cse10 437299) (<= 0 .cse11))))) .cse6 .cse9) (and .cse0 (and .cse4 (< 11 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 80))) (and .cse0 .cse8 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 9))))) [2018-07-24 02:59:57,574 INFO L421 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-07-24 02:59:57,574 INFO L421 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-07-24 02:59:57,574 INFO L421 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-07-24 02:59:57,574 INFO L421 ceAbstractionStarter]: For program point L201(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,574 INFO L421 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-07-24 02:59:57,574 INFO L421 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-07-24 02:59:57,574 INFO L421 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-07-24 02:59:57,574 INFO L421 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-07-24 02:59:57,575 INFO L421 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-07-24 02:59:57,575 INFO L421 ceAbstractionStarter]: For program point L21'(lines 20 872) no Hoare annotation was computed. [2018-07-24 02:59:57,575 INFO L421 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-07-24 02:59:57,575 INFO L421 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-07-24 02:59:57,575 INFO L421 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-07-24 02:59:57,575 INFO L421 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-07-24 02:59:57,575 INFO L421 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-07-24 02:59:57,575 INFO L421 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-07-24 02:59:57,575 INFO L421 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-07-24 02:59:57,575 INFO L421 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-07-24 02:59:57,575 INFO L421 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-07-24 02:59:57,576 INFO L421 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-07-24 02:59:57,576 INFO L421 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-07-24 02:59:57,576 INFO L421 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-07-24 02:59:57,576 INFO L421 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-07-24 02:59:57,576 INFO L421 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-07-24 02:59:57,576 INFO L421 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-07-24 02:59:57,576 INFO L421 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-07-24 02:59:57,576 INFO L421 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-07-24 02:59:57,576 INFO L421 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-07-24 02:59:57,576 INFO L421 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-07-24 02:59:57,577 INFO L421 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-07-24 02:59:57,577 INFO L421 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-07-24 02:59:57,577 INFO L421 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-07-24 02:59:57,577 INFO L421 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-07-24 02:59:57,577 INFO L421 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-07-24 02:59:57,577 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-07-24 02:59:57,577 INFO L421 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-07-24 02:59:57,577 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 190) no Hoare annotation was computed. [2018-07-24 02:59:57,577 INFO L421 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-07-24 02:59:57,577 INFO L421 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-07-24 02:59:57,578 INFO L421 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-07-24 02:59:57,584 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,585 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,585 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,585 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,586 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,586 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,601 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,601 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,601 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,602 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,602 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,602 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,605 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,605 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,605 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,606 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,606 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,606 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,608 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,609 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,609 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,609 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,609 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,610 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 02:59:57 BoogieIcfgContainer [2018-07-24 02:59:57,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 02:59:57,614 INFO L168 Benchmark]: Toolchain (without parser) took 89397.45 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 4.0 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-07-24 02:59:57,616 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 02:59:57,616 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-07-24 02:59:57,617 INFO L168 Benchmark]: Boogie Procedure Inliner took 145.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-24 02:59:57,618 INFO L168 Benchmark]: Boogie Preprocessor took 276.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 788.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -865.2 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2018-07-24 02:59:57,618 INFO L168 Benchmark]: RCFGBuilder took 3853.58 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 137.6 MB). Peak memory consumption was 137.6 MB. Max. memory is 7.1 GB. [2018-07-24 02:59:57,619 INFO L168 Benchmark]: TraceAbstraction took 84325.25 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 4.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-07-24 02:59:57,624 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 792.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 145.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 276.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 788.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -865.2 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3853.58 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 137.6 MB). Peak memory consumption was 137.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 84325.25 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 4.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 190]: 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-24 02:59:57,644 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,644 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,644 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,644 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,644 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,645 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,648 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,648 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,648 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,650 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,650 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,650 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] Derived loop invariant: ((((((((((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 7 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15) && 12849 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 5)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8 && 7 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 5)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 73282) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 6)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 5)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 6)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 11)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 80 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && 7 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 6))) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && 80 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 49 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 5)) || ((7 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 6)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 6 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && (\exists v_prenex_26 : int :: (((((-1 * ((10 * v_prenex_26 + 2779120) / 9) + 437300) / 10 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 && v_prenex_26 <= 11) && 0 < v_prenex_26 + 43) && (10 * v_prenex_26 + 2779120) / 9 <= 437300) && (10 * v_prenex_26 + 2779120) / 9 <= 437299) && 0 <= 10 * v_prenex_26 + 2779120)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 73282) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 6)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8 && 11 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 80)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 80 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9) - InvariantResult [Line: 880]: Loop Invariant [2018-07-24 02:59:57,655 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,655 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,656 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,656 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,656 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,656 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,663 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,664 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,664 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,664 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,664 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-07-24 02:59:57,664 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] Derived loop invariant: ((((((((((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 7 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15) && 12849 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 5)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8 && 7 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 5)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 73282) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 6)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 5)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 6)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 11)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 80 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && 7 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 6))) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && 80 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 49 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 5)) || ((7 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 8)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 5) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 6)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 == 6 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1) && (\exists v_prenex_26 : int :: (((((-1 * ((10 * v_prenex_26 + 2779120) / 9) + 437300) / 10 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 && v_prenex_26 <= 11) && 0 < v_prenex_26 + 43) && (10 * v_prenex_26 + 2779120) / 9 <= 437300) && (10 * v_prenex_26 + 2779120) / 9 <= 437299) && 0 <= 10 * v_prenex_26 + 2779120)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 73282) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 6)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 <= 8 && 11 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 80)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 1 && 80 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 9) - 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, 84.2s OverallTime, 13 OverallIterations, 12 TraceHistogramMax, 40.7s AutomataDifference, 0.0s DeadEndRemovalTime, 8.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1803 SDtfs, 9508 SDslu, 1780 SDs, 0 SdLazy, 22684 SolverSat, 2755 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4848 GetRequests, 4767 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 15.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12875occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 8403 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 180 NumberOfFragments, 409 HoareAnnotationTreeSize, 3 FomulaSimplifications, 51307 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 12952 FormulaSimplificationTreeSizeReductionInter, 6.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 23.9s InterpolantComputationTime, 13510 NumberOfCodeBlocks, 13510 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 13491 ConstructedInterpolants, 26 QuantifiedInterpolants, 50943086 SizeOfPredicates, 14 NumberOfNonLiveVariables, 5794 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 39985/41032 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/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label19_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_02-59-57-672.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label19_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_02-59-57-672.csv Received shutdown request...