java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-tiling/rewnif_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 01:18:06,917 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:18:06,918 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:18:06,929 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:18:06,930 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:18:06,930 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:18:06,931 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:18:06,934 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:18:06,935 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:18:06,935 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:18:06,936 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:18:06,936 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:18:06,936 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:18:06,937 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:18:06,937 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:18:06,939 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:18:06,941 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:18:06,942 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:18:06,942 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:18:06,943 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:18:06,944 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:18:06,944 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:18:06,945 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:18:06,945 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:18:06,953 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:18:06,954 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:18:06,954 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:18:06,954 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:18:06,954 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:18:06,954 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:18:06,955 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:18:06,955 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 01:18:06,966 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:18:06,967 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:18:06,967 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:18:06,967 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:18:06,967 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:18:06,967 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:18:06,967 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:18:06,968 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:18:06,968 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:18:06,968 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:18:06,968 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:18:06,968 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:18:06,968 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 01:18:06,968 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:18:06,968 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 01:18:06,968 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:18:06,968 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 01:18:06,968 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 01:18:06,969 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:18:06,969 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:18:06,969 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:18:06,969 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:18:06,969 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:18:06,969 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:18:06,970 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:18:06,970 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:18:06,970 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:18:06,970 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:18:06,970 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:18:06,970 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:18:06,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:18:06,970 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:18:06,971 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:18:06,971 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:18:06,999 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:18:07,007 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:18:07,010 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:18:07,011 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:18:07,011 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:18:07,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rewnif_true-unreach-call.i [2018-01-30 01:18:07,075 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:18:07,076 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 01:18:07,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:18:07,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:18:07,080 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:18:07,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:18:07" (1/1) ... [2018-01-30 01:18:07,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2227fefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:07, skipping insertion in model container [2018-01-30 01:18:07,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:18:07" (1/1) ... [2018-01-30 01:18:07,091 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:18:07,100 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:18:07,168 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:18:07,176 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:18:07,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:07 WrapperNode [2018-01-30 01:18:07,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:18:07,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:18:07,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:18:07,179 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:18:07,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:07" (1/1) ... [2018-01-30 01:18:07,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:07" (1/1) ... [2018-01-30 01:18:07,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:07" (1/1) ... [2018-01-30 01:18:07,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:07" (1/1) ... [2018-01-30 01:18:07,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:07" (1/1) ... [2018-01-30 01:18:07,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:07" (1/1) ... [2018-01-30 01:18:07,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:07" (1/1) ... [2018-01-30 01:18:07,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:18:07,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:18:07,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:18:07,197 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:18:07,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:07" (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 01:18:07,238 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:18:07,238 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:18:07,238 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 01:18:07,238 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:18:07,238 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 01:18:07,238 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 01:18:07,238 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:18:07,238 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:18:07,239 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:18:07,239 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:18:07,492 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:18:07,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:18:07 BoogieIcfgContainer [2018-01-30 01:18:07,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:18:07,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:18:07,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:18:07,495 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:18:07,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:18:07" (1/3) ... [2018-01-30 01:18:07,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a4d97b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:18:07, skipping insertion in model container [2018-01-30 01:18:07,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:07" (2/3) ... [2018-01-30 01:18:07,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a4d97b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:18:07, skipping insertion in model container [2018-01-30 01:18:07,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:18:07" (3/3) ... [2018-01-30 01:18:07,497 INFO L107 eAbstractionObserver]: Analyzing ICFG rewnif_true-unreach-call.i [2018-01-30 01:18:07,502 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:18:07,506 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 01:18:07,530 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:18:07,531 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:18:07,531 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:18:07,531 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:18:07,531 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:18:07,531 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:18:07,531 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:18:07,531 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:18:07,531 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:18:07,540 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-30 01:18:07,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-30 01:18:07,543 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:18:07,544 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] [2018-01-30 01:18:07,544 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:18:07,547 INFO L82 PathProgramCache]: Analyzing trace with hash 726012185, now seen corresponding path program 1 times [2018-01-30 01:18:07,548 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:18:07,548 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:18:07,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:07,576 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:18:07,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:18:07,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:18:07,618 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 01:18:07,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:18:07,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 01:18:07,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 01:18:07,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 01:18:07,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 01:18:07,629 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-01-30 01:18:07,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:18:07,641 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-01-30 01:18:07,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 01:18:07,642 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-30 01:18:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:18:07,648 INFO L225 Difference]: With dead ends: 56 [2018-01-30 01:18:07,648 INFO L226 Difference]: Without dead ends: 33 [2018-01-30 01:18:07,649 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 01:18:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-30 01:18:07,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-30 01:18:07,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-30 01:18:07,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-01-30 01:18:07,670 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 20 [2018-01-30 01:18:07,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:18:07,670 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-01-30 01:18:07,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 01:18:07,671 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-01-30 01:18:07,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-30 01:18:07,671 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:18:07,671 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] [2018-01-30 01:18:07,671 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:18:07,671 INFO L82 PathProgramCache]: Analyzing trace with hash 283091420, now seen corresponding path program 1 times [2018-01-30 01:18:07,671 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:18:07,672 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:18:07,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:07,672 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:18:07,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:18:07,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:18:07,797 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 01:18:07,797 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:18:07,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:18:07,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:18:07,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:18:07,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:18:07,807 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 4 states. [2018-01-30 01:18:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:18:08,019 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-01-30 01:18:08,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:18:08,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-30 01:18:08,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:18:08,021 INFO L225 Difference]: With dead ends: 65 [2018-01-30 01:18:08,021 INFO L226 Difference]: Without dead ends: 44 [2018-01-30 01:18:08,021 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:18:08,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-30 01:18:08,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-01-30 01:18:08,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-30 01:18:08,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-01-30 01:18:08,027 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 21 [2018-01-30 01:18:08,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:18:08,027 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-01-30 01:18:08,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:18:08,028 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-01-30 01:18:08,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-30 01:18:08,028 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:18:08,028 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] [2018-01-30 01:18:08,028 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:18:08,028 INFO L82 PathProgramCache]: Analyzing trace with hash 433486483, now seen corresponding path program 1 times [2018-01-30 01:18:08,028 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:18:08,029 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:18:08,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:08,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:18:08,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:18:08,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:18:08,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:18:08,192 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:18:08,193 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 01:18:08,202 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:18:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:18:08,220 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:18:08,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:18:08,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:18:08,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-01-30 01:18:08,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:18:08,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:18:08,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:18:08,314 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 9 states. [2018-01-30 01:18:08,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:18:08,589 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-01-30 01:18:08,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 01:18:08,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-01-30 01:18:08,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:18:08,590 INFO L225 Difference]: With dead ends: 75 [2018-01-30 01:18:08,590 INFO L226 Difference]: Without dead ends: 62 [2018-01-30 01:18:08,591 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2018-01-30 01:18:08,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-30 01:18:08,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2018-01-30 01:18:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-30 01:18:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-01-30 01:18:08,596 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 29 [2018-01-30 01:18:08,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:18:08,596 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-01-30 01:18:08,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:18:08,596 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-01-30 01:18:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 01:18:08,596 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:18:08,597 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 01:18:08,597 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:18:08,597 INFO L82 PathProgramCache]: Analyzing trace with hash -100943511, now seen corresponding path program 1 times [2018-01-30 01:18:08,597 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:18:08,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:18:08,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:08,598 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:18:08,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:18:08,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:18:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:18:09,199 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:18:09,199 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 01:18:09,213 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:18:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:18:09,225 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:18:09,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:18:09,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:18:09,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:18:09,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 01:18:09,314 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 11 [2018-01-30 01:18:09,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:18:09,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:18:09,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 01:18:09,371 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:18:09,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:18:09,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2018-01-30 01:18:09,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 01:18:09,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 01:18:09,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-01-30 01:18:09,389 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 19 states. [2018-01-30 01:18:09,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:18:09,985 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2018-01-30 01:18:09,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 01:18:09,985 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-01-30 01:18:09,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:18:09,986 INFO L225 Difference]: With dead ends: 101 [2018-01-30 01:18:09,986 INFO L226 Difference]: Without dead ends: 89 [2018-01-30 01:18:09,986 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2018-01-30 01:18:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-30 01:18:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2018-01-30 01:18:09,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-30 01:18:09,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-01-30 01:18:09,992 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 36 [2018-01-30 01:18:09,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:18:09,992 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-01-30 01:18:09,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 01:18:09,992 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-01-30 01:18:09,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-30 01:18:09,993 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:18:09,993 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-30 01:18:09,993 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:18:09,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1935702809, now seen corresponding path program 1 times [2018-01-30 01:18:09,993 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:18:09,993 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:18:09,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:09,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:18:09,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:18:10,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:18:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:18:10,281 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:18:10,282 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 01:18:10,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:18:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:18:10,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:18:10,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:18:10,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:18:10,322 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 01:18:10,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-30 01:18:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:18:10,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:18:10,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 20 [2018-01-30 01:18:10,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-30 01:18:10,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-30 01:18:10,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-01-30 01:18:10,392 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 20 states. [2018-01-30 01:18:10,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:18:10,811 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2018-01-30 01:18:10,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 01:18:10,812 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 46 [2018-01-30 01:18:10,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:18:10,813 INFO L225 Difference]: With dead ends: 113 [2018-01-30 01:18:10,813 INFO L226 Difference]: Without dead ends: 101 [2018-01-30 01:18:10,814 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2018-01-30 01:18:10,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-30 01:18:10,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 82. [2018-01-30 01:18:10,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-30 01:18:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-01-30 01:18:10,820 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 46 [2018-01-30 01:18:10,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:18:10,821 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-01-30 01:18:10,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-30 01:18:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-01-30 01:18:10,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-30 01:18:10,821 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:18:10,821 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:18:10,821 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:18:10,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1918503364, now seen corresponding path program 2 times [2018-01-30 01:18:10,822 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:18:10,822 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:18:10,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:10,822 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:18:10,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:18:10,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:18:11,000 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 01:18:11,000 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:18:11,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 01:18:11,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 01:18:11,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 01:18:11,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:18:11,000 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 7 states. [2018-01-30 01:18:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:18:11,041 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2018-01-30 01:18:11,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:18:11,044 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-01-30 01:18:11,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:18:11,044 INFO L225 Difference]: With dead ends: 134 [2018-01-30 01:18:11,044 INFO L226 Difference]: Without dead ends: 82 [2018-01-30 01:18:11,045 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:18:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-30 01:18:11,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-30 01:18:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-30 01:18:11,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-01-30 01:18:11,054 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 51 [2018-01-30 01:18:11,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:18:11,054 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-01-30 01:18:11,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 01:18:11,054 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-01-30 01:18:11,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-30 01:18:11,055 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:18:11,055 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:18:11,055 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:18:11,055 INFO L82 PathProgramCache]: Analyzing trace with hash 817022267, now seen corresponding path program 3 times [2018-01-30 01:18:11,055 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:18:11,055 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:18:11,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:11,056 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:18:11,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:18:11,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:18:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 11 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:18:11,360 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:18:11,360 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 01:18:11,386 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:18:11,390 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:18:11,393 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:18:11,394 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:18:11,395 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:18:11,398 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:18:11,398 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:18:11,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:18:11,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:18:11,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:18:11,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:18:11,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-30 01:18:11,495 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:11,505 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:11,505 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 14 treesize of output 25 [2018-01-30 01:18:11,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:18:11,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:18:11,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-01-30 01:18:11,549 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:11,549 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:11,550 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:11,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 34 [2018-01-30 01:18:11,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:18:11,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:18:11,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:24 [2018-01-30 01:18:11,609 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:11,609 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:11,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:11,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:11,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:11,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 53 [2018-01-30 01:18:11,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:18:11,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:18:11,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2018-01-30 01:18:11,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:11,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:11,652 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:11,653 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:11,654 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:11,654 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:11,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 64 [2018-01-30 01:18:11,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-30 01:18:11,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:18:11,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:67 [2018-01-30 01:18:12,109 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:12,109 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:12,110 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:12,112 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:12,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:12,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:12,115 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:12,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:12,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 45 treesize of output 94 [2018-01-30 01:18:12,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-01-30 01:18:12,219 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:12,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 40 [2018-01-30 01:18:12,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 01:18:12,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-01-30 01:18:12,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:79, output treesize:166 [2018-01-30 01:18:12,470 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 62 DAG size of output 55 [2018-01-30 01:18:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:18:12,724 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:18:12,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 33 [2018-01-30 01:18:12,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 01:18:12,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 01:18:12,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 01:18:12,725 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 33 states. [2018-01-30 01:18:23,175 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 38 DAG size of output 36 [2018-01-30 01:18:27,691 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 64 DAG size of output 60 [2018-01-30 01:18:28,211 WARN L146 SmtUtils]: Spent 264ms on a formula simplification. DAG size of input: 67 DAG size of output 62 [2018-01-30 01:18:28,421 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 62 DAG size of output 60 [2018-01-30 01:18:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:18:28,650 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2018-01-30 01:18:28,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-30 01:18:28,650 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 52 [2018-01-30 01:18:28,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:18:28,651 INFO L225 Difference]: With dead ends: 136 [2018-01-30 01:18:28,651 INFO L226 Difference]: Without dead ends: 124 [2018-01-30 01:18:28,652 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=391, Invalid=2261, Unknown=0, NotChecked=0, Total=2652 [2018-01-30 01:18:28,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-30 01:18:28,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 82. [2018-01-30 01:18:28,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-30 01:18:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-01-30 01:18:28,660 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 52 [2018-01-30 01:18:28,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:18:28,660 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-01-30 01:18:28,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 01:18:28,660 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-01-30 01:18:28,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-30 01:18:28,661 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:18:28,661 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:18:28,661 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:18:28,661 INFO L82 PathProgramCache]: Analyzing trace with hash 298945253, now seen corresponding path program 2 times [2018-01-30 01:18:28,661 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:18:28,661 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:18:28,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:28,662 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:18:28,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:18:28,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:18:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 01:18:28,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:18:28,719 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 01:18:28,726 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:18:28,731 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:18:28,735 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:18:28,738 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:18:28,739 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:18:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 01:18:28,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:18:28,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-01-30 01:18:28,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-30 01:18:28,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-30 01:18:28,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-01-30 01:18:28,938 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 16 states. [2018-01-30 01:18:29,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:18:29,083 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-01-30 01:18:29,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 01:18:29,084 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-01-30 01:18:29,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:18:29,084 INFO L225 Difference]: With dead ends: 128 [2018-01-30 01:18:29,084 INFO L226 Difference]: Without dead ends: 87 [2018-01-30 01:18:29,085 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2018-01-30 01:18:29,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-30 01:18:29,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2018-01-30 01:18:29,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-30 01:18:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-01-30 01:18:29,090 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 56 [2018-01-30 01:18:29,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:18:29,091 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-01-30 01:18:29,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-30 01:18:29,091 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-01-30 01:18:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-30 01:18:29,091 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:18:29,091 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 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] [2018-01-30 01:18:29,091 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:18:29,092 INFO L82 PathProgramCache]: Analyzing trace with hash 31420985, now seen corresponding path program 3 times [2018-01-30 01:18:29,092 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:18:29,092 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:18:29,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:29,092 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:18:29,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:18:29,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:18:29,403 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:18:29,403 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:18:29,403 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 01:18:29,410 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:18:29,414 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:18:29,416 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:18:29,417 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:18:29,418 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:18:29,420 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:18:29,421 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:18:29,422 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:18:29,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:18:29,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:18:29,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:18:29,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 01:18:29,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:29,473 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:29,473 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 14 treesize of output 25 [2018-01-30 01:18:29,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:18:29,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:18:29,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2018-01-30 01:18:29,493 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:29,493 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:29,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:29,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 34 [2018-01-30 01:18:29,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:18:29,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:18:29,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2018-01-30 01:18:29,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:29,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:29,571 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:29,572 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:29,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:29,578 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 2 case distinctions, treesize of input 24 treesize of output 53 [2018-01-30 01:18:29,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-30 01:18:29,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-30 01:18:29,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:55 [2018-01-30 01:18:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 7 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:18:29,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:18:29,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 32 [2018-01-30 01:18:29,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-30 01:18:29,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-30 01:18:29,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2018-01-30 01:18:29,885 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 32 states. [2018-01-30 01:18:37,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:18:37,871 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-01-30 01:18:37,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-30 01:18:37,871 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-01-30 01:18:37,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:18:37,872 INFO L225 Difference]: With dead ends: 133 [2018-01-30 01:18:37,872 INFO L226 Difference]: Without dead ends: 121 [2018-01-30 01:18:37,873 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=402, Invalid=2790, Unknown=0, NotChecked=0, Total=3192 [2018-01-30 01:18:37,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-30 01:18:37,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 67. [2018-01-30 01:18:37,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-30 01:18:37,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-01-30 01:18:37,880 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 62 [2018-01-30 01:18:37,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:18:37,880 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-01-30 01:18:37,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-30 01:18:37,881 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-01-30 01:18:37,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-30 01:18:37,881 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:18:37,881 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:18:37,881 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:18:37,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1512243506, now seen corresponding path program 4 times [2018-01-30 01:18:37,881 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:18:37,881 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:18:37,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:37,882 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:18:37,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:18:37,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:18:38,130 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 44 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 01:18:38,131 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:18:38,131 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 01:18:38,136 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:18:38,155 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:18:38,157 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:18:38,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:18:38,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:18:38,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:18:38,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 01:18:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 44 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 01:18:38,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:18:38,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 29 [2018-01-30 01:18:38,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 01:18:38,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 01:18:38,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2018-01-30 01:18:38,377 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 29 states. [2018-01-30 01:18:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:18:39,107 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2018-01-30 01:18:39,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-30 01:18:39,108 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 64 [2018-01-30 01:18:39,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:18:39,109 INFO L225 Difference]: With dead ends: 139 [2018-01-30 01:18:39,109 INFO L226 Difference]: Without dead ends: 127 [2018-01-30 01:18:39,109 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=2192, Unknown=0, NotChecked=0, Total=2450 [2018-01-30 01:18:39,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-30 01:18:39,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2018-01-30 01:18:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-30 01:18:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-01-30 01:18:39,120 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 64 [2018-01-30 01:18:39,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:18:39,120 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-01-30 01:18:39,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 01:18:39,121 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-01-30 01:18:39,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-30 01:18:39,122 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:18:39,122 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 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] [2018-01-30 01:18:39,122 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:18:39,122 INFO L82 PathProgramCache]: Analyzing trace with hash -173469684, now seen corresponding path program 5 times [2018-01-30 01:18:39,122 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:18:39,122 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:18:39,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:39,123 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:18:39,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:18:39,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:18:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 33 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 01:18:39,313 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:18:39,313 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 01:18:39,318 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 01:18:39,324 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:18:39,326 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:18:39,329 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:18:39,332 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:18:39,332 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:18:39,334 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:18:39,407 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 33 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-30 01:18:39,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:18:39,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2018-01-30 01:18:39,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 01:18:39,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 01:18:39,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-01-30 01:18:39,424 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 22 states. [2018-01-30 01:18:39,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:18:39,718 INFO L93 Difference]: Finished difference Result 160 states and 167 transitions. [2018-01-30 01:18:39,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 01:18:39,719 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 74 [2018-01-30 01:18:39,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:18:39,719 INFO L225 Difference]: With dead ends: 160 [2018-01-30 01:18:39,719 INFO L226 Difference]: Without dead ends: 109 [2018-01-30 01:18:39,720 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=1085, Unknown=0, NotChecked=0, Total=1332 [2018-01-30 01:18:39,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-30 01:18:39,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-01-30 01:18:39,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-30 01:18:39,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2018-01-30 01:18:39,730 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 74 [2018-01-30 01:18:39,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:18:39,730 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2018-01-30 01:18:39,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 01:18:39,730 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-01-30 01:18:39,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-30 01:18:39,731 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:18:39,731 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:18:39,731 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:18:39,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2039546976, now seen corresponding path program 6 times [2018-01-30 01:18:39,731 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:18:39,731 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:18:39,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:39,732 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:18:39,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:18:39,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:18:39,984 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 7 proven. 98 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 01:18:39,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:18:39,984 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 01:18:39,993 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 01:18:40,003 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:18:40,004 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:18:40,006 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:18:40,007 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:18:40,009 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:18:40,011 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:18:40,012 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:18:40,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:18:40,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:18:40,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:18:40,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:18:40,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 01:18:40,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 19 [2018-01-30 01:18:40,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-30 01:18:40,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:18:40,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:33 [2018-01-30 01:18:40,135 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:40,136 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 20 treesize of output 25 [2018-01-30 01:18:40,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:18:40,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:40,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:40,153 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 22 treesize of output 33 [2018-01-30 01:18:40,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:18:40,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:18:40,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:41 [2018-01-30 01:18:40,364 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:40,366 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:40,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:40,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 45 [2018-01-30 01:18:40,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-30 01:18:40,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-30 01:18:40,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:55 [2018-01-30 01:18:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 6 proven. 99 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-30 01:18:41,054 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:18:41,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 37 [2018-01-30 01:18:41,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-30 01:18:41,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-30 01:18:41,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1203, Unknown=0, NotChecked=0, Total=1332 [2018-01-30 01:18:41,055 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 37 states. [2018-01-30 01:18:50,457 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 40 DAG size of output 35 [2018-01-30 01:18:50,632 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 44 DAG size of output 37 [2018-01-30 01:18:51,000 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 37 DAG size of output 37 [2018-01-30 01:18:51,744 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 42 DAG size of output 39 [2018-01-30 01:18:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:18:52,634 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-01-30 01:18:52,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-01-30 01:18:52,635 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 80 [2018-01-30 01:18:52,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:18:52,635 INFO L225 Difference]: With dead ends: 146 [2018-01-30 01:18:52,636 INFO L226 Difference]: Without dead ends: 134 [2018-01-30 01:18:52,637 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1683 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=635, Invalid=5845, Unknown=0, NotChecked=0, Total=6480 [2018-01-30 01:18:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-30 01:18:52,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 85. [2018-01-30 01:18:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-30 01:18:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2018-01-30 01:18:52,646 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 80 [2018-01-30 01:18:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:18:52,647 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2018-01-30 01:18:52,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-30 01:18:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2018-01-30 01:18:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-30 01:18:52,647 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:18:52,647 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-01-30 01:18:52,648 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:18:52,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1995488181, now seen corresponding path program 7 times [2018-01-30 01:18:52,648 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:18:52,648 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:18:52,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:52,648 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:18:52,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:18:52,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:18:52,910 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 6 DAG size of output 5 [2018-01-30 01:18:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 11 proven. 81 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-30 01:18:53,293 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:18:53,293 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 01:18:53,316 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:18:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:18:53,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:18:53,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:18:53,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:18:53,399 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 01:18:53,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-30 01:18:54,747 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 5 proven. 87 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-30 01:18:54,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:18:54,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 40 [2018-01-30 01:18:54,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-30 01:18:54,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-30 01:18:54,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1425, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 01:18:54,765 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand 40 states. [2018-01-30 01:18:56,874 WARN L146 SmtUtils]: Spent 368ms on a formula simplification. DAG size of input: 48 DAG size of output 41 [2018-01-30 01:18:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:18:57,259 INFO L93 Difference]: Finished difference Result 196 states and 215 transitions. [2018-01-30 01:18:57,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-01-30 01:18:57,260 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 82 [2018-01-30 01:18:57,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:18:57,261 INFO L225 Difference]: With dead ends: 196 [2018-01-30 01:18:57,261 INFO L226 Difference]: Without dead ends: 148 [2018-01-30 01:18:57,262 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2118 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=764, Invalid=7068, Unknown=0, NotChecked=0, Total=7832 [2018-01-30 01:18:57,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-30 01:18:57,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 133. [2018-01-30 01:18:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-30 01:18:57,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 139 transitions. [2018-01-30 01:18:57,277 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 139 transitions. Word has length 82 [2018-01-30 01:18:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:18:57,278 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 139 transitions. [2018-01-30 01:18:57,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-30 01:18:57,278 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2018-01-30 01:18:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-01-30 01:18:57,278 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:18:57,278 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:18:57,278 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:18:57,279 INFO L82 PathProgramCache]: Analyzing trace with hash 591390727, now seen corresponding path program 8 times [2018-01-30 01:18:57,279 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:18:57,279 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:18:57,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:57,279 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:18:57,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:18:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:18:57,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:18:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 8 proven. 158 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-30 01:18:57,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:18:57,685 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 01:18:57,690 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:18:57,694 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:18:57,699 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:18:57,701 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:18:57,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:18:57,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:18:57,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:18:57,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:18:57,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 01:18:57,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:57,766 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:57,766 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 14 treesize of output 25 [2018-01-30 01:18:57,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:18:57,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:18:57,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-01-30 01:18:57,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:57,789 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:57,789 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:18:57,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 34 [2018-01-30 01:18:57,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:18:57,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:18:57,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2018-01-30 01:18:58,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 01:18:58,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:18:58,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:18:58,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2018-01-30 01:18:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 5 proven. 161 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-30 01:18:58,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:18:58,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 45 [2018-01-30 01:18:58,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-01-30 01:18:58,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-01-30 01:18:58,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1777, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 01:18:58,358 INFO L87 Difference]: Start difference. First operand 133 states and 139 transitions. Second operand 45 states. [2018-01-30 01:19:00,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:19:00,783 INFO L93 Difference]: Finished difference Result 233 states and 257 transitions. [2018-01-30 01:19:00,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-01-30 01:19:00,783 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 98 [2018-01-30 01:19:00,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:19:00,784 INFO L225 Difference]: With dead ends: 233 [2018-01-30 01:19:00,784 INFO L226 Difference]: Without dead ends: 221 [2018-01-30 01:19:00,786 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4374 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1336, Invalid=13184, Unknown=0, NotChecked=0, Total=14520 [2018-01-30 01:19:00,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-30 01:19:00,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 193. [2018-01-30 01:19:00,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-30 01:19:00,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 206 transitions. [2018-01-30 01:19:00,811 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 206 transitions. Word has length 98 [2018-01-30 01:19:00,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:19:00,811 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 206 transitions. [2018-01-30 01:19:00,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-01-30 01:19:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 206 transitions. [2018-01-30 01:19:00,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-01-30 01:19:00,812 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:19:00,812 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:19:00,812 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:19:00,812 INFO L82 PathProgramCache]: Analyzing trace with hash 183274396, now seen corresponding path program 9 times [2018-01-30 01:19:00,812 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:19:00,812 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:19:00,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:00,813 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:19:00,813 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:19:00,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:19:01,537 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 7 proven. 144 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-30 01:19:01,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:19:01,537 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 01:19:01,542 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:19:01,546 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:19:01,548 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:19:01,550 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:19:01,552 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:19:01,555 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:19:01,558 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:19:01,559 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:19:01,560 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:19:01,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:19:01,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:01,748 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 01:19:01,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-01-30 01:19:01,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 01:19:01,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:01,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:01,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2018-01-30 01:19:01,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 01:19:01,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:01,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:01,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2018-01-30 01:19:02,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 01:19:02,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:02,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:02,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2018-01-30 01:19:02,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 01:19:02,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:02,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:02,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2018-01-30 01:19:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 44 proven. 98 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-30 01:19:02,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:19:02,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 51 [2018-01-30 01:19:02,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-01-30 01:19:02,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-01-30 01:19:02,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2362, Unknown=0, NotChecked=0, Total=2550 [2018-01-30 01:19:02,349 INFO L87 Difference]: Start difference. First operand 193 states and 206 transitions. Second operand 51 states. [2018-01-30 01:19:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:19:04,113 INFO L93 Difference]: Finished difference Result 236 states and 249 transitions. [2018-01-30 01:19:04,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-01-30 01:19:04,113 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-01-30 01:19:04,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:19:04,114 INFO L225 Difference]: With dead ends: 236 [2018-01-30 01:19:04,114 INFO L226 Difference]: Without dead ends: 165 [2018-01-30 01:19:04,116 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2101 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=817, Invalid=9283, Unknown=0, NotChecked=0, Total=10100 [2018-01-30 01:19:04,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-30 01:19:04,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2018-01-30 01:19:04,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-30 01:19:04,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 170 transitions. [2018-01-30 01:19:04,137 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 170 transitions. Word has length 100 [2018-01-30 01:19:04,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:19:04,137 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 170 transitions. [2018-01-30 01:19:04,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-01-30 01:19:04,138 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 170 transitions. [2018-01-30 01:19:04,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-01-30 01:19:04,138 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:19:04,139 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 7, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:19:04,139 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:19:04,139 INFO L82 PathProgramCache]: Analyzing trace with hash 277876695, now seen corresponding path program 10 times [2018-01-30 01:19:04,139 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:19:04,139 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:19:04,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:04,139 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:19:04,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:19:04,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:19:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 15 proven. 283 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-30 01:19:04,645 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:19:04,645 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 01:19:04,650 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:19:04,663 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:19:04,665 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:19:04,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:19:04,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:04,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:04,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 01:19:04,719 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:04,720 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:04,720 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 14 treesize of output 25 [2018-01-30 01:19:04,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:04,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:04,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-01-30 01:19:04,747 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:04,747 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:04,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:04,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 34 [2018-01-30 01:19:04,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:04,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:04,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2018-01-30 01:19:04,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:04,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:04,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:04,827 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 0 case distinctions, treesize of input 24 treesize of output 41 [2018-01-30 01:19:04,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:04,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:04,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-01-30 01:19:04,862 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:04,862 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:04,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:04,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-01-30 01:19:04,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:04,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:04,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-01-30 01:19:04,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-01-30 01:19:04,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:05,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:05,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-01-30 01:19:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 7 proven. 291 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-30 01:19:05,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:19:05,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 37] total 57 [2018-01-30 01:19:05,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-01-30 01:19:05,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-01-30 01:19:05,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=2915, Unknown=0, NotChecked=0, Total=3192 [2018-01-30 01:19:05,459 INFO L87 Difference]: Start difference. First operand 161 states and 170 transitions. Second operand 57 states. [2018-01-30 01:19:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:19:09,194 INFO L93 Difference]: Finished difference Result 286 states and 316 transitions. [2018-01-30 01:19:09,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-01-30 01:19:09,194 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 124 [2018-01-30 01:19:09,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:19:09,195 INFO L225 Difference]: With dead ends: 286 [2018-01-30 01:19:09,195 INFO L226 Difference]: Without dead ends: 274 [2018-01-30 01:19:09,196 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 100 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7529 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1867, Invalid=22003, Unknown=0, NotChecked=0, Total=23870 [2018-01-30 01:19:09,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-01-30 01:19:09,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 243. [2018-01-30 01:19:09,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-01-30 01:19:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 261 transitions. [2018-01-30 01:19:09,226 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 261 transitions. Word has length 124 [2018-01-30 01:19:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:19:09,227 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 261 transitions. [2018-01-30 01:19:09,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-01-30 01:19:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 261 transitions. [2018-01-30 01:19:09,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-01-30 01:19:09,228 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:19:09,228 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:19:09,228 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:19:09,228 INFO L82 PathProgramCache]: Analyzing trace with hash -925503103, now seen corresponding path program 11 times [2018-01-30 01:19:09,228 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:19:09,228 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:19:09,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:09,228 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:19:09,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:19:09,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:19:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 120 proven. 127 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-01-30 01:19:09,911 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:19:09,912 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 01:19:09,924 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 01:19:09,928 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:19:09,930 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:19:09,932 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:19:09,934 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:19:09,937 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:19:09,940 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:19:09,946 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:19:09,947 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:19:09,948 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:19:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 120 proven. 127 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-01-30 01:19:10,157 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:19:10,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 40 [2018-01-30 01:19:10,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-30 01:19:10,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-30 01:19:10,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1324, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 01:19:10,158 INFO L87 Difference]: Start difference. First operand 243 states and 261 transitions. Second operand 40 states. [2018-01-30 01:19:10,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:19:10,738 INFO L93 Difference]: Finished difference Result 320 states and 340 transitions. [2018-01-30 01:19:10,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-01-30 01:19:10,738 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 128 [2018-01-30 01:19:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:19:10,739 INFO L225 Difference]: With dead ends: 320 [2018-01-30 01:19:10,739 INFO L226 Difference]: Without dead ends: 243 [2018-01-30 01:19:10,740 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=754, Invalid=4076, Unknown=0, NotChecked=0, Total=4830 [2018-01-30 01:19:10,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-01-30 01:19:10,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-01-30 01:19:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-01-30 01:19:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 260 transitions. [2018-01-30 01:19:10,769 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 260 transitions. Word has length 128 [2018-01-30 01:19:10,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:19:10,769 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 260 transitions. [2018-01-30 01:19:10,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-30 01:19:10,769 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 260 transitions. [2018-01-30 01:19:10,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-01-30 01:19:10,770 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:19:10,770 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:19:10,770 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:19:10,770 INFO L82 PathProgramCache]: Analyzing trace with hash -864312214, now seen corresponding path program 12 times [2018-01-30 01:19:10,770 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:19:10,771 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:19:10,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:10,771 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:19:10,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:19:10,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:19:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 11 proven. 300 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-30 01:19:11,430 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:19:11,430 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 01:19:11,434 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 01:19:11,439 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:19:11,441 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:19:11,442 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:19:11,445 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:19:11,447 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:19:11,450 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:19:11,453 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:19:11,457 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:19:11,458 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:19:11,460 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:19:11,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:19:11,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:11,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:11,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 01:19:11,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 01:19:11,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:11,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:11,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2018-01-30 01:19:12,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 01:19:12,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:12,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:12,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2018-01-30 01:19:12,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 01:19:12,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:12,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:12,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2018-01-30 01:19:12,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 01:19:12,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:12,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:12,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2018-01-30 01:19:12,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 01:19:12,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:12,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:12,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2018-01-30 01:19:12,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 01:19:12,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:12,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:12,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2018-01-30 01:19:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 117 proven. 194 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-30 01:19:12,938 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:19:12,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 39] total 70 [2018-01-30 01:19:12,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-01-30 01:19:12,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-01-30 01:19:12,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=4519, Unknown=0, NotChecked=0, Total=4830 [2018-01-30 01:19:12,939 INFO L87 Difference]: Start difference. First operand 243 states and 260 transitions. Second operand 70 states. [2018-01-30 01:19:17,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:19:17,626 INFO L93 Difference]: Finished difference Result 354 states and 379 transitions. [2018-01-30 01:19:17,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-01-30 01:19:17,626 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-01-30 01:19:17,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:19:17,627 INFO L225 Difference]: With dead ends: 354 [2018-01-30 01:19:17,627 INFO L226 Difference]: Without dead ends: 267 [2018-01-30 01:19:17,628 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7228 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1688, Invalid=27042, Unknown=0, NotChecked=0, Total=28730 [2018-01-30 01:19:17,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-01-30 01:19:17,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 249. [2018-01-30 01:19:17,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-01-30 01:19:17,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 266 transitions. [2018-01-30 01:19:17,678 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 266 transitions. Word has length 136 [2018-01-30 01:19:17,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:19:17,678 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 266 transitions. [2018-01-30 01:19:17,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-01-30 01:19:17,678 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 266 transitions. [2018-01-30 01:19:17,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-01-30 01:19:17,679 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:19:17,680 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 9, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:19:17,680 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:19:17,680 INFO L82 PathProgramCache]: Analyzing trace with hash 245575975, now seen corresponding path program 13 times [2018-01-30 01:19:17,680 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:19:17,680 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:19:17,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:17,680 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:19:17,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:19:17,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:19:18,407 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 39 proven. 429 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-30 01:19:18,407 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:19:18,407 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-30 01:19:18,414 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:19:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:19:18,433 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:19:18,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 01:19:18,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:18,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:18,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 01:19:18,497 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:18,497 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:18,498 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 14 treesize of output 25 [2018-01-30 01:19:18,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:18,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:18,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-01-30 01:19:18,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:18,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:18,530 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:18,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 34 [2018-01-30 01:19:18,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:18,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:18,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2018-01-30 01:19:18,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:18,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:18,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:18,626 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 0 case distinctions, treesize of input 24 treesize of output 41 [2018-01-30 01:19:18,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:18,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:18,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-01-30 01:19:18,665 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:18,666 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:18,666 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:18,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-01-30 01:19:18,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:18,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:18,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-01-30 01:19:18,766 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:18,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:18,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:18,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:18,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 52 [2018-01-30 01:19:18,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:18,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:18,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:31 [2018-01-30 01:19:18,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:18,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:18,814 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:19:18,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 64 [2018-01-30 01:19:18,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:18,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:18,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:31 [2018-01-30 01:19:18,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-01-30 01:19:18,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:18,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:18,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-01-30 01:19:19,565 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 9 proven. 459 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-30 01:19:19,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:19:19,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 45] total 66 [2018-01-30 01:19:19,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-01-30 01:19:19,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-01-30 01:19:19,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=3979, Unknown=0, NotChecked=0, Total=4290 [2018-01-30 01:19:19,582 INFO L87 Difference]: Start difference. First operand 249 states and 266 transitions. Second operand 66 states. Received shutdown request... [2018-01-30 01:19:22,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-01-30 01:19:22,603 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 01:19:22,606 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 01:19:22,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:19:22 BoogieIcfgContainer [2018-01-30 01:19:22,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 01:19:22,606 INFO L168 Benchmark]: Toolchain (without parser) took 75531.32 ms. Allocated memory was 149.9 MB in the beginning and 482.3 MB in the end (delta: 332.4 MB). Free memory was 115.0 MB in the beginning and 318.2 MB in the end (delta: -203.2 MB). Peak memory consumption was 129.2 MB. Max. memory is 5.3 GB. [2018-01-30 01:19:22,607 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 149.9 MB. Free memory is still 119.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:19:22,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 102.51 ms. Allocated memory is still 149.9 MB. Free memory was 114.8 MB in the beginning and 106.9 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-01-30 01:19:22,607 INFO L168 Benchmark]: Boogie Preprocessor took 17.70 ms. Allocated memory is still 149.9 MB. Free memory was 106.9 MB in the beginning and 105.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. [2018-01-30 01:19:22,608 INFO L168 Benchmark]: RCFGBuilder took 295.64 ms. Allocated memory is still 149.9 MB. Free memory was 105.1 MB in the beginning and 93.4 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 5.3 GB. [2018-01-30 01:19:22,608 INFO L168 Benchmark]: TraceAbstraction took 75113.23 ms. Allocated memory was 149.9 MB in the beginning and 482.3 MB in the end (delta: 332.4 MB). Free memory was 93.2 MB in the beginning and 318.2 MB in the end (delta: -225.0 MB). Peak memory consumption was 107.4 MB. Max. memory is 5.3 GB. [2018-01-30 01:19:22,608 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 149.9 MB. Free memory is still 119.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 102.51 ms. Allocated memory is still 149.9 MB. Free memory was 114.8 MB in the beginning and 106.9 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 17.70 ms. Allocated memory is still 149.9 MB. Free memory was 106.9 MB in the beginning and 105.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 295.64 ms. Allocated memory is still 149.9 MB. Free memory was 105.1 MB in the beginning and 93.4 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 75113.23 ms. Allocated memory was 149.9 MB in the beginning and 482.3 MB in the end (delta: 332.4 MB). Free memory was 93.2 MB in the beginning and 318.2 MB in the end (delta: -225.0 MB). Peak memory consumption was 107.4 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 (249states) and interpolant automaton (currently 96 states, 66 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 133 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 1 error locations. TIMEOUT Result, 75.0s OverallTime, 19 OverallIterations, 11 TraceHistogramMax, 56.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 799 SDtfs, 2405 SDslu, 14381 SDs, 0 SdLazy, 25740 SolverSat, 1405 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 39.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2344 GetRequests, 1088 SyntacticMatches, 58 SemanticMatches, 1197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34243 ImplicationChecksByTransitivity, 29.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 328 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 2726 NumberOfCodeBlocks, 2724 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 2691 ConstructedInterpolants, 167 QuantifiedInterpolants, 2235554 SizeOfPredicates, 257 NumberOfNonLiveVariables, 2029 ConjunctsInSsa, 523 ConjunctsInUnsatCore, 35 InterpolantComputations, 3 PerfectInterpolantSequences, 1109/4663 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/rewnif_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_01-19-22-612.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rewnif_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_01-19-22-612.csv Completed graceful shutdown