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/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/reducercommutativity/sum10_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d63d1fb [2018-01-27 23:07:11,450 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-27 23:07:11,452 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-27 23:07:11,469 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-27 23:07:11,470 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-27 23:07:11,471 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-27 23:07:11,472 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-27 23:07:11,474 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-27 23:07:11,477 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-27 23:07:11,478 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-27 23:07:11,479 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-27 23:07:11,479 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-27 23:07:11,480 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-27 23:07:11,482 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-27 23:07:11,483 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-27 23:07:11,485 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-27 23:07:11,487 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-27 23:07:11,490 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-27 23:07:11,491 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-27 23:07:11,493 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-27 23:07:11,495 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-27 23:07:11,495 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-27 23:07:11,496 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-27 23:07:11,497 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-27 23:07:11,498 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-27 23:07:11,499 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-27 23:07:11,499 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-27 23:07:11,500 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-27 23:07:11,500 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-27 23:07:11,501 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-27 23:07:11,501 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-27 23:07:11,502 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-27 23:07:11,513 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-27 23:07:11,513 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-27 23:07:11,514 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-27 23:07:11,514 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-27 23:07:11,515 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-27 23:07:11,515 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-27 23:07:11,515 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-27 23:07:11,516 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-27 23:07:11,516 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-27 23:07:11,517 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-27 23:07:11,517 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-27 23:07:11,517 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-27 23:07:11,517 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-27 23:07:11,517 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-27 23:07:11,518 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-27 23:07:11,518 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-27 23:07:11,518 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-27 23:07:11,518 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-27 23:07:11,518 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-27 23:07:11,519 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-27 23:07:11,519 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-27 23:07:11,519 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-27 23:07:11,519 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-27 23:07:11,519 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-27 23:07:11,520 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-27 23:07:11,520 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-27 23:07:11,520 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-27 23:07:11,520 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-27 23:07:11,520 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-27 23:07:11,521 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-27 23:07:11,521 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-27 23:07:11,521 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-27 23:07:11,521 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-27 23:07:11,521 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-27 23:07:11,522 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-27 23:07:11,523 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-27 23:07:11,523 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-27 23:07:11,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-27 23:07:11,595 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-27 23:07:11,599 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-27 23:07:11,600 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-27 23:07:11,601 INFO L276 PluginConnector]: CDTParser initialized [2018-01-27 23:07:11,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum10_true-unreach-call_true-termination.i [2018-01-27 23:07:11,817 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-27 23:07:11,824 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-27 23:07:11,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-27 23:07:11,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-27 23:07:11,835 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-27 23:07:11,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:07:11" (1/1) ... [2018-01-27 23:07:11,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@523eec15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:11, skipping insertion in model container [2018-01-27 23:07:11,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:07:11" (1/1) ... [2018-01-27 23:07:11,859 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-27 23:07:11,882 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-27 23:07:12,070 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-27 23:07:12,098 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-27 23:07:12,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:12 WrapperNode [2018-01-27 23:07:12,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-27 23:07:12,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-27 23:07:12,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-27 23:07:12,112 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-27 23:07:12,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:12" (1/1) ... [2018-01-27 23:07:12,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:12" (1/1) ... [2018-01-27 23:07:12,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:12" (1/1) ... [2018-01-27 23:07:12,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:12" (1/1) ... [2018-01-27 23:07:12,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:12" (1/1) ... [2018-01-27 23:07:12,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:12" (1/1) ... [2018-01-27 23:07:12,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:12" (1/1) ... [2018-01-27 23:07:12,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-27 23:07:12,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-27 23:07:12,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-27 23:07:12,165 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-27 23:07:12,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:12" (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-27 23:07:12,244 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-27 23:07:12,245 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-27 23:07:12,245 INFO L136 BoogieDeclarations]: Found implementation of procedure sum [2018-01-27 23:07:12,247 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-27 23:07:12,248 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-27 23:07:12,248 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-27 23:07:12,248 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-27 23:07:12,248 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-27 23:07:12,248 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-27 23:07:12,249 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-27 23:07:12,249 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-27 23:07:12,249 INFO L128 BoogieDeclarations]: Found specification of procedure sum [2018-01-27 23:07:12,249 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-27 23:07:12,249 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-27 23:07:12,249 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-27 23:07:12,818 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-27 23:07:12,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:07:12 BoogieIcfgContainer [2018-01-27 23:07:12,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-27 23:07:12,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-27 23:07:12,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-27 23:07:12,823 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-27 23:07:12,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 11:07:11" (1/3) ... [2018-01-27 23:07:12,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e66276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:07:12, skipping insertion in model container [2018-01-27 23:07:12,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:12" (2/3) ... [2018-01-27 23:07:12,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e66276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:07:12, skipping insertion in model container [2018-01-27 23:07:12,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:07:12" (3/3) ... [2018-01-27 23:07:12,827 INFO L105 eAbstractionObserver]: Analyzing ICFG sum10_true-unreach-call_true-termination.i [2018-01-27 23:07:12,836 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-27 23:07:12,843 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-27 23:07:12,893 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:07:12,893 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:07:12,893 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:07:12,893 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:07:12,893 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:07:12,894 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:07:12,894 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:07:12,894 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-27 23:07:12,895 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:07:12,919 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-27 23:07:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-27 23:07:12,929 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:12,934 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-27 23:07:12,934 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-27 23:07:12,940 INFO L82 PathProgramCache]: Analyzing trace with hash 114361, now seen corresponding path program 1 times [2018-01-27 23:07:12,943 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:12,944 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:13,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:13,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:13,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:07:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:07:13,098 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-27 23:07:13,106 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:07:13,119 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:07:13,119 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:07:13,119 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:07:13,119 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:07:13,119 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:07:13,119 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:07:13,120 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:07:13,120 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-27 23:07:13,120 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:07:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-27 23:07:13,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-27 23:07:13,125 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:13,126 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:07:13,126 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:13,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1258483300, now seen corresponding path program 1 times [2018-01-27 23:07:13,127 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:13,127 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:13,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:13,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:13,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:13,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-27 23:07:13,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:07:13,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 23:07:13,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 23:07:13,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 23:07:13,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:07:13,277 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-01-27 23:07:13,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:13,317 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2018-01-27 23:07:13,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 23:07:13,319 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 46 [2018-01-27 23:07:13,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:13,333 INFO L225 Difference]: With dead ends: 94 [2018-01-27 23:07:13,333 INFO L226 Difference]: Without dead ends: 50 [2018-01-27 23:07:13,339 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:07:13,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-27 23:07:13,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-27 23:07:13,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-27 23:07:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-27 23:07:13,550 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 46 [2018-01-27 23:07:13,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:13,550 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-27 23:07:13,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 23:07:13,550 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-27 23:07:13,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-27 23:07:13,555 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:13,555 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:07:13,555 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:13,556 INFO L82 PathProgramCache]: Analyzing trace with hash -983082746, now seen corresponding path program 1 times [2018-01-27 23:07:13,556 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:13,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:13,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:13,560 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:13,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:13,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:13,775 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-27 23:07:13,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:07:13,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 23:07:13,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 23:07:13,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 23:07:13,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:07:13,780 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 3 states. [2018-01-27 23:07:13,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:13,895 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-01-27 23:07:13,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:07:13,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-01-27 23:07:13,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:13,898 INFO L225 Difference]: With dead ends: 93 [2018-01-27 23:07:13,899 INFO L226 Difference]: Without dead ends: 55 [2018-01-27 23:07:13,900 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:07:13,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-27 23:07:13,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-01-27 23:07:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-27 23:07:13,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-27 23:07:13,912 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 51 [2018-01-27 23:07:13,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:13,913 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-27 23:07:13,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 23:07:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-27 23:07:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-27 23:07:13,915 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:13,916 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:07:13,916 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:13,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1286187467, now seen corresponding path program 1 times [2018-01-27 23:07:13,916 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:13,917 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:13,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:13,918 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:13,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:13,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-27 23:07:14,064 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:14,064 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-27 23:07:14,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:14,175 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:14,293 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-27 23:07:14,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-27 23:07:14,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-01-27 23:07:14,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-27 23:07:14,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-27 23:07:14,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-27 23:07:14,332 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 4 states. [2018-01-27 23:07:14,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:14,422 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2018-01-27 23:07:14,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:07:14,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-01-27 23:07:14,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:14,425 INFO L225 Difference]: With dead ends: 94 [2018-01-27 23:07:14,425 INFO L226 Difference]: Without dead ends: 57 [2018-01-27 23:07:14,426 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-27 23:07:14,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-27 23:07:14,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-01-27 23:07:14,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-27 23:07:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-27 23:07:14,434 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 56 [2018-01-27 23:07:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:14,434 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-27 23:07:14,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-27 23:07:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-27 23:07:14,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-27 23:07:14,437 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:14,437 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:07:14,437 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:14,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1323141693, now seen corresponding path program 1 times [2018-01-27 23:07:14,438 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:14,438 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:14,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:14,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:14,440 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:14,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:07:14,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:07:14,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 23:07:14,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 23:07:14,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 23:07:14,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:07:14,572 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 3 states. [2018-01-27 23:07:14,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:14,670 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-01-27 23:07:14,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:07:14,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-01-27 23:07:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:14,679 INFO L225 Difference]: With dead ends: 82 [2018-01-27 23:07:14,679 INFO L226 Difference]: Without dead ends: 60 [2018-01-27 23:07:14,680 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:07:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-27 23:07:14,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-01-27 23:07:14,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-27 23:07:14,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-27 23:07:14,689 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 71 [2018-01-27 23:07:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:14,691 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-27 23:07:14,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 23:07:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-27 23:07:14,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-27 23:07:14,693 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:14,694 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:07:14,694 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:14,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1123185973, now seen corresponding path program 1 times [2018-01-27 23:07:14,694 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:14,694 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:14,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:14,696 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:14,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:14,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:07:14,890 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:14,891 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-27 23:07:14,903 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:14,989 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:07:15,151 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:15,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-01-27 23:07:15,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-27 23:07:15,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-27 23:07:15,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 23:07:15,152 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2018-01-27 23:07:15,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:15,315 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-01-27 23:07:15,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-27 23:07:15,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-01-27 23:07:15,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:15,319 INFO L225 Difference]: With dead ends: 106 [2018-01-27 23:07:15,319 INFO L226 Difference]: Without dead ends: 64 [2018-01-27 23:07:15,320 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 23:07:15,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-27 23:07:15,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-01-27 23:07:15,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-27 23:07:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-27 23:07:15,328 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 77 [2018-01-27 23:07:15,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:15,328 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-27 23:07:15,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-27 23:07:15,328 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-27 23:07:15,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-27 23:07:15,330 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:15,330 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:07:15,330 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:15,331 INFO L82 PathProgramCache]: Analyzing trace with hash 651249060, now seen corresponding path program 2 times [2018-01-27 23:07:15,331 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:15,331 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:15,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:15,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:15,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:15,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:15,499 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:07:15,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:15,499 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-27 23:07:15,512 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-27 23:07:15,549 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:15,577 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:15,592 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:15,597 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:07:15,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:15,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-27 23:07:15,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-27 23:07:15,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-27 23:07:15,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-27 23:07:15,655 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 6 states. [2018-01-27 23:07:15,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:15,689 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-01-27 23:07:15,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-27 23:07:15,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-01-27 23:07:15,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:15,691 INFO L225 Difference]: With dead ends: 111 [2018-01-27 23:07:15,691 INFO L226 Difference]: Without dead ends: 69 [2018-01-27 23:07:15,692 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-27 23:07:15,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-27 23:07:15,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-01-27 23:07:15,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-27 23:07:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-01-27 23:07:15,702 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 82 [2018-01-27 23:07:15,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:15,702 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-01-27 23:07:15,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-27 23:07:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-01-27 23:07:15,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-27 23:07:15,704 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:15,704 INFO L330 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:07:15,704 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:15,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1424072043, now seen corresponding path program 3 times [2018-01-27 23:07:15,705 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:15,705 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:15,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:15,706 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:15,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:15,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:07:15,908 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:15,908 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-27 23:07:15,918 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-27 23:07:15,937 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:07:15,944 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:07:15,955 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:15,960 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-27 23:07:16,035 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:16,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-01-27 23:07:16,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-27 23:07:16,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-27 23:07:16,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:07:16,037 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 8 states. [2018-01-27 23:07:16,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:16,114 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2018-01-27 23:07:16,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-27 23:07:16,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-01-27 23:07:16,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:16,118 INFO L225 Difference]: With dead ends: 124 [2018-01-27 23:07:16,118 INFO L226 Difference]: Without dead ends: 82 [2018-01-27 23:07:16,119 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:07:16,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-27 23:07:16,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2018-01-27 23:07:16,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-27 23:07:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-01-27 23:07:16,131 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 87 [2018-01-27 23:07:16,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:16,131 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-01-27 23:07:16,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-27 23:07:16,132 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-01-27 23:07:16,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-27 23:07:16,134 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:16,134 INFO L330 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:07:16,134 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:16,134 INFO L82 PathProgramCache]: Analyzing trace with hash -748922802, now seen corresponding path program 4 times [2018-01-27 23:07:16,134 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:16,134 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:16,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:16,136 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:16,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:16,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-01-27 23:07:16,523 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:16,523 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-27 23:07:16,533 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-27 23:07:16,579 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:16,585 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-01-27 23:07:16,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:16,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-27 23:07:16,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-27 23:07:16,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-27 23:07:16,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:07:16,675 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 8 states. [2018-01-27 23:07:17,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:17,022 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-01-27 23:07:17,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-27 23:07:17,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2018-01-27 23:07:17,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:17,024 INFO L225 Difference]: With dead ends: 131 [2018-01-27 23:07:17,024 INFO L226 Difference]: Without dead ends: 84 [2018-01-27 23:07:17,025 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:07:17,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-27 23:07:17,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-01-27 23:07:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-27 23:07:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-01-27 23:07:17,033 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 107 [2018-01-27 23:07:17,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:17,034 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-01-27 23:07:17,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-27 23:07:17,034 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-01-27 23:07:17,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-27 23:07:17,036 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:17,037 INFO L330 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:07:17,037 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:17,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1381891197, now seen corresponding path program 5 times [2018-01-27 23:07:17,037 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:17,037 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:17,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:17,038 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:17,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:17,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:17,406 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-01-27 23:07:17,406 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:17,406 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-27 23:07:17,412 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-27 23:07:17,432 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:17,449 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:17,459 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:17,470 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:17,487 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:17,504 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:17,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:17,655 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 62 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-27 23:07:17,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:17,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-01-27 23:07:17,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-27 23:07:17,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-27 23:07:17,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:07:17,679 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 11 states. [2018-01-27 23:07:17,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:17,905 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2018-01-27 23:07:17,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-27 23:07:17,907 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 112 [2018-01-27 23:07:17,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:17,909 INFO L225 Difference]: With dead ends: 144 [2018-01-27 23:07:17,909 INFO L226 Difference]: Without dead ends: 97 [2018-01-27 23:07:17,910 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:07:17,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-27 23:07:17,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2018-01-27 23:07:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-27 23:07:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-01-27 23:07:17,930 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 112 [2018-01-27 23:07:17,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:17,930 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-01-27 23:07:17,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-27 23:07:17,931 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-01-27 23:07:17,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-01-27 23:07:17,934 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:17,934 INFO L330 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 7, 6, 6, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:07:17,934 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:17,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1272996132, now seen corresponding path program 6 times [2018-01-27 23:07:17,934 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:17,935 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:17,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:17,936 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:17,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:17,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:18,290 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-01-27 23:07:18,290 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:18,290 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-27 23:07:18,300 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-27 23:07:18,323 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:18,338 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:18,356 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:18,374 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:18,381 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:18,383 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:18,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 126 proven. 2 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-01-27 23:07:18,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:18,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-01-27 23:07:18,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-27 23:07:18,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-27 23:07:18,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:07:18,468 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 11 states. [2018-01-27 23:07:18,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:18,593 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2018-01-27 23:07:18,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-27 23:07:18,596 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 132 [2018-01-27 23:07:18,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:18,597 INFO L225 Difference]: With dead ends: 161 [2018-01-27 23:07:18,598 INFO L226 Difference]: Without dead ends: 109 [2018-01-27 23:07:18,598 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:07:18,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-27 23:07:18,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2018-01-27 23:07:18,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-27 23:07:18,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2018-01-27 23:07:18,609 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 132 [2018-01-27 23:07:18,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:18,610 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2018-01-27 23:07:18,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-27 23:07:18,610 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-01-27 23:07:18,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-01-27 23:07:18,612 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:18,612 INFO L330 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 8, 7, 7, 7, 7, 3, 3, 3, 3, 3, 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] [2018-01-27 23:07:18,613 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:18,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1486344909, now seen corresponding path program 7 times [2018-01-27 23:07:18,613 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:18,613 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:18,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:18,614 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:18,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:18,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:18,916 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-01-27 23:07:18,916 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:18,916 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-27 23:07:18,922 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:18,959 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-01-27 23:07:19,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:19,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-01-27 23:07:19,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-27 23:07:19,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-27 23:07:19,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:07:19,006 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 11 states. [2018-01-27 23:07:19,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:19,066 INFO L93 Difference]: Finished difference Result 168 states and 176 transitions. [2018-01-27 23:07:19,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-27 23:07:19,067 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 143 [2018-01-27 23:07:19,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:19,068 INFO L225 Difference]: With dead ends: 168 [2018-01-27 23:07:19,068 INFO L226 Difference]: Without dead ends: 110 [2018-01-27 23:07:19,069 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:07:19,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-27 23:07:19,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2018-01-27 23:07:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-27 23:07:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-01-27 23:07:19,077 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 143 [2018-01-27 23:07:19,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:19,077 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-01-27 23:07:19,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-27 23:07:19,078 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-01-27 23:07:19,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-01-27 23:07:19,080 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:19,080 INFO L330 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 9, 9, 8, 8, 8, 8, 3, 3, 3, 3, 3, 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] [2018-01-27 23:07:19,080 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:19,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1248283516, now seen corresponding path program 8 times [2018-01-27 23:07:19,081 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:19,081 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:19,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:19,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:19,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:19,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:19,352 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-01-27 23:07:19,352 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:19,352 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-27 23:07:19,357 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-27 23:07:19,375 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:19,400 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:19,403 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:19,406 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-01-27 23:07:19,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:19,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-01-27 23:07:19,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-27 23:07:19,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-27 23:07:19,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:07:19,493 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 12 states. [2018-01-27 23:07:19,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:19,544 INFO L93 Difference]: Finished difference Result 173 states and 181 transitions. [2018-01-27 23:07:19,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-27 23:07:19,545 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 148 [2018-01-27 23:07:19,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:19,546 INFO L225 Difference]: With dead ends: 173 [2018-01-27 23:07:19,546 INFO L226 Difference]: Without dead ends: 115 [2018-01-27 23:07:19,546 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:07:19,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-27 23:07:19,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2018-01-27 23:07:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-27 23:07:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2018-01-27 23:07:19,553 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 148 [2018-01-27 23:07:19,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:19,553 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2018-01-27 23:07:19,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-27 23:07:19,553 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2018-01-27 23:07:19,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-01-27 23:07:19,554 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:19,555 INFO L330 BasicCegarLoop]: trace histogram [12, 10, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 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] [2018-01-27 23:07:19,555 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:19,555 INFO L82 PathProgramCache]: Analyzing trace with hash 304277549, now seen corresponding path program 9 times [2018-01-27 23:07:19,555 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:19,555 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:19,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:19,556 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:19,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:19,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-01-27 23:07:20,109 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:20,109 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-27 23:07:20,115 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-27 23:07:20,140 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:07:20,158 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:07:20,171 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:07:20,188 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:07:20,193 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:20,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 124 proven. 21 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-01-27 23:07:20,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:20,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2018-01-27 23:07:20,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-27 23:07:20,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-27 23:07:20,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-01-27 23:07:20,418 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand 16 states. [2018-01-27 23:07:20,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:20,564 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2018-01-27 23:07:20,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-27 23:07:20,565 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 153 [2018-01-27 23:07:20,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:20,566 INFO L225 Difference]: With dead ends: 183 [2018-01-27 23:07:20,567 INFO L226 Difference]: Without dead ends: 125 [2018-01-27 23:07:20,567 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-01-27 23:07:20,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-27 23:07:20,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-01-27 23:07:20,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-27 23:07:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2018-01-27 23:07:20,574 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 153 [2018-01-27 23:07:20,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:20,574 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2018-01-27 23:07:20,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-27 23:07:20,574 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2018-01-27 23:07:20,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-01-27 23:07:20,575 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:20,575 INFO L330 BasicCegarLoop]: trace histogram [15, 12, 12, 12, 12, 11, 10, 10, 10, 10, 3, 3, 3, 3, 3, 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] [2018-01-27 23:07:20,575 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:20,575 INFO L82 PathProgramCache]: Analyzing trace with hash 842916598, now seen corresponding path program 10 times [2018-01-27 23:07:20,575 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:20,576 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:20,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:20,576 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:20,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:20,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:20,974 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-01-27 23:07:20,974 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:20,974 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-27 23:07:20,980 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-27 23:07:21,028 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:21,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 198 proven. 38 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2018-01-27 23:07:21,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:21,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-27 23:07:21,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-27 23:07:21,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-27 23:07:21,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:07:21,104 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 8 states. [2018-01-27 23:07:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:21,129 INFO L93 Difference]: Finished difference Result 192 states and 202 transitions. [2018-01-27 23:07:21,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-27 23:07:21,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 173 [2018-01-27 23:07:21,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:21,131 INFO L225 Difference]: With dead ends: 192 [2018-01-27 23:07:21,131 INFO L226 Difference]: Without dead ends: 130 [2018-01-27 23:07:21,132 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:07:21,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-27 23:07:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2018-01-27 23:07:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-27 23:07:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2018-01-27 23:07:21,139 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 173 [2018-01-27 23:07:21,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:21,139 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2018-01-27 23:07:21,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-27 23:07:21,139 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-01-27 23:07:21,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-01-27 23:07:21,141 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:21,141 INFO L330 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 11, 10, 10, 10, 10, 3, 3, 3, 3, 3, 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] [2018-01-27 23:07:21,141 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:21,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1312513444, now seen corresponding path program 11 times [2018-01-27 23:07:21,141 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:21,141 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:21,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:21,144 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:21,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:21,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-01-27 23:07:21,376 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:21,376 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-27 23:07:21,383 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-27 23:07:21,396 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:21,398 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:21,402 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:21,406 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:21,410 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:21,416 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:21,421 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:21,430 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:21,437 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:21,456 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:21,504 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:21,518 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:21,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 296 proven. 60 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2018-01-27 23:07:21,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:21,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-01-27 23:07:21,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-27 23:07:21,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-27 23:07:21,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-27 23:07:21,690 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 9 states. [2018-01-27 23:07:22,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:22,086 INFO L93 Difference]: Finished difference Result 202 states and 212 transitions. [2018-01-27 23:07:22,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-27 23:07:22,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 188 [2018-01-27 23:07:22,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:22,090 INFO L225 Difference]: With dead ends: 202 [2018-01-27 23:07:22,090 INFO L226 Difference]: Without dead ends: 135 [2018-01-27 23:07:22,091 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-27 23:07:22,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-27 23:07:22,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2018-01-27 23:07:22,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-27 23:07:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2018-01-27 23:07:22,101 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 188 [2018-01-27 23:07:22,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:22,101 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2018-01-27 23:07:22,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-27 23:07:22,101 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2018-01-27 23:07:22,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-01-27 23:07:22,103 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:22,103 INFO L330 BasicCegarLoop]: trace histogram [21, 18, 18, 18, 18, 11, 10, 10, 10, 10, 3, 3, 3, 3, 3, 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] [2018-01-27 23:07:22,103 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:22,103 INFO L82 PathProgramCache]: Analyzing trace with hash -917625418, now seen corresponding path program 12 times [2018-01-27 23:07:22,103 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:22,104 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:22,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:22,104 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:22,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:22,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 0 proven. 505 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2018-01-27 23:07:22,444 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:22,444 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-27 23:07:22,449 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-27 23:07:22,469 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:22,474 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:22,479 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:22,482 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:22,486 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:22,489 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:22,494 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:22,495 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:22,499 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 420 proven. 10 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2018-01-27 23:07:22,596 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:22,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2018-01-27 23:07:22,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-27 23:07:22,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-27 23:07:22,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:07:22,598 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand 12 states. [2018-01-27 23:07:22,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:22,668 INFO L93 Difference]: Finished difference Result 222 states and 233 transitions. [2018-01-27 23:07:22,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-27 23:07:22,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 203 [2018-01-27 23:07:22,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:22,670 INFO L225 Difference]: With dead ends: 222 [2018-01-27 23:07:22,670 INFO L226 Difference]: Without dead ends: 150 [2018-01-27 23:07:22,670 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:07:22,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-27 23:07:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 143. [2018-01-27 23:07:22,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-27 23:07:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-01-27 23:07:22,678 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 203 [2018-01-27 23:07:22,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:22,679 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-01-27 23:07:22,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-27 23:07:22,680 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-01-27 23:07:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-01-27 23:07:22,682 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:22,682 INFO L330 BasicCegarLoop]: trace histogram [24, 21, 21, 21, 21, 11, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:07:22,682 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:22,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1461290924, now seen corresponding path program 13 times [2018-01-27 23:07:22,682 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:22,683 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:22,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:22,684 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:22,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:22,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2018-01-27 23:07:22,966 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:22,966 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-27 23:07:22,972 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:23,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 552 proven. 119 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2018-01-27 23:07:23,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:23,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-01-27 23:07:23,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-27 23:07:23,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-27 23:07:23,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:07:23,117 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 11 states. [2018-01-27 23:07:23,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:23,166 INFO L93 Difference]: Finished difference Result 234 states and 244 transitions. [2018-01-27 23:07:23,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-27 23:07:23,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 224 [2018-01-27 23:07:23,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:23,168 INFO L225 Difference]: With dead ends: 234 [2018-01-27 23:07:23,168 INFO L226 Difference]: Without dead ends: 151 [2018-01-27 23:07:23,169 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:07:23,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-27 23:07:23,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2018-01-27 23:07:23,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-27 23:07:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 152 transitions. [2018-01-27 23:07:23,177 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 152 transitions. Word has length 224 [2018-01-27 23:07:23,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:23,177 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 152 transitions. [2018-01-27 23:07:23,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-27 23:07:23,178 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-01-27 23:07:23,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-01-27 23:07:23,182 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:23,182 INFO L330 BasicCegarLoop]: trace histogram [27, 24, 24, 24, 24, 11, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:07:23,182 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:23,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1050356674, now seen corresponding path program 14 times [2018-01-27 23:07:23,182 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:23,183 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:23,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:23,183 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:23,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:23,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1811 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 941 trivial. 0 not checked. [2018-01-27 23:07:23,806 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:23,806 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-27 23:07:23,811 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-27 23:07:23,830 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:23,862 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:23,875 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:23,882 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1811 backedges. 710 proven. 156 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2018-01-27 23:07:23,997 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:23,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-01-27 23:07:23,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-27 23:07:23,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-27 23:07:23,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:07:23,998 INFO L87 Difference]: Start difference. First operand 148 states and 152 transitions. Second operand 12 states. [2018-01-27 23:07:24,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:24,082 INFO L93 Difference]: Finished difference Result 244 states and 254 transitions. [2018-01-27 23:07:24,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-27 23:07:24,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 239 [2018-01-27 23:07:24,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:24,084 INFO L225 Difference]: With dead ends: 244 [2018-01-27 23:07:24,084 INFO L226 Difference]: Without dead ends: 156 [2018-01-27 23:07:24,085 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:07:24,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-27 23:07:24,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2018-01-27 23:07:24,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-27 23:07:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2018-01-27 23:07:24,092 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 239 [2018-01-27 23:07:24,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:24,092 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2018-01-27 23:07:24,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-27 23:07:24,093 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-01-27 23:07:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-01-27 23:07:24,094 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:24,095 INFO L330 BasicCegarLoop]: trace histogram [30, 27, 27, 27, 27, 11, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:07:24,095 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:24,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1331907948, now seen corresponding path program 15 times [2018-01-27 23:07:24,095 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:24,095 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:24,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:24,096 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:24,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:24,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 0 proven. 1090 refuted. 0 times theorem prover too weak. 1114 trivial. 0 not checked. [2018-01-27 23:07:24,535 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:24,535 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:07:24,540 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-27 23:07:24,564 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:07:24,581 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:07:24,600 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:07:24,612 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:07:24,629 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-27 23:07:24,637 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:24,643 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:24,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 894 proven. 24 refuted. 0 times theorem prover too weak. 1286 trivial. 0 not checked. [2018-01-27 23:07:24,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:24,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2018-01-27 23:07:24,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-27 23:07:24,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-27 23:07:24,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-01-27 23:07:24,807 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 16 states. [2018-01-27 23:07:24,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:24,885 INFO L93 Difference]: Finished difference Result 261 states and 272 transitions. [2018-01-27 23:07:24,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-27 23:07:24,885 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 254 [2018-01-27 23:07:24,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:24,887 INFO L225 Difference]: With dead ends: 261 [2018-01-27 23:07:24,887 INFO L226 Difference]: Without dead ends: 168 [2018-01-27 23:07:24,888 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-01-27 23:07:24,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-27 23:07:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2018-01-27 23:07:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-27 23:07:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 168 transitions. [2018-01-27 23:07:24,895 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 168 transitions. Word has length 254 [2018-01-27 23:07:24,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:24,895 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 168 transitions. [2018-01-27 23:07:24,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-27 23:07:24,896 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2018-01-27 23:07:24,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-01-27 23:07:24,897 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:24,898 INFO L330 BasicCegarLoop]: trace histogram [33, 30, 30, 30, 30, 11, 10, 10, 10, 10, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:07:24,898 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:24,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1703114554, now seen corresponding path program 16 times [2018-01-27 23:07:24,898 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:24,898 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:24,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:24,899 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:24,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:24,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:25,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2662 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 2618 trivial. 0 not checked. [2018-01-27 23:07:25,324 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:25,324 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-27 23:07:25,337 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:07:25,409 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:25,416 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2662 backedges. 1092 proven. 44 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2018-01-27 23:07:25,517 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:25,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-27 23:07:25,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-27 23:07:25,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-27 23:07:25,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:07:25,518 INFO L87 Difference]: Start difference. First operand 164 states and 168 transitions. Second operand 8 states. [2018-01-27 23:07:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:25,549 INFO L93 Difference]: Finished difference Result 241 states and 246 transitions. [2018-01-27 23:07:25,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-27 23:07:25,549 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 275 [2018-01-27 23:07:25,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:25,552 INFO L225 Difference]: With dead ends: 241 [2018-01-27 23:07:25,552 INFO L226 Difference]: Without dead ends: 174 [2018-01-27 23:07:25,552 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-01-27 23:07:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-27 23:07:25,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2018-01-27 23:07:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-27 23:07:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 174 transitions. [2018-01-27 23:07:25,560 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 174 transitions. Word has length 275 [2018-01-27 23:07:25,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:25,561 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 174 transitions. [2018-01-27 23:07:25,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-27 23:07:25,561 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 174 transitions. [2018-01-27 23:07:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-01-27 23:07:25,563 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:25,563 INFO L330 BasicCegarLoop]: trace histogram [33, 30, 30, 30, 30, 11, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:07:25,563 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:25,564 INFO L82 PathProgramCache]: Analyzing trace with hash -616092018, now seen corresponding path program 17 times [2018-01-27 23:07:25,564 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:25,564 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:25,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:25,565 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:25,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:25,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:26,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2618 trivial. 0 not checked. [2018-01-27 23:07:26,384 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:26,384 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:07:26,398 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-27 23:07:26,418 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,424 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,425 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,426 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,427 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,428 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,432 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,434 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,435 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,437 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,439 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,442 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,445 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,449 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,454 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,463 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,472 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,534 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,621 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,686 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,792 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:26,794 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:26,802 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:26,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 1092 proven. 70 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2018-01-27 23:07:26,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:26,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-01-27 23:07:26,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-27 23:07:26,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-27 23:07:26,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-27 23:07:26,980 INFO L87 Difference]: Start difference. First operand 170 states and 174 transitions. Second operand 9 states. [2018-01-27 23:07:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:27,401 INFO L93 Difference]: Finished difference Result 247 states and 252 transitions. [2018-01-27 23:07:27,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-27 23:07:27,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 281 [2018-01-27 23:07:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:27,404 INFO L225 Difference]: With dead ends: 247 [2018-01-27 23:07:27,404 INFO L226 Difference]: Without dead ends: 180 [2018-01-27 23:07:27,404 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-01-27 23:07:27,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-27 23:07:27,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2018-01-27 23:07:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-27 23:07:27,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 180 transitions. [2018-01-27 23:07:27,414 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 180 transitions. Word has length 281 [2018-01-27 23:07:27,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:27,415 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 180 transitions. [2018-01-27 23:07:27,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-27 23:07:27,415 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 180 transitions. [2018-01-27 23:07:27,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-01-27 23:07:27,417 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:27,417 INFO L330 BasicCegarLoop]: trace histogram [33, 30, 30, 30, 30, 11, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:07:27,420 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:27,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1801429418, now seen corresponding path program 18 times [2018-01-27 23:07:27,420 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:27,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:27,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:27,421 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:27,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:27,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2720 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 2618 trivial. 0 not checked. [2018-01-27 23:07:28,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:28,162 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:07:28,169 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-27 23:07:28,196 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:28,210 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:28,232 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:28,241 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:28,251 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:28,254 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:28,259 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:28,263 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:28,269 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:28,294 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:28,301 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:28,338 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:28,349 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:28,427 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:28,553 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-27 23:07:28,555 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:28,562 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2720 backedges. 1092 proven. 102 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2018-01-27 23:07:28,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:28,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-27 23:07:28,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-27 23:07:28,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-27 23:07:28,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-01-27 23:07:28,652 INFO L87 Difference]: Start difference. First operand 176 states and 180 transitions. Second operand 10 states. [2018-01-27 23:07:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:28,799 INFO L93 Difference]: Finished difference Result 253 states and 258 transitions. [2018-01-27 23:07:28,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-27 23:07:28,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 287 [2018-01-27 23:07:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:28,801 INFO L225 Difference]: With dead ends: 253 [2018-01-27 23:07:28,801 INFO L226 Difference]: Without dead ends: 186 [2018-01-27 23:07:28,802 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-01-27 23:07:28,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-27 23:07:28,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 182. [2018-01-27 23:07:28,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-27 23:07:28,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 186 transitions. [2018-01-27 23:07:28,809 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 186 transitions. Word has length 287 [2018-01-27 23:07:28,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:28,810 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 186 transitions. [2018-01-27 23:07:28,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-27 23:07:28,810 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 186 transitions. [2018-01-27 23:07:28,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-01-27 23:07:28,812 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:28,813 INFO L330 BasicCegarLoop]: trace histogram [33, 30, 30, 30, 30, 11, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:07:28,813 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:28,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1074227170, now seen corresponding path program 19 times [2018-01-27 23:07:28,813 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:28,813 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:28,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:28,814 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:28,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:28,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:29,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 2618 trivial. 0 not checked. [2018-01-27 23:07:29,137 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:29,137 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:07:29,142 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:29,209 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:29,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1092 proven. 140 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2018-01-27 23:07:29,387 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:29,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-01-27 23:07:29,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-27 23:07:29,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-27 23:07:29,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:07:29,389 INFO L87 Difference]: Start difference. First operand 182 states and 186 transitions. Second operand 11 states. [2018-01-27 23:07:29,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:29,454 INFO L93 Difference]: Finished difference Result 259 states and 264 transitions. [2018-01-27 23:07:29,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-27 23:07:29,454 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 293 [2018-01-27 23:07:29,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:29,456 INFO L225 Difference]: With dead ends: 259 [2018-01-27 23:07:29,456 INFO L226 Difference]: Without dead ends: 192 [2018-01-27 23:07:29,457 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:07:29,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-27 23:07:29,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2018-01-27 23:07:29,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-27 23:07:29,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 192 transitions. [2018-01-27 23:07:29,467 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 192 transitions. Word has length 293 [2018-01-27 23:07:29,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:29,469 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 192 transitions. [2018-01-27 23:07:29,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-27 23:07:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 192 transitions. [2018-01-27 23:07:29,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-01-27 23:07:29,471 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:29,472 INFO L330 BasicCegarLoop]: trace histogram [33, 30, 30, 30, 30, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:07:29,472 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:29,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1604297754, now seen corresponding path program 20 times [2018-01-27 23:07:29,472 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:29,472 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:29,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:29,473 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:29,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:29,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2802 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 2618 trivial. 0 not checked. [2018-01-27 23:07:30,412 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:30,412 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:07:30,423 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-27 23:07:30,451 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:30,494 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:30,500 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:30,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2802 backedges. 1092 proven. 184 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2018-01-27 23:07:30,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:30,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-01-27 23:07:30,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-27 23:07:30,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-27 23:07:30,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:07:30,602 INFO L87 Difference]: Start difference. First operand 188 states and 192 transitions. Second operand 12 states. [2018-01-27 23:07:30,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:30,643 INFO L93 Difference]: Finished difference Result 261 states and 266 transitions. [2018-01-27 23:07:30,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-27 23:07:30,643 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 299 [2018-01-27 23:07:30,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:30,645 INFO L225 Difference]: With dead ends: 261 [2018-01-27 23:07:30,645 INFO L226 Difference]: Without dead ends: 194 [2018-01-27 23:07:30,646 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-27 23:07:30,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-27 23:07:30,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-01-27 23:07:30,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-01-27 23:07:30,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 198 transitions. [2018-01-27 23:07:30,654 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 198 transitions. Word has length 299 [2018-01-27 23:07:30,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:30,655 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 198 transitions. [2018-01-27 23:07:30,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-27 23:07:30,655 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 198 transitions. [2018-01-27 23:07:30,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-01-27 23:07:30,657 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:30,658 INFO L330 BasicCegarLoop]: trace histogram [33, 30, 30, 30, 30, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:07:30,658 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:07:30,658 INFO L82 PathProgramCache]: Analyzing trace with hash 176695726, now seen corresponding path program 21 times [2018-01-27 23:07:30,658 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:30,658 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:30,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:30,659 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-27 23:07:30,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:07:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:07:31,483 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-27 23:07:31,521 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:07:31,541 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:07:31,550 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:07:31,559 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:07:31,560 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:07:31,560 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:07:31,634 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:07:31,634 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:07:31,634 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:07:31,634 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:07:31,635 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:07:31,635 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:07:31,635 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:07:31,635 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == sumErr0EnsuresViolation======== [2018-01-27 23:07:31,635 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:07:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-27 23:07:31,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-27 23:07:31,637 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:31,637 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:07:31,637 INFO L371 AbstractCegarLoop]: === Iteration 1 === [sumErr0EnsuresViolation]=== [2018-01-27 23:07:31,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1916362052, now seen corresponding path program 1 times [2018-01-27 23:07:31,637 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:31,637 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:31,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:31,638 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:31,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:31,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:31,643 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-27 23:07:31,643 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:07:31,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 23:07:31,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 23:07:31,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 23:07:31,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:07:31,645 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-01-27 23:07:31,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:31,648 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2018-01-27 23:07:31,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 23:07:31,648 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-01-27 23:07:31,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:31,649 INFO L225 Difference]: With dead ends: 94 [2018-01-27 23:07:31,651 INFO L226 Difference]: Without dead ends: 0 [2018-01-27 23:07:31,651 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:07:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-27 23:07:31,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-27 23:07:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-27 23:07:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-27 23:07:31,652 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-01-27 23:07:31,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:31,652 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-27 23:07:31,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 23:07:31,653 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-27 23:07:31,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-27 23:07:31,656 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:07:31,656 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:07:31,656 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:07:31,657 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:07:31,657 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:07:31,657 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:07:31,657 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:07:31,657 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-27 23:07:31,657 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:07:31,660 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-27 23:07:31,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-27 23:07:31,661 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:31,661 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:07:31,662 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-27 23:07:31,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1996453586, now seen corresponding path program 1 times [2018-01-27 23:07:31,662 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:31,662 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:31,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:31,663 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:31,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:31,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:31,672 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-27 23:07:31,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:07:31,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 23:07:31,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 23:07:31,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 23:07:31,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:07:31,673 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-01-27 23:07:31,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:31,677 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2018-01-27 23:07:31,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 23:07:31,678 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 44 [2018-01-27 23:07:31,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:31,678 INFO L225 Difference]: With dead ends: 94 [2018-01-27 23:07:31,678 INFO L226 Difference]: Without dead ends: 48 [2018-01-27 23:07:31,679 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:07:31,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-27 23:07:31,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-27 23:07:31,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-27 23:07:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-01-27 23:07:31,682 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 44 [2018-01-27 23:07:31,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:31,682 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-01-27 23:07:31,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 23:07:31,682 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-01-27 23:07:31,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-27 23:07:31,683 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:31,683 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:07:31,683 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-27 23:07:31,683 INFO L82 PathProgramCache]: Analyzing trace with hash -179793732, now seen corresponding path program 1 times [2018-01-27 23:07:31,683 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:31,683 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:31,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:31,685 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:31,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:31,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:31,752 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-27 23:07:31,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:07:31,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 23:07:31,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 23:07:31,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 23:07:31,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:07:31,754 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 3 states. [2018-01-27 23:07:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:31,845 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-01-27 23:07:31,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:07:31,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-01-27 23:07:31,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:31,847 INFO L225 Difference]: With dead ends: 89 [2018-01-27 23:07:31,847 INFO L226 Difference]: Without dead ends: 53 [2018-01-27 23:07:31,848 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:07:31,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-27 23:07:31,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-01-27 23:07:31,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-27 23:07:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-27 23:07:31,852 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 49 [2018-01-27 23:07:31,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:31,852 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-27 23:07:31,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 23:07:31,852 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-27 23:07:31,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-27 23:07:31,853 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:31,853 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:07:31,853 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-27 23:07:31,853 INFO L82 PathProgramCache]: Analyzing trace with hash 534973867, now seen corresponding path program 1 times [2018-01-27 23:07:31,853 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:31,853 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:31,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:31,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:31,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:31,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:31,916 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-27 23:07:31,916 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:31,916 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-27 23:07:31,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:07:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:31,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:32,049 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-27 23:07:32,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-27 23:07:32,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-01-27 23:07:32,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-27 23:07:32,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-27 23:07:32,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-27 23:07:32,083 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2018-01-27 23:07:32,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:32,218 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2018-01-27 23:07:32,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:07:32,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-01-27 23:07:32,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:32,219 INFO L225 Difference]: With dead ends: 90 [2018-01-27 23:07:32,220 INFO L226 Difference]: Without dead ends: 55 [2018-01-27 23:07:32,220 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-27 23:07:32,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-27 23:07:32,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-01-27 23:07:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-27 23:07:32,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-27 23:07:32,224 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 54 [2018-01-27 23:07:32,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:32,224 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-27 23:07:32,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-27 23:07:32,224 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-27 23:07:32,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-27 23:07:32,225 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:32,225 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:07:32,225 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-27 23:07:32,225 INFO L82 PathProgramCache]: Analyzing trace with hash -29908045, now seen corresponding path program 1 times [2018-01-27 23:07:32,225 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:32,225 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:32,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:32,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:32,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:32,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:07:32,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:07:32,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-27 23:07:32,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-27 23:07:32,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-27 23:07:32,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:07:32,299 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 3 states. [2018-01-27 23:07:32,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:32,409 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-01-27 23:07:32,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-27 23:07:32,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-01-27 23:07:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:32,410 INFO L225 Difference]: With dead ends: 78 [2018-01-27 23:07:32,410 INFO L226 Difference]: Without dead ends: 58 [2018-01-27 23:07:32,411 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-27 23:07:32,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-27 23:07:32,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-01-27 23:07:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-27 23:07:32,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-27 23:07:32,415 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 69 [2018-01-27 23:07:32,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:32,415 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-27 23:07:32,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-27 23:07:32,416 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-27 23:07:32,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-27 23:07:32,416 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:32,416 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:07:32,417 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-27 23:07:32,417 INFO L82 PathProgramCache]: Analyzing trace with hash -704975701, now seen corresponding path program 1 times [2018-01-27 23:07:32,417 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:32,417 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:32,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:32,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:32,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:32,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:32,556 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:07:32,557 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:32,596 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-27 23:07:32,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:07:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:32,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:32,749 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:07:32,781 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-27 23:07:32,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-01-27 23:07:32,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-27 23:07:32,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-27 23:07:32,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 23:07:32,782 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2018-01-27 23:07:32,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:32,920 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-01-27 23:07:32,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-27 23:07:32,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-01-27 23:07:32,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:32,922 INFO L225 Difference]: With dead ends: 102 [2018-01-27 23:07:32,922 INFO L226 Difference]: Without dead ends: 62 [2018-01-27 23:07:32,922 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-27 23:07:32,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-27 23:07:32,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2018-01-27 23:07:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-27 23:07:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-01-27 23:07:32,925 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 75 [2018-01-27 23:07:32,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:32,925 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-01-27 23:07:32,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-27 23:07:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-01-27 23:07:32,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-27 23:07:32,926 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:07:32,926 INFO L330 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-27 23:07:32,927 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-27 23:07:32,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1524698330, now seen corresponding path program 2 times [2018-01-27 23:07:32,927 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:07:32,927 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:07:32,928 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:32,928 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:07:32,928 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:07:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:07:32,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:07:33,165 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-27 23:07:33,165 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-27 23:07:33,165 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-27 23:07:33,176 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-27 23:07:33,190 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-27 23:07:33,203 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-27 23:07:33,206 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-27 23:07:33,547 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 23:07:33,556 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 12 treesize of output 5 [2018-01-27 23:07:33,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-27 23:07:33,585 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-27 23:07:33,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-27 23:07:33,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 23:07:33,899 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 12 treesize of output 5 [2018-01-27 23:07:33,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-27 23:07:33,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-27 23:07:33,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-27 23:07:34,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-27 23:07:34,227 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 12 treesize of output 5 [2018-01-27 23:07:34,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-27 23:07:34,251 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-27 23:07:34,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-27 23:07:34,446 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#x~5.base| Int)) (and (= (store |c_old(#valid)| |main_~#x~5.base| 0) |c_#valid|) (= (select |c_old(#valid)| |main_~#x~5.base|) 0))) is different from true [2018-01-27 23:07:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-01-27 23:07:34,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-27 23:07:34,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-01-27 23:07:34,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-27 23:07:34,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-27 23:07:34,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2018-01-27 23:07:34,505 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 9 states. [2018-01-27 23:07:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:07:35,264 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-01-27 23:07:35,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-27 23:07:35,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-01-27 23:07:35,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:07:35,264 INFO L225 Difference]: With dead ends: 106 [2018-01-27 23:07:35,264 INFO L226 Difference]: Without dead ends: 0 [2018-01-27 23:07:35,265 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=47, Invalid=112, Unknown=1, NotChecked=22, Total=182 [2018-01-27 23:07:35,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-27 23:07:35,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-27 23:07:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-27 23:07:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-27 23:07:35,265 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2018-01-27 23:07:35,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:07:35,266 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-27 23:07:35,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-27 23:07:35,266 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-27 23:07:35,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-27 23:07:35,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:07:35 BoogieIcfgContainer [2018-01-27 23:07:35,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-27 23:07:35,270 INFO L168 Benchmark]: Toolchain (without parser) took 23452.97 ms. Allocated memory was 304.6 MB in the beginning and 756.5 MB in the end (delta: 451.9 MB). Free memory was 265.5 MB in the beginning and 388.6 MB in the end (delta: -123.1 MB). Peak memory consumption was 328.8 MB. Max. memory is 5.3 GB. [2018-01-27 23:07:35,273 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 304.6 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-27 23:07:35,274 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.00 ms. Allocated memory is still 304.6 MB. Free memory was 264.5 MB in the beginning and 256.4 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-01-27 23:07:35,274 INFO L168 Benchmark]: Boogie Preprocessor took 52.35 ms. Allocated memory is still 304.6 MB. Free memory was 256.4 MB in the beginning and 254.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-27 23:07:35,274 INFO L168 Benchmark]: RCFGBuilder took 654.09 ms. Allocated memory is still 304.6 MB. Free memory was 254.4 MB in the beginning and 236.5 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-01-27 23:07:35,275 INFO L168 Benchmark]: TraceAbstraction took 22450.14 ms. Allocated memory was 304.6 MB in the beginning and 756.5 MB in the end (delta: 451.9 MB). Free memory was 236.5 MB in the beginning and 388.6 MB in the end (delta: -152.1 MB). Peak memory consumption was 299.8 MB. Max. memory is 5.3 GB. [2018-01-27 23:07:35,276 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.17 ms. Allocated memory is still 304.6 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 286.00 ms. Allocated memory is still 304.6 MB. Free memory was 264.5 MB in the beginning and 256.4 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 52.35 ms. Allocated memory is still 304.6 MB. Free memory was 256.4 MB in the beginning and 254.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 654.09 ms. Allocated memory is still 304.6 MB. Free memory was 254.4 MB in the beginning and 236.5 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 22450.14 ms. Allocated memory was 304.6 MB in the beginning and 756.5 MB in the end (delta: 451.9 MB). Free memory was 236.5 MB in the beginning and 388.6 MB in the end (delta: -152.1 MB). Peak memory consumption was 299.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 54 locations, 4 error locations. UNSAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L17] FCALL int x[10]; VAL [x={42:0}] [L18] int temp; [L19] int ret; [L20] int ret2; [L21] int ret5; [L23] int i = 0; VAL [i=0, x={42:0}] [L23] COND TRUE i < 10 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=0, x={42:0}] [L23] i++ VAL [i=1, x={42:0}] [L23] COND TRUE i < 10 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=1, x={42:0}] [L23] i++ VAL [i=2, x={42:0}] [L23] COND TRUE i < 10 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=2, x={42:0}] [L23] i++ VAL [i=3, x={42:0}] [L23] COND TRUE i < 10 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=3, x={42:0}] [L23] i++ VAL [i=4, x={42:0}] [L23] COND TRUE i < 10 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=4, x={42:0}] [L23] i++ VAL [i=5, x={42:0}] [L23] COND TRUE i < 10 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=5, x={42:0}] [L23] i++ VAL [i=6, x={42:0}] [L23] COND TRUE i < 10 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=6, x={42:0}] [L23] i++ VAL [i=7, x={42:0}] [L23] COND TRUE i < 10 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=7, x={42:0}] [L23] i++ VAL [i=8, x={42:0}] [L23] COND TRUE i < 10 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=8, x={42:0}] [L23] i++ VAL [i=9, x={42:0}] [L23] COND TRUE i < 10 [L24] FCALL x[i] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, i=9, x={42:0}] [L23] i++ VAL [i=10, x={42:0}] [L23] COND FALSE !(i < 10) VAL [i=10, x={42:0}] [L27] CALL, EXPR sum(x) VAL [x={42:0}] [L6] int i; [L7] long long ret; [L8] ret = 0 [L9] i = 0 VAL [i=0, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=0, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=0, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=1, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=1, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=1, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=2, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=2, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=2, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=3, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=3, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=3, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=4, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=4, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=4, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=5, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=5, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=5, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=6, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=6, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=6, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=7, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=7, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=7, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=8, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=8, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=8, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=9, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=9, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=9, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=10, ret=0, x={42:0}, x={42:0}] [L9] COND FALSE !(i < 10) VAL [i=10, ret=0, x={42:0}, x={42:0}] [L12] RET return ret; VAL [\result=0, i=10, ret=0, x={42:0}, x={42:0}] [L27] EXPR sum(x) VAL [i=10, sum(x)=0, x={42:0}] [L27] ret = sum(x) [L29] EXPR, FCALL x[0] VAL [i=10, ret=0, x={42:0}, x[0]=0] [L29] temp=x[0] [L29] EXPR, FCALL x[1] VAL [i=10, ret=0, temp=0, x={42:0}, x[1]=0] [L29] FCALL x[0] = x[1] VAL [i=10, ret=0, temp=0, x={42:0}, x[1]=0] [L29] FCALL x[1] = temp VAL [i=10, ret=0, temp=0, x={42:0}] [L30] CALL, EXPR sum(x) VAL [x={42:0}] [L6] int i; [L7] long long ret; [L8] ret = 0 [L9] i = 0 VAL [i=0, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=0, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=0, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=1, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=1, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=1, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=2, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=2, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=2, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=3, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=3, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=3, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=4, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=4, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=4, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=5, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=5, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=5, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=6, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=6, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=6, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=7, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=7, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=7, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=8, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=8, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=8, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=9, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=9, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=9, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=10, ret=0, x={42:0}, x={42:0}] [L9] COND FALSE !(i < 10) VAL [i=10, ret=0, x={42:0}, x={42:0}] [L12] RET return ret; VAL [\result=0, i=10, ret=0, x={42:0}, x={42:0}] [L30] EXPR sum(x) VAL [i=10, ret=0, sum(x)=0, temp=0, x={42:0}] [L30] ret2 = sum(x) [L31] EXPR, FCALL x[0] VAL [i=10, ret=0, ret2=0, temp=0, x={42:0}, x[0]=0] [L31] temp=x[0] [L32] int i =0 ; VAL [i=0, i=10, ret=0, ret2=0, temp=0, x={42:0}] [L32] COND TRUE i<10 -1 VAL [i=10, i=0, ret=0, ret2=0, temp=0, x={42:0}] [L33] EXPR, FCALL x[i+1] VAL [i=10, i=0, ret=0, ret2=0, temp=0, x={42:0}, x[i+1]=0] [L33] FCALL x[i] = x[i+1] VAL [i=10, i=0, ret=0, ret2=0, temp=0, x={42:0}, x[i+1]=0] [L32] i++ VAL [i=1, i=10, ret=0, ret2=0, temp=0, x={42:0}] [L32] COND TRUE i<10 -1 VAL [i=10, i=1, ret=0, ret2=0, temp=0, x={42:0}] [L33] EXPR, FCALL x[i+1] VAL [i=10, i=1, ret=0, ret2=0, temp=0, x={42:0}, x[i+1]=0] [L33] FCALL x[i] = x[i+1] VAL [i=1, i=10, ret=0, ret2=0, temp=0, x={42:0}, x[i+1]=0] [L32] i++ VAL [i=10, i=2, ret=0, ret2=0, temp=0, x={42:0}] [L32] COND TRUE i<10 -1 VAL [i=2, i=10, ret=0, ret2=0, temp=0, x={42:0}] [L33] EXPR, FCALL x[i+1] VAL [i=2, i=10, ret=0, ret2=0, temp=0, x={42:0}, x[i+1]=0] [L33] FCALL x[i] = x[i+1] VAL [i=10, i=2, ret=0, ret2=0, temp=0, x={42:0}, x[i+1]=0] [L32] i++ VAL [i=3, i=10, ret=0, ret2=0, temp=0, x={42:0}] [L32] COND TRUE i<10 -1 VAL [i=3, i=10, ret=0, ret2=0, temp=0, x={42:0}] [L33] EXPR, FCALL x[i+1] VAL [i=3, i=10, ret=0, ret2=0, temp=0, x={42:0}, x[i+1]=0] [L33] FCALL x[i] = x[i+1] VAL [i=3, i=10, ret=0, ret2=0, temp=0, x={42:0}, x[i+1]=0] [L32] i++ VAL [i=10, i=4, ret=0, ret2=0, temp=0, x={42:0}] [L32] COND TRUE i<10 -1 VAL [i=4, i=10, ret=0, ret2=0, temp=0, x={42:0}] [L33] EXPR, FCALL x[i+1] VAL [i=4, i=10, ret=0, ret2=0, temp=0, x={42:0}, x[i+1]=0] [L33] FCALL x[i] = x[i+1] VAL [i=10, i=4, ret=0, ret2=0, temp=0, x={42:0}, x[i+1]=0] [L32] i++ VAL [i=5, i=10, ret=0, ret2=0, temp=0, x={42:0}] [L32] COND TRUE i<10 -1 VAL [i=10, i=5, ret=0, ret2=0, temp=0, x={42:0}] [L33] EXPR, FCALL x[i+1] VAL [i=10, i=5, ret=0, ret2=0, temp=0, x={42:0}, x[i+1]=0] [L33] FCALL x[i] = x[i+1] VAL [i=5, i=10, ret=0, ret2=0, temp=0, x={42:0}, x[i+1]=0] [L32] i++ VAL [i=10, i=6, ret=0, ret2=0, temp=0, x={42:0}] [L32] COND TRUE i<10 -1 VAL [i=10, i=6, ret=0, ret2=0, temp=0, x={42:0}] [L33] EXPR, FCALL x[i+1] VAL [i=10, i=6, ret=0, ret2=0, temp=0, x={42:0}, x[i+1]=0] [L33] FCALL x[i] = x[i+1] VAL [i=6, i=10, ret=0, ret2=0, temp=0, x={42:0}, x[i+1]=0] [L32] i++ VAL [i=7, i=10, ret=0, ret2=0, temp=0, x={42:0}] [L32] COND TRUE i<10 -1 VAL [i=10, i=7, ret=0, ret2=0, temp=0, x={42:0}] [L33] EXPR, FCALL x[i+1] VAL [i=7, i=10, ret=0, ret2=0, temp=0, x={42:0}, x[i+1]=0] [L33] FCALL x[i] = x[i+1] VAL [i=10, i=7, ret=0, ret2=0, temp=0, x={42:0}, x[i+1]=0] [L32] i++ VAL [i=10, i=8, ret=0, ret2=0, temp=0, x={42:0}] [L32] COND TRUE i<10 -1 VAL [i=10, i=8, ret=0, ret2=0, temp=0, x={42:0}] [L33] EXPR, FCALL x[i+1] VAL [i=10, i=8, ret=0, ret2=0, temp=0, x={42:0}, x[i+1]=0] [L33] FCALL x[i] = x[i+1] VAL [i=8, i=10, ret=0, ret2=0, temp=0, x={42:0}, x[i+1]=0] [L32] i++ VAL [i=10, i=9, ret=0, ret2=0, temp=0, x={42:0}] [L32] COND FALSE !(i<10 -1) VAL [i=10, i=9, ret=0, ret2=0, temp=0, x={42:0}] [L35] FCALL x[10 -1] = temp VAL [i=9, i=10, ret=0, ret2=0, temp=0, x={42:0}] [L36] CALL, EXPR sum(x) VAL [x={42:0}] [L6] int i; [L7] long long ret; [L8] ret = 0 [L9] i = 0 VAL [i=0, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=0, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=0, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=1, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=1, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=1, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=2, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=2, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=2, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=3, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=3, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=3, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=4, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=4, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=4, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=5, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=5, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=5, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=6, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=6, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=6, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=7, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=7, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=7, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=8, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=8, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=8, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=9, ret=0, x={42:0}, x={42:0}] [L9] COND TRUE i < 10 VAL [i=9, ret=0, x={42:0}, x={42:0}] [L10] EXPR, FCALL x[i] VAL [i=9, ret=0, x={42:0}, x={42:0}, x[i]=0] [L10] ret = ret + x[i] [L9] i++ VAL [i=10, ret=0, x={42:0}, x={42:0}] [L9] COND FALSE !(i < 10) VAL [i=10, ret=0, x={42:0}, x={42:0}] [L12] RET return ret; VAL [\result=0, i=10, ret=0, x={42:0}, x={42:0}] [L36] EXPR sum(x) VAL [i=10, i=9, ret=0, ret2=0, sum(x)=0, temp=0, x={42:0}] [L36] ret5 = sum(x) [L38] COND FALSE !(ret != ret2 || ret !=ret5) VAL [i=9, i=10, ret=0, ret2=0, ret5=0, temp=0, x={42:0}] [L41] return 1; VAL [\result=1, i=9, i=10, ret=0, ret2=0, ret5=0, temp=0, x={42:0}] [L41] return 1; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 54 locations, 4 error locations. UNSAFE Result, 18.5s OverallTime, 25 OverallIterations, 33 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1203 SDtfs, 510 SDslu, 6098 SDs, 0 SdLazy, 908 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3977 GetRequests, 3807 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=24, 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, 24 MinimizatonAttempts, 86 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 8099 NumberOfCodeBlocks, 7532 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 7749 ConstructedInterpolants, 0 QuantifiedInterpolants, 2120593 SizeOfPredicates, 21 NumberOfNonLiveVariables, 6170 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 45 InterpolantComputations, 4 PerfectInterpolantSequences, 41777/48062 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 4]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: sumErr0EnsuresViolation CFG has 4 procedures, 54 locations, 4 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 57 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 15]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 54 locations, 4 error locations. SAFE Result, 3.6s OverallTime, 6 OverallIterations, 6 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 286 SDtfs, 75 SDslu, 325 SDs, 0 SdLazy, 168 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 208 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=5, 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 580 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 571 ConstructedInterpolants, 35 QuantifiedInterpolants, 91665 SizeOfPredicates, 5 NumberOfNonLiveVariables, 400 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 337/360 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sum10_true-unreach-call_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-27_23-07-35-300.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sum10_true-unreach-call_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-27_23-07-35-300.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sum10_true-unreach-call_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-27_23-07-35-300.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sum10_true-unreach-call_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-27_23-07-35-300.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sum10_true-unreach-call_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-27_23-07-35-300.csv Received shutdown request...