java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-examples/standard_two_index_06_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 04:03:54,283 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 04:03:54,284 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 04:03:54,296 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 04:03:54,297 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 04:03:54,297 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 04:03:54,298 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 04:03:54,299 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 04:03:54,300 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 04:03:54,300 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 04:03:54,301 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 04:03:54,301 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 04:03:54,301 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 04:03:54,302 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 04:03:54,302 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 04:03:54,304 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 04:03:54,305 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 04:03:54,306 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 04:03:54,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 04:03:54,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 04:03:54,308 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 04:03:54,308 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 04:03:54,309 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 04:03:54,309 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 04:03:54,309 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 04:03:54,310 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 04:03:54,310 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 04:03:54,311 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 04:03:54,311 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 04:03:54,311 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 04:03:54,311 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 04:03:54,311 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 04:03:54,317 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 04:03:54,317 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 04:03:54,317 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 04:03:54,317 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 04:03:54,317 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 04:03:54,317 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 04:03:54,318 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 04:03:54,318 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 04:03:54,318 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 04:03:54,318 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 04:03:54,318 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 04:03:54,318 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 04:03:54,318 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 04:03:54,318 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 04:03:54,319 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 04:03:54,319 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 04:03:54,319 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 04:03:54,319 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 04:03:54,319 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 04:03:54,319 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 04:03:54,319 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 04:03:54,319 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 04:03:54,319 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 04:03:54,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 04:03:54,319 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 04:03:54,319 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 04:03:54,320 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 04:03:54,320 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 04:03:54,320 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 04:03:54,320 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 04:03:54,320 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 04:03:54,320 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 04:03:54,320 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 04:03:54,320 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 04:03:54,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 04:03:54,346 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 04:03:54,348 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 04:03:54,349 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 04:03:54,349 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 04:03:54,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_06_true-unreach-call.i [2018-01-30 04:03:54,413 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 04:03:54,413 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 04:03:54,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 04:03:54,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 04:03:54,418 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 04:03:54,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 04:03:54" (1/1) ... [2018-01-30 04:03:54,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1b5fa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:03:54, skipping insertion in model container [2018-01-30 04:03:54,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 04:03:54" (1/1) ... [2018-01-30 04:03:54,429 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 04:03:54,438 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 04:03:54,507 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 04:03:54,516 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 04:03:54,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:03:54 WrapperNode [2018-01-30 04:03:54,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 04:03:54,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 04:03:54,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 04:03:54,520 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 04:03:54,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:03:54" (1/1) ... [2018-01-30 04:03:54,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:03:54" (1/1) ... [2018-01-30 04:03:54,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:03:54" (1/1) ... [2018-01-30 04:03:54,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:03:54" (1/1) ... [2018-01-30 04:03:54,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:03:54" (1/1) ... [2018-01-30 04:03:54,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:03:54" (1/1) ... [2018-01-30 04:03:54,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:03:54" (1/1) ... [2018-01-30 04:03:54,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 04:03:54,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 04:03:54,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 04:03:54,538 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 04:03:54,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:03:54" (1/1) ... No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 04:03:54,583 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 04:03:54,584 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 04:03:54,584 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 04:03:54,584 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 04:03:54,584 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 04:03:54,584 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 04:03:54,584 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 04:03:54,584 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 04:03:54,584 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 04:03:54,584 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 04:03:54,836 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 04:03:54,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 04:03:54 BoogieIcfgContainer [2018-01-30 04:03:54,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 04:03:54,837 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 04:03:54,837 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 04:03:54,838 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 04:03:54,840 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 04:03:54" (1/1) ... [2018-01-30 04:03:54,842 WARN L213 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-01-30 04:03:54,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 04:03:54 BasicIcfg [2018-01-30 04:03:54,849 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 04:03:54,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 04:03:54,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 04:03:54,851 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 04:03:54,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 04:03:54" (1/4) ... [2018-01-30 04:03:54,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64750dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 04:03:54, skipping insertion in model container [2018-01-30 04:03:54,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:03:54" (2/4) ... [2018-01-30 04:03:54,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64750dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 04:03:54, skipping insertion in model container [2018-01-30 04:03:54,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 04:03:54" (3/4) ... [2018-01-30 04:03:54,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64750dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 04:03:54, skipping insertion in model container [2018-01-30 04:03:54,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 04:03:54" (4/4) ... [2018-01-30 04:03:54,853 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_two_index_06_true-unreach-call.ileft_unchanged_by_heapseparator [2018-01-30 04:03:54,858 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 04:03:54,867 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 04:03:54,890 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 04:03:54,890 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 04:03:54,890 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 04:03:54,890 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 04:03:54,890 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 04:03:54,890 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 04:03:54,890 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 04:03:54,891 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 04:03:54,891 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 04:03:54,900 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-30 04:03:54,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-30 04:03:54,903 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:03:54,904 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:03:54,904 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:03:54,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1467335525, now seen corresponding path program 1 times [2018-01-30 04:03:54,907 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:03:54,908 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:03:54,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:54,939 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:03:54,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:03:54,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:03:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:03:54,976 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 04:03:54,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 04:03:54,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 04:03:54,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 04:03:54,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 04:03:54,986 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-01-30 04:03:54,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:03:54,998 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-01-30 04:03:54,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 04:03:54,999 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-30 04:03:54,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:03:55,004 INFO L225 Difference]: With dead ends: 62 [2018-01-30 04:03:55,004 INFO L226 Difference]: Without dead ends: 33 [2018-01-30 04:03:55,006 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 04:03:55,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-30 04:03:55,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-30 04:03:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-30 04:03:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-01-30 04:03:55,027 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 19 [2018-01-30 04:03:55,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:03:55,027 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-01-30 04:03:55,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 04:03:55,027 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-01-30 04:03:55,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-30 04:03:55,028 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:03:55,028 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 04:03:55,028 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:03:55,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1534800412, now seen corresponding path program 1 times [2018-01-30 04:03:55,028 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:03:55,028 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:03:55,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:55,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:03:55,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:03:55,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:03:55,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:03:55,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 04:03:55,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 04:03:55,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 04:03:55,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 04:03:55,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 04:03:55,130 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 3 states. [2018-01-30 04:03:55,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:03:55,203 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-01-30 04:03:55,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 04:03:55,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-01-30 04:03:55,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:03:55,204 INFO L225 Difference]: With dead ends: 58 [2018-01-30 04:03:55,204 INFO L226 Difference]: Without dead ends: 39 [2018-01-30 04:03:55,205 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 04:03:55,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-30 04:03:55,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-01-30 04:03:55,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-30 04:03:55,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-01-30 04:03:55,208 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2018-01-30 04:03:55,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:03:55,208 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-01-30 04:03:55,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 04:03:55,208 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-01-30 04:03:55,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-30 04:03:55,209 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:03:55,209 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] [2018-01-30 04:03:55,209 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:03:55,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1177485203, now seen corresponding path program 1 times [2018-01-30 04:03:55,209 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:03:55,209 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:03:55,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:55,210 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:03:55,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:03:55,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:03:55,277 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 04:03:55,277 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:03:55,277 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 04:03:55,295 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:03:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:03:55,319 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:03:55,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 04:03:55,347 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 04:03:55,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-01-30 04:03:55,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 04:03:55,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 04:03:55,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 04:03:55,348 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 4 states. [2018-01-30 04:03:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:03:55,480 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2018-01-30 04:03:55,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 04:03:55,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-30 04:03:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:03:55,482 INFO L225 Difference]: With dead ends: 72 [2018-01-30 04:03:55,482 INFO L226 Difference]: Without dead ends: 53 [2018-01-30 04:03:55,483 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 04:03:55,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-30 04:03:55,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2018-01-30 04:03:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-30 04:03:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-30 04:03:55,488 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 27 [2018-01-30 04:03:55,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:03:55,488 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-30 04:03:55,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 04:03:55,488 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-30 04:03:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 04:03:55,489 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:03:55,489 INFO L350 BasicCegarLoop]: trace histogram [3, 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] [2018-01-30 04:03:55,489 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:03:55,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1314058504, now seen corresponding path program 1 times [2018-01-30 04:03:55,489 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:03:55,489 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:03:55,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:55,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:03:55,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:03:55,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:03:55,537 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-30 04:03:55,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:03:55,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 04:03:55,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:03:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:03:55,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:03:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 04:03:55,621 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:03:55,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 6 [2018-01-30 04:03:55,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 04:03:55,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 04:03:55,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-30 04:03:55,622 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 6 states. [2018-01-30 04:03:55,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:03:55,792 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-01-30 04:03:55,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 04:03:55,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-01-30 04:03:55,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:03:55,793 INFO L225 Difference]: With dead ends: 96 [2018-01-30 04:03:55,793 INFO L226 Difference]: Without dead ends: 75 [2018-01-30 04:03:55,793 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-30 04:03:55,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-30 04:03:55,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2018-01-30 04:03:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-30 04:03:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-01-30 04:03:55,797 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 38 [2018-01-30 04:03:55,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:03:55,797 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-01-30 04:03:55,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 04:03:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-01-30 04:03:55,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-30 04:03:55,798 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:03:55,798 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 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 04:03:55,798 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:03:55,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1153596856, now seen corresponding path program 2 times [2018-01-30 04:03:55,799 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:03:55,799 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:03:55,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:55,799 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:03:55,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:03:55,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:03:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-30 04:03:55,942 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:03:55,942 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) [2018-01-30 04:03:55,951 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 04:03:55,960 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:03:55,964 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:03:55,966 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:03:55,967 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:03:55,974 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-30 04:03:55,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:03:55,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-30 04:03:55,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 04:03:55,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 04:03:55,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-30 04:03:55,992 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 7 states. [2018-01-30 04:03:56,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:03:56,175 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2018-01-30 04:03:56,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 04:03:56,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-01-30 04:03:56,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:03:56,177 INFO L225 Difference]: With dead ends: 100 [2018-01-30 04:03:56,177 INFO L226 Difference]: Without dead ends: 74 [2018-01-30 04:03:56,178 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-30 04:03:56,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-30 04:03:56,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2018-01-30 04:03:56,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-30 04:03:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-01-30 04:03:56,184 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 55 [2018-01-30 04:03:56,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:03:56,184 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-01-30 04:03:56,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 04:03:56,184 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-01-30 04:03:56,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-30 04:03:56,185 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:03:56,185 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 3, 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 04:03:56,185 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:03:56,185 INFO L82 PathProgramCache]: Analyzing trace with hash 587476335, now seen corresponding path program 3 times [2018-01-30 04:03:56,185 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:03:56,185 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:03:56,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:56,186 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:03:56,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:03:56,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:03:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-30 04:03:56,313 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:03:56,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-30 04:03:56,318 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 04:03:56,322 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:03:56,336 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:03:56,349 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:03:56,361 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:03:56,363 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:03:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-30 04:03:56,504 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:03:56,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2018-01-30 04:03:56,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 04:03:56,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 04:03:56,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-01-30 04:03:56,505 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 10 states. [2018-01-30 04:03:56,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:03:56,711 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2018-01-30 04:03:56,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 04:03:56,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-01-30 04:03:56,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:03:56,712 INFO L225 Difference]: With dead ends: 135 [2018-01-30 04:03:56,712 INFO L226 Difference]: Without dead ends: 109 [2018-01-30 04:03:56,713 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-01-30 04:03:56,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-30 04:03:56,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 89. [2018-01-30 04:03:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-30 04:03:56,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2018-01-30 04:03:56,717 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 61 [2018-01-30 04:03:56,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:03:56,718 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2018-01-30 04:03:56,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 04:03:56,718 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-01-30 04:03:56,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-30 04:03:56,719 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:03:56,719 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:03:56,719 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:03:56,719 INFO L82 PathProgramCache]: Analyzing trace with hash -621303298, now seen corresponding path program 4 times [2018-01-30 04:03:56,720 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:03:56,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:03:56,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:56,720 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:03:56,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:03:56,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:03:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-30 04:03:56,979 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:03:56,980 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 04:03:56,984 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 04:03:56,998 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:03:57,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:03:57,035 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 8 treesize of output 7 [2018-01-30 04:03:57,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:03:57,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 04:03:57,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 04:03:57,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:03:57,074 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 16 treesize of output 19 [2018-01-30 04:03:57,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:03:57,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 04:03:57,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 04:03:57,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:03:57,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:03:57,167 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 23 treesize of output 30 [2018-01-30 04:03:57,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:03:57,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-30 04:03:57,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:25 [2018-01-30 04:03:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-01-30 04:03:57,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:03:57,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-01-30 04:03:57,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 04:03:57,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 04:03:57,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-01-30 04:03:57,377 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 21 states. [2018-01-30 04:03:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:03:57,911 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-01-30 04:03:57,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-30 04:03:57,911 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 84 [2018-01-30 04:03:57,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:03:57,912 INFO L225 Difference]: With dead ends: 145 [2018-01-30 04:03:57,912 INFO L226 Difference]: Without dead ends: 114 [2018-01-30 04:03:57,913 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=318, Invalid=1322, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 04:03:57,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-30 04:03:57,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2018-01-30 04:03:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-30 04:03:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2018-01-30 04:03:57,919 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 84 [2018-01-30 04:03:57,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:03:57,921 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2018-01-30 04:03:57,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 04:03:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2018-01-30 04:03:57,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-30 04:03:57,922 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:03:57,922 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:03:57,922 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:03:57,923 INFO L82 PathProgramCache]: Analyzing trace with hash 376662990, now seen corresponding path program 1 times [2018-01-30 04:03:57,923 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:03:57,923 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:03:57,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:57,923 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:03:57,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:03:57,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:03:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 2 proven. 234 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-30 04:03:58,050 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:03:58,050 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 04:03:58,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:03:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:03:58,077 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:03:58,090 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-01-30 04:03:58,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:03:58,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-01-30 04:03:58,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 04:03:58,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 04:03:58,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-30 04:03:58,108 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 12 states. [2018-01-30 04:03:58,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:03:58,213 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2018-01-30 04:03:58,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 04:03:58,225 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-01-30 04:03:58,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:03:58,225 INFO L225 Difference]: With dead ends: 156 [2018-01-30 04:03:58,225 INFO L226 Difference]: Without dead ends: 118 [2018-01-30 04:03:58,226 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-01-30 04:03:58,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-30 04:03:58,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2018-01-30 04:03:58,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-30 04:03:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2018-01-30 04:03:58,231 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 99 [2018-01-30 04:03:58,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:03:58,231 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2018-01-30 04:03:58,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 04:03:58,231 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2018-01-30 04:03:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-30 04:03:58,232 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:03:58,232 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:03:58,232 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:03:58,232 INFO L82 PathProgramCache]: Analyzing trace with hash -988437243, now seen corresponding path program 2 times [2018-01-30 04:03:58,232 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:03:58,232 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:03:58,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:58,233 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:03:58,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:03:58,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:03:58,426 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 2 proven. 290 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-30 04:03:58,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:03:58,426 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 04:03:58,437 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 04:03:58,442 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:03:58,459 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:03:58,460 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:03:58,462 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:03:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-01-30 04:03:58,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:03:58,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-01-30 04:03:58,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 04:03:58,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 04:03:58,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-01-30 04:03:58,488 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand 13 states. [2018-01-30 04:03:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:03:58,583 INFO L93 Difference]: Finished difference Result 162 states and 169 transitions. [2018-01-30 04:03:58,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 04:03:58,594 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 105 [2018-01-30 04:03:58,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:03:58,595 INFO L225 Difference]: With dead ends: 162 [2018-01-30 04:03:58,595 INFO L226 Difference]: Without dead ends: 124 [2018-01-30 04:03:58,596 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-01-30 04:03:58,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-30 04:03:58,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2018-01-30 04:03:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-30 04:03:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2018-01-30 04:03:58,601 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 105 [2018-01-30 04:03:58,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:03:58,601 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2018-01-30 04:03:58,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 04:03:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-01-30 04:03:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-01-30 04:03:58,602 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:03:58,602 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:03:58,602 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:03:58,602 INFO L82 PathProgramCache]: Analyzing trace with hash 316659964, now seen corresponding path program 3 times [2018-01-30 04:03:58,602 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:03:58,602 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:03:58,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:58,602 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:03:58,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:03:58,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:03:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 2 proven. 352 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-30 04:03:58,790 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:03:58,790 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 04:03:58,796 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 04:03:58,801 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:03:58,816 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:03:58,829 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:03:58,836 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:03:58,848 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:03:58,849 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:03:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-01-30 04:03:59,123 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:03:59,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 16 [2018-01-30 04:03:59,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-30 04:03:59,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-30 04:03:59,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-01-30 04:03:59,124 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand 16 states. [2018-01-30 04:03:59,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:03:59,474 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2018-01-30 04:03:59,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 04:03:59,481 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 111 [2018-01-30 04:03:59,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:03:59,481 INFO L225 Difference]: With dead ends: 197 [2018-01-30 04:03:59,481 INFO L226 Difference]: Without dead ends: 159 [2018-01-30 04:03:59,482 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-01-30 04:03:59,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-30 04:03:59,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2018-01-30 04:03:59,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-30 04:03:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2018-01-30 04:03:59,487 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 111 [2018-01-30 04:03:59,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:03:59,487 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2018-01-30 04:03:59,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-30 04:03:59,487 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2018-01-30 04:03:59,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-01-30 04:03:59,488 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:03:59,488 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:03:59,488 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:03:59,488 INFO L82 PathProgramCache]: Analyzing trace with hash 2082105079, now seen corresponding path program 4 times [2018-01-30 04:03:59,488 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:03:59,488 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:03:59,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:59,489 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:03:59,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:03:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:03:59,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:03:59,683 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 2 proven. 574 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-30 04:03:59,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:03:59,683 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 04:03:59,688 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 04:03:59,701 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:03:59,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:03:59,797 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 8 treesize of output 7 [2018-01-30 04:03:59,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:03:59,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 04:03:59,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 04:03:59,829 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:03:59,830 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 16 treesize of output 19 [2018-01-30 04:03:59,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:03:59,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 04:03:59,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 04:03:59,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:03:59,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:03:59,881 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:03:59,883 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 23 treesize of output 34 [2018-01-30 04:03:59,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:03:59,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-30 04:03:59,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:30 [2018-01-30 04:04:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 4 proven. 473 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-01-30 04:04:00,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:04:00,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25] total 40 [2018-01-30 04:04:00,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-30 04:04:00,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-30 04:04:00,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=1244, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 04:04:00,626 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand 40 states. [2018-01-30 04:04:04,335 WARN L143 SmtUtils]: Spent 590ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-30 04:04:06,549 WARN L143 SmtUtils]: Spent 2039ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-30 04:04:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:04:09,032 INFO L93 Difference]: Finished difference Result 218 states and 230 transitions. [2018-01-30 04:04:09,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-30 04:04:09,032 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 134 [2018-01-30 04:04:09,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:04:09,033 INFO L225 Difference]: With dead ends: 218 [2018-01-30 04:04:09,033 INFO L226 Difference]: Without dead ends: 175 [2018-01-30 04:04:09,034 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=650, Invalid=3507, Unknown=3, NotChecked=0, Total=4160 [2018-01-30 04:04:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-30 04:04:09,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 152. [2018-01-30 04:04:09,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-30 04:04:09,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 155 transitions. [2018-01-30 04:04:09,040 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 155 transitions. Word has length 134 [2018-01-30 04:04:09,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:04:09,040 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 155 transitions. [2018-01-30 04:04:09,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-30 04:04:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 155 transitions. [2018-01-30 04:04:09,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-01-30 04:04:09,041 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:04:09,041 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:04:09,042 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:04:09,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1867942709, now seen corresponding path program 5 times [2018-01-30 04:04:09,042 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:04:09,042 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:04:09,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:09,042 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:04:09,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:04:09,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:04:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 4 proven. 660 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-30 04:04:09,191 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:04:09,191 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 04:04:09,201 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 04:04:09,206 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:09,207 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:09,208 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:09,209 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:09,210 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:09,211 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:09,212 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:09,213 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:09,215 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:09,216 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:09,218 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:09,220 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:09,222 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:09,226 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:09,230 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:09,238 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:09,238 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:04:09,240 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:04:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-01-30 04:04:09,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:04:09,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-01-30 04:04:09,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 04:04:09,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 04:04:09,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-01-30 04:04:09,271 INFO L87 Difference]: Start difference. First operand 152 states and 155 transitions. Second operand 18 states. [2018-01-30 04:04:09,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:04:09,379 INFO L93 Difference]: Finished difference Result 220 states and 227 transitions. [2018-01-30 04:04:09,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 04:04:09,379 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 149 [2018-01-30 04:04:09,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:04:09,379 INFO L225 Difference]: With dead ends: 220 [2018-01-30 04:04:09,380 INFO L226 Difference]: Without dead ends: 168 [2018-01-30 04:04:09,380 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-01-30 04:04:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-30 04:04:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 158. [2018-01-30 04:04:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-30 04:04:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 161 transitions. [2018-01-30 04:04:09,385 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 161 transitions. Word has length 149 [2018-01-30 04:04:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:04:09,385 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 161 transitions. [2018-01-30 04:04:09,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 04:04:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 161 transitions. [2018-01-30 04:04:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-01-30 04:04:09,386 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:04:09,386 INFO L350 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:04:09,386 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:04:09,386 INFO L82 PathProgramCache]: Analyzing trace with hash -302258004, now seen corresponding path program 6 times [2018-01-30 04:04:09,386 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:04:09,387 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:04:09,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:09,387 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:04:09,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:04:09,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:04:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 4 proven. 752 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-30 04:04:09,638 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:04:09,638 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 04:04:09,650 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 04:04:09,656 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:09,657 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:09,659 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:09,660 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:09,663 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:09,664 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:09,666 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:09,668 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:09,670 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:09,670 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:04:09,671 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:04:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2018-01-30 04:04:09,748 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:04:09,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7] total 21 [2018-01-30 04:04:09,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 04:04:09,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 04:04:09,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-01-30 04:04:09,749 INFO L87 Difference]: Start difference. First operand 158 states and 161 transitions. Second operand 21 states. [2018-01-30 04:04:09,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:04:09,903 INFO L93 Difference]: Finished difference Result 255 states and 267 transitions. [2018-01-30 04:04:09,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 04:04:09,903 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 155 [2018-01-30 04:04:09,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:04:09,904 INFO L225 Difference]: With dead ends: 255 [2018-01-30 04:04:09,904 INFO L226 Difference]: Without dead ends: 203 [2018-01-30 04:04:09,904 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-01-30 04:04:09,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-30 04:04:09,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 181. [2018-01-30 04:04:09,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-01-30 04:04:09,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 184 transitions. [2018-01-30 04:04:09,909 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 184 transitions. Word has length 155 [2018-01-30 04:04:09,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:04:09,909 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 184 transitions. [2018-01-30 04:04:09,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 04:04:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 184 transitions. [2018-01-30 04:04:09,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-01-30 04:04:09,910 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:04:09,911 INFO L350 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 6, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:04:09,911 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:04:09,911 INFO L82 PathProgramCache]: Analyzing trace with hash 271742561, now seen corresponding path program 7 times [2018-01-30 04:04:09,911 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:04:09,911 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:04:09,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:09,911 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:04:09,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:04:09,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:04:10,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 4 proven. 1064 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-01-30 04:04:10,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:04:10,389 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 04:04:10,394 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:04:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:04:10,415 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:04:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-01-30 04:04:10,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:04:10,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-01-30 04:04:10,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 04:04:10,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 04:04:10,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-01-30 04:04:10,449 INFO L87 Difference]: Start difference. First operand 181 states and 184 transitions. Second operand 22 states. [2018-01-30 04:04:10,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:04:10,554 INFO L93 Difference]: Finished difference Result 259 states and 267 transitions. [2018-01-30 04:04:10,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 04:04:10,555 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 178 [2018-01-30 04:04:10,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:04:10,555 INFO L225 Difference]: With dead ends: 259 [2018-01-30 04:04:10,555 INFO L226 Difference]: Without dead ends: 202 [2018-01-30 04:04:10,556 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-01-30 04:04:10,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-30 04:04:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 187. [2018-01-30 04:04:10,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-30 04:04:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 190 transitions. [2018-01-30 04:04:10,561 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 190 transitions. Word has length 178 [2018-01-30 04:04:10,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:04:10,561 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 190 transitions. [2018-01-30 04:04:10,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 04:04:10,562 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 190 transitions. [2018-01-30 04:04:10,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-01-30 04:04:10,563 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:04:10,563 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 6, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:04:10,563 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:04:10,563 INFO L82 PathProgramCache]: Analyzing trace with hash -95813558, now seen corresponding path program 8 times [2018-01-30 04:04:10,563 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:04:10,563 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:04:10,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:10,564 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:04:10,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:04:10,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:04:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 4 proven. 1180 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-01-30 04:04:10,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:04:10,796 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 04:04:10,801 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 04:04:10,806 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:10,816 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:10,818 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:04:10,820 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:04:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-01-30 04:04:10,854 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:04:10,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-01-30 04:04:10,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-30 04:04:10,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-30 04:04:10,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-01-30 04:04:10,855 INFO L87 Difference]: Start difference. First operand 187 states and 190 transitions. Second operand 23 states. [2018-01-30 04:04:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:04:10,988 INFO L93 Difference]: Finished difference Result 265 states and 273 transitions. [2018-01-30 04:04:10,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-30 04:04:10,988 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 184 [2018-01-30 04:04:10,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:04:10,989 INFO L225 Difference]: With dead ends: 265 [2018-01-30 04:04:10,989 INFO L226 Difference]: Without dead ends: 208 [2018-01-30 04:04:10,989 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-01-30 04:04:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-01-30 04:04:10,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 193. [2018-01-30 04:04:10,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-30 04:04:10,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 196 transitions. [2018-01-30 04:04:10,994 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 196 transitions. Word has length 184 [2018-01-30 04:04:10,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:04:10,994 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 196 transitions. [2018-01-30 04:04:10,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-30 04:04:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 196 transitions. [2018-01-30 04:04:10,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-01-30 04:04:10,995 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:04:10,995 INFO L350 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 6, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:04:10,995 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:04:10,995 INFO L82 PathProgramCache]: Analyzing trace with hash 308459379, now seen corresponding path program 9 times [2018-01-30 04:04:10,995 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:04:10,995 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:04:10,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:10,996 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:04:10,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:04:11,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:04:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1381 backedges. 4 proven. 1302 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-01-30 04:04:11,307 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:04:11,307 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 04:04:11,312 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 04:04:11,317 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:04:11,319 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:04:11,321 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:04:11,324 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:04:11,326 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:04:11,328 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:04:11,328 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:04:11,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:04:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1381 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1321 trivial. 0 not checked. [2018-01-30 04:04:11,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:04:11,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 26 [2018-01-30 04:04:11,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-30 04:04:11,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-30 04:04:11,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-01-30 04:04:11,393 INFO L87 Difference]: Start difference. First operand 193 states and 196 transitions. Second operand 26 states. [2018-01-30 04:04:11,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:04:11,626 INFO L93 Difference]: Finished difference Result 300 states and 313 transitions. [2018-01-30 04:04:11,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 04:04:11,628 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 190 [2018-01-30 04:04:11,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:04:11,629 INFO L225 Difference]: With dead ends: 300 [2018-01-30 04:04:11,629 INFO L226 Difference]: Without dead ends: 243 [2018-01-30 04:04:11,629 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-01-30 04:04:11,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-01-30 04:04:11,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 216. [2018-01-30 04:04:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-30 04:04:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 219 transitions. [2018-01-30 04:04:11,635 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 219 transitions. Word has length 190 [2018-01-30 04:04:11,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:04:11,635 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 219 transitions. [2018-01-30 04:04:11,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-30 04:04:11,635 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 219 transitions. [2018-01-30 04:04:11,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-01-30 04:04:11,636 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:04:11,636 INFO L350 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 7, 6, 6, 6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:04:11,636 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:04:11,636 INFO L82 PathProgramCache]: Analyzing trace with hash 2064100772, now seen corresponding path program 10 times [2018-01-30 04:04:11,636 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:04:11,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:04:11,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:11,637 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:04:11,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:04:11,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:04:12,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1810 backedges. 4 proven. 1704 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-01-30 04:04:12,084 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:04:12,084 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 04:04:12,089 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 04:04:12,104 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:04:12,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:04:12,287 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 8 treesize of output 7 [2018-01-30 04:04:12,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:04:12,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 04:04:12,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 04:04:12,331 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:12,332 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 16 treesize of output 19 [2018-01-30 04:04:12,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:04:12,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 04:04:12,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 04:04:12,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:12,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:12,393 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:12,396 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 23 treesize of output 34 [2018-01-30 04:04:12,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:04:12,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-30 04:04:12,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:30 [2018-01-30 04:04:12,493 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:12,493 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:12,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:12,495 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:12,495 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:12,496 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:12,500 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 30 treesize of output 53 [2018-01-30 04:04:12,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:04:12,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-01-30 04:04:12,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:43, output treesize:42 [2018-01-30 04:04:16,626 WARN L143 SmtUtils]: Spent 1541ms on a formula simplification that was a NOOP. DAG size: 41 [2018-01-30 04:04:17,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1810 backedges. 14 proven. 1443 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2018-01-30 04:04:17,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:04:17,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 35] total 60 [2018-01-30 04:04:17,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-01-30 04:04:17,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-01-30 04:04:17,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=2776, Unknown=3, NotChecked=0, Total=3540 [2018-01-30 04:04:17,124 INFO L87 Difference]: Start difference. First operand 216 states and 219 transitions. Second operand 60 states. [2018-01-30 04:04:28,434 WARN L143 SmtUtils]: Spent 1211ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-30 04:04:30,809 WARN L143 SmtUtils]: Spent 2006ms on a formula simplification that was a NOOP. DAG size: 42 [2018-01-30 04:04:32,859 WARN L143 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 43 [2018-01-30 04:04:34,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:04:34,842 INFO L93 Difference]: Finished difference Result 323 states and 337 transitions. [2018-01-30 04:04:34,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-01-30 04:04:34,843 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 213 [2018-01-30 04:04:34,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:04:34,843 INFO L225 Difference]: With dead ends: 323 [2018-01-30 04:04:34,844 INFO L226 Difference]: Without dead ends: 261 [2018-01-30 04:04:34,845 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2860 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=1455, Invalid=7281, Unknown=6, NotChecked=0, Total=8742 [2018-01-30 04:04:34,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-01-30 04:04:34,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 231. [2018-01-30 04:04:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-01-30 04:04:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 234 transitions. [2018-01-30 04:04:34,852 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 234 transitions. Word has length 213 [2018-01-30 04:04:34,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:04:34,852 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 234 transitions. [2018-01-30 04:04:34,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-01-30 04:04:34,852 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 234 transitions. [2018-01-30 04:04:34,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-01-30 04:04:34,853 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:04:34,853 INFO L350 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 7, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:04:34,853 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:04:34,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1981678810, now seen corresponding path program 11 times [2018-01-30 04:04:34,854 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:04:34,854 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:04:34,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:34,854 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:04:34,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:04:34,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:04:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1979 backedges. 6 proven. 1850 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-01-30 04:04:35,403 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:04:35,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 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 04:04:35,408 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 04:04:35,413 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,414 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,415 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,416 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,417 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,418 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,419 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,420 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,421 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,423 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,424 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,426 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,428 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,431 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,433 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,436 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,439 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,442 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,446 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,450 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,455 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,460 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,467 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,475 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,483 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,500 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:35,501 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:04:35,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:04:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1979 backedges. 0 proven. 1850 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-01-30 04:04:35,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:04:35,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-01-30 04:04:35,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-30 04:04:35,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-30 04:04:35,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-01-30 04:04:35,547 INFO L87 Difference]: Start difference. First operand 231 states and 234 transitions. Second operand 28 states. [2018-01-30 04:04:36,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:04:36,066 INFO L93 Difference]: Finished difference Result 323 states and 331 transitions. [2018-01-30 04:04:36,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-30 04:04:36,066 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 228 [2018-01-30 04:04:36,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:04:36,067 INFO L225 Difference]: With dead ends: 323 [2018-01-30 04:04:36,067 INFO L226 Difference]: Without dead ends: 252 [2018-01-30 04:04:36,067 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-01-30 04:04:36,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-01-30 04:04:36,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 237. [2018-01-30 04:04:36,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-01-30 04:04:36,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 240 transitions. [2018-01-30 04:04:36,075 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 240 transitions. Word has length 228 [2018-01-30 04:04:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:04:36,075 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 240 transitions. [2018-01-30 04:04:36,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-30 04:04:36,075 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 240 transitions. [2018-01-30 04:04:36,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-01-30 04:04:36,076 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:04:36,076 INFO L350 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 7, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:04:36,076 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:04:36,076 INFO L82 PathProgramCache]: Analyzing trace with hash 2030002819, now seen corresponding path program 12 times [2018-01-30 04:04:36,076 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:04:36,076 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:04:36,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:36,077 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:04:36,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:04:36,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:04:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2131 backedges. 6 proven. 2002 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-01-30 04:04:36,628 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:04:36,628 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 04:04:36,632 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 04:04:36,638 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:36,639 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:36,641 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:36,643 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:36,645 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:36,646 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:36,649 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:36,651 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:36,653 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:36,655 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:36,658 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:36,661 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:36,664 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 04:04:36,664 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:04:36,666 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:04:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2131 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 2044 trivial. 0 not checked. [2018-01-30 04:04:36,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:04:36,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 9] total 31 [2018-01-30 04:04:36,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-30 04:04:36,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-30 04:04:36,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-01-30 04:04:36,752 INFO L87 Difference]: Start difference. First operand 237 states and 240 transitions. Second operand 31 states. [2018-01-30 04:04:37,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:04:37,050 INFO L93 Difference]: Finished difference Result 358 states and 371 transitions. [2018-01-30 04:04:37,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-30 04:04:37,058 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 234 [2018-01-30 04:04:37,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:04:37,059 INFO L225 Difference]: With dead ends: 358 [2018-01-30 04:04:37,059 INFO L226 Difference]: Without dead ends: 287 [2018-01-30 04:04:37,059 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-01-30 04:04:37,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-01-30 04:04:37,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 260. [2018-01-30 04:04:37,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-01-30 04:04:37,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 263 transitions. [2018-01-30 04:04:37,067 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 263 transitions. Word has length 234 [2018-01-30 04:04:37,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:04:37,067 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 263 transitions. [2018-01-30 04:04:37,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-30 04:04:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 263 transitions. [2018-01-30 04:04:37,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-01-30 04:04:37,068 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:04:37,068 INFO L350 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 8, 7, 7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:04:37,068 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:04:37,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1642932038, now seen corresponding path program 13 times [2018-01-30 04:04:37,069 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:04:37,069 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:04:37,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:37,069 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:04:37,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:04:37,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:04:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2655 backedges. 6 proven. 2494 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-01-30 04:04:37,543 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:04:37,543 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 04:04:37,547 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:04:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:04:37,573 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:04:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2655 backedges. 0 proven. 2494 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-01-30 04:04:37,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:04:37,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-01-30 04:04:37,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-30 04:04:37,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-30 04:04:37,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-01-30 04:04:37,626 INFO L87 Difference]: Start difference. First operand 260 states and 263 transitions. Second operand 32 states. [2018-01-30 04:04:38,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:04:38,536 INFO L93 Difference]: Finished difference Result 357 states and 365 transitions. [2018-01-30 04:04:38,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-30 04:04:38,536 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 257 [2018-01-30 04:04:38,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:04:38,537 INFO L225 Difference]: With dead ends: 357 [2018-01-30 04:04:38,537 INFO L226 Difference]: Without dead ends: 281 [2018-01-30 04:04:38,538 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-01-30 04:04:38,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-01-30 04:04:38,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 266. [2018-01-30 04:04:38,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-01-30 04:04:38,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 269 transitions. [2018-01-30 04:04:38,547 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 269 transitions. Word has length 257 [2018-01-30 04:04:38,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:04:38,547 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 269 transitions. [2018-01-30 04:04:38,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-30 04:04:38,547 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 269 transitions. [2018-01-30 04:04:38,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-01-30 04:04:38,548 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:04:38,548 INFO L350 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 8, 7, 7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:04:38,548 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:04:38,548 INFO L82 PathProgramCache]: Analyzing trace with hash -551032911, now seen corresponding path program 14 times [2018-01-30 04:04:38,548 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:04:38,549 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:04:38,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:38,549 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:04:38,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:04:38,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:04:39,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 6 proven. 2670 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-01-30 04:04:39,253 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:04:39,253 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 04:04:39,257 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 04:04:39,264 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:39,283 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 04:04:39,285 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:04:39,287 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:04:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 0 proven. 2670 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-01-30 04:04:39,342 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:04:39,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-01-30 04:04:39,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 04:04:39,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 04:04:39,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 04:04:39,343 INFO L87 Difference]: Start difference. First operand 266 states and 269 transitions. Second operand 33 states. [2018-01-30 04:04:39,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:04:39,565 INFO L93 Difference]: Finished difference Result 363 states and 371 transitions. [2018-01-30 04:04:39,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-30 04:04:39,565 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 263 [2018-01-30 04:04:39,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:04:39,566 INFO L225 Difference]: With dead ends: 363 [2018-01-30 04:04:39,566 INFO L226 Difference]: Without dead ends: 287 [2018-01-30 04:04:39,566 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 04:04:39,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-01-30 04:04:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 272. [2018-01-30 04:04:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-01-30 04:04:39,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 275 transitions. [2018-01-30 04:04:39,575 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 275 transitions. Word has length 263 [2018-01-30 04:04:39,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:04:39,575 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 275 transitions. [2018-01-30 04:04:39,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 04:04:39,575 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 275 transitions. [2018-01-30 04:04:39,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-01-30 04:04:39,576 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:04:39,576 INFO L350 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 8, 7, 7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:04:39,576 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:04:39,576 INFO L82 PathProgramCache]: Analyzing trace with hash -572677784, now seen corresponding path program 15 times [2018-01-30 04:04:39,576 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:04:39,576 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:04:39,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:39,577 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:04:39,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:04:39,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:04:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3013 backedges. 6 proven. 2852 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-01-30 04:04:40,552 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:04:40,552 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 04:04:40,556 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 04:04:40,570 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:04:40,572 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:04:40,576 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:04:40,578 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:04:40,581 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:04:40,588 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:04:40,591 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:04:40,599 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 04:04:40,607 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:04:40,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:04:40,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3013 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 2894 trivial. 0 not checked. [2018-01-30 04:04:40,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:04:40,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 10] total 36 [2018-01-30 04:04:40,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-30 04:04:40,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-30 04:04:40,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 04:04:40,679 INFO L87 Difference]: Start difference. First operand 272 states and 275 transitions. Second operand 36 states. [2018-01-30 04:04:40,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:04:40,986 INFO L93 Difference]: Finished difference Result 403 states and 417 transitions. [2018-01-30 04:04:40,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 04:04:40,986 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 269 [2018-01-30 04:04:40,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:04:40,987 INFO L225 Difference]: With dead ends: 403 [2018-01-30 04:04:40,987 INFO L226 Difference]: Without dead ends: 327 [2018-01-30 04:04:40,987 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 04:04:40,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-01-30 04:04:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 295. [2018-01-30 04:04:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-01-30 04:04:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 298 transitions. [2018-01-30 04:04:40,995 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 298 transitions. Word has length 269 [2018-01-30 04:04:40,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:04:40,995 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 298 transitions. [2018-01-30 04:04:40,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 04:04:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 298 transitions. [2018-01-30 04:04:40,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-01-30 04:04:40,996 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:04:40,996 INFO L350 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 9, 8, 8, 8, 8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:04:40,996 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:04:40,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1661322763, now seen corresponding path program 16 times [2018-01-30 04:04:40,996 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:04:40,996 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:04:40,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:40,996 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 04:04:40,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:04:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:04:41,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:04:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3632 backedges. 6 proven. 3434 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-01-30 04:04:41,983 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:04:41,983 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 04:04:41,987 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 04:04:42,008 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 04:04:42,012 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:04:42,368 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 8 treesize of output 7 [2018-01-30 04:04:42,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:04:42,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 04:04:42,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 04:04:42,411 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:42,412 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 16 treesize of output 19 [2018-01-30 04:04:42,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:04:42,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 04:04:42,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-01-30 04:04:42,551 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:42,552 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:42,552 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:42,554 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 23 treesize of output 34 [2018-01-30 04:04:42,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:04:42,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-30 04:04:42,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:30 [2018-01-30 04:04:42,674 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:42,694 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:42,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:42,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:42,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:42,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:42,881 INFO L303 Elim1Store]: Index analysis took 241 ms [2018-01-30 04:04:42,882 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 30 treesize of output 53 [2018-01-30 04:04:42,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:04:43,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-01-30 04:04:43,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:43, output treesize:42 [2018-01-30 04:04:43,581 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:43,582 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:43,582 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:43,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:43,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:43,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:43,585 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:43,585 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:43,586 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:43,587 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 04:04:43,602 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 37 treesize of output 76 [2018-01-30 04:04:43,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 04:04:43,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-01-30 04:04:43,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:55, output treesize:54 [2018-01-30 04:04:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3632 backedges. 29 proven. 2937 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-01-30 04:04:56,015 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:04:56,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 46] total 81 [2018-01-30 04:04:56,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-01-30 04:04:56,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-01-30 04:04:56,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1429, Invalid=5042, Unknown=9, NotChecked=0, Total=6480 [2018-01-30 04:04:56,017 INFO L87 Difference]: Start difference. First operand 295 states and 298 transitions. Second operand 81 states. [2018-01-30 04:05:03,038 WARN L146 SmtUtils]: Spent 3782ms on a formula simplification. DAG size of input: 46 DAG size of output 38 [2018-01-30 04:05:05,821 WARN L143 SmtUtils]: Spent 1138ms on a formula simplification that was a NOOP. DAG size: 42 [2018-01-30 04:05:07,016 WARN L143 SmtUtils]: Spent 1153ms on a formula simplification that was a NOOP. DAG size: 43 Received shutdown request... [2018-01-30 04:05:12,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-01-30 04:05:12,064 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 04:05:12,066 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 04:05:12,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 04:05:12 BasicIcfg [2018-01-30 04:05:12,066 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 04:05:12,067 INFO L168 Benchmark]: Toolchain (without parser) took 77653.90 ms. Allocated memory was 149.4 MB in the beginning and 501.2 MB in the end (delta: 351.8 MB). Free memory was 114.4 MB in the beginning and 297.8 MB in the end (delta: -183.4 MB). Peak memory consumption was 168.4 MB. Max. memory is 5.3 GB. [2018-01-30 04:05:12,068 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 149.4 MB. Free memory is still 119.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 04:05:12,068 INFO L168 Benchmark]: CACSL2BoogieTranslator took 105.24 ms. Allocated memory is still 149.4 MB. Free memory was 114.2 MB in the beginning and 106.0 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 5.3 GB. [2018-01-30 04:05:12,068 INFO L168 Benchmark]: Boogie Preprocessor took 17.64 ms. Allocated memory is still 149.4 MB. Free memory was 106.0 MB in the beginning and 104.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-01-30 04:05:12,068 INFO L168 Benchmark]: RCFGBuilder took 299.69 ms. Allocated memory is still 149.4 MB. Free memory was 104.4 MB in the beginning and 92.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-30 04:05:12,068 INFO L168 Benchmark]: IcfgTransformer took 11.51 ms. Allocated memory is still 149.4 MB. Free memory was 92.3 MB in the beginning and 91.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 5.3 GB. [2018-01-30 04:05:12,068 INFO L168 Benchmark]: TraceAbstraction took 77217.23 ms. Allocated memory was 149.4 MB in the beginning and 501.2 MB in the end (delta: 351.8 MB). Free memory was 90.8 MB in the beginning and 297.8 MB in the end (delta: -207.0 MB). Peak memory consumption was 144.8 MB. Max. memory is 5.3 GB. [2018-01-30 04:05:12,069 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 149.4 MB. Free memory is still 119.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 105.24 ms. Allocated memory is still 149.4 MB. Free memory was 114.2 MB in the beginning and 106.0 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 17.64 ms. Allocated memory is still 149.4 MB. Free memory was 106.0 MB in the beginning and 104.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 299.69 ms. Allocated memory is still 149.4 MB. Free memory was 104.4 MB in the beginning and 92.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * IcfgTransformer took 11.51 ms. Allocated memory is still 149.4 MB. Free memory was 92.3 MB in the beginning and 91.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 77217.23 ms. Allocated memory was 149.4 MB in the beginning and 501.2 MB in the end (delta: 351.8 MB). Free memory was 90.8 MB in the beginning and 297.8 MB in the end (delta: -207.0 MB). Peak memory consumption was 144.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 2). Cancelled while BasicCegarLoop was constructing difference of abstraction (295states) and interpolant automaton (currently 61 states, 81 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 109 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 1 error locations. TIMEOUT Result, 77.1s OverallTime, 23 OverallIterations, 35 TraceHistogramMax, 47.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 887 SDtfs, 2956 SDslu, 11536 SDs, 0 SdLazy, 12196 SolverSat, 595 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 19.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3834 GetRequests, 3227 SyntacticMatches, 0 SemanticMatches, 606 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8691 ImplicationChecksByTransitivity, 49.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=22, 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.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 357 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 28.1s InterpolantComputationTime, 6692 NumberOfCodeBlocks, 6055 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 6648 ConstructedInterpolants, 101 QuantifiedInterpolants, 4134032 SizeOfPredicates, 50 NumberOfNonLiveVariables, 3893 ConjunctsInSsa, 434 ConjunctsInUnsatCore, 44 InterpolantComputations, 3 PerfectInterpolantSequences, 11144/50564 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/standard_two_index_06_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_04-05-12-073.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_two_index_06_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_04-05-12-073.csv Completed graceful shutdown