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/Problem01_label42_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 01:20:42,783 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 01:20:42,785 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 01:20:42,803 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 01:20:42,804 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 01:20:42,806 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 01:20:42,807 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 01:20:42,810 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 01:20:42,814 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 01:20:42,815 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 01:20:42,822 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 01:20:42,822 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 01:20:42,827 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 01:20:42,828 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 01:20:42,832 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 01:20:42,833 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 01:20:42,834 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 01:20:42,836 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 01:20:42,841 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 01:20:42,843 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 01:20:42,847 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 01:20:42,848 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 01:20:42,857 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 01:20:42,857 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 01:20:42,858 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 01:20:42,859 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 01:20:42,861 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 01:20:42,862 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 01:20:42,866 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 01:20:42,867 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 01:20:42,867 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 01:20:42,868 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 01:20:42,869 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 01:20:42,869 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 01:20:42,871 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 01:20:42,872 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 01:20:42,873 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 01:20:42,899 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 01:20:42,899 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 01:20:42,900 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 01:20:42,903 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-24 01:20:42,904 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-24 01:20:42,905 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-24 01:20:42,905 INFO L133 SettingsManager]: * Use SBE=true [2018-07-24 01:20:42,905 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 01:20:42,905 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 01:20:42,906 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 01:20:42,906 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 01:20:42,906 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 01:20:42,906 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 01:20:42,906 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 01:20:42,907 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 01:20:42,907 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 01:20:42,907 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 01:20:42,908 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 01:20:42,909 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 01:20:42,909 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 01:20:42,909 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 01:20:42,910 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 01:20:42,910 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 01:20:42,910 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-24 01:20:42,910 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 01:20:42,911 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 01:20:42,911 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 01:20:42,911 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 01:20:42,980 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 01:20:42,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 01:20:43,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 01:20:43,003 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 01:20:43,004 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 01:20:43,005 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label42_true-unreach-call_false-termination.c [2018-07-24 01:20:43,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3893922d/c26cab79f78e4cb58593219e9f03232e/FLAG326d5784c [2018-07-24 01:20:43,613 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 01:20:43,614 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label42_true-unreach-call_false-termination.c [2018-07-24 01:20:43,642 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3893922d/c26cab79f78e4cb58593219e9f03232e/FLAG326d5784c [2018-07-24 01:20:43,657 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3893922d/c26cab79f78e4cb58593219e9f03232e [2018-07-24 01:20:43,668 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 01:20:43,670 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 01:20:43,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 01:20:43,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 01:20:43,678 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 01:20:43,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:20:43" (1/1) ... [2018-07-24 01:20:43,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@658546c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:43, skipping insertion in model container [2018-07-24 01:20:43,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:20:43" (1/1) ... [2018-07-24 01:20:43,906 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 01:20:44,204 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:20:44,222 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 01:20:44,321 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:20:44,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:44 WrapperNode [2018-07-24 01:20:44,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 01:20:44,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 01:20:44,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 01:20:44,369 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 01:20:44,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:44" (1/1) ... [2018-07-24 01:20:44,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:44" (1/1) ... [2018-07-24 01:20:44,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 01:20:44,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 01:20:44,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 01:20:44,478 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 01:20:44,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:44" (1/1) ... [2018-07-24 01:20:44,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:44" (1/1) ... [2018-07-24 01:20:44,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:44" (1/1) ... [2018-07-24 01:20:44,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:44" (1/1) ... [2018-07-24 01:20:44,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:44" (1/1) ... [2018-07-24 01:20:44,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:44" (1/1) ... [2018-07-24 01:20:44,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:44" (1/1) ... [2018-07-24 01:20:44,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 01:20:44,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 01:20:44,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 01:20:44,697 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 01:20:44,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:44" (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 01:20:44,782 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-24 01:20:44,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 01:20:44,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 01:20:48,132 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 01:20:48,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:20:48 BoogieIcfgContainer [2018-07-24 01:20:48,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 01:20:48,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 01:20:48,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 01:20:48,138 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 01:20:48,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 01:20:43" (1/3) ... [2018-07-24 01:20:48,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@227d65c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:20:48, skipping insertion in model container [2018-07-24 01:20:48,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:20:44" (2/3) ... [2018-07-24 01:20:48,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@227d65c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:20:48, skipping insertion in model container [2018-07-24 01:20:48,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:20:48" (3/3) ... [2018-07-24 01:20:48,142 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label42_true-unreach-call_false-termination.c [2018-07-24 01:20:48,152 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 01:20:48,161 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 01:20:48,217 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 01:20:48,218 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 01:20:48,218 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 01:20:48,219 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 01:20:48,219 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 01:20:48,219 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 01:20:48,219 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 01:20:48,220 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 01:20:48,220 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 01:20:48,243 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-07-24 01:20:48,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-24 01:20:48,257 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:48,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:20:48,259 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:48,265 INFO L82 PathProgramCache]: Analyzing trace with hash -136202145, now seen corresponding path program 1 times [2018-07-24 01:20:48,268 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:48,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:48,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:48,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:48,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:48,913 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 01:20:48,916 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:48,916 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:20:48,922 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:20:48,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:20:48,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:48,943 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-07-24 01:20:51,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:51,640 INFO L93 Difference]: Finished difference Result 666 states and 1182 transitions. [2018-07-24 01:20:51,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:20:51,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-07-24 01:20:51,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:51,664 INFO L225 Difference]: With dead ends: 666 [2018-07-24 01:20:51,664 INFO L226 Difference]: Without dead ends: 460 [2018-07-24 01:20:51,669 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 01:20:51,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-07-24 01:20:51,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2018-07-24 01:20:51,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-07-24 01:20:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 732 transitions. [2018-07-24 01:20:51,741 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 732 transitions. Word has length 116 [2018-07-24 01:20:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:51,742 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 732 transitions. [2018-07-24 01:20:51,743 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:20:51,743 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 732 transitions. [2018-07-24 01:20:51,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-07-24 01:20:51,750 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:51,750 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:51,751 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:51,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1030136754, now seen corresponding path program 1 times [2018-07-24 01:20:51,751 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:51,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:51,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:51,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:51,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:20:51,843 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:51,843 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:20:51,845 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:20:51,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:20:51,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:51,846 INFO L87 Difference]: Start difference. First operand 460 states and 732 transitions. Second operand 3 states. [2018-07-24 01:20:52,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:52,899 INFO L93 Difference]: Finished difference Result 1314 states and 2131 transitions. [2018-07-24 01:20:52,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:20:52,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-07-24 01:20:52,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:52,907 INFO L225 Difference]: With dead ends: 1314 [2018-07-24 01:20:52,908 INFO L226 Difference]: Without dead ends: 856 [2018-07-24 01:20:52,911 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:52,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-07-24 01:20:52,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-07-24 01:20:52,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-07-24 01:20:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1275 transitions. [2018-07-24 01:20:52,956 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1275 transitions. Word has length 123 [2018-07-24 01:20:52,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:52,956 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1275 transitions. [2018-07-24 01:20:52,956 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:20:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1275 transitions. [2018-07-24 01:20:52,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-24 01:20:52,962 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:52,963 INFO L353 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:20:52,963 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:52,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1968627861, now seen corresponding path program 1 times [2018-07-24 01:20:52,963 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:52,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:52,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:52,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:52,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:53,146 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-07-24 01:20:53,147 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:53,147 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:20:53,148 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:20:53,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:20:53,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:53,152 INFO L87 Difference]: Start difference. First operand 856 states and 1275 transitions. Second operand 3 states. [2018-07-24 01:20:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:55,155 INFO L93 Difference]: Finished difference Result 1974 states and 3012 transitions. [2018-07-24 01:20:55,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:20:55,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2018-07-24 01:20:55,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:55,162 INFO L225 Difference]: With dead ends: 1974 [2018-07-24 01:20:55,163 INFO L226 Difference]: Without dead ends: 1120 [2018-07-24 01:20:55,164 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:55,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2018-07-24 01:20:55,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1120. [2018-07-24 01:20:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2018-07-24 01:20:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1703 transitions. [2018-07-24 01:20:55,196 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1703 transitions. Word has length 152 [2018-07-24 01:20:55,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:55,197 INFO L471 AbstractCegarLoop]: Abstraction has 1120 states and 1703 transitions. [2018-07-24 01:20:55,197 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:20:55,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1703 transitions. [2018-07-24 01:20:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-24 01:20:55,201 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:55,202 INFO L353 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:20:55,202 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:55,202 INFO L82 PathProgramCache]: Analyzing trace with hash 525694411, now seen corresponding path program 1 times [2018-07-24 01:20:55,202 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:55,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:55,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:55,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:55,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 01:20:55,430 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:55,430 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:20:55,430 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:20:55,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:20:55,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:55,431 INFO L87 Difference]: Start difference. First operand 1120 states and 1703 transitions. Second operand 4 states. [2018-07-24 01:20:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:57,827 INFO L93 Difference]: Finished difference Result 2373 states and 3570 transitions. [2018-07-24 01:20:57,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:20:57,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-07-24 01:20:57,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:57,841 INFO L225 Difference]: With dead ends: 2373 [2018-07-24 01:20:57,841 INFO L226 Difference]: Without dead ends: 1255 [2018-07-24 01:20:57,843 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:20:57,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2018-07-24 01:20:57,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1252. [2018-07-24 01:20:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-07-24 01:20:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1841 transitions. [2018-07-24 01:20:57,870 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1841 transitions. Word has length 156 [2018-07-24 01:20:57,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:57,871 INFO L471 AbstractCegarLoop]: Abstraction has 1252 states and 1841 transitions. [2018-07-24 01:20:57,871 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:20:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1841 transitions. [2018-07-24 01:20:57,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-07-24 01:20:57,875 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:57,875 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:20:57,875 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:57,876 INFO L82 PathProgramCache]: Analyzing trace with hash -365717213, now seen corresponding path program 1 times [2018-07-24 01:20:57,876 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:57,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:57,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:57,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:57,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:58,029 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-07-24 01:20:58,029 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:58,029 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:20:58,030 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:20:58,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:20:58,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:58,030 INFO L87 Difference]: Start difference. First operand 1252 states and 1841 transitions. Second operand 3 states. [2018-07-24 01:20:59,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:59,056 INFO L93 Difference]: Finished difference Result 3162 states and 4718 transitions. [2018-07-24 01:20:59,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:20:59,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2018-07-24 01:20:59,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:59,068 INFO L225 Difference]: With dead ends: 3162 [2018-07-24 01:20:59,069 INFO L226 Difference]: Without dead ends: 2044 [2018-07-24 01:20:59,071 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:20:59,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2018-07-24 01:20:59,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2044. [2018-07-24 01:20:59,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2018-07-24 01:20:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2828 transitions. [2018-07-24 01:20:59,111 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2828 transitions. Word has length 161 [2018-07-24 01:20:59,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:59,111 INFO L471 AbstractCegarLoop]: Abstraction has 2044 states and 2828 transitions. [2018-07-24 01:20:59,111 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:20:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2828 transitions. [2018-07-24 01:20:59,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-07-24 01:20:59,117 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:20:59,117 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:20:59,117 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:20:59,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1745663186, now seen corresponding path program 1 times [2018-07-24 01:20:59,118 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:20:59,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:20:59,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:59,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:20:59,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:20:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:20:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-07-24 01:20:59,374 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:20:59,374 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:20:59,374 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:20:59,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:20:59,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:20:59,376 INFO L87 Difference]: Start difference. First operand 2044 states and 2828 transitions. Second operand 4 states. [2018-07-24 01:21:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:00,735 INFO L93 Difference]: Finished difference Result 6850 states and 9424 transitions. [2018-07-24 01:21:00,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:21:00,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2018-07-24 01:21:00,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:00,758 INFO L225 Difference]: With dead ends: 6850 [2018-07-24 01:21:00,758 INFO L226 Difference]: Without dead ends: 4940 [2018-07-24 01:21:00,763 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:00,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4940 states. [2018-07-24 01:21:00,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4940 to 4940. [2018-07-24 01:21:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4940 states. [2018-07-24 01:21:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4940 states to 4940 states and 6244 transitions. [2018-07-24 01:21:00,850 INFO L78 Accepts]: Start accepts. Automaton has 4940 states and 6244 transitions. Word has length 171 [2018-07-24 01:21:00,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:00,850 INFO L471 AbstractCegarLoop]: Abstraction has 4940 states and 6244 transitions. [2018-07-24 01:21:00,850 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:21:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 4940 states and 6244 transitions. [2018-07-24 01:21:00,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-07-24 01:21:00,860 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:00,860 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:21:00,861 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:00,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1826193770, now seen corresponding path program 1 times [2018-07-24 01:21:00,861 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:00,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:00,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:00,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:00,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-07-24 01:21:01,042 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:01,042 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:21:01,042 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 01:21:01,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 01:21:01,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:21:01,043 INFO L87 Difference]: Start difference. First operand 4940 states and 6244 transitions. Second operand 5 states. [2018-07-24 01:21:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:02,887 INFO L93 Difference]: Finished difference Result 9878 states and 12543 transitions. [2018-07-24 01:21:02,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 01:21:02,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2018-07-24 01:21:02,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:02,903 INFO L225 Difference]: With dead ends: 9878 [2018-07-24 01:21:02,903 INFO L226 Difference]: Without dead ends: 5072 [2018-07-24 01:21:02,908 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:21:02,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2018-07-24 01:21:02,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 5072. [2018-07-24 01:21:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5072 states. [2018-07-24 01:21:02,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5072 states to 5072 states and 6293 transitions. [2018-07-24 01:21:02,981 INFO L78 Accepts]: Start accepts. Automaton has 5072 states and 6293 transitions. Word has length 195 [2018-07-24 01:21:02,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:02,981 INFO L471 AbstractCegarLoop]: Abstraction has 5072 states and 6293 transitions. [2018-07-24 01:21:02,981 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 01:21:02,982 INFO L276 IsEmpty]: Start isEmpty. Operand 5072 states and 6293 transitions. [2018-07-24 01:21:02,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-24 01:21:02,994 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:02,994 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:21:02,999 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:03,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1027716654, now seen corresponding path program 1 times [2018-07-24 01:21:03,000 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:03,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:03,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:03,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:03,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-07-24 01:21:03,164 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:03,164 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:21:03,164 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:21:03,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:21:03,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:03,165 INFO L87 Difference]: Start difference. First operand 5072 states and 6293 transitions. Second operand 4 states. [2018-07-24 01:21:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:06,238 INFO L93 Difference]: Finished difference Result 9742 states and 12123 transitions. [2018-07-24 01:21:06,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:21:06,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2018-07-24 01:21:06,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:06,249 INFO L225 Difference]: With dead ends: 9742 [2018-07-24 01:21:06,249 INFO L226 Difference]: Without dead ends: 3464 [2018-07-24 01:21:06,255 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 01:21:06,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3464 states. [2018-07-24 01:21:06,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3464 to 3464. [2018-07-24 01:21:06,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3464 states. [2018-07-24 01:21:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 3789 transitions. [2018-07-24 01:21:06,303 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 3789 transitions. Word has length 198 [2018-07-24 01:21:06,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:06,303 INFO L471 AbstractCegarLoop]: Abstraction has 3464 states and 3789 transitions. [2018-07-24 01:21:06,304 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:21:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 3789 transitions. [2018-07-24 01:21:06,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-24 01:21:06,310 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:06,311 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:21:06,311 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:06,311 INFO L82 PathProgramCache]: Analyzing trace with hash -337833433, now seen corresponding path program 1 times [2018-07-24 01:21:06,311 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:06,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:06,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:06,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:06,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-07-24 01:21:06,478 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:21:06,478 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:21:06,478 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:21:06,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:21:06,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:21:06,479 INFO L87 Difference]: Start difference. First operand 3464 states and 3789 transitions. Second operand 3 states. [2018-07-24 01:21:07,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:07,046 INFO L93 Difference]: Finished difference Result 6794 states and 7441 transitions. [2018-07-24 01:21:07,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:21:07,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-07-24 01:21:07,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:07,056 INFO L225 Difference]: With dead ends: 6794 [2018-07-24 01:21:07,057 INFO L226 Difference]: Without dead ends: 3062 [2018-07-24 01:21:07,060 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:21:07,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2018-07-24 01:21:07,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 2798. [2018-07-24 01:21:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2798 states. [2018-07-24 01:21:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 3042 transitions. [2018-07-24 01:21:07,097 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 3042 transitions. Word has length 212 [2018-07-24 01:21:07,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:07,098 INFO L471 AbstractCegarLoop]: Abstraction has 2798 states and 3042 transitions. [2018-07-24 01:21:07,098 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:21:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 3042 transitions. [2018-07-24 01:21:07,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-07-24 01:21:07,104 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:07,105 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:21:07,105 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:07,105 INFO L82 PathProgramCache]: Analyzing trace with hash -675440445, now seen corresponding path program 1 times [2018-07-24 01:21:07,105 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:07,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:07,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:07,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:07,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:07,436 WARN L169 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-07-24 01:21:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 102 proven. 5 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-07-24 01:21:07,499 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:21:07,499 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 01:21:07,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:07,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:21:07,777 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-07-24 01:21:07,815 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 01:21:07,815 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-07-24 01:21:07,816 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:21:07,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:21:07,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:07,817 INFO L87 Difference]: Start difference. First operand 2798 states and 3042 transitions. Second operand 4 states. [2018-07-24 01:21:09,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:09,913 INFO L93 Difference]: Finished difference Result 5594 states and 6095 transitions. [2018-07-24 01:21:09,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:21:09,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2018-07-24 01:21:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:09,928 INFO L225 Difference]: With dead ends: 5594 [2018-07-24 01:21:09,929 INFO L226 Difference]: Without dead ends: 2796 [2018-07-24 01:21:09,932 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:21:09,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2018-07-24 01:21:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2796. [2018-07-24 01:21:09,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2796 states. [2018-07-24 01:21:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 2989 transitions. [2018-07-24 01:21:09,979 INFO L78 Accepts]: Start accepts. Automaton has 2796 states and 2989 transitions. Word has length 223 [2018-07-24 01:21:09,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:09,980 INFO L471 AbstractCegarLoop]: Abstraction has 2796 states and 2989 transitions. [2018-07-24 01:21:09,980 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:21:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 2989 transitions. [2018-07-24 01:21:09,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-07-24 01:21:09,988 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:21:09,989 INFO L353 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:21:09,989 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:21:09,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1809098212, now seen corresponding path program 1 times [2018-07-24 01:21:09,989 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:21:09,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:21:09,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:09,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:09,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:21:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:10,473 WARN L169 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-07-24 01:21:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 181 proven. 27 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-07-24 01:21:10,742 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:21:10,743 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 01:21:10,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:21:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:21:10,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:21:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-07-24 01:21:11,048 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 01:21:11,049 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-07-24 01:21:11,049 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-24 01:21:11,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-24 01:21:11,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-07-24 01:21:11,051 INFO L87 Difference]: Start difference. First operand 2796 states and 2989 transitions. Second operand 7 states. [2018-07-24 01:21:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:21:13,112 INFO L93 Difference]: Finished difference Result 7055 states and 7563 transitions. [2018-07-24 01:21:13,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-24 01:21:13,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 242 [2018-07-24 01:21:13,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:21:13,113 INFO L225 Difference]: With dead ends: 7055 [2018-07-24 01:21:13,113 INFO L226 Difference]: Without dead ends: 0 [2018-07-24 01:21:13,119 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 244 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-07-24 01:21:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-24 01:21:13,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-24 01:21:13,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-24 01:21:13,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-24 01:21:13,120 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 242 [2018-07-24 01:21:13,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:21:13,120 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-24 01:21:13,120 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-24 01:21:13,121 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-24 01:21:13,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-24 01:21:13,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-24 01:21:15,541 WARN L169 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2018-07-24 01:21:15,890 WARN L169 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2018-07-24 01:21:15,894 INFO L421 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-07-24 01:21:15,894 INFO L421 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-07-24 01:21:15,894 INFO L421 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-07-24 01:21:15,894 INFO L421 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-07-24 01:21:15,894 INFO L421 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-07-24 01:21:15,894 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-24 01:21:15,895 INFO L421 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-07-24 01:21:15,895 INFO L421 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-07-24 01:21:15,895 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-24 01:21:15,895 INFO L421 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,895 INFO L421 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-07-24 01:21:15,895 INFO L421 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-07-24 01:21:15,895 INFO L421 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,895 INFO L421 ceAbstractionStarter]: For program point L391'(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,895 INFO L421 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-07-24 01:21:15,895 INFO L421 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-07-24 01:21:15,895 INFO L421 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,895 INFO L421 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,895 INFO L421 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-07-24 01:21:15,896 INFO L421 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,896 INFO L421 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-07-24 01:21:15,896 INFO L421 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,896 INFO L421 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-07-24 01:21:15,896 INFO L421 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-07-24 01:21:15,896 INFO L421 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,896 INFO L421 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-07-24 01:21:15,896 INFO L421 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,896 INFO L421 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-07-24 01:21:15,896 INFO L421 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,896 INFO L421 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,896 INFO L421 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-07-24 01:21:15,897 INFO L421 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,897 INFO L421 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,897 INFO L421 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-07-24 01:21:15,897 INFO L421 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,897 INFO L421 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-07-24 01:21:15,897 INFO L421 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,897 INFO L421 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-07-24 01:21:15,897 INFO L421 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,898 INFO L421 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-07-24 01:21:15,898 INFO L421 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,898 INFO L421 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-07-24 01:21:15,898 INFO L421 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,898 INFO L421 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-07-24 01:21:15,898 INFO L421 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-07-24 01:21:15,898 INFO L421 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-07-24 01:21:15,898 INFO L421 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,898 INFO L421 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-07-24 01:21:15,899 INFO L421 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,899 INFO L421 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-07-24 01:21:15,899 INFO L421 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-07-24 01:21:15,899 INFO L421 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,899 INFO L421 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-07-24 01:21:15,899 INFO L421 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,899 INFO L421 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-07-24 01:21:15,899 INFO L421 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,900 INFO L421 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,900 INFO L421 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-07-24 01:21:15,900 INFO L421 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,900 INFO L421 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-07-24 01:21:15,900 INFO L421 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,900 INFO L421 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-07-24 01:21:15,900 INFO L421 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-07-24 01:21:15,900 INFO L421 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-07-24 01:21:15,900 INFO L421 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-07-24 01:21:15,900 INFO L421 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,901 INFO L421 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-07-24 01:21:15,901 INFO L421 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,901 INFO L421 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-07-24 01:21:15,901 INFO L421 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,901 INFO L421 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-07-24 01:21:15,901 INFO L421 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-07-24 01:21:15,901 INFO L421 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-07-24 01:21:15,901 INFO L421 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,901 INFO L421 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-07-24 01:21:15,902 INFO L421 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,902 INFO L421 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-07-24 01:21:15,902 INFO L421 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-07-24 01:21:15,902 INFO L421 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-07-24 01:21:15,902 INFO L421 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,902 INFO L421 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-07-24 01:21:15,902 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-24 01:21:15,902 INFO L421 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,902 INFO L421 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-07-24 01:21:15,902 INFO L421 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,902 INFO L421 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-07-24 01:21:15,902 INFO L421 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,902 INFO L421 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,903 INFO L421 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-07-24 01:21:15,903 INFO L421 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,903 INFO L421 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-07-24 01:21:15,903 INFO L421 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-07-24 01:21:15,903 INFO L421 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,903 INFO L421 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-07-24 01:21:15,903 INFO L421 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-07-24 01:21:15,903 INFO L421 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,903 INFO L421 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,903 INFO L421 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-07-24 01:21:15,903 INFO L421 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-07-24 01:21:15,903 INFO L421 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-07-24 01:21:15,903 INFO L421 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,904 INFO L421 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-07-24 01:21:15,904 INFO L421 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-07-24 01:21:15,904 INFO L421 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-07-24 01:21:15,904 INFO L421 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,904 INFO L421 ceAbstractionStarter]: For program point L583(lines 583 593) no Hoare annotation was computed. [2018-07-24 01:21:15,904 INFO L421 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,904 INFO L421 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-07-24 01:21:15,904 INFO L421 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-07-24 01:21:15,905 INFO L421 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-07-24 01:21:15,905 INFO L421 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,905 INFO L421 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-07-24 01:21:15,905 INFO L421 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-07-24 01:21:15,905 INFO L421 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-07-24 01:21:15,905 INFO L421 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,906 INFO L417 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 15)) (.cse9 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13))) (let ((.cse3 (not (= 6 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0))) (.cse1 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 0)) (.cse6 (not .cse9)) (.cse4 (not .cse0)) (.cse10 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5)) (.cse7 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1)) (.cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse8 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 4) .cse2) (and .cse3 .cse4 .cse5 .cse2) (and .cse6 .cse3 .cse7 .cse2) (and .cse3 .cse8 .cse7 .cse9) (and .cse5 .cse9 .cse2) (and .cse10 .cse1 .cse2) (and .cse6 .cse4 .cse10 .cse2) (and .cse0 .cse7 .cse2) (and .cse5 .cse8 .cse9)))) [2018-07-24 01:21:15,906 INFO L421 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-07-24 01:21:15,906 INFO L421 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,906 INFO L421 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-07-24 01:21:15,906 INFO L421 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-07-24 01:21:15,906 INFO L421 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-07-24 01:21:15,906 INFO L421 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,907 INFO L421 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-07-24 01:21:15,907 INFO L424 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-07-24 01:21:15,907 INFO L421 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-07-24 01:21:15,907 INFO L421 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-07-24 01:21:15,907 INFO L421 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-07-24 01:21:15,907 INFO L421 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-07-24 01:21:15,907 INFO L421 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,907 INFO L421 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-07-24 01:21:15,908 INFO L421 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-07-24 01:21:15,908 INFO L421 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,908 INFO L421 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-07-24 01:21:15,908 INFO L421 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-07-24 01:21:15,908 INFO L421 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-07-24 01:21:15,908 INFO L421 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,908 INFO L421 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-07-24 01:21:15,908 INFO L421 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-07-24 01:21:15,908 INFO L421 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,908 INFO L421 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,908 INFO L421 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-07-24 01:21:15,908 INFO L421 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-07-24 01:21:15,908 INFO L421 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-07-24 01:21:15,909 INFO L421 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,909 INFO L421 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-07-24 01:21:15,909 INFO L421 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-07-24 01:21:15,909 INFO L421 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-07-24 01:21:15,909 INFO L421 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-07-24 01:21:15,909 INFO L421 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-07-24 01:21:15,909 INFO L421 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,909 INFO L421 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-07-24 01:21:15,909 INFO L421 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-07-24 01:21:15,909 INFO L421 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-07-24 01:21:15,909 INFO L421 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-07-24 01:21:15,909 INFO L421 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-07-24 01:21:15,909 INFO L421 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-07-24 01:21:15,910 INFO L421 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-07-24 01:21:15,910 INFO L421 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-07-24 01:21:15,910 INFO L421 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-07-24 01:21:15,910 INFO L421 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-07-24 01:21:15,910 INFO L421 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-07-24 01:21:15,910 INFO L421 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-07-24 01:21:15,910 INFO L421 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,910 INFO L421 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-07-24 01:21:15,910 INFO L421 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-07-24 01:21:15,910 INFO L421 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-07-24 01:21:15,910 INFO L421 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-07-24 01:21:15,910 INFO L421 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-07-24 01:21:15,910 INFO L421 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,910 INFO L421 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-07-24 01:21:15,911 INFO L421 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,911 INFO L417 ceAbstractionStarter]: At program point L583''(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 15)) (.cse9 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13))) (let ((.cse3 (not (= 6 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0))) (.cse1 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 0)) (.cse6 (not .cse9)) (.cse4 (not .cse0)) (.cse10 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5)) (.cse7 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1)) (.cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1)) (.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse8 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 4) .cse2) (and .cse3 .cse4 .cse5 .cse2) (and .cse6 .cse3 .cse7 .cse2) (and .cse3 .cse8 .cse7 .cse9) (and .cse5 .cse9 .cse2) (and .cse10 .cse1 .cse2) (and .cse6 .cse4 .cse10 .cse2) (and .cse0 .cse7 .cse2) (and .cse5 .cse8 .cse9)))) [2018-07-24 01:21:15,911 INFO L421 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-07-24 01:21:15,911 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-07-24 01:21:15,911 INFO L421 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-07-24 01:21:15,911 INFO L421 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-07-24 01:21:15,911 INFO L421 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-07-24 01:21:15,911 INFO L421 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-07-24 01:21:15,911 INFO L421 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,912 INFO L421 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-07-24 01:21:15,912 INFO L421 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-07-24 01:21:15,912 INFO L421 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-07-24 01:21:15,912 INFO L421 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,912 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 521) no Hoare annotation was computed. [2018-07-24 01:21:15,912 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-24 01:21:15,912 INFO L421 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-07-24 01:21:15,912 INFO L421 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-07-24 01:21:15,912 INFO L421 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-07-24 01:21:15,912 INFO L421 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-07-24 01:21:15,912 INFO L421 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-07-24 01:21:15,912 INFO L421 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-07-24 01:21:15,912 INFO L421 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-07-24 01:21:15,912 INFO L421 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-07-24 01:21:15,913 INFO L421 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-07-24 01:21:15,913 INFO L421 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-07-24 01:21:15,913 INFO L421 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-07-24 01:21:15,913 INFO L421 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-07-24 01:21:15,913 INFO L421 ceAbstractionStarter]: For program point L520'(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:21:15,913 INFO L421 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-07-24 01:21:15,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 01:21:15 BoogieIcfgContainer [2018-07-24 01:21:15,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 01:21:15,942 INFO L168 Benchmark]: Toolchain (without parser) took 32272.97 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -688.5 MB). Peak memory consumption was 399.9 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:15,943 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 01:21:15,943 INFO L168 Benchmark]: CACSL2BoogieTranslator took 696.74 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:15,944 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.12 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 01:21:15,945 INFO L168 Benchmark]: Boogie Preprocessor took 219.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.0 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:15,946 INFO L168 Benchmark]: RCFGBuilder took 3436.43 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 138.0 MB). Peak memory consumption was 138.0 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:15,947 INFO L168 Benchmark]: TraceAbstraction took 27806.68 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 334.5 MB). Free memory was 2.0 GB in the beginning and 2.1 GB in the end (delta: -45.8 MB). Peak memory consumption was 288.7 MB. Max. memory is 7.1 GB. [2018-07-24 01:21:15,952 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 696.74 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 109.12 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 219.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.0 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3436.43 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 138.0 MB). Peak memory consumption was 138.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27806.68 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 334.5 MB). Free memory was 2.0 GB in the beginning and 2.1 GB in the end (delta: -45.8 MB). Peak memory consumption was 288.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 521]: 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: 30]: Loop Invariant Derived loop invariant: ((((((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((!(6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && !(6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((!(6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((!(6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && !(6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((!(6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((!(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 27.7s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 20.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1514 SDtfs, 3074 SDslu, 592 SDs, 0 SdLazy, 7159 SolverSat, 1300 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 510 GetRequests, 479 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5072occurred in iteration=7, 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: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 267 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 108 NumberOfFragments, 241 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1574 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 214 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2414 NumberOfCodeBlocks, 2414 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2401 ConstructedInterpolants, 0 QuantifiedInterpolants, 1007419 SizeOfPredicates, 1 NumberOfNonLiveVariables, 779 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 1489/1521 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/Problem01_label42_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_01-21-15-973.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label42_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_01-21-15-973.csv Received shutdown request...