java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 22:29:04,313 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:29:04,315 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:29:04,330 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:29:04,330 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:29:04,331 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:29:04,332 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:29:04,334 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:29:04,336 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:29:04,337 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:29:04,338 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:29:04,338 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:29:04,339 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:29:04,341 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:29:04,342 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:29:04,344 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:29:04,346 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:29:04,348 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:29:04,349 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:29:04,351 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:29:04,353 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:29:04,353 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:29:04,354 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:29:04,355 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:29:04,356 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:29:04,357 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:29:04,357 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:29:04,358 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:29:04,358 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:29:04,358 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:29:04,359 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:29:04,359 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 22:29:04,368 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:29:04,368 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:29:04,368 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:29:04,369 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:29:04,369 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:29:04,369 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:29:04,369 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:29:04,369 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:29:04,369 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:29:04,370 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:29:04,370 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:29:04,370 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:29:04,370 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:29:04,370 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:29:04,370 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:29:04,370 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:29:04,370 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:29:04,370 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:29:04,371 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:29:04,371 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:29:04,371 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:29:04,371 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:29:04,371 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:29:04,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:29:04,372 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:29:04,372 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:29:04,372 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:29:04,372 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:29:04,372 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:29:04,372 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:29:04,373 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:29:04,373 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:29:04,373 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:29:04,373 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:29:04,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:29:04,414 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:29:04,418 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:29:04,419 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:29:04,419 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:29:04,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-01-28 22:29:04,617 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:29:04,623 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:29:04,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:29:04,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:29:04,628 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:29:04,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:29:04" (1/1) ... [2018-01-28 22:29:04,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55fe8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:04, skipping insertion in model container [2018-01-28 22:29:04,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:29:04" (1/1) ... [2018-01-28 22:29:04,645 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:29:04,694 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:29:04,811 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:29:04,831 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:29:04,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:04 WrapperNode [2018-01-28 22:29:04,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:29:04,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:29:04,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:29:04,840 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:29:04,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:04" (1/1) ... [2018-01-28 22:29:04,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:04" (1/1) ... [2018-01-28 22:29:04,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:04" (1/1) ... [2018-01-28 22:29:04,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:04" (1/1) ... [2018-01-28 22:29:04,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:04" (1/1) ... [2018-01-28 22:29:04,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:04" (1/1) ... [2018-01-28 22:29:04,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:04" (1/1) ... [2018-01-28 22:29:04,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:29:04,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:29:04,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:29:04,875 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:29:04,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:04" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:29:04,919 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:29:04,920 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:29:04,920 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-28 22:29:04,920 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-28 22:29:04,920 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:29:04,920 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 22:29:04,920 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 22:29:04,920 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:29:04,921 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:29:04,921 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:29:04,921 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 22:29:04,921 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 22:29:04,921 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 22:29:04,921 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-28 22:29:04,922 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-28 22:29:04,922 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:29:04,922 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:29:04,922 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:29:05,111 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:29:05,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:29:05 BoogieIcfgContainer [2018-01-28 22:29:05,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:29:05,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:29:05,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:29:05,115 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:29:05,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:29:04" (1/3) ... [2018-01-28 22:29:05,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f04d6be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:29:05, skipping insertion in model container [2018-01-28 22:29:05,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:29:04" (2/3) ... [2018-01-28 22:29:05,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f04d6be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:29:05, skipping insertion in model container [2018-01-28 22:29:05,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:29:05" (3/3) ... [2018-01-28 22:29:05,117 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-01-28 22:29:05,123 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:29:05,129 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-28 22:29:05,179 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:29:05,179 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:29:05,179 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:29:05,179 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:29:05,180 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:29:05,180 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:29:05,180 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:29:05,180 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:29:05,181 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:29:05,201 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-28 22:29:05,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 22:29:05,208 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:05,209 INFO L330 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] [2018-01-28 22:29:05,209 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:29:05,214 INFO L82 PathProgramCache]: Analyzing trace with hash -175263290, now seen corresponding path program 1 times [2018-01-28 22:29:05,216 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:05,217 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:05,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:05,268 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:05,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:05,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:29:05,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:29:05,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:29:05,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:29:05,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:29:05,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:29:05,498 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-01-28 22:29:05,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:05,641 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2018-01-28 22:29:05,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:29:05,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-28 22:29:05,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:05,653 INFO L225 Difference]: With dead ends: 105 [2018-01-28 22:29:05,654 INFO L226 Difference]: Without dead ends: 89 [2018-01-28 22:29:05,657 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-01-28 22:29:05,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-28 22:29:05,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2018-01-28 22:29:05,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-28 22:29:05,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2018-01-28 22:29:05,702 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 25 [2018-01-28 22:29:05,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:05,703 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-01-28 22:29:05,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:29:05,703 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2018-01-28 22:29:05,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-28 22:29:05,704 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:05,705 INFO L330 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] [2018-01-28 22:29:05,705 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:29:05,705 INFO L82 PathProgramCache]: Analyzing trace with hash -95214814, now seen corresponding path program 1 times [2018-01-28 22:29:05,705 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:05,705 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:05,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:05,707 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:05,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:05,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:05,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:29:05,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:29:05,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:29:05,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:29:05,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:29:05,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:29:05,825 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 6 states. [2018-01-28 22:29:05,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:05,953 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2018-01-28 22:29:05,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:29:05,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-28 22:29:05,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:05,956 INFO L225 Difference]: With dead ends: 108 [2018-01-28 22:29:05,956 INFO L226 Difference]: Without dead ends: 104 [2018-01-28 22:29:05,957 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:29:05,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-28 22:29:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 75. [2018-01-28 22:29:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-28 22:29:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-01-28 22:29:05,969 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 26 [2018-01-28 22:29:05,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:05,970 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-01-28 22:29:05,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:29:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-01-28 22:29:05,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-28 22:29:05,971 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:05,971 INFO L330 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] [2018-01-28 22:29:05,972 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:29:05,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1326999554, now seen corresponding path program 1 times [2018-01-28 22:29:05,972 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:05,972 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:05,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:05,974 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:05,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:05,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:06,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:29:06,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:29:06,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:29:06,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:29:06,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:29:06,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:29:06,046 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 4 states. [2018-01-28 22:29:06,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:06,090 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2018-01-28 22:29:06,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:29:06,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-28 22:29:06,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:06,093 INFO L225 Difference]: With dead ends: 117 [2018-01-28 22:29:06,093 INFO L226 Difference]: Without dead ends: 113 [2018-01-28 22:29:06,094 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:29:06,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-28 22:29:06,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 77. [2018-01-28 22:29:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-28 22:29:06,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-01-28 22:29:06,106 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 28 [2018-01-28 22:29:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:06,107 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-01-28 22:29:06,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:29:06,107 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-01-28 22:29:06,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 22:29:06,108 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:06,109 INFO L330 BasicCegarLoop]: trace histogram [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] [2018-01-28 22:29:06,109 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:29:06,109 INFO L82 PathProgramCache]: Analyzing trace with hash -822618111, now seen corresponding path program 1 times [2018-01-28 22:29:06,109 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:06,109 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:06,111 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:06,111 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:06,111 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:06,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:29:06,196 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:29:06,197 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:29:06,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:06,245 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:29:06,270 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:29:06,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:29:06,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-01-28 22:29:06,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:29:06,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:29:06,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:29:06,302 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 5 states. [2018-01-28 22:29:06,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:06,340 INFO L93 Difference]: Finished difference Result 121 states and 134 transitions. [2018-01-28 22:29:06,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:29:06,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-28 22:29:06,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:06,342 INFO L225 Difference]: With dead ends: 121 [2018-01-28 22:29:06,342 INFO L226 Difference]: Without dead ends: 61 [2018-01-28 22:29:06,343 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:29:06,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-28 22:29:06,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-28 22:29:06,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-28 22:29:06,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-28 22:29:06,351 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 36 [2018-01-28 22:29:06,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:06,352 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-28 22:29:06,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:29:06,352 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-28 22:29:06,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 22:29:06,354 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:06,354 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:29:06,354 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:29:06,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1159121627, now seen corresponding path program 1 times [2018-01-28 22:29:06,354 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:06,354 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:06,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:06,356 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:06,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:06,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:06,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 22:29:06,435 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:29:06,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:29:06,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:29:06,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:29:06,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:29:06,436 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 5 states. [2018-01-28 22:29:06,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:06,515 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-01-28 22:29:06,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:29:06,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-28 22:29:06,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:06,516 INFO L225 Difference]: With dead ends: 110 [2018-01-28 22:29:06,516 INFO L226 Difference]: Without dead ends: 66 [2018-01-28 22:29:06,517 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:29:06,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-28 22:29:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-01-28 22:29:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-28 22:29:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-01-28 22:29:06,524 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 37 [2018-01-28 22:29:06,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:06,525 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-01-28 22:29:06,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:29:06,525 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-01-28 22:29:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 22:29:06,527 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:06,527 INFO L330 BasicCegarLoop]: trace histogram [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] [2018-01-28 22:29:06,527 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:29:06,527 INFO L82 PathProgramCache]: Analyzing trace with hash -2081203821, now seen corresponding path program 1 times [2018-01-28 22:29:06,527 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:06,528 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:06,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:06,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:06,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:06,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:06,697 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:29:06,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:29:06,698 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:29:06,707 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:06,736 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:29:06,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 22:29:06,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:06,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:29:06,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:29:06,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:06,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:06,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-28 22:29:06,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:06,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:29:06,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-28 22:29:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:29:07,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:29:07,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-28 22:29:07,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 22:29:07,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 22:29:07,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:29:07,004 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 11 states. [2018-01-28 22:29:07,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:07,403 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-01-28 22:29:07,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:29:07,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-01-28 22:29:07,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:07,446 INFO L225 Difference]: With dead ends: 91 [2018-01-28 22:29:07,446 INFO L226 Difference]: Without dead ends: 88 [2018-01-28 22:29:07,446 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-01-28 22:29:07,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-28 22:29:07,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 67. [2018-01-28 22:29:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-28 22:29:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-01-28 22:29:07,457 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 38 [2018-01-28 22:29:07,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:07,458 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-01-28 22:29:07,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 22:29:07,458 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-01-28 22:29:07,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 22:29:07,460 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:07,460 INFO L330 BasicCegarLoop]: trace histogram [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] [2018-01-28 22:29:07,460 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:29:07,460 INFO L82 PathProgramCache]: Analyzing trace with hash -2081203820, now seen corresponding path program 1 times [2018-01-28 22:29:07,460 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:07,461 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:07,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:07,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:07,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:07,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:29:07,950 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:29:07,950 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:29:07,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:07,982 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:29:08,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-28 22:29:08,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:08,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-28 22:29:08,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:08,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-28 22:29:08,024 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:08,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-28 22:29:08,041 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:08,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:29:08,055 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-28 22:29:08,371 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:08,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:08,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-28 22:29:08,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:08,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:08,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-01-28 22:29:08,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:08,463 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:08,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:08,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-01-28 22:29:08,465 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:08,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:08,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-01-28 22:29:08,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:08,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-28 22:29:08,546 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-28 22:29:08,648 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:29:08,673 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:29:08,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-01-28 22:29:08,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 22:29:08,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 22:29:08,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=365, Unknown=1, NotChecked=0, Total=420 [2018-01-28 22:29:08,674 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 21 states. [2018-01-28 22:29:08,962 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 55 DAG size of output 52 [2018-01-28 22:29:09,105 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-28 22:29:55,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:55,010 INFO L93 Difference]: Finished difference Result 145 states and 167 transitions. [2018-01-28 22:29:55,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-28 22:29:55,011 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2018-01-28 22:29:55,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:55,013 INFO L225 Difference]: With dead ends: 145 [2018-01-28 22:29:55,013 INFO L226 Difference]: Without dead ends: 143 [2018-01-28 22:29:55,014 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=163, Invalid=955, Unknown=4, NotChecked=0, Total=1122 [2018-01-28 22:29:55,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-28 22:29:55,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 101. [2018-01-28 22:29:55,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-28 22:29:55,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2018-01-28 22:29:55,034 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 38 [2018-01-28 22:29:55,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:55,035 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2018-01-28 22:29:55,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 22:29:55,035 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2018-01-28 22:29:55,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 22:29:55,036 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:55,036 INFO L330 BasicCegarLoop]: trace histogram [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] [2018-01-28 22:29:55,037 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:29:55,037 INFO L82 PathProgramCache]: Analyzing trace with hash 143153682, now seen corresponding path program 1 times [2018-01-28 22:29:55,037 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:55,037 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:55,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:55,039 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:55,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:55,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:29:55,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:29:55,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:29:55,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:29:55,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:29:55,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:29:55,082 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 4 states. [2018-01-28 22:29:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:55,114 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2018-01-28 22:29:55,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:29:55,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-01-28 22:29:55,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:55,115 INFO L225 Difference]: With dead ends: 115 [2018-01-28 22:29:55,115 INFO L226 Difference]: Without dead ends: 96 [2018-01-28 22:29:55,116 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:29:55,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-28 22:29:55,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2018-01-28 22:29:55,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-28 22:29:55,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2018-01-28 22:29:55,130 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 40 [2018-01-28 22:29:55,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:55,131 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2018-01-28 22:29:55,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:29:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2018-01-28 22:29:55,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 22:29:55,132 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:55,132 INFO L330 BasicCegarLoop]: trace histogram [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] [2018-01-28 22:29:55,132 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:29:55,132 INFO L82 PathProgramCache]: Analyzing trace with hash -212588640, now seen corresponding path program 1 times [2018-01-28 22:29:55,133 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:55,133 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:55,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:55,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:55,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:55,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:55,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 22:29:55,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:29:55,340 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:29:55,350 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:55,368 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:29:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 22:29:55,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:29:55,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-01-28 22:29:55,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 22:29:55,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 22:29:55,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=122, Unknown=9, NotChecked=0, Total=156 [2018-01-28 22:29:55,477 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand 13 states. [2018-01-28 22:29:55,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:55,960 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2018-01-28 22:29:55,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:29:55,961 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-01-28 22:29:55,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:55,963 INFO L225 Difference]: With dead ends: 99 [2018-01-28 22:29:55,963 INFO L226 Difference]: Without dead ends: 88 [2018-01-28 22:29:55,963 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=274, Unknown=9, NotChecked=0, Total=342 [2018-01-28 22:29:55,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-28 22:29:55,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-01-28 22:29:55,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-28 22:29:55,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2018-01-28 22:29:55,980 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 43 [2018-01-28 22:29:55,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:55,981 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2018-01-28 22:29:55,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 22:29:55,981 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2018-01-28 22:29:55,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-28 22:29:55,982 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:55,982 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:29:55,982 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:29:55,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1746977166, now seen corresponding path program 1 times [2018-01-28 22:29:55,982 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:55,983 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:55,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:55,984 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:55,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:55,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:29:56,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:29:56,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:29:56,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:29:56,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:29:56,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:29:56,032 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand 6 states. [2018-01-28 22:29:56,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:56,105 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2018-01-28 22:29:56,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:29:56,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-01-28 22:29:56,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:56,106 INFO L225 Difference]: With dead ends: 115 [2018-01-28 22:29:56,106 INFO L226 Difference]: Without dead ends: 87 [2018-01-28 22:29:56,107 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:29:56,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-28 22:29:56,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-01-28 22:29:56,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-28 22:29:56,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2018-01-28 22:29:56,119 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 44 [2018-01-28 22:29:56,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:56,119 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2018-01-28 22:29:56,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:29:56,120 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2018-01-28 22:29:56,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-28 22:29:56,120 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:56,120 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:29:56,120 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:29:56,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1150993881, now seen corresponding path program 1 times [2018-01-28 22:29:56,120 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:56,121 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:56,121 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:56,121 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:56,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:56,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:29:56,222 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:29:56,222 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:29:56,233 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:56,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:29:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:29:56,382 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:29:56,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-01-28 22:29:56,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:29:56,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:29:56,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:29:56,383 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 9 states. [2018-01-28 22:29:56,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:56,572 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2018-01-28 22:29:56,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:29:56,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-01-28 22:29:56,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:56,574 INFO L225 Difference]: With dead ends: 114 [2018-01-28 22:29:56,574 INFO L226 Difference]: Without dead ends: 110 [2018-01-28 22:29:56,574 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:29:56,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-28 22:29:56,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 85. [2018-01-28 22:29:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-28 22:29:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-01-28 22:29:56,585 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 46 [2018-01-28 22:29:56,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:56,585 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-01-28 22:29:56,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:29:56,585 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-01-28 22:29:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-28 22:29:56,586 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:56,586 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:29:56,586 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:29:56,586 INFO L82 PathProgramCache]: Analyzing trace with hash -420007505, now seen corresponding path program 1 times [2018-01-28 22:29:56,586 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:56,586 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:56,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:56,587 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:56,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:56,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:57,113 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:29:57,114 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:29:57,114 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:29:57,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:57,151 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:29:57,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-28 22:29:57,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:57,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-28 22:29:57,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:57,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-28 22:29:57,211 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:57,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-28 22:29:57,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:57,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:29:57,227 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-28 22:29:57,523 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:57,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:57,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 25 [2018-01-28 22:29:57,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:57,551 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:57,552 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:57,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 22:29:57,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:57,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 22:29:57,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-01-28 22:29:57,831 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:57,832 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:57,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:57,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 34 [2018-01-28 22:29:57,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:57,865 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:57,865 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:29:57,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 22:29:57,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:29:57,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-28 22:29:57,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:32 [2018-01-28 22:29:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:29:57,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:29:57,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2018-01-28 22:29:57,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-28 22:29:57,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-28 22:29:57,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=719, Unknown=1, NotChecked=0, Total=812 [2018-01-28 22:29:57,991 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 29 states. [2018-01-28 22:29:58,369 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 64 DAG size of output 59 [2018-01-28 22:29:59,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:29:59,299 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2018-01-28 22:29:59,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-28 22:29:59,299 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-01-28 22:29:59,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:29:59,300 INFO L225 Difference]: With dead ends: 129 [2018-01-28 22:29:59,300 INFO L226 Difference]: Without dead ends: 127 [2018-01-28 22:29:59,301 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=232, Invalid=1656, Unknown=4, NotChecked=0, Total=1892 [2018-01-28 22:29:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-28 22:29:59,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2018-01-28 22:29:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-28 22:29:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 132 transitions. [2018-01-28 22:29:59,311 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 132 transitions. Word has length 56 [2018-01-28 22:29:59,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:29:59,312 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 132 transitions. [2018-01-28 22:29:59,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-28 22:29:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 132 transitions. [2018-01-28 22:29:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-28 22:29:59,313 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:29:59,313 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:29:59,313 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:29:59,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1175021715, now seen corresponding path program 1 times [2018-01-28 22:29:59,313 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:29:59,314 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:29:59,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:59,315 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:59,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:29:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:59,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:29:59,494 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:29:59,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:29:59,494 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:29:59,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:29:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:29:59,526 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:29:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:29:59,705 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:29:59,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-01-28 22:29:59,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-28 22:29:59,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-28 22:29:59,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-01-28 22:29:59,706 INFO L87 Difference]: Start difference. First operand 111 states and 132 transitions. Second operand 19 states. [2018-01-28 22:30:00,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:30:00,089 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2018-01-28 22:30:00,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-28 22:30:00,089 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-01-28 22:30:00,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:30:00,090 INFO L225 Difference]: With dead ends: 126 [2018-01-28 22:30:00,090 INFO L226 Difference]: Without dead ends: 124 [2018-01-28 22:30:00,091 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2018-01-28 22:30:00,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-28 22:30:00,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 88. [2018-01-28 22:30:00,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-28 22:30:00,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-01-28 22:30:00,101 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 58 [2018-01-28 22:30:00,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:30:00,102 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-01-28 22:30:00,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-28 22:30:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-01-28 22:30:00,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-28 22:30:00,102 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:30:00,102 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:30:00,102 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:30:00,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2065934786, now seen corresponding path program 1 times [2018-01-28 22:30:00,103 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:30:00,103 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:30:00,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:30:00,103 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:30:00,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:30:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:30:00,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:30:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-28 22:30:00,401 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:30:00,401 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:30:00,409 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:30:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:30:00,433 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:30:00,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-28 22:30:00,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 22:30:00,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:30:00,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:30:00,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:30:00,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-01-28 22:30:00,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-01-28 22:30:00,641 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:30:00,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-28 22:30:00,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:30:00,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:30:00,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:30:00,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-01-28 22:30:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:30:00,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:30:00,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 23 [2018-01-28 22:30:00,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-28 22:30:00,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-28 22:30:00,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2018-01-28 22:30:00,673 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 24 states. [2018-01-28 22:30:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:30:01,034 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2018-01-28 22:30:01,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-28 22:30:01,034 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-01-28 22:30:01,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:30:01,035 INFO L225 Difference]: With dead ends: 127 [2018-01-28 22:30:01,035 INFO L226 Difference]: Without dead ends: 126 [2018-01-28 22:30:01,036 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=1207, Unknown=0, NotChecked=0, Total=1406 [2018-01-28 22:30:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-28 22:30:01,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 101. [2018-01-28 22:30:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-28 22:30:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2018-01-28 22:30:01,048 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 59 [2018-01-28 22:30:01,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:30:01,048 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2018-01-28 22:30:01,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-28 22:30:01,049 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2018-01-28 22:30:01,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-28 22:30:01,049 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:30:01,050 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:30:01,050 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:30:01,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2065934785, now seen corresponding path program 1 times [2018-01-28 22:30:01,050 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:30:01,050 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:30:01,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:30:01,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:30:01,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:30:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:30:01,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:30:01,470 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:30:01,470 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:30:01,471 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:30:01,476 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:30:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:30:01,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:30:01,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 22:30:01,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:30:01,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:30:01,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:30:01,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-28 22:30:01,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 22:30:01,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:30:01,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:30:01,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:30:01,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-01-28 22:30:01,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-01-28 22:30:01,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:30:01,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:30:01,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:3 [2018-01-28 22:30:01,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-01-28 22:30:01,716 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:30:01,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-28 22:30:01,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:30:01,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:30:01,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:30:01,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:5 [2018-01-28 22:30:01,735 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:30:01,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:30:01,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 25 [2018-01-28 22:30:01,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-28 22:30:01,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-28 22:30:01,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2018-01-28 22:30:01,770 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand 26 states. [2018-01-28 22:30:02,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:30:02,249 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2018-01-28 22:30:02,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-28 22:30:02,250 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-01-28 22:30:02,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:30:02,251 INFO L225 Difference]: With dead ends: 103 [2018-01-28 22:30:02,251 INFO L226 Difference]: Without dead ends: 102 [2018-01-28 22:30:02,252 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=1163, Unknown=0, NotChecked=0, Total=1332 [2018-01-28 22:30:02,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-28 22:30:02,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-01-28 22:30:02,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-28 22:30:02,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2018-01-28 22:30:02,265 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 59 [2018-01-28 22:30:02,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:30:02,265 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2018-01-28 22:30:02,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-28 22:30:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-01-28 22:30:02,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-28 22:30:02,266 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:30:02,266 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:30:02,266 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:30:02,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1089853339, now seen corresponding path program 1 times [2018-01-28 22:30:02,267 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:30:02,267 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:30:02,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:30:02,268 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:30:02,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:30:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:30:02,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:30:02,316 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-28 22:30:02,316 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:30:02,316 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:30:02,321 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:30:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:30:02,341 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:30:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-28 22:30:02,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:30:02,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2018-01-28 22:30:02,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:30:02,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:30:02,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:30:02,407 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 8 states. [2018-01-28 22:30:02,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:30:02,467 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-01-28 22:30:02,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:30:02,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-01-28 22:30:02,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:30:02,468 INFO L225 Difference]: With dead ends: 105 [2018-01-28 22:30:02,468 INFO L226 Difference]: Without dead ends: 100 [2018-01-28 22:30:02,468 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:30:02,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-28 22:30:02,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-01-28 22:30:02,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-28 22:30:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-28 22:30:02,478 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 61 [2018-01-28 22:30:02,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:30:02,478 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-28 22:30:02,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:30:02,478 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-28 22:30:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-28 22:30:02,478 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:30:02,479 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:30:02,479 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:30:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1434342132, now seen corresponding path program 2 times [2018-01-28 22:30:02,479 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:30:02,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:30:02,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:30:02,480 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:30:02,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:30:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:30:02,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:30:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-28 22:30:02,660 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:30:02,660 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:30:02,678 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:30:02,692 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:30:02,711 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:30:02,723 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:30:02,725 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:30:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-28 22:30:02,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:30:02,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-01-28 22:30:02,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 22:30:02,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 22:30:02,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:30:02,866 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 13 states. [2018-01-28 22:30:02,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:30:02,950 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-01-28 22:30:02,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:30:02,950 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2018-01-28 22:30:02,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:30:02,952 INFO L225 Difference]: With dead ends: 156 [2018-01-28 22:30:02,952 INFO L226 Difference]: Without dead ends: 152 [2018-01-28 22:30:02,952 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-01-28 22:30:02,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-28 22:30:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 105. [2018-01-28 22:30:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-28 22:30:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-01-28 22:30:02,968 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 64 [2018-01-28 22:30:02,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:30:02,977 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-01-28 22:30:02,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 22:30:02,977 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-01-28 22:30:02,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-28 22:30:02,978 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:30:02,979 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-01-28 22:30:02,979 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:30:02,979 INFO L82 PathProgramCache]: Analyzing trace with hash -123263374, now seen corresponding path program 1 times [2018-01-28 22:30:02,979 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:30:02,979 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:30:02,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:30:02,980 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:30:02,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:30:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:30:02,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:30:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 22:30:03,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:30:03,558 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:30:03,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:30:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:30:03,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:30:03,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 22:30:03,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:30:03,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:30:03,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:30:03,646 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:30:03,647 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:30:03,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 22:30:03,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:30:03,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:30:03,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-28 22:30:03,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-28 22:30:03,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 22:30:03,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:30:03,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:30:03,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:30:03,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-01-28 22:30:03,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-28 22:30:03,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:30:03,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-28 22:30:03,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:19 [2018-01-28 22:30:07,811 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 19 [2018-01-28 22:30:08,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-01-28 22:30:08,167 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:30:08,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-28 22:30:08,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:30:08,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:30:08,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:30:08,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:10 [2018-01-28 22:30:08,188 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:30:08,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-28 22:30:08,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:30:08,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:30:08,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:22 [2018-01-28 22:30:08,240 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:30:08,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:30:08,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2018-01-28 22:30:08,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-28 22:30:08,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-28 22:30:08,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=889, Unknown=1, NotChecked=0, Total=992 [2018-01-28 22:30:08,261 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 32 states. [2018-01-28 22:30:41,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:30:41,053 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2018-01-28 22:30:41,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-28 22:30:41,053 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2018-01-28 22:30:41,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:30:41,054 INFO L225 Difference]: With dead ends: 122 [2018-01-28 22:30:41,054 INFO L226 Difference]: Without dead ends: 120 [2018-01-28 22:30:41,055 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=264, Invalid=1991, Unknown=1, NotChecked=0, Total=2256 [2018-01-28 22:30:41,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-28 22:30:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2018-01-28 22:30:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-28 22:30:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-01-28 22:30:41,065 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 66 [2018-01-28 22:30:41,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:30:41,065 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-01-28 22:30:41,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-28 22:30:41,065 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-01-28 22:30:41,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-28 22:30:41,066 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:30:41,066 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:30:41,066 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:30:41,066 INFO L82 PathProgramCache]: Analyzing trace with hash -123263326, now seen corresponding path program 1 times [2018-01-28 22:30:41,066 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:30:41,066 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:30:41,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:30:41,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:30:41,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:30:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:30:41,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:30:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-28 22:30:41,139 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:30:41,139 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:30:41,144 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:30:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:30:41,162 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:30:41,175 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-28 22:30:41,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:30:41,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-28 22:30:41,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 22:30:41,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 22:30:41,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:30:41,195 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 10 states. [2018-01-28 22:30:41,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:30:41,270 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-01-28 22:30:41,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:30:41,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-01-28 22:30:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:30:41,271 INFO L225 Difference]: With dead ends: 135 [2018-01-28 22:30:41,271 INFO L226 Difference]: Without dead ends: 116 [2018-01-28 22:30:41,271 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-01-28 22:30:41,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-28 22:30:41,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-01-28 22:30:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-28 22:30:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-01-28 22:30:41,281 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 66 [2018-01-28 22:30:41,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:30:41,281 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-01-28 22:30:41,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 22:30:41,281 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-01-28 22:30:41,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-28 22:30:41,282 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:30:41,282 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-01-28 22:30:41,282 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:30:41,282 INFO L82 PathProgramCache]: Analyzing trace with hash 57889040, now seen corresponding path program 1 times [2018-01-28 22:30:41,282 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:30:41,282 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:30:41,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:30:41,283 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:30:41,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:30:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:30:41,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:30:41,596 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 20 DAG size of output 18 [2018-01-28 22:30:41,736 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 20 DAG size of output 18 [2018-01-28 22:30:42,001 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 25 DAG size of output 14 [2018-01-28 22:30:42,234 WARN L146 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 39 DAG size of output 20 [2018-01-28 22:30:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-28 22:30:42,912 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:30:42,913 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:30:42,918 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:30:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:30:42,940 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:30:43,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-01-28 22:30:43,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 22:30:43,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:30:43,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:30:43,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-01-28 22:30:43,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 22:30:43,260 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:30:43,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:30:43,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:30:43,296 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:117 [2018-01-28 22:30:43,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2018-01-28 22:30:43,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:30:43,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2018-01-28 22:30:43,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:30:43,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-28 22:30:43,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:89, output treesize:71 [2018-01-28 22:30:51,148 WARN L146 SmtUtils]: Spent 5176ms on a formula simplification. DAG size of input: 68 DAG size of output 68 [2018-01-28 22:30:53,293 WARN L143 SmtUtils]: Spent 2033ms on a formula simplification that was a NOOP. DAG size: 66 [2018-01-28 22:30:55,510 WARN L143 SmtUtils]: Spent 2083ms on a formula simplification that was a NOOP. DAG size: 67 [2018-01-28 22:30:55,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 102 [2018-01-28 22:30:55,527 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:30:55,528 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:30:55,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 104 [2018-01-28 22:30:55,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:30:55,588 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:30:55,588 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:30:55,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 104 [2018-01-28 22:30:55,595 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 22:30:55,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2018-01-28 22:30:55,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:30:55,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:30:55,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2018-01-28 22:30:55,715 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:30:55,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2018-01-28 22:30:55,715 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:30:55,725 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:30:55,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:30:55,749 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:182, output treesize:63 [2018-01-28 22:30:58,078 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:30:58,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:30:58,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 39 [2018-01-28 22:30:58,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-28 22:30:58,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-28 22:30:58,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1432, Unknown=31, NotChecked=0, Total=1560 [2018-01-28 22:30:58,099 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 40 states. [2018-01-28 22:31:03,581 WARN L146 SmtUtils]: Spent 2074ms on a formula simplification. DAG size of input: 113 DAG size of output 44 [2018-01-28 22:31:05,751 WARN L146 SmtUtils]: Spent 2068ms on a formula simplification. DAG size of input: 110 DAG size of output 40 [2018-01-28 22:31:05,960 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 130 DAG size of output 45 [2018-01-28 22:31:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:31:14,906 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-01-28 22:31:14,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-28 22:31:14,906 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 69 [2018-01-28 22:31:14,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:31:14,907 INFO L225 Difference]: With dead ends: 116 [2018-01-28 22:31:14,907 INFO L226 Difference]: Without dead ends: 93 [2018-01-28 22:31:14,908 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=280, Invalid=3316, Unknown=64, NotChecked=0, Total=3660 [2018-01-28 22:31:14,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-28 22:31:14,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-01-28 22:31:14,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-28 22:31:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2018-01-28 22:31:14,920 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 69 [2018-01-28 22:31:14,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:31:14,921 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2018-01-28 22:31:14,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-28 22:31:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2018-01-28 22:31:14,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-28 22:31:14,922 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:31:14,922 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:31:14,922 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:31:14,922 INFO L82 PathProgramCache]: Analyzing trace with hash 581785866, now seen corresponding path program 2 times [2018-01-28 22:31:14,923 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:31:14,923 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:31:14,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:31:14,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:31:14,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:31:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:31:14,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:31:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-28 22:31:15,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:31:15,381 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:31:15,386 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:31:15,396 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:31:15,404 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:31:15,409 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:31:15,411 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:31:15,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-28 22:31:15,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:15,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-28 22:31:15,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:15,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-28 22:31:15,456 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:15,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-28 22:31:15,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:15,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:31:15,469 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-28 22:31:15,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:15,801 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:15,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-28 22:31:15,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:15,842 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:15,843 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:15,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-01-28 22:31:15,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:15,879 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:15,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-01-28 22:31:15,880 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:15,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-01-28 22:31:15,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:15,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-28 22:31:15,953 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-28 22:31:16,354 WARN L146 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 57 DAG size of output 54 [2018-01-28 22:31:16,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:16,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 68 [2018-01-28 22:31:16,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-28 22:31:17,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:17,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:17,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-01-28 22:31:17,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:17,185 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:17,186 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:17,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-01-28 22:31:17,187 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:17,189 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:17,190 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:17,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-28 22:31:17,190 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:17,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:17,338 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:17,339 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:17,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 82 [2018-01-28 22:31:17,347 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-28 22:31:17,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:17,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:17,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-01-28 22:31:17,581 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:17,766 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:17,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:17,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2018-01-28 22:31:17,768 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:17,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:17,947 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:17,949 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:17,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 80 [2018-01-28 22:31:17,956 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-28 22:31:18,191 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:18,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:18,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 80 [2018-01-28 22:31:18,198 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-28 22:31:18,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 8 dim-1 vars, End of recursive call: 32 dim-0 vars, and 8 xjuncts. [2018-01-28 22:31:18,496 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 28 variables, input treesize:245, output treesize:357 [2018-01-28 22:31:21,439 WARN L146 SmtUtils]: Spent 668ms on a formula simplification. DAG size of input: 200 DAG size of output 51 [2018-01-28 22:31:21,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:21,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 68 [2018-01-28 22:31:21,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-28 22:31:22,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:22,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:22,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-01-28 22:31:22,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:22,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:22,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:22,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-28 22:31:22,086 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:22,242 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:22,242 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:22,244 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:22,244 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:22,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 92 [2018-01-28 22:31:22,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-28 22:31:22,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:22,491 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:22,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-01-28 22:31:22,492 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:22,497 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:22,503 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:22,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-28 22:31:22,504 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:22,721 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:22,725 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:22,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:22,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 90 [2018-01-28 22:31:22,734 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-28 22:31:23,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:23,058 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:23,059 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:23,061 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:23,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 90 [2018-01-28 22:31:23,069 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-28 22:31:23,361 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:23,362 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:23,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-28 22:31:23,363 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:23,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:23,366 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:23,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-01-28 22:31:23,367 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:23,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:23,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:23,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-01-28 22:31:23,616 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:23,619 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:23,619 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:31:23,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-28 22:31:23,620 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-28 22:31:23,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 8 dim-1 vars, End of recursive call: 32 dim-0 vars, and 8 xjuncts. [2018-01-28 22:31:23,888 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 28 variables, input treesize:245, output treesize:357 [2018-01-28 22:31:24,255 WARN L146 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 200 DAG size of output 51 [2018-01-28 22:31:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-28 22:31:24,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:31:24,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-01-28 22:31:24,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-28 22:31:24,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-28 22:31:24,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1011, Unknown=2, NotChecked=0, Total=1122 [2018-01-28 22:31:24,310 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 34 states. [2018-01-28 22:31:24,540 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 55 DAG size of output 52 [2018-01-28 22:31:24,721 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 67 DAG size of output 64 Received shutdown request... [2018-01-28 22:31:33,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:31:33,138 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 22:31:33,141 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 22:31:33,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:31:33 BoogieIcfgContainer [2018-01-28 22:31:33,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 22:31:33,142 INFO L168 Benchmark]: Toolchain (without parser) took 148524.82 ms. Allocated memory was 303.0 MB in the beginning and 528.5 MB in the end (delta: 225.4 MB). Free memory was 262.1 MB in the beginning and 432.9 MB in the end (delta: -170.8 MB). Peak memory consumption was 54.6 MB. Max. memory is 5.3 GB. [2018-01-28 22:31:33,143 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:31:33,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.54 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 249.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-28 22:31:33,144 INFO L168 Benchmark]: Boogie Preprocessor took 34.39 ms. Allocated memory is still 303.0 MB. Free memory was 249.0 MB in the beginning and 247.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:31:33,144 INFO L168 Benchmark]: RCFGBuilder took 236.65 ms. Allocated memory is still 303.0 MB. Free memory was 247.0 MB in the beginning and 228.3 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 5.3 GB. [2018-01-28 22:31:33,144 INFO L168 Benchmark]: TraceAbstraction took 148029.75 ms. Allocated memory was 303.0 MB in the beginning and 528.5 MB in the end (delta: 225.4 MB). Free memory was 228.3 MB in the beginning and 432.9 MB in the end (delta: -204.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 5.3 GB. [2018-01-28 22:31:33,145 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.54 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 249.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.39 ms. Allocated memory is still 303.0 MB. Free memory was 249.0 MB in the beginning and 247.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 236.65 ms. Allocated memory is still 303.0 MB. Free memory was 247.0 MB in the beginning and 228.3 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 148029.75 ms. Allocated memory was 303.0 MB in the beginning and 528.5 MB in the end (delta: 225.4 MB). Free memory was 228.3 MB in the beginning and 432.9 MB in the end (delta: -204.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (93states) and interpolant automaton (currently 11 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 41 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (93states) and interpolant automaton (currently 11 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 41 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (93states) and interpolant automaton (currently 11 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 41 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (93states) and interpolant automaton (currently 11 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 41 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (93states) and interpolant automaton (currently 11 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 41 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (93states) and interpolant automaton (currently 11 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 41 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (93states) and interpolant automaton (currently 11 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 41 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (93states) and interpolant automaton (currently 11 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 41 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (93states) and interpolant automaton (currently 11 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 41 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 9 error locations. TIMEOUT Result, 147.9s OverallTime, 21 OverallIterations, 4 TraceHistogramMax, 109.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1128 SDtfs, 1827 SDslu, 7532 SDs, 0 SdLazy, 5296 SolverSat, 278 SolverUnsat, 89 SolverUnknown, 0 SolverNotchecked, 86.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1208 GetRequests, 755 SyntacticMatches, 32 SemanticMatches, 420 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3030 ImplicationChecksByTransitivity, 47.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=18, 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.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 313 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 36.9s InterpolantComputationTime, 1866 NumberOfCodeBlocks, 1866 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1830 ConstructedInterpolants, 195 QuantifiedInterpolants, 1186151 SizeOfPredicates, 114 NumberOfNonLiveVariables, 2370 ConjunctsInSsa, 337 ConjunctsInUnsatCore, 36 InterpolantComputations, 8 PerfectInterpolantSequences, 414/726 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_22-31-33-153.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_22-31-33-153.csv Completed graceful shutdown