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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-tiling/nr3_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 04:55:22,045 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 04:55:22,046 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 04:55:22,054 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 04:55:22,055 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 04:55:22,055 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 04:55:22,056 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 04:55:22,057 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 04:55:22,058 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 04:55:22,058 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 04:55:22,059 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 04:55:22,059 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 04:55:22,059 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 04:55:22,060 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 04:55:22,061 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 04:55:22,062 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 04:55:22,063 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 04:55:22,064 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 04:55:22,065 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 04:55:22,065 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 04:55:22,066 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 04:55:22,066 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 04:55:22,067 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 04:55:22,067 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 04:55:22,068 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 04:55:22,068 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 04:55:22,068 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 04:55:22,069 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 04:55:22,069 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 04:55:22,069 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 04:55:22,069 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 04:55:22,069 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 04:55:22,074 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 04:55:22,074 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 04:55:22,075 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 04:55:22,075 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 04:55:22,075 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 04:55:22,075 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 04:55:22,075 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 04:55:22,076 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 04:55:22,076 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 04:55:22,076 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 04:55:22,076 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 04:55:22,076 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 04:55:22,076 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 04:55:22,076 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 04:55:22,076 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 04:55:22,076 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 04:55:22,076 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 04:55:22,076 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 04:55:22,077 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 04:55:22,077 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 04:55:22,077 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 04:55:22,077 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 04:55:22,077 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 04:55:22,077 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 04:55:22,077 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 04:55:22,077 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 04:55:22,077 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 04:55:22,077 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 04:55:22,077 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 04:55:22,078 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 04:55:22,078 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 04:55:22,078 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 04:55:22,078 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 04:55:22,078 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 04:55:22,103 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 04:55:22,109 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 04:55:22,113 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 04:55:22,113 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 04:55:22,114 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 04:55:22,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr3_true-unreach-call.i [2018-01-30 04:55:22,178 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 04:55:22,179 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 04:55:22,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 04:55:22,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 04:55:22,183 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 04:55:22,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 04:55:22" (1/1) ... [2018-01-30 04:55:22,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1b5fa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:55:22, skipping insertion in model container [2018-01-30 04:55:22,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 04:55:22" (1/1) ... [2018-01-30 04:55:22,194 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 04:55:22,203 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 04:55:22,274 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 04:55:22,283 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 04:55:22,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:55:22 WrapperNode [2018-01-30 04:55:22,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 04:55:22,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 04:55:22,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 04:55:22,287 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 04:55:22,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:55:22" (1/1) ... [2018-01-30 04:55:22,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:55:22" (1/1) ... [2018-01-30 04:55:22,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:55:22" (1/1) ... [2018-01-30 04:55:22,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:55:22" (1/1) ... [2018-01-30 04:55:22,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:55:22" (1/1) ... [2018-01-30 04:55:22,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:55:22" (1/1) ... [2018-01-30 04:55:22,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:55:22" (1/1) ... [2018-01-30 04:55:22,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 04:55:22,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 04:55:22,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 04:55:22,304 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 04:55:22,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:55:22" (1/1) ... No working directory specified, using /home/daniel/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-30 04:55:22,337 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 04:55:22,337 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 04:55:22,337 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 04:55:22,337 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 04:55:22,338 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 04:55:22,338 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-01-30 04:55:22,338 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 04:55:22,338 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 04:55:22,338 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 04:55:22,338 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 04:55:22,338 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 04:55:22,615 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 04:55:22,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 04:55:22 BoogieIcfgContainer [2018-01-30 04:55:22,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 04:55:22,616 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 04:55:22,616 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 04:55:22,617 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 04:55:22,618 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 04:55:22" (1/1) ... [2018-01-30 04:55:22,621 WARN L213 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-01-30 04:55:22,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 04:55:22 BasicIcfg [2018-01-30 04:55:22,628 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 04:55:22,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 04:55:22,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 04:55:22,630 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 04:55:22,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 04:55:22" (1/4) ... [2018-01-30 04:55:22,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750c9aca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 04:55:22, skipping insertion in model container [2018-01-30 04:55:22,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:55:22" (2/4) ... [2018-01-30 04:55:22,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750c9aca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 04:55:22, skipping insertion in model container [2018-01-30 04:55:22,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 04:55:22" (3/4) ... [2018-01-30 04:55:22,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750c9aca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 04:55:22, skipping insertion in model container [2018-01-30 04:55:22,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 04:55:22" (4/4) ... [2018-01-30 04:55:22,632 INFO L107 eAbstractionObserver]: Analyzing ICFG nr3_true-unreach-call.ileft_unchanged_by_heapseparator [2018-01-30 04:55:22,637 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 04:55:22,642 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 04:55:22,666 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 04:55:22,666 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 04:55:22,666 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 04:55:22,666 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 04:55:22,666 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 04:55:22,666 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 04:55:22,666 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 04:55:22,666 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 04:55:22,667 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 04:55:22,676 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-30 04:55:22,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 04:55:22,679 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:55:22,680 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:55:22,680 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:55:22,683 INFO L82 PathProgramCache]: Analyzing trace with hash -499478863, now seen corresponding path program 1 times [2018-01-30 04:55:22,684 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:55:22,684 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:55:22,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:55:22,713 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:55:22,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:55:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:55:22,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:55:22,767 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-30 04:55:22,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 04:55:22,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 04:55:22,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 04:55:22,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 04:55:22,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 04:55:22,779 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-01-30 04:55:22,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:55:22,797 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2018-01-30 04:55:22,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 04:55:22,798 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-30 04:55:22,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:55:22,803 INFO L225 Difference]: With dead ends: 81 [2018-01-30 04:55:22,803 INFO L226 Difference]: Without dead ends: 43 [2018-01-30 04:55:22,805 INFO L553 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-30 04:55:22,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-30 04:55:22,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-30 04:55:22,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-30 04:55:22,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-30 04:55:22,837 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 24 [2018-01-30 04:55:22,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:55:22,838 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-30 04:55:22,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 04:55:22,838 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-30 04:55:22,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 04:55:22,839 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:55:22,839 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:55:22,839 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:55:22,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1904142811, now seen corresponding path program 1 times [2018-01-30 04:55:22,839 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:55:22,840 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:55:22,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:55:22,840 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:55:22,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:55:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:55:22,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:55:23,429 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 34 DAG size of output 14 [2018-01-30 04:55:23,449 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-30 04:55:23,450 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 04:55:23,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 04:55:23,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 04:55:23,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 04:55:23,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 04:55:23,451 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-01-30 04:55:23,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:55:23,596 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-01-30 04:55:23,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 04:55:23,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-30 04:55:23,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:55:23,598 INFO L225 Difference]: With dead ends: 74 [2018-01-30 04:55:23,598 INFO L226 Difference]: Without dead ends: 61 [2018-01-30 04:55:23,599 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 04:55:23,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-30 04:55:23,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2018-01-30 04:55:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-30 04:55:23,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-30 04:55:23,605 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 25 [2018-01-30 04:55:23,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:55:23,605 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-30 04:55:23,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 04:55:23,606 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-30 04:55:23,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 04:55:23,606 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:55:23,606 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:55:23,606 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:55:23,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2073421288, now seen corresponding path program 1 times [2018-01-30 04:55:23,606 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:55:23,606 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:55:23,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:55:23,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:55:23,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:55:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:55:23,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:55:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:55:23,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 04:55:23,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 04:55:23,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 04:55:23,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 04:55:23,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 04:55:23,664 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 3 states. [2018-01-30 04:55:23,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:55:23,710 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2018-01-30 04:55:23,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 04:55:23,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-01-30 04:55:23,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:55:23,711 INFO L225 Difference]: With dead ends: 79 [2018-01-30 04:55:23,711 INFO L226 Difference]: Without dead ends: 52 [2018-01-30 04:55:23,711 INFO L553 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-30 04:55:23,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-30 04:55:23,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2018-01-30 04:55:23,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-30 04:55:23,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-30 04:55:23,715 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 33 [2018-01-30 04:55:23,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:55:23,715 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-30 04:55:23,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 04:55:23,715 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-30 04:55:23,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-30 04:55:23,717 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:55:23,718 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 04:55:23,718 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:55:23,718 INFO L82 PathProgramCache]: Analyzing trace with hash 255775441, now seen corresponding path program 1 times [2018-01-30 04:55:23,718 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:55:23,718 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:55:23,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:55:23,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:55:23,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:55:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:55:23,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:55:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:55:23,775 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:55:23,775 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 04:55:23,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:55:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:55:23,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:55:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:55:23,845 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:55:23,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 04:55:23,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 04:55:23,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 04:55:23,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-30 04:55:23,846 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2018-01-30 04:55:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:55:24,014 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2018-01-30 04:55:24,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 04:55:24,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-01-30 04:55:24,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:55:24,018 INFO L225 Difference]: With dead ends: 89 [2018-01-30 04:55:24,018 INFO L226 Difference]: Without dead ends: 60 [2018-01-30 04:55:24,018 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-30 04:55:24,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-30 04:55:24,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-01-30 04:55:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-30 04:55:24,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-01-30 04:55:24,025 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 40 [2018-01-30 04:55:24,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:55:24,025 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-01-30 04:55:24,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 04:55:24,025 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-01-30 04:55:24,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-30 04:55:24,026 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:55:24,026 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:55:24,026 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:55:24,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1474594808, now seen corresponding path program 2 times [2018-01-30 04:55:24,026 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:55:24,026 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:55:24,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:55:24,027 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:55:24,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:55:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:55:24,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:55:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 04:55:24,104 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:55:24,104 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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) [2018-01-30 04:55:24,120 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 04:55:24,126 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:55:24,133 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:55:24,134 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:55:24,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:55:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:55:24,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:55:24,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2018-01-30 04:55:24,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 04:55:24,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 04:55:24,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 04:55:24,163 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 8 states. [2018-01-30 04:55:24,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:55:24,456 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2018-01-30 04:55:24,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 04:55:24,456 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-01-30 04:55:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:55:24,457 INFO L225 Difference]: With dead ends: 99 [2018-01-30 04:55:24,457 INFO L226 Difference]: Without dead ends: 62 [2018-01-30 04:55:24,457 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-01-30 04:55:24,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-30 04:55:24,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-30 04:55:24,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-30 04:55:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-30 04:55:24,463 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 47 [2018-01-30 04:55:24,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:55:24,464 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-30 04:55:24,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 04:55:24,464 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-30 04:55:24,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 04:55:24,464 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:55:24,465 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:55:24,465 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:55:24,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1780265775, now seen corresponding path program 1 times [2018-01-30 04:55:24,465 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:55:24,465 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:55:24,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:55:24,465 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:55:24,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:55:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:55:24,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:55:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:55:25,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:55:25,019 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 04:55:25,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:55:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:55:25,044 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:55:25,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 04:55:25,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:55:25,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 04:55:25,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-01-30 04:55:25,240 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:25,240 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:25,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-01-30 04:55:25,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:55:25,252 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-30 04:55:25,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:32 [2018-01-30 04:55:25,309 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:25,311 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:25,312 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:25,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 56 [2018-01-30 04:55:25,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-01-30 04:55:25,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-30 04:55:25,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:73 [2018-01-30 04:55:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:55:25,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:55:25,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 23 [2018-01-30 04:55:25,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-30 04:55:25,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-30 04:55:25,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2018-01-30 04:55:25,696 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 23 states. [2018-01-30 04:55:27,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:55:27,066 INFO L93 Difference]: Finished difference Result 212 states and 242 transitions. [2018-01-30 04:55:27,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 04:55:27,076 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2018-01-30 04:55:27,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:55:27,076 INFO L225 Difference]: With dead ends: 212 [2018-01-30 04:55:27,077 INFO L226 Difference]: Without dead ends: 168 [2018-01-30 04:55:27,077 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=308, Invalid=1252, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 04:55:27,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-30 04:55:27,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 119. [2018-01-30 04:55:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-30 04:55:27,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2018-01-30 04:55:27,090 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 54 [2018-01-30 04:55:27,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:55:27,090 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2018-01-30 04:55:27,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-30 04:55:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2018-01-30 04:55:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-30 04:55:27,093 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:55:27,093 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:55:27,093 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:55:27,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1661087981, now seen corresponding path program 1 times [2018-01-30 04:55:27,093 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:55:27,093 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:55:27,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:55:27,094 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:55:27,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:55:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:55:27,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:55:27,372 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:55:27,373 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:55:27,373 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 04:55:27,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:55:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:55:27,392 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:55:27,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 04:55:27,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:55:27,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 04:55:27,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2018-01-30 04:55:27,541 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:27,542 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:27,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 29 [2018-01-30 04:55:27,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:55:27,549 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-30 04:55:27,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-01-30 04:55:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:55:28,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:55:28,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 33 [2018-01-30 04:55:28,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 04:55:28,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 04:55:28,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 04:55:28,108 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand 33 states. [2018-01-30 04:55:29,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:55:29,314 INFO L93 Difference]: Finished difference Result 280 states and 320 transitions. [2018-01-30 04:55:29,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-30 04:55:29,315 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-01-30 04:55:29,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:55:29,317 INFO L225 Difference]: With dead ends: 280 [2018-01-30 04:55:29,317 INFO L226 Difference]: Without dead ends: 190 [2018-01-30 04:55:29,319 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=545, Invalid=3237, Unknown=0, NotChecked=0, Total=3782 [2018-01-30 04:55:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-30 04:55:29,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 131. [2018-01-30 04:55:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-30 04:55:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2018-01-30 04:55:29,329 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 64 [2018-01-30 04:55:29,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:55:29,329 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2018-01-30 04:55:29,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 04:55:29,329 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2018-01-30 04:55:29,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-30 04:55:29,330 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:55:29,330 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:55:29,330 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:55:29,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1856772395, now seen corresponding path program 2 times [2018-01-30 04:55:29,330 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:55:29,330 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:55:29,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:55:29,331 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:55:29,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:55:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:55:29,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:55:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 04:55:29,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:55:29,619 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 04:55:29,624 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 04:55:29,635 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:55:29,640 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:55:29,644 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:55:29,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:55:29,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 04:55:29,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:55:29,854 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-30 04:55:29,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-01-30 04:55:30,003 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 04:55:30,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:55:30,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 34 [2018-01-30 04:55:30,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 04:55:30,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 04:55:30,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1018, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 04:55:30,021 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand 34 states. [2018-01-30 04:55:30,750 WARN L143 SmtUtils]: Spent 118ms on a formula simplification that was a NOOP. DAG size: 17 [2018-01-30 04:55:31,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:55:31,787 INFO L93 Difference]: Finished difference Result 292 states and 330 transitions. [2018-01-30 04:55:31,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-01-30 04:55:31,787 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 74 [2018-01-30 04:55:31,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:55:31,788 INFO L225 Difference]: With dead ends: 292 [2018-01-30 04:55:31,788 INFO L226 Difference]: Without dead ends: 203 [2018-01-30 04:55:31,789 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=755, Invalid=5097, Unknown=0, NotChecked=0, Total=5852 [2018-01-30 04:55:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-30 04:55:31,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 157. [2018-01-30 04:55:31,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-30 04:55:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2018-01-30 04:55:31,803 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 74 [2018-01-30 04:55:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:55:31,804 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2018-01-30 04:55:31,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 04:55:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2018-01-30 04:55:31,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-30 04:55:31,805 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:55:31,805 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-30 04:55:31,805 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:55:31,805 INFO L82 PathProgramCache]: Analyzing trace with hash -209144809, now seen corresponding path program 3 times [2018-01-30 04:55:31,805 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:55:31,805 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:55:31,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:55:31,806 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:55:31,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:55:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:55:31,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:55:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-01-30 04:55:32,303 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:55:32,303 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 04:55:32,312 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 04:55:32,317 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:55:32,320 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:55:32,322 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:55:32,324 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:55:32,325 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:55:32,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:55:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-01-30 04:55:32,584 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:55:32,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-01-30 04:55:32,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-30 04:55:32,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-30 04:55:32,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2018-01-30 04:55:32,585 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand 27 states. [2018-01-30 04:55:33,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:55:33,101 INFO L93 Difference]: Finished difference Result 283 states and 307 transitions. [2018-01-30 04:55:33,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 04:55:33,101 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2018-01-30 04:55:33,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:55:33,102 INFO L225 Difference]: With dead ends: 283 [2018-01-30 04:55:33,102 INFO L226 Difference]: Without dead ends: 238 [2018-01-30 04:55:33,102 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=366, Invalid=1116, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 04:55:33,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-30 04:55:33,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 174. [2018-01-30 04:55:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-30 04:55:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 189 transitions. [2018-01-30 04:55:33,114 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 189 transitions. Word has length 84 [2018-01-30 04:55:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:55:33,114 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 189 transitions. [2018-01-30 04:55:33,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-30 04:55:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 189 transitions. [2018-01-30 04:55:33,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-30 04:55:33,115 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:55:33,115 INFO L350 BasicCegarLoop]: trace histogram [8, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:55:33,115 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:55:33,115 INFO L82 PathProgramCache]: Analyzing trace with hash -2114443867, now seen corresponding path program 2 times [2018-01-30 04:55:33,115 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:55:33,115 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:55:33,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:55:33,116 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:55:33,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:55:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:55:33,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:55:33,346 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 6 DAG size of output 5 [2018-01-30 04:55:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 8 proven. 124 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 04:55:33,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:55:33,668 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 04:55:33,673 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 04:55:33,679 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:55:33,683 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:55:33,694 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:55:33,696 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:55:33,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 04:55:33,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:55:33,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 04:55:33,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-01-30 04:55:33,803 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:33,803 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:33,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-01-30 04:55:33,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:55:33,810 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-30 04:55:33,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:32 [2018-01-30 04:55:33,842 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:33,844 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:33,844 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:33,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 80 [2018-01-30 04:55:33,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-01-30 04:55:33,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-30 04:55:33,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:108 [2018-01-30 04:55:34,401 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:34,402 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:34,403 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:34,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 76 [2018-01-30 04:55:34,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-30 04:55:34,459 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:34,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:34,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 70 [2018-01-30 04:55:34,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 04:55:34,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:34,520 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:34,521 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:34,523 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:34,524 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:34,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 129 [2018-01-30 04:55:34,539 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-01-30 04:55:34,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2018-01-30 04:55:34,683 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:127, output treesize:332 [2018-01-30 04:55:34,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:34,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:34,903 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:34,904 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:34,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:34,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 96 [2018-01-30 04:55:34,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:55:34,952 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:34,953 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:34,954 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:34,956 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:34,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 90 [2018-01-30 04:55:34,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 04:55:35,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-30 04:55:35,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:87, output treesize:85 [2018-01-30 04:55:35,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:35,338 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:35,339 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:35,341 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:35,343 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:35,345 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:35,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 139 [2018-01-30 04:55:35,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2018-01-30 04:55:35,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:35,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:35,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:35,492 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:55:35,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 125 [2018-01-30 04:55:35,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-30 04:55:35,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 23 dim-0 vars, and 7 xjuncts. [2018-01-30 04:55:35,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:109, output treesize:317 [2018-01-30 04:56:18,593 WARN L146 SmtUtils]: Spent 42468ms on a formula simplification. DAG size of input: 155 DAG size of output 131 [2018-01-30 04:56:39,617 WARN L143 SmtUtils]: Spent 20701ms on a formula simplification that was a NOOP. DAG size: 133 [2018-01-30 04:56:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:56:39,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:56:39,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 39 [2018-01-30 04:56:39,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-30 04:56:39,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-30 04:56:39,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1314, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 04:56:39,973 INFO L87 Difference]: Start difference. First operand 174 states and 189 transitions. Second operand 39 states. Received shutdown request... [2018-01-30 04:56:44,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 04:56:44,707 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 04:56:44,710 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 04:56:44,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 04:56:44 BasicIcfg [2018-01-30 04:56:44,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 04:56:44,710 INFO L168 Benchmark]: Toolchain (without parser) took 82532.06 ms. Allocated memory was 148.9 MB in the beginning and 334.5 MB in the end (delta: 185.6 MB). Free memory was 112.6 MB in the beginning and 125.9 MB in the end (delta: -13.3 MB). Peak memory consumption was 172.3 MB. Max. memory is 5.3 GB. [2018-01-30 04:56:44,711 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 148.9 MB. Free memory is still 117.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 04:56:44,711 INFO L168 Benchmark]: CACSL2BoogieTranslator took 106.69 ms. Allocated memory is still 148.9 MB. Free memory was 112.4 MB in the beginning and 104.1 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 5.3 GB. [2018-01-30 04:56:44,712 INFO L168 Benchmark]: Boogie Preprocessor took 17.65 ms. Allocated memory is still 148.9 MB. Free memory was 104.1 MB in the beginning and 102.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. [2018-01-30 04:56:44,712 INFO L168 Benchmark]: RCFGBuilder took 311.36 ms. Allocated memory is still 148.9 MB. Free memory was 102.5 MB in the beginning and 88.4 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. [2018-01-30 04:56:44,712 INFO L168 Benchmark]: IcfgTransformer took 12.28 ms. Allocated memory is still 148.9 MB. Free memory was 88.4 MB in the beginning and 87.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-01-30 04:56:44,712 INFO L168 Benchmark]: TraceAbstraction took 82081.63 ms. Allocated memory was 148.9 MB in the beginning and 334.5 MB in the end (delta: 185.6 MB). Free memory was 86.9 MB in the beginning and 125.9 MB in the end (delta: -39.0 MB). Peak memory consumption was 146.6 MB. Max. memory is 5.3 GB. [2018-01-30 04:56:44,713 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.10 ms. Allocated memory is still 148.9 MB. Free memory is still 117.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 106.69 ms. Allocated memory is still 148.9 MB. Free memory was 112.4 MB in the beginning and 104.1 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 17.65 ms. Allocated memory is still 148.9 MB. Free memory was 104.1 MB in the beginning and 102.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 311.36 ms. Allocated memory is still 148.9 MB. Free memory was 102.5 MB in the beginning and 88.4 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. * IcfgTransformer took 12.28 ms. Allocated memory is still 148.9 MB. Free memory was 88.4 MB in the beginning and 87.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 82081.63 ms. Allocated memory was 148.9 MB in the beginning and 334.5 MB in the end (delta: 185.6 MB). Free memory was 86.9 MB in the beginning and 125.9 MB in the end (delta: -39.0 MB). Peak memory consumption was 146.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (174states) and interpolant automaton (currently 15 states, 39 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 87. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 1 error locations. TIMEOUT Result, 82.0s OverallTime, 10 OverallIterations, 8 TraceHistogramMax, 10.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 415 SDtfs, 1094 SDslu, 3000 SDs, 0 SdLazy, 3440 SolverSat, 346 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 683 GetRequests, 388 SyntacticMatches, 17 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3775 ImplicationChecksByTransitivity, 71.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=9, 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, 9 MinimizatonAttempts, 244 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 71.0s InterpolantComputationTime, 974 NumberOfCodeBlocks, 967 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 957 ConstructedInterpolants, 90 QuantifiedInterpolants, 1206657 SizeOfPredicates, 62 NumberOfNonLiveVariables, 700 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 181/658 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nr3_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_04-56-44-718.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nr3_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_04-56-44-718.csv Completed graceful shutdown