java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:00:41,407 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:00:41,410 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:00:41,427 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:00:41,427 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:00:41,429 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:00:41,430 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:00:41,432 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:00:41,434 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:00:41,435 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:00:41,436 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:00:41,436 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:00:41,437 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:00:41,438 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:00:41,439 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:00:41,442 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:00:41,444 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:00:41,446 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:00:41,447 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:00:41,449 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:00:41,451 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:00:41,451 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:00:41,452 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:00:41,453 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:00:41,454 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:00:41,455 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:00:41,455 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:00:41,456 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:00:41,456 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:00:41,456 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:00:41,457 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:00:41,457 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:00:41,467 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:00:41,468 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:00:41,469 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:00:41,469 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:00:41,469 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:00:41,469 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:00:41,469 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:00:41,470 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:00:41,470 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:00:41,470 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:00:41,471 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:00:41,471 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:00:41,471 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:00:41,471 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:00:41,471 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:00:41,472 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:00:41,472 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:00:41,472 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:00:41,472 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:00:41,472 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:00:41,473 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:00:41,473 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:00:41,473 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:00:41,473 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:00:41,473 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:00:41,474 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:00:41,474 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:00:41,474 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:00:41,474 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:00:41,474 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:00:41,474 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:00:41,475 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:00:41,475 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:00:41,476 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:00:41,512 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:00:41,524 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:00:41,528 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:00:41,530 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:00:41,530 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:00:41,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-free.i [2018-01-24 13:00:41,694 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:00:41,699 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:00:41,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:00:41,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:00:41,708 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:00:41,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:00:41" (1/1) ... [2018-01-24 13:00:41,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e82129b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:00:41, skipping insertion in model container [2018-01-24 13:00:41,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:00:41" (1/1) ... [2018-01-24 13:00:41,730 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:00:41,770 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:00:41,883 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:00:41,898 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:00:41,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:00:41 WrapperNode [2018-01-24 13:00:41,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:00:41,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:00:41,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:00:41,907 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:00:41,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:00:41" (1/1) ... [2018-01-24 13:00:41,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:00:41" (1/1) ... [2018-01-24 13:00:41,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:00:41" (1/1) ... [2018-01-24 13:00:41,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:00:41" (1/1) ... [2018-01-24 13:00:41,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:00:41" (1/1) ... [2018-01-24 13:00:41,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:00:41" (1/1) ... [2018-01-24 13:00:41,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:00:41" (1/1) ... [2018-01-24 13:00:41,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:00:41,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:00:41,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:00:41,953 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:00:41,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:00:41" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:00:42,017 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:00:42,017 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:00:42,017 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-24 13:00:42,017 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:00:42,017 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:00:42,017 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:00:42,018 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:00:42,018 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:00:42,018 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:00:42,018 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:00:42,018 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:00:42,018 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:00:42,019 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-24 13:00:42,019 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:00:42,019 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:00:42,019 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:00:42,507 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:00:42,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:00:42 BoogieIcfgContainer [2018-01-24 13:00:42,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:00:42,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:00:42,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:00:42,534 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:00:42,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:00:41" (1/3) ... [2018-01-24 13:00:42,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c34672f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:00:42, skipping insertion in model container [2018-01-24 13:00:42,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:00:41" (2/3) ... [2018-01-24 13:00:42,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c34672f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:00:42, skipping insertion in model container [2018-01-24 13:00:42,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:00:42" (3/3) ... [2018-01-24 13:00:42,538 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-free.i [2018-01-24 13:00:42,545 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:00:42,552 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 53 error locations. [2018-01-24 13:00:42,591 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:00:42,591 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:00:42,591 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:00:42,591 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:00:42,591 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:00:42,592 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:00:42,592 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:00:42,592 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:00:42,592 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:00:42,612 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2018-01-24 13:00:42,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 13:00:42,618 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:42,618 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:42,618 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:42,622 INFO L82 PathProgramCache]: Analyzing trace with hash 842410072, now seen corresponding path program 1 times [2018-01-24 13:00:42,624 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:42,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:42,665 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:42,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:42,666 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:42,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:42,755 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-24 13:00:42,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:00:42,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:00:42,757 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:00:42,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:00:42,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:00:42,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:00:42,772 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 3 states. [2018-01-24 13:00:43,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:43,095 INFO L93 Difference]: Finished difference Result 188 states and 205 transitions. [2018-01-24 13:00:43,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:00:43,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 13:00:43,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:43,113 INFO L225 Difference]: With dead ends: 188 [2018-01-24 13:00:43,113 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 13:00:43,118 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-24 13:00:43,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 13:00:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-01-24 13:00:43,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-24 13:00:43,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2018-01-24 13:00:43,169 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 7 [2018-01-24 13:00:43,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:43,170 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2018-01-24 13:00:43,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:00:43,170 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-01-24 13:00:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 13:00:43,170 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:43,170 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:43,171 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:43,171 INFO L82 PathProgramCache]: Analyzing trace with hash 842410073, now seen corresponding path program 1 times [2018-01-24 13:00:43,171 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:43,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:43,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:43,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:43,173 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:43,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:43,256 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-24 13:00:43,257 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:00:43,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:00:43,257 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:00:43,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:00:43,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:00:43,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:00:43,259 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 3 states. [2018-01-24 13:00:43,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:43,485 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-01-24 13:00:43,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:00:43,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 13:00:43,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:43,487 INFO L225 Difference]: With dead ends: 111 [2018-01-24 13:00:43,487 INFO L226 Difference]: Without dead ends: 110 [2018-01-24 13:00:43,488 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-24 13:00:43,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-24 13:00:43,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-01-24 13:00:43,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-24 13:00:43,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-01-24 13:00:43,500 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 7 [2018-01-24 13:00:43,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:43,500 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-01-24 13:00:43,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:00:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-01-24 13:00:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 13:00:43,501 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:43,501 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:43,501 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:43,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1112643303, now seen corresponding path program 1 times [2018-01-24 13:00:43,502 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:43,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:43,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:43,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:43,503 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:43,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:43,632 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-24 13:00:43,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:00:43,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:00:43,632 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:00:43,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:00:43,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:00:43,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:00:43,633 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 5 states. [2018-01-24 13:00:43,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:43,895 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-01-24 13:00:43,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:00:43,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-24 13:00:43,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:43,897 INFO L225 Difference]: With dead ends: 109 [2018-01-24 13:00:43,897 INFO L226 Difference]: Without dead ends: 106 [2018-01-24 13:00:43,898 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:00:43,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-24 13:00:43,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-01-24 13:00:43,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-24 13:00:43,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-01-24 13:00:43,907 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 13 [2018-01-24 13:00:43,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:43,907 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-01-24 13:00:43,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:00:43,908 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-01-24 13:00:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 13:00:43,908 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:43,908 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:43,909 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:43,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1112643304, now seen corresponding path program 1 times [2018-01-24 13:00:43,909 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:43,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:43,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:43,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:43,911 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:43,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:44,012 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-24 13:00:44,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:00:44,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:00:44,012 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:00:44,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:00:44,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:00:44,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:00:44,014 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 7 states. [2018-01-24 13:00:44,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:44,240 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-01-24 13:00:44,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:00:44,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-01-24 13:00:44,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:44,241 INFO L225 Difference]: With dead ends: 105 [2018-01-24 13:00:44,241 INFO L226 Difference]: Without dead ends: 93 [2018-01-24 13:00:44,241 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:00:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-24 13:00:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-01-24 13:00:44,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 13:00:44,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-01-24 13:00:44,248 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 13 [2018-01-24 13:00:44,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:44,248 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-01-24 13:00:44,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:00:44,248 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-01-24 13:00:44,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 13:00:44,249 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:44,249 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:44,249 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:44,249 INFO L82 PathProgramCache]: Analyzing trace with hash 132204114, now seen corresponding path program 1 times [2018-01-24 13:00:44,249 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:44,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:44,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:44,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:44,250 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:44,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:44,280 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-24 13:00:44,280 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:00:44,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:00:44,281 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:00:44,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:00:44,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:00:44,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:00:44,281 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 4 states. [2018-01-24 13:00:44,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:44,362 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-01-24 13:00:44,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:00:44,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 13:00:44,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:44,363 INFO L225 Difference]: With dead ends: 93 [2018-01-24 13:00:44,363 INFO L226 Difference]: Without dead ends: 89 [2018-01-24 13:00:44,363 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:00:44,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-24 13:00:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-01-24 13:00:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-24 13:00:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-01-24 13:00:44,368 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 14 [2018-01-24 13:00:44,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:44,368 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-01-24 13:00:44,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:00:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-01-24 13:00:44,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 13:00:44,369 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:44,369 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:44,369 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:44,369 INFO L82 PathProgramCache]: Analyzing trace with hash 132204115, now seen corresponding path program 1 times [2018-01-24 13:00:44,369 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:44,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:44,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:44,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:44,370 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:44,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:44,432 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-24 13:00:44,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:00:44,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:00:44,433 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:00:44,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:00:44,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:00:44,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:00:44,434 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 4 states. [2018-01-24 13:00:44,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:44,481 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-01-24 13:00:44,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:00:44,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 13:00:44,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:44,482 INFO L225 Difference]: With dead ends: 89 [2018-01-24 13:00:44,482 INFO L226 Difference]: Without dead ends: 85 [2018-01-24 13:00:44,483 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:00:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-24 13:00:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-24 13:00:44,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-24 13:00:44,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-01-24 13:00:44,489 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 14 [2018-01-24 13:00:44,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:44,489 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-01-24 13:00:44,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:00:44,489 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-01-24 13:00:44,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:00:44,490 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:44,490 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:44,490 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:44,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1054600686, now seen corresponding path program 1 times [2018-01-24 13:00:44,491 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:44,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:44,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:44,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:44,492 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:44,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:44,583 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-24 13:00:44,583 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:00:44,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:00:44,584 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:00:44,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:00:44,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:00:44,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:00:44,585 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 8 states. [2018-01-24 13:00:44,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:44,781 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2018-01-24 13:00:44,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 13:00:44,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 13:00:44,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:44,783 INFO L225 Difference]: With dead ends: 178 [2018-01-24 13:00:44,783 INFO L226 Difference]: Without dead ends: 100 [2018-01-24 13:00:44,783 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-01-24 13:00:44,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-24 13:00:44,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2018-01-24 13:00:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 13:00:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-01-24 13:00:44,791 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 19 [2018-01-24 13:00:44,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:44,791 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-01-24 13:00:44,791 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:00:44,791 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-01-24 13:00:44,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 13:00:44,793 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:44,793 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:44,793 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:44,794 INFO L82 PathProgramCache]: Analyzing trace with hash -882655928, now seen corresponding path program 1 times [2018-01-24 13:00:44,794 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:44,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:44,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:44,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:44,795 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:44,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:44,902 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-24 13:00:44,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:00:44,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:00:44,903 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:00:44,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:00:44,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:00:44,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:00:44,904 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 7 states. [2018-01-24 13:00:45,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:45,089 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-01-24 13:00:45,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:00:45,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-24 13:00:45,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:45,091 INFO L225 Difference]: With dead ends: 117 [2018-01-24 13:00:45,091 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 13:00:45,091 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:00:45,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 13:00:45,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2018-01-24 13:00:45,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 13:00:45,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-01-24 13:00:45,098 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 30 [2018-01-24 13:00:45,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:45,099 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-01-24 13:00:45,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:00:45,099 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-01-24 13:00:45,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 13:00:45,100 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:45,100 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:45,100 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:45,101 INFO L82 PathProgramCache]: Analyzing trace with hash -882655927, now seen corresponding path program 1 times [2018-01-24 13:00:45,101 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:45,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:45,102 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:45,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:45,102 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:45,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:45,292 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-24 13:00:45,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:00:45,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:00:45,293 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:00:45,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:00:45,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:00:45,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:00:45,294 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 9 states. [2018-01-24 13:00:45,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:45,477 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-01-24 13:00:45,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 13:00:45,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-24 13:00:45,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:45,479 INFO L225 Difference]: With dead ends: 123 [2018-01-24 13:00:45,479 INFO L226 Difference]: Without dead ends: 122 [2018-01-24 13:00:45,479 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-01-24 13:00:45,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-24 13:00:45,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 93. [2018-01-24 13:00:45,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 13:00:45,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2018-01-24 13:00:45,486 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 30 [2018-01-24 13:00:45,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:45,486 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2018-01-24 13:00:45,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:00:45,487 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2018-01-24 13:00:45,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 13:00:45,488 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:45,488 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:45,488 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:45,488 INFO L82 PathProgramCache]: Analyzing trace with hash -552202616, now seen corresponding path program 1 times [2018-01-24 13:00:45,488 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:45,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:45,489 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:45,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:45,490 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:45,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:45,564 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-24 13:00:45,565 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:00:45,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:00:45,565 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:00:45,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:00:45,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:00:45,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:00:45,566 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 5 states. [2018-01-24 13:00:45,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:45,636 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2018-01-24 13:00:45,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:00:45,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-24 13:00:45,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:45,637 INFO L225 Difference]: With dead ends: 130 [2018-01-24 13:00:45,637 INFO L226 Difference]: Without dead ends: 99 [2018-01-24 13:00:45,637 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:00:45,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-24 13:00:45,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-01-24 13:00:45,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 13:00:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-01-24 13:00:45,642 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 33 [2018-01-24 13:00:45,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:45,643 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-01-24 13:00:45,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:00:45,643 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-01-24 13:00:45,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 13:00:45,644 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:45,645 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:45,645 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:45,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1412958943, now seen corresponding path program 1 times [2018-01-24 13:00:45,645 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:45,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:45,646 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:45,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:45,647 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:45,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:45,741 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-24 13:00:45,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:00:45,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:00:45,742 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:00:45,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:00:45,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:00:45,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:00:45,743 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 5 states. [2018-01-24 13:00:45,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:45,953 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-01-24 13:00:45,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:00:45,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-24 13:00:45,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:45,954 INFO L225 Difference]: With dead ends: 96 [2018-01-24 13:00:45,954 INFO L226 Difference]: Without dead ends: 95 [2018-01-24 13:00:45,955 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:00:45,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-24 13:00:45,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-01-24 13:00:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 13:00:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-01-24 13:00:45,959 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 33 [2018-01-24 13:00:45,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:45,959 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-01-24 13:00:45,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:00:45,960 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-01-24 13:00:45,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 13:00:45,961 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:45,961 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:45,961 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:45,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1412958942, now seen corresponding path program 1 times [2018-01-24 13:00:45,962 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:45,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:45,963 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:45,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:45,963 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:45,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:46,214 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-24 13:00:46,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:00:46,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 13:00:46,215 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:00:46,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:00:46,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:00:46,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:00:46,216 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 11 states. [2018-01-24 13:00:46,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:46,504 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-01-24 13:00:46,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 13:00:46,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-01-24 13:00:46,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:46,506 INFO L225 Difference]: With dead ends: 98 [2018-01-24 13:00:46,506 INFO L226 Difference]: Without dead ends: 97 [2018-01-24 13:00:46,507 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-01-24 13:00:46,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-24 13:00:46,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-01-24 13:00:46,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 13:00:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-01-24 13:00:46,512 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 33 [2018-01-24 13:00:46,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:46,512 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-01-24 13:00:46,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:00:46,513 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-01-24 13:00:46,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 13:00:46,514 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:46,514 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:46,514 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:46,514 INFO L82 PathProgramCache]: Analyzing trace with hash -852054260, now seen corresponding path program 1 times [2018-01-24 13:00:46,514 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:46,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:46,515 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:46,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:46,516 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:46,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:46,877 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-24 13:00:46,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:00:46,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 13:00:46,878 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:00:46,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 13:00:46,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 13:00:46,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-24 13:00:46,878 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 15 states. [2018-01-24 13:00:47,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:47,455 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-01-24 13:00:47,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 13:00:47,456 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-01-24 13:00:47,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:47,457 INFO L225 Difference]: With dead ends: 133 [2018-01-24 13:00:47,457 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 13:00:47,458 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-01-24 13:00:47,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 13:00:47,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 109. [2018-01-24 13:00:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-24 13:00:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-01-24 13:00:47,463 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 34 [2018-01-24 13:00:47,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:47,463 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-01-24 13:00:47,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 13:00:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-01-24 13:00:47,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 13:00:47,464 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:47,464 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:47,464 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:47,464 INFO L82 PathProgramCache]: Analyzing trace with hash -852054259, now seen corresponding path program 1 times [2018-01-24 13:00:47,465 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:47,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:47,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:47,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:47,465 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:47,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:47,777 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-24 13:00:47,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:00:47,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 13:00:47,777 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:00:47,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 13:00:47,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 13:00:47,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-24 13:00:47,778 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 15 states. [2018-01-24 13:00:48,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:48,278 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2018-01-24 13:00:48,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 13:00:48,278 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-01-24 13:00:48,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:48,279 INFO L225 Difference]: With dead ends: 122 [2018-01-24 13:00:48,279 INFO L226 Difference]: Without dead ends: 121 [2018-01-24 13:00:48,279 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2018-01-24 13:00:48,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-24 13:00:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2018-01-24 13:00:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-24 13:00:48,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-01-24 13:00:48,285 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 34 [2018-01-24 13:00:48,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:48,286 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-01-24 13:00:48,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 13:00:48,286 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-01-24 13:00:48,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 13:00:48,286 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:48,286 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:48,287 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:48,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1908491397, now seen corresponding path program 1 times [2018-01-24 13:00:48,287 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:48,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:48,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:48,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:48,288 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:48,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:48,367 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-24 13:00:48,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:00:48,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:00:48,368 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:00:48,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:00:48,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:00:48,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:00:48,369 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 8 states. [2018-01-24 13:00:48,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:48,528 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-01-24 13:00:48,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 13:00:48,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-24 13:00:48,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:48,529 INFO L225 Difference]: With dead ends: 114 [2018-01-24 13:00:48,529 INFO L226 Difference]: Without dead ends: 106 [2018-01-24 13:00:48,530 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-24 13:00:48,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-24 13:00:48,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-01-24 13:00:48,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-24 13:00:48,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-01-24 13:00:48,536 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 35 [2018-01-24 13:00:48,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:48,536 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-01-24 13:00:48,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:00:48,537 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-01-24 13:00:48,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 13:00:48,537 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:48,537 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:48,538 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:48,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1514610189, now seen corresponding path program 1 times [2018-01-24 13:00:48,538 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:48,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:48,539 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:48,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:48,539 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:48,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:48,864 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-24 13:00:48,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:00:48,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 13:00:48,864 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:00:48,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 13:00:48,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 13:00:48,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-01-24 13:00:48,865 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 15 states. [2018-01-24 13:00:49,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:49,786 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-01-24 13:00:49,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 13:00:49,786 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-24 13:00:49,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:49,787 INFO L225 Difference]: With dead ends: 145 [2018-01-24 13:00:49,787 INFO L226 Difference]: Without dead ends: 144 [2018-01-24 13:00:49,787 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2018-01-24 13:00:49,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-24 13:00:49,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 118. [2018-01-24 13:00:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-24 13:00:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-24 13:00:49,795 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 36 [2018-01-24 13:00:49,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:49,795 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-24 13:00:49,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 13:00:49,795 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-24 13:00:49,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 13:00:49,796 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:49,796 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:49,796 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:49,796 INFO L82 PathProgramCache]: Analyzing trace with hash -291724377, now seen corresponding path program 1 times [2018-01-24 13:00:49,797 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:49,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:49,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:49,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:49,798 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:49,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:49,899 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-24 13:00:49,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:00:49,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:00:49,900 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:00:49,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:00:49,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:00:49,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:00:49,900 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 8 states. [2018-01-24 13:00:50,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:50,118 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-01-24 13:00:50,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:00:50,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-24 13:00:50,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:50,122 INFO L225 Difference]: With dead ends: 118 [2018-01-24 13:00:50,123 INFO L226 Difference]: Without dead ends: 117 [2018-01-24 13:00:50,123 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-24 13:00:50,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-24 13:00:50,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-01-24 13:00:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-24 13:00:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-01-24 13:00:50,130 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 37 [2018-01-24 13:00:50,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:50,131 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-01-24 13:00:50,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:00:50,131 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-01-24 13:00:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 13:00:50,131 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:50,132 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:50,132 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:50,132 INFO L82 PathProgramCache]: Analyzing trace with hash -291724376, now seen corresponding path program 1 times [2018-01-24 13:00:50,132 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:50,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:50,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:50,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:50,133 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:50,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:50,710 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-24 13:00:50,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:00:50,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 13:00:50,710 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:00:50,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 13:00:50,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 13:00:50,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-01-24 13:00:50,711 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 15 states. [2018-01-24 13:00:51,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:51,269 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-01-24 13:00:51,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 13:00:51,269 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-01-24 13:00:51,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:51,270 INFO L225 Difference]: With dead ends: 128 [2018-01-24 13:00:51,270 INFO L226 Difference]: Without dead ends: 127 [2018-01-24 13:00:51,271 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2018-01-24 13:00:51,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-24 13:00:51,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2018-01-24 13:00:51,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-24 13:00:51,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-24 13:00:51,279 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 37 [2018-01-24 13:00:51,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:51,279 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-24 13:00:51,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 13:00:51,279 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-24 13:00:51,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 13:00:51,280 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:51,280 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:51,280 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:51,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1900218884, now seen corresponding path program 1 times [2018-01-24 13:00:51,280 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:51,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:51,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:51,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:51,282 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:51,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:00:51,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:00:51,428 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:00:51,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:51,434 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:00:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:51,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:00:51,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 13:00:51,588 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-24 13:00:51,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:51,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:51,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:51,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-24 13:00:51,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-24 13:00:51,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:51,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:51,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-24 13:00:51,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-01-24 13:00:51,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 13:00:51,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:51,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:51,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:51,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-01-24 13:00:51,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-01-24 13:00:51,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-01-24 13:00:51,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:51,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:52,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:52,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-01-24 13:00:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:00:52,033 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:00:52,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-01-24 13:00:52,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-24 13:00:52,254 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:52,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:52,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-24 13:00:52,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:44 [2018-01-24 13:00:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:00:52,356 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:00:52,356 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:00:52,360 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:52,360 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:00:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:52,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:00:52,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:00:52,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:52,429 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-24 13:00:52,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-01-24 13:00:52,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 13:00:52,485 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-24 13:00:52,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:52,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:52,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:52,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-24 13:00:52,513 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:00:52,514 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:00:52,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-01-24 13:00:52,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:52,523 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-24 13:00:52,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:26 [2018-01-24 13:00:52,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-01-24 13:00:52,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-24 13:00:52,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:52,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:52,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:52,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2018-01-24 13:00:52,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-01-24 13:00:52,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-01-24 13:00:52,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:52,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:52,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:52,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:41, output treesize:15 [2018-01-24 13:00:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:00:52,744 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:00:52,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-24 13:00:52,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-01-24 13:00:52,942 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:52,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:52,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-01-24 13:00:52,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:83 [2018-01-24 13:00:53,204 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:00:53,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:00:53,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 11, 13, 11] total 34 [2018-01-24 13:00:53,206 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:00:53,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 13:00:53,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 13:00:53,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1059, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 13:00:53,207 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 20 states. [2018-01-24 13:00:53,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:53,944 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2018-01-24 13:00:53,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 13:00:53,944 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-01-24 13:00:53,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:53,945 INFO L225 Difference]: With dead ends: 125 [2018-01-24 13:00:53,945 INFO L226 Difference]: Without dead ends: 124 [2018-01-24 13:00:53,946 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 118 SyntacticMatches, 12 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=362, Invalid=1708, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 13:00:53,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-24 13:00:53,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-01-24 13:00:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-24 13:00:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2018-01-24 13:00:53,951 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 38 [2018-01-24 13:00:53,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:53,951 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2018-01-24 13:00:53,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 13:00:53,951 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2018-01-24 13:00:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 13:00:53,951 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:53,952 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:53,952 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:53,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1900218883, now seen corresponding path program 1 times [2018-01-24 13:00:53,952 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:53,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:53,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:53,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:53,953 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:53,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:54,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:00:54,314 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:00:54,314 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:00:54,344 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:54,344 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:00:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:54,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:00:54,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 13:00:54,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:00:54,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:54,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:54,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 13:00:54,655 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-24 13:00:54,656 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:54,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:54,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:54,666 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-01-24 13:00:54,722 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:00:54,723 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 23 [2018-01-24 13:00:54,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:54,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:00:54,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:00:54,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-01-24 13:00:54,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:54,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:54,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-01-24 13:00:54,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-01-24 13:00:54,812 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 24 treesize of output 23 [2018-01-24 13:00:54,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:54,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:54,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-01-24 13:00:54,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-24 13:00:54,849 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:54,863 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:54,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:54,870 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-01-24 13:00:54,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-01-24 13:00:54,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-01-24 13:00:54,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:54,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:54,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-01-24 13:00:54,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-01-24 13:00:54,928 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:54,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:54,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:54,936 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-01-24 13:00:54,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:00:54,958 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:00:55,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-24 13:00:55,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-24 13:00:55,326 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:55,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:55,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-24 13:00:55,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-24 13:00:55,337 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:55,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:55,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-01-24 13:00:55,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-24 13:00:55,344 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:55,349 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:55,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-24 13:00:55,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-24 13:00:55,390 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:55,393 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:55,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-01-24 13:00:55,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-24 13:00:55,397 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:55,400 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:55,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-01-24 13:00:55,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-24 13:00:55,403 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:55,406 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:55,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-01-24 13:00:55,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-24 13:00:55,438 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:55,441 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:55,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-01-24 13:00:55,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-24 13:00:55,445 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:55,448 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:55,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-01-24 13:00:55,471 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:66, output treesize:70 [2018-01-24 13:00:55,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-01-24 13:00:55,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:55,633 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:00:55,633 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:00:55,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-24 13:00:55,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:55,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-01-24 13:00:55,649 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:55,669 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:00:55,669 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:00:55,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-01-24 13:00:55,670 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:55,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-01-24 13:00:55,681 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:55,691 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:00:55,691 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:00:55,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-24 13:00:55,692 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:55,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:00:55,699 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 16 variables, input treesize:106, output treesize:12 [2018-01-24 13:00:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:00:55,801 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:00:55,801 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:00:55,812 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:55,812 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:00:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:55,863 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:00:55,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:00:55,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:55,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:00:55,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:55,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:55,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-01-24 13:00:55,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:00:55,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:00:55,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 13:00:55,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:55,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 13:00:55,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:56,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:56,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:34 [2018-01-24 13:00:56,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 13:00:56,047 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-24 13:00:56,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:56,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:56,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 13:00:56,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:00:56,061 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:56,062 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:56,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:56,070 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:44 [2018-01-24 13:00:56,247 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:00:56,248 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:00:56,248 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:00:56,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-24 13:00:56,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:56,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 40 [2018-01-24 13:00:56,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:56,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:56,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:50 [2018-01-24 13:00:56,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-01-24 13:00:56,389 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 24 treesize of output 23 [2018-01-24 13:00:56,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:56,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:56,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2018-01-24 13:00:56,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-01-24 13:00:56,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:56,464 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:56,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:56,478 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:77, output treesize:69 [2018-01-24 13:00:56,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 40 [2018-01-24 13:00:56,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-24 13:00:56,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:56,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2018-01-24 13:00:56,633 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:56,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:56,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-01-24 13:00:56,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-01-24 13:00:56,672 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:56,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-01-24 13:00:56,686 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:56,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-01-24 13:00:56,699 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:56,704 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:56,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:56,717 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:83, output treesize:31 [2018-01-24 13:00:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:00:56,759 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:00:56,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-24 13:00:56,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-24 13:00:56,988 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:56,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:56,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-24 13:00:56,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-24 13:00:56,996 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:57,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:57,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-01-24 13:00:57,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-24 13:00:57,003 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:57,008 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:00:57,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-01-24 13:00:57,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-24 13:00:57,051 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:57,054 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:57,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-01-24 13:00:57,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-24 13:00:57,060 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:57,063 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:57,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-24 13:00:57,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-24 13:00:57,102 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:57,105 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:57,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-01-24 13:00:57,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-24 13:00:57,109 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:57,123 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:57,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-01-24 13:00:57,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-24 13:00:57,127 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-24 13:00:57,133 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:00:57,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-01-24 13:00:57,157 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:66, output treesize:70 [2018-01-24 13:00:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:00:57,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:00:57,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 13, 14, 13] total 46 [2018-01-24 13:00:57,583 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:00:57,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 13:00:57,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 13:00:57,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1968, Unknown=1, NotChecked=0, Total=2162 [2018-01-24 13:00:57,584 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 22 states. [2018-01-24 13:00:58,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:58,554 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-01-24 13:00:58,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 13:00:58,554 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2018-01-24 13:00:58,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:58,555 INFO L225 Difference]: With dead ends: 124 [2018-01-24 13:00:58,555 INFO L226 Difference]: Without dead ends: 123 [2018-01-24 13:00:58,556 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 107 SyntacticMatches, 11 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=421, Invalid=2883, Unknown=2, NotChecked=0, Total=3306 [2018-01-24 13:00:58,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-24 13:00:58,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-01-24 13:00:58,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-24 13:00:58,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-01-24 13:00:58,561 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 38 [2018-01-24 13:00:58,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:58,561 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-01-24 13:00:58,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 13:00:58,561 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-01-24 13:00:58,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 13:00:58,561 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:58,561 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:58,562 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:58,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1174251320, now seen corresponding path program 1 times [2018-01-24 13:00:58,562 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:58,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:58,562 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:58,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:58,563 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:58,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:58,752 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-24 13:00:58,752 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:00:58,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 13:00:58,752 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:00:58,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 13:00:58,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 13:00:58,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-24 13:00:58,753 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 12 states. [2018-01-24 13:00:58,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:00:58,991 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-01-24 13:00:58,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 13:00:58,991 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-01-24 13:00:58,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:00:58,992 INFO L225 Difference]: With dead ends: 131 [2018-01-24 13:00:58,992 INFO L226 Difference]: Without dead ends: 130 [2018-01-24 13:00:58,992 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-01-24 13:00:58,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-24 13:00:58,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-01-24 13:00:58,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-24 13:00:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2018-01-24 13:00:59,000 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 39 [2018-01-24 13:00:59,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:00:59,000 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2018-01-24 13:00:59,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 13:00:59,001 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2018-01-24 13:00:59,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 13:00:59,001 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:00:59,001 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:00:59,002 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:00:59,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1194268638, now seen corresponding path program 1 times [2018-01-24 13:00:59,002 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:00:59,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:59,003 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:00:59,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:00:59,003 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:00:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:00:59,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:00:59,727 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-24 13:00:59,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:00:59,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-01-24 13:00:59,728 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:00:59,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 13:00:59,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 13:00:59,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-01-24 13:00:59,729 INFO L87 Difference]: Start difference. First operand 128 states and 135 transitions. Second operand 19 states. [2018-01-24 13:01:00,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:01:00,366 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2018-01-24 13:01:00,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 13:01:00,367 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-01-24 13:01:00,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:01:00,368 INFO L225 Difference]: With dead ends: 167 [2018-01-24 13:01:00,368 INFO L226 Difference]: Without dead ends: 136 [2018-01-24 13:01:00,368 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2018-01-24 13:01:00,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-24 13:01:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 131. [2018-01-24 13:01:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-24 13:01:00,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-01-24 13:01:00,375 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 44 [2018-01-24 13:01:00,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:01:00,375 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-01-24 13:01:00,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 13:01:00,375 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-01-24 13:01:00,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 13:01:00,376 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:01:00,376 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:01:00,376 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:01:00,376 INFO L82 PathProgramCache]: Analyzing trace with hash -936632417, now seen corresponding path program 1 times [2018-01-24 13:01:00,376 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:01:00,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:00,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:00,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:00,377 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:01:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:00,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:01:00,917 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 40 DAG size of output 24 [2018-01-24 13:01:02,379 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-24 13:01:02,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:01:02,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-01-24 13:01:02,380 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:01:02,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 13:01:02,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 13:01:02,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-01-24 13:01:02,381 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 26 states. [2018-01-24 13:01:03,225 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 81 DAG size of output 80 [2018-01-24 13:01:03,604 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 85 DAG size of output 82 [2018-01-24 13:01:04,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:01:04,353 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-01-24 13:01:04,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-24 13:01:04,354 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2018-01-24 13:01:04,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:01:04,355 INFO L225 Difference]: With dead ends: 138 [2018-01-24 13:01:04,355 INFO L226 Difference]: Without dead ends: 117 [2018-01-24 13:01:04,356 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=195, Invalid=1785, Unknown=0, NotChecked=0, Total=1980 [2018-01-24 13:01:04,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-24 13:01:04,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-01-24 13:01:04,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-24 13:01:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-01-24 13:01:04,364 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 46 [2018-01-24 13:01:04,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:01:04,364 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-01-24 13:01:04,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-24 13:01:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-01-24 13:01:04,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-24 13:01:04,365 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:01:04,365 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:01:04,365 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:01:04,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1548731934, now seen corresponding path program 1 times [2018-01-24 13:01:04,365 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:01:04,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:04,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:04,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:04,366 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:01:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:04,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:01:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:04,578 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:01:04,578 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:01:04,586 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:04,586 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:01:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:04,631 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:01:04,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 13:01:04,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:01:04,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:04,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:04,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:04,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-01-24 13:01:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:04,767 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:01:04,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-24 13:01:04,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-24 13:01:04,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:04,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:04,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-24 13:01:04,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 6 treesize of output 1 [2018-01-24 13:01:04,991 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:04,992 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:04,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:01:04,999 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2018-01-24 13:01:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:05,073 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:01:05,073 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:01:05,076 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:05,076 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:01:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:05,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:01:05,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 13:01:05,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:01:05,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:05,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:05,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:05,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-01-24 13:01:05,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 13:01:05,261 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-24 13:01:05,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:05,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:05,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:05,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-01-24 13:01:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:05,284 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:01:05,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-24 13:01:05,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-24 13:01:05,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:05,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:05,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-24 13:01:05,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 6 treesize of output 1 [2018-01-24 13:01:05,372 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:05,372 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:05,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:01:05,377 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2018-01-24 13:01:05,387 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:05,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:01:05,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13, 17, 13] total 29 [2018-01-24 13:01:05,389 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:01:05,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 13:01:05,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 13:01:05,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2018-01-24 13:01:05,390 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 17 states. [2018-01-24 13:01:05,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:01:05,793 INFO L93 Difference]: Finished difference Result 184 states and 194 transitions. [2018-01-24 13:01:05,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-24 13:01:05,794 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-01-24 13:01:05,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:01:05,794 INFO L225 Difference]: With dead ends: 184 [2018-01-24 13:01:05,794 INFO L226 Difference]: Without dead ends: 95 [2018-01-24 13:01:05,796 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 180 SyntacticMatches, 17 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=369, Invalid=1983, Unknown=0, NotChecked=0, Total=2352 [2018-01-24 13:01:05,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-24 13:01:05,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-01-24 13:01:05,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 13:01:05,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-01-24 13:01:05,802 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 53 [2018-01-24 13:01:05,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:01:05,802 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-01-24 13:01:05,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 13:01:05,802 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-01-24 13:01:05,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-24 13:01:05,803 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:01:05,803 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:01:05,803 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 13:01:05,803 INFO L82 PathProgramCache]: Analyzing trace with hash -2027547752, now seen corresponding path program 1 times [2018-01-24 13:01:05,803 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:01:05,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:05,804 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:05,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:01:05,804 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:01:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:05,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:01:06,178 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 20 DAG size of output 17 [2018-01-24 13:01:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:07,003 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:01:07,003 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:01:07,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:01:07,008 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:01:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:01:07,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:01:07,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:01:07,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:07,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:07,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:01:07,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 13:01:07,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 13:01:07,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:07,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:07,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:07,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-24 13:01:07,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 13:01:07,231 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-24 13:01:07,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:07,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:07,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 43 [2018-01-24 13:01:07,255 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 28 treesize of output 27 [2018-01-24 13:01:07,255 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:07,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:07,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:07,278 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-01-24 13:01:07,320 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:07,321 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:07,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-01-24 13:01:07,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:07,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:07,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:44 [2018-01-24 13:01:07,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 13:01:07,772 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-24 13:01:07,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:07,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:07,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:07,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:135 [2018-01-24 13:01:07,919 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:07,920 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:07,920 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:07,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 29 [2018-01-24 13:01:07,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:07,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 72 [2018-01-24 13:01:07,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-01-24 13:01:07,937 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:07,945 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:07,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 75 [2018-01-24 13:01:07,988 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-01-24 13:01:07,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:07,991 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:07,991 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 36 treesize of output 86 [2018-01-24 13:01:07,992 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:07,998 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:08,014 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:01:08,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 87 [2018-01-24 13:01:08,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 51 [2018-01-24 13:01:08,018 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:08,028 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:08,034 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:08,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:08,045 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:178, output treesize:78 [2018-01-24 13:01:08,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-01-24 13:01:08,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2018-01-24 13:01:08,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:08,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:08,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:08,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:60 [2018-01-24 13:01:08,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-24 13:01:08,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-01-24 13:01:08,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:08,247 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:01:08,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-01-24 13:01:08,247 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:08,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 13:01:08,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:01:08,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:08,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:01:08,258 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:3 [2018-01-24 13:01:08,273 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:01:08,273 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:01:08,521 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 73 DAG size of output 72 [2018-01-24 13:01:08,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2018-01-24 13:01:08,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-24 13:01:08,948 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:08,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:08,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 133 [2018-01-24 13:01:08,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-24 13:01:08,960 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:08,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:08,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2018-01-24 13:01:08,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-24 13:01:08,979 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:08,984 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:08,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2018-01-24 13:01:08,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-24 13:01:08,988 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:08,993 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:08,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 159 [2018-01-24 13:01:08,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-24 13:01:08,998 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:09,008 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:09,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 133 [2018-01-24 13:01:09,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-24 13:01:09,012 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:09,020 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:01:09,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-01-24 13:01:09,104 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 1 variables, input treesize:188, output treesize:739 [2018-01-24 13:01:09,104 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-01-24 13:01:25,761 WARN L146 SmtUtils]: Spent 16300ms on a formula simplification. DAG size of input: 104 DAG size of output 54 [2018-01-24 13:01:25,763 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-24 13:01:25,765 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-24 13:01:28,006 WARN L143 SmtUtils]: Spent 2029ms on a formula simplification that was a NOOP. DAG size: 59 [2018-01-24 13:01:28,008 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-24 13:01:30,278 WARN L143 SmtUtils]: Spent 2034ms on a formula simplification that was a NOOP. DAG size: 59 [2018-01-24 13:01:30,281 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-24 13:01:32,595 WARN L143 SmtUtils]: Spent 2057ms on a formula simplification that was a NOOP. DAG size: 63 [2018-01-24 13:01:32,598 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 Received shutdown request... [2018-01-24 13:01:34,840 WARN L143 SmtUtils]: Spent 2028ms on a formula simplification that was a NOOP. DAG size: 65 [2018-01-24 13:01:34,842 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 13:01:34,842 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 13:01:34,846 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 13:01:34,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:01:34 BoogieIcfgContainer [2018-01-24 13:01:34,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:01:34,847 INFO L168 Benchmark]: Toolchain (without parser) took 53153.17 ms. Allocated memory was 305.7 MB in the beginning and 709.9 MB in the end (delta: 404.2 MB). Free memory was 265.6 MB in the beginning and 605.2 MB in the end (delta: -339.7 MB). Peak memory consumption was 64.6 MB. Max. memory is 5.3 GB. [2018-01-24 13:01:34,848 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 305.7 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:01:34,848 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.74 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 254.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:01:34,849 INFO L168 Benchmark]: Boogie Preprocessor took 45.54 ms. Allocated memory is still 305.7 MB. Free memory was 254.6 MB in the beginning and 252.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:01:34,849 INFO L168 Benchmark]: RCFGBuilder took 578.15 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 222.2 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 5.3 GB. [2018-01-24 13:01:34,849 INFO L168 Benchmark]: TraceAbstraction took 52315.10 ms. Allocated memory was 305.7 MB in the beginning and 709.9 MB in the end (delta: 404.2 MB). Free memory was 222.2 MB in the beginning and 605.2 MB in the end (delta: -383.1 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-01-24 13:01:34,850 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.18 ms. Allocated memory is still 305.7 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 205.74 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 254.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.54 ms. Allocated memory is still 305.7 MB. Free memory was 254.6 MB in the beginning and 252.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 578.15 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 222.2 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 52315.10 ms. Allocated memory was 305.7 MB in the beginning and 709.9 MB in the end (delta: 404.2 MB). Free memory was 222.2 MB in the beginning and 605.2 MB in the end (delta: -383.1 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 633]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 117 locations, 53 error locations. TIMEOUT Result, 52.2s OverallTime, 25 OverallIterations, 2 TraceHistogramMax, 10.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1549 SDtfs, 1913 SDslu, 5986 SDs, 0 SdLazy, 6943 SolverSat, 314 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 929 GetRequests, 437 SyntacticMatches, 50 SemanticMatches, 442 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3452 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred 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, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 147 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 975 NumberOfCodeBlocks, 975 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1197 ConstructedInterpolants, 84 QuantifiedInterpolants, 656197 SizeOfPredicates, 125 NumberOfNonLiveVariables, 1262 ConjunctsInSsa, 256 ConjunctsInUnsatCore, 36 InterpolantComputations, 21 PerfectInterpolantSequences, 58/195 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-01-34-857.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-01-34-857.csv Completed graceful shutdown