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_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:45:24,330 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:45:24,332 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:45:24,346 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:45:24,346 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:45:24,347 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:45:24,349 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:45:24,350 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:45:24,352 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:45:24,352 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:45:24,353 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:45:24,353 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:45:24,354 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:45:24,356 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:45:24,357 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:45:24,359 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:45:24,362 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:45:24,364 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:45:24,365 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:45:24,366 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:45:24,368 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:45:24,369 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:45:24,369 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:45:24,370 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:45:24,371 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:45:24,372 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:45:24,372 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:45:24,373 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:45:24,373 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:45:24,373 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:45:24,374 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:45:24,374 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 16:45:24,384 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:45:24,385 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:45:24,385 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:45:24,386 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:45:24,386 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:45:24,386 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:45:24,386 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:45:24,386 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:45:24,387 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:45:24,387 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:45:24,388 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:45:24,388 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:45:24,388 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:45:24,388 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:45:24,388 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:45:24,389 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:45:24,389 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:45:24,389 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:45:24,389 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:45:24,389 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:45:24,390 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:45:24,390 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:45:24,390 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:45:24,390 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:45:24,390 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:45:24,391 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:45:24,391 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:45:24,391 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:45:24,391 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:45:24,391 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:45:24,392 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:45:24,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:45:24,392 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:45:24,392 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:45:24,393 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:45:24,393 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:45:24,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:45:24,445 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:45:24,450 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:45:24,451 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:45:24,452 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:45:24,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:45:24,642 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:45:24,648 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:45:24,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:45:24,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:45:24,656 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:45:24,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:45:24" (1/1) ... [2018-01-24 16:45:24,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e47ad9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:45:24, skipping insertion in model container [2018-01-24 16:45:24,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:45:24" (1/1) ... [2018-01-24 16:45:24,681 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:45:24,721 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:45:24,846 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:45:24,863 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:45:24,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:45:24 WrapperNode [2018-01-24 16:45:24,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:45:24,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:45:24,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:45:24,870 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:45:24,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:45:24" (1/1) ... [2018-01-24 16:45:24,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:45:24" (1/1) ... [2018-01-24 16:45:24,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:45:24" (1/1) ... [2018-01-24 16:45:24,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:45:24" (1/1) ... [2018-01-24 16:45:24,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:45:24" (1/1) ... [2018-01-24 16:45:24,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:45:24" (1/1) ... [2018-01-24 16:45:24,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:45:24" (1/1) ... [2018-01-24 16:45:24,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:45:24,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:45:24,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:45:24,908 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:45:24,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:45:24" (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 16:45:24,953 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:45:24,954 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:45:24,954 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-01-24 16:45:24,954 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:45:24,954 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:45:24,954 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:45:24,954 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:45:24,954 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:45:24,954 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:45:24,954 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:45:24,955 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-01-24 16:45:24,955 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:45:24,955 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:45:24,955 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:45:25,285 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:45:25,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:45:25 BoogieIcfgContainer [2018-01-24 16:45:25,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:45:25,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:45:25,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:45:25,289 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:45:25,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:45:24" (1/3) ... [2018-01-24 16:45:25,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9c0ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:45:25, skipping insertion in model container [2018-01-24 16:45:25,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:45:24" (2/3) ... [2018-01-24 16:45:25,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9c0ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:45:25, skipping insertion in model container [2018-01-24 16:45:25,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:45:25" (3/3) ... [2018-01-24 16:45:25,294 INFO L105 eAbstractionObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:45:25,303 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:45:25,311 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-24 16:45:25,354 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:45:25,355 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:45:25,389 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:45:25,389 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:45:25,389 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:45:25,389 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:45:25,390 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:45:25,390 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:45:25,391 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:45:25,413 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-01-24 16:45:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:45:25,421 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:45:25,422 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:45:25,423 INFO L371 AbstractCegarLoop]: === Iteration 1 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 16:45:25,428 INFO L82 PathProgramCache]: Analyzing trace with hash -456745945, now seen corresponding path program 1 times [2018-01-24 16:45:25,431 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:45:25,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:25,483 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:25,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:25,483 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:45:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:25,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:45:25,762 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 16:45:25,764 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:45:25,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:45:25,765 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:45:25,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:45:25,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:45:25,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:45:25,782 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 4 states. [2018-01-24 16:45:25,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:45:25,947 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2018-01-24 16:45:25,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:45:25,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-24 16:45:25,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:45:25,958 INFO L225 Difference]: With dead ends: 138 [2018-01-24 16:45:25,958 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 16:45:25,962 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 16:45:25,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 16:45:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 16:45:25,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 16:45:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-01-24 16:45:26,000 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 18 [2018-01-24 16:45:26,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:45:26,001 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-01-24 16:45:26,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:45:26,001 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-01-24 16:45:26,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:45:26,002 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:45:26,002 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:45:26,002 INFO L371 AbstractCegarLoop]: === Iteration 2 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 16:45:26,002 INFO L82 PathProgramCache]: Analyzing trace with hash -456745944, now seen corresponding path program 1 times [2018-01-24 16:45:26,002 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:45:26,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:26,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:26,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:26,004 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:45:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:26,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:45:26,192 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 16:45:26,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:45:26,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:45:26,193 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:45:26,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:45:26,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:45:26,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:45:26,195 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 7 states. [2018-01-24 16:45:26,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:45:26,499 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-01-24 16:45:26,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:45:26,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-24 16:45:26,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:45:26,502 INFO L225 Difference]: With dead ends: 99 [2018-01-24 16:45:26,502 INFO L226 Difference]: Without dead ends: 96 [2018-01-24 16:45:26,503 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:45:26,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-24 16:45:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2018-01-24 16:45:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 16:45:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-01-24 16:45:26,511 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 18 [2018-01-24 16:45:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:45:26,512 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-01-24 16:45:26,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:45:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-01-24 16:45:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:45:26,513 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:45:26,513 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 16:45:26,513 INFO L371 AbstractCegarLoop]: === Iteration 3 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 16:45:26,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1274222418, now seen corresponding path program 1 times [2018-01-24 16:45:26,514 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:45:26,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:26,515 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:26,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:26,515 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:45:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:26,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:45:26,566 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 16:45:26,566 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:45:26,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:45:26,567 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:45:26,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:45:26,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:45:26,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:45:26,568 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 4 states. [2018-01-24 16:45:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:45:26,622 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-01-24 16:45:26,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:45:26,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-24 16:45:26,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:45:26,623 INFO L225 Difference]: With dead ends: 82 [2018-01-24 16:45:26,623 INFO L226 Difference]: Without dead ends: 80 [2018-01-24 16:45:26,623 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 16:45:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-24 16:45:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-24 16:45:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 16:45:26,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-01-24 16:45:26,631 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 19 [2018-01-24 16:45:26,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:45:26,632 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-01-24 16:45:26,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:45:26,632 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-01-24 16:45:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:45:26,632 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:45:26,633 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 16:45:26,633 INFO L371 AbstractCegarLoop]: === Iteration 4 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 16:45:26,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1274222417, now seen corresponding path program 1 times [2018-01-24 16:45:26,633 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:45:26,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:26,634 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:26,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:26,635 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:45:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:26,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:45:26,756 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 16:45:26,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:45:26,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:45:26,756 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:45:26,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:45:26,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:45:26,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:45:26,757 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 8 states. [2018-01-24 16:45:26,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:45:26,969 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2018-01-24 16:45:26,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:45:26,975 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 16:45:26,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:45:26,976 INFO L225 Difference]: With dead ends: 99 [2018-01-24 16:45:26,976 INFO L226 Difference]: Without dead ends: 97 [2018-01-24 16:45:26,977 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-01-24 16:45:26,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-24 16:45:26,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-01-24 16:45:26,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 16:45:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-01-24 16:45:26,986 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 19 [2018-01-24 16:45:26,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:45:26,987 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-01-24 16:45:26,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:45:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-01-24 16:45:26,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 16:45:26,988 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:45:26,988 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] [2018-01-24 16:45:26,989 INFO L371 AbstractCegarLoop]: === Iteration 5 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 16:45:26,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1183954355, now seen corresponding path program 1 times [2018-01-24 16:45:26,990 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:45:26,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:26,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:26,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:26,991 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:45:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:27,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:45:27,072 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 16:45:27,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:45:27,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:45:27,073 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:45:27,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:45:27,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:45:27,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:45:27,074 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 6 states. [2018-01-24 16:45:27,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:45:27,180 INFO L93 Difference]: Finished difference Result 181 states and 205 transitions. [2018-01-24 16:45:27,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:45:27,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-24 16:45:27,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:45:27,182 INFO L225 Difference]: With dead ends: 181 [2018-01-24 16:45:27,182 INFO L226 Difference]: Without dead ends: 128 [2018-01-24 16:45:27,183 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:45:27,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-24 16:45:27,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2018-01-24 16:45:27,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-24 16:45:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2018-01-24 16:45:27,198 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 23 [2018-01-24 16:45:27,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:45:27,198 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2018-01-24 16:45:27,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:45:27,199 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2018-01-24 16:45:27,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 16:45:27,200 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:45:27,200 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:45:27,200 INFO L371 AbstractCegarLoop]: === Iteration 6 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 16:45:27,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1662425565, now seen corresponding path program 1 times [2018-01-24 16:45:27,201 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:45:27,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:27,202 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:27,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:27,202 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:45:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:27,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:45:27,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:45:27,316 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:45:27,316 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:45:27,317 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 16:45:27,319 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [10], [15], [16], [18], [19], [23], [126], [129], [133], [134], [141], [142], [143], [145] [2018-01-24 16:45:27,362 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:45:27,362 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:45:27,556 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:45:27,558 INFO L268 AbstractInterpreter]: Visited 21 different actions 27 times. Merged at 6 different actions 6 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-24 16:45:27,575 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:45:27,576 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:45:27,576 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 16:45:27,589 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:27,589 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:45:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:27,624 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:45:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:45:27,691 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:45:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:45:27,780 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:45:27,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [9] total 13 [2018-01-24 16:45:27,780 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:45:27,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:45:27,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:45:27,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:45:27,781 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 7 states. [2018-01-24 16:45:27,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:45:27,897 INFO L93 Difference]: Finished difference Result 165 states and 185 transitions. [2018-01-24 16:45:27,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:45:27,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-24 16:45:27,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:45:27,899 INFO L225 Difference]: With dead ends: 165 [2018-01-24 16:45:27,899 INFO L226 Difference]: Without dead ends: 126 [2018-01-24 16:45:27,900 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-01-24 16:45:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-24 16:45:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 113. [2018-01-24 16:45:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 16:45:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-01-24 16:45:27,913 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 23 [2018-01-24 16:45:27,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:45:27,914 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-01-24 16:45:27,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:45:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-01-24 16:45:27,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 16:45:27,915 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:45:27,915 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] [2018-01-24 16:45:27,915 INFO L371 AbstractCegarLoop]: === Iteration 7 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 16:45:27,915 INFO L82 PathProgramCache]: Analyzing trace with hash -404393547, now seen corresponding path program 1 times [2018-01-24 16:45:27,916 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:45:27,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:27,917 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:27,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:27,917 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:45:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:27,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:45:27,984 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 16:45:27,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:45:27,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:45:27,984 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:45:27,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:45:27,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:45:27,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:45:27,985 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 6 states. [2018-01-24 16:45:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:45:28,111 INFO L93 Difference]: Finished difference Result 191 states and 213 transitions. [2018-01-24 16:45:28,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:45:28,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-24 16:45:28,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:45:28,113 INFO L225 Difference]: With dead ends: 191 [2018-01-24 16:45:28,113 INFO L226 Difference]: Without dead ends: 117 [2018-01-24 16:45:28,113 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:45:28,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-24 16:45:28,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-01-24 16:45:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 16:45:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-01-24 16:45:28,126 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 23 [2018-01-24 16:45:28,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:45:28,127 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-01-24 16:45:28,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:45:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-01-24 16:45:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 16:45:28,128 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:45:28,128 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:45:28,128 INFO L371 AbstractCegarLoop]: === Iteration 8 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 16:45:28,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1044193829, now seen corresponding path program 1 times [2018-01-24 16:45:28,129 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:45:28,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:28,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:28,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:28,130 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:45:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:28,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:45:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:45:28,346 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:45:28,346 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:45:28,346 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 16:45:28,346 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [10], [15], [16], [18], [19], [23], [126], [131], [133], [134], [141], [142], [143], [145] [2018-01-24 16:45:28,347 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:45:28,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:45:28,455 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:45:28,455 INFO L268 AbstractInterpreter]: Visited 21 different actions 27 times. Merged at 6 different actions 6 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-24 16:45:28,456 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:45:28,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:45:28,457 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:45:28,469 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:28,470 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:45:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:28,489 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:45:28,511 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 16:45:28,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:28,532 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 16:45:28,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:28,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:45:28,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-24 16:45:28,565 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:45:28,566 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:45:28,567 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 11 treesize of output 4 [2018-01-24 16:45:28,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:28,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-24 16:45:28,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:28,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:45:28,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-24 16:45:28,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:45:28,761 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:45:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:45:29,018 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:45:29,018 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 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 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:45:29,024 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:29,024 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:45:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:29,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:45:29,067 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 16:45:29,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:29,076 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 16:45:29,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:29,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:45:29,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-24 16:45:29,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:45:29,091 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:45:29,091 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 11 treesize of output 4 [2018-01-24 16:45:29,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:29,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-24 16:45:29,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:29,104 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 16:45:29,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:22 [2018-01-24 16:45:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:45:29,135 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:45:29,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:45:29,259 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:45:29,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 18 [2018-01-24 16:45:29,260 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:45:29,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 16:45:29,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 16:45:29,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-01-24 16:45:29,261 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 12 states. [2018-01-24 16:45:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:45:29,610 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-01-24 16:45:29,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:45:29,611 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-01-24 16:45:29,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:45:29,612 INFO L225 Difference]: With dead ends: 117 [2018-01-24 16:45:29,612 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 16:45:29,613 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2018-01-24 16:45:29,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 16:45:29,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2018-01-24 16:45:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-24 16:45:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-01-24 16:45:29,625 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 23 [2018-01-24 16:45:29,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:45:29,625 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-01-24 16:45:29,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 16:45:29,626 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-01-24 16:45:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:45:29,627 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:45:29,627 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:45:29,628 INFO L371 AbstractCegarLoop]: === Iteration 9 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 16:45:29,628 INFO L82 PathProgramCache]: Analyzing trace with hash 186672598, now seen corresponding path program 1 times [2018-01-24 16:45:29,628 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:45:29,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:29,629 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:29,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:29,629 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:45:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:29,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:45:29,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:45:29,714 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:45:29,714 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:45:29,714 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 16:45:29,714 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [10], [13], [15], [16], [19], [23], [27], [31], [36], [40], [45], [48], [126], [131], [133], [134], [141], [142], [143], [145] [2018-01-24 16:45:29,715 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:45:29,715 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:45:29,837 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:45:29,838 INFO L268 AbstractInterpreter]: Visited 27 different actions 39 times. Merged at 12 different actions 12 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-24 16:45:29,855 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:45:29,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:45:29,856 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:45:29,863 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:29,864 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:45:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:29,885 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:45:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:45:29,911 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:45:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:45:30,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:45:30,009 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 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 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:45:30,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:30,012 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:45:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:30,042 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:45:30,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:45:30,047 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:45:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:45:30,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:45:30,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 9 [2018-01-24 16:45:30,076 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:45:30,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:45:30,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:45:30,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:45:30,077 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 8 states. [2018-01-24 16:45:30,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:45:30,196 INFO L93 Difference]: Finished difference Result 222 states and 246 transitions. [2018-01-24 16:45:30,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:45:30,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-01-24 16:45:30,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:45:30,198 INFO L225 Difference]: With dead ends: 222 [2018-01-24 16:45:30,198 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 16:45:30,198 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:45:30,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 16:45:30,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 124. [2018-01-24 16:45:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-24 16:45:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-01-24 16:45:30,217 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 28 [2018-01-24 16:45:30,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:45:30,218 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-01-24 16:45:30,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:45:30,218 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-01-24 16:45:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 16:45:30,219 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:45:30,219 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:45:30,219 INFO L371 AbstractCegarLoop]: === Iteration 10 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 16:45:30,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1928191573, now seen corresponding path program 2 times [2018-01-24 16:45:30,220 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:45:30,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:30,221 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:30,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:30,221 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:45:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:30,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:45:30,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:45:30,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:45:30,658 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:45:30,658 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:45:30,658 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:45:30,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:45:30,658 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:45:30,668 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:45:30,668 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:45:30,678 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:45:30,680 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:45:30,683 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:45:30,686 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 16:45:30,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:30,690 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 16:45:30,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:30,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:45:30,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-24 16:45:30,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:45:30,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-24 16:45:30,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:30,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:45:30,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:45:30,755 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 16:45:30,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:30,765 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 16:45:30,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:35 [2018-01-24 16:45:30,802 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:45:30,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:45:30,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-01-24 16:45:30,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:30,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:45:30,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:45:30,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:45:30,836 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 16 treesize of output 13 [2018-01-24 16:45:30,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:30,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 16:45:30,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2018-01-24 16:45:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-24 16:45:31,003 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:45:31,486 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-24 16:45:31,507 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:45:31,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [13] total 27 [2018-01-24 16:45:31,507 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:45:31,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:45:31,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:45:31,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2018-01-24 16:45:31,508 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 10 states. [2018-01-24 16:45:31,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:45:31,942 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2018-01-24 16:45:31,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 16:45:31,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-01-24 16:45:31,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:45:31,944 INFO L225 Difference]: With dead ends: 124 [2018-01-24 16:45:31,944 INFO L226 Difference]: Without dead ends: 121 [2018-01-24 16:45:31,945 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=184, Invalid=937, Unknown=1, NotChecked=0, Total=1122 [2018-01-24 16:45:31,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-24 16:45:31,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-01-24 16:45:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-24 16:45:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2018-01-24 16:45:31,960 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 33 [2018-01-24 16:45:31,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:45:31,960 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2018-01-24 16:45:31,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:45:31,960 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2018-01-24 16:45:31,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 16:45:31,961 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:45:31,962 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:45:31,962 INFO L371 AbstractCegarLoop]: === Iteration 11 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 16:45:31,962 INFO L82 PathProgramCache]: Analyzing trace with hash -355603392, now seen corresponding path program 1 times [2018-01-24 16:45:31,962 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:45:31,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:31,963 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:45:31,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:31,963 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:45:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:31,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:45:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-24 16:45:32,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:45:32,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:45:32,063 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:45:32,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:45:32,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:45:32,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:45:32,064 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand 9 states. [2018-01-24 16:45:32,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:45:32,190 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2018-01-24 16:45:32,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:45:32,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-01-24 16:45:32,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:45:32,192 INFO L225 Difference]: With dead ends: 159 [2018-01-24 16:45:32,192 INFO L226 Difference]: Without dead ends: 158 [2018-01-24 16:45:32,193 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-01-24 16:45:32,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-24 16:45:32,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 125. [2018-01-24 16:45:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-24 16:45:32,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-01-24 16:45:32,210 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 34 [2018-01-24 16:45:32,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:45:32,211 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-01-24 16:45:32,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:45:32,211 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-01-24 16:45:32,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 16:45:32,212 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:45:32,212 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:45:32,212 INFO L371 AbstractCegarLoop]: === Iteration 12 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 16:45:32,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1116063411, now seen corresponding path program 1 times [2018-01-24 16:45:32,213 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:45:32,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:32,213 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:32,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:32,214 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:45:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:32,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:45:32,240 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-24 16:45:32,241 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:45:32,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:45:32,241 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:45:32,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:45:32,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:45:32,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:45:32,242 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 3 states. [2018-01-24 16:45:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:45:32,262 INFO L93 Difference]: Finished difference Result 173 states and 192 transitions. [2018-01-24 16:45:32,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:45:32,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-01-24 16:45:32,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:45:32,264 INFO L225 Difference]: With dead ends: 173 [2018-01-24 16:45:32,264 INFO L226 Difference]: Without dead ends: 126 [2018-01-24 16:45:32,264 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:45:32,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-24 16:45:32,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-01-24 16:45:32,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-24 16:45:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-01-24 16:45:32,282 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 38 [2018-01-24 16:45:32,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:45:32,282 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-01-24 16:45:32,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:45:32,282 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-01-24 16:45:32,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 16:45:32,283 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:45:32,284 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:45:32,284 INFO L371 AbstractCegarLoop]: === Iteration 13 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 16:45:32,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1116072442, now seen corresponding path program 1 times [2018-01-24 16:45:32,284 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:45:32,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:32,285 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:32,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:32,285 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:45:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:32,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:45:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-24 16:45:32,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:45:32,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 16:45:32,406 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:45:32,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 16:45:32,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 16:45:32,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:45:32,406 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 11 states. [2018-01-24 16:45:32,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:45:32,636 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2018-01-24 16:45:32,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 16:45:32,636 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-01-24 16:45:32,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:45:32,637 INFO L225 Difference]: With dead ends: 127 [2018-01-24 16:45:32,637 INFO L226 Difference]: Without dead ends: 125 [2018-01-24 16:45:32,638 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-01-24 16:45:32,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-24 16:45:32,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-01-24 16:45:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-24 16:45:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-01-24 16:45:32,648 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 38 [2018-01-24 16:45:32,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:45:32,648 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-01-24 16:45:32,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 16:45:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-01-24 16:45:32,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 16:45:32,649 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:45:32,650 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:45:32,650 INFO L371 AbstractCegarLoop]: === Iteration 14 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 16:45:32,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1390751146, now seen corresponding path program 1 times [2018-01-24 16:45:32,650 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:45:32,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:32,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:32,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:32,651 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:45:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:32,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:45:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-24 16:45:32,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:45:32,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:45:32,753 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:45:32,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:45:32,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:45:32,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:45:32,754 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 9 states. [2018-01-24 16:45:33,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:45:33,073 INFO L93 Difference]: Finished difference Result 189 states and 211 transitions. [2018-01-24 16:45:33,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:45:33,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-01-24 16:45:33,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:45:33,074 INFO L225 Difference]: With dead ends: 189 [2018-01-24 16:45:33,074 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 16:45:33,075 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-24 16:45:33,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 16:45:33,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-01-24 16:45:33,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-24 16:45:33,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2018-01-24 16:45:33,090 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 42 [2018-01-24 16:45:33,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:45:33,091 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2018-01-24 16:45:33,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:45:33,091 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2018-01-24 16:45:33,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 16:45:33,092 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:45:33,092 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:45:33,092 INFO L371 AbstractCegarLoop]: === Iteration 15 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 16:45:33,092 INFO L82 PathProgramCache]: Analyzing trace with hash -363955689, now seen corresponding path program 1 times [2018-01-24 16:45:33,092 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:45:33,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:33,093 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:33,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:45:33,094 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:45:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:33,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:45:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:45:33,548 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:45:33,548 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:45:33,549 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-01-24 16:45:33,549 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [10], [13], [15], [16], [19], [23], [27], [31], [34], [90], [94], [97], [99], [100], [111], [113], [117], [118], [119], [120], [121], [122], [126], [129], [133], [134], [136], [137], [138], [140], [141], [142], [143], [145], [146] [2018-01-24 16:45:33,551 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:45:33,551 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:45:33,803 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:45:33,803 INFO L268 AbstractInterpreter]: Visited 42 different actions 91 times. Merged at 22 different actions 45 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 31 variables. [2018-01-24 16:45:33,820 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:45:33,820 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:45:33,820 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 16:45:33,831 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:33,831 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:45:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:33,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:45:33,869 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 16:45:33,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:33,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:45:33,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:45:33,904 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:45:33,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:45:33,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:45:33,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:33,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:45:33,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 16:45:33,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 15 treesize of output 12 [2018-01-24 16:45:33,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 16:45:33,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:33,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:45:34,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:45:34,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-24 16:45:34,030 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-24 16:45:34,032 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 16:45:34,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:34,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:45:34,042 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 16:45:34,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-01-24 16:45:34,091 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 0 case distinctions, treesize of input 22 treesize of output 20 [2018-01-24 16:45:34,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-24 16:45:34,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:34,096 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 16:45:34,097 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:34,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:45:34,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:45:34,100 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:29, output treesize:7 [2018-01-24 16:45:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:45:34,119 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:45:34,194 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2018-01-24 16:45:34,209 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 13 treesize of output 12 [2018-01-24 16:45:34,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:34,223 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 25 treesize of output 23 [2018-01-24 16:45:34,225 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 10 treesize of output 1 [2018-01-24 16:45:34,225 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:34,228 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:45:34,230 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 20 treesize of output 16 [2018-01-24 16:45:34,244 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-01-24 16:45:34,245 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-24 16:45:34,247 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:45:34,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-01-24 16:45:34,275 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 5 xjuncts. [2018-01-24 16:45:34,276 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:43, output treesize:37 [2018-01-24 16:45:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:45:34,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:45:34,429 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 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 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:45:34,432 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:45:34,432 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:45:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:45:34,472 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:45:34,474 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 16:45:34,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:45:34,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:45:34,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 16:45:34,591 WARN L1029 $PredicateComparison]: unable to prove that (and (not (= 0 |c_lis_#t~malloc1.base|)) (exists ((|lis_#t~malloc0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |lis_#t~malloc0.base| 1))) (and (= 0 (select .cse0 |c_lis_#t~malloc1.base|)) (= |c_#valid| (store (store .cse0 |c_lis_#t~malloc1.base| 1) |lis_#t~malloc0.base| 0)) (= (select |c_old(#valid)| |lis_#t~malloc0.base|) 0) (not (= 0 |lis_#t~malloc0.base|)))))) is different from true [2018-01-24 16:45:34,597 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|lis_#t~malloc1.base| Int) (|lis_#t~malloc0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |lis_#t~malloc0.base| 1))) (and (= 0 (select .cse0 |lis_#t~malloc1.base|)) (not (= 0 |lis_#t~malloc1.base|)) (= (select |c_old(#valid)| |lis_#t~malloc0.base|) 0) (not (= 0 |lis_#t~malloc0.base|)) (= |c_#valid| (store (store (store .cse0 |lis_#t~malloc1.base| 1) |lis_#t~malloc0.base| 0) |lis_#t~malloc1.base| 0))))) is different from true [2018-01-24 16:45:34,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 16:45:34,703 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:45:34,757 WARN L1007 $PredicateComparison]: unable to prove that (forall ((v_lis_~prev~2.base_26 Int) (v_lis_~best~2.base_39 Int)) (let ((.cse0 (store |c_#valid| v_lis_~best~2.base_39 1))) (or (not (= 0 (select .cse0 v_lis_~prev~2.base_26))) (= (store (store (store (store .cse0 v_lis_~prev~2.base_26 1) v_lis_~best~2.base_39 0) v_lis_~prev~2.base_26 0) |c_main_#t~malloc19.base| 0) |c_old(#valid)|) (= v_lis_~prev~2.base_26 0) (not (= (select |c_#valid| v_lis_~best~2.base_39) 0)) (= v_lis_~best~2.base_39 0)))) is different from false [2018-01-24 16:45:34,763 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_old(#valid)_BEFORE_CALL_6| term size 31 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:328) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-24 16:45:34,765 INFO L168 Benchmark]: Toolchain (without parser) took 10123.03 ms. Allocated memory was 303.0 MB in the beginning and 581.4 MB in the end (delta: 278.4 MB). Free memory was 263.1 MB in the beginning and 433.0 MB in the end (delta: -169.9 MB). Peak memory consumption was 108.5 MB. Max. memory is 5.3 GB. [2018-01-24 16:45:34,766 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:45:34,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.33 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 251.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. [2018-01-24 16:45:34,767 INFO L168 Benchmark]: Boogie Preprocessor took 38.00 ms. Allocated memory is still 303.0 MB. Free memory was 251.8 MB in the beginning and 249.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:45:34,767 INFO L168 Benchmark]: RCFGBuilder took 378.11 ms. Allocated memory is still 303.0 MB. Free memory was 249.8 MB in the beginning and 226.1 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. [2018-01-24 16:45:34,767 INFO L168 Benchmark]: TraceAbstraction took 9477.87 ms. Allocated memory was 303.0 MB in the beginning and 581.4 MB in the end (delta: 278.4 MB). Free memory was 226.1 MB in the beginning and 433.0 MB in the end (delta: -206.9 MB). Peak memory consumption was 71.5 MB. Max. memory is 5.3 GB. [2018-01-24 16:45:34,769 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.22 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.33 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 251.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.00 ms. Allocated memory is still 303.0 MB. Free memory was 251.8 MB in the beginning and 249.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 378.11 ms. Allocated memory is still 303.0 MB. Free memory was 249.8 MB in the beginning and 226.1 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9477.87 ms. Allocated memory was 303.0 MB in the beginning and 581.4 MB in the end (delta: 278.4 MB). Free memory was 226.1 MB in the beginning and 433.0 MB in the end (delta: -206.9 MB). Peak memory consumption was 71.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 236 LocStat_NO_SUPPORTING_DISEQUALITIES : 51 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 27 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 56 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.473208 RENAME_VARIABLES(MILLISECONDS) : 0.592193 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.401190 PROJECTAWAY(MILLISECONDS) : 0.420094 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001091 DISJOIN(MILLISECONDS) : 0.754632 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.645423 ADD_EQUALITY(MILLISECONDS) : 0.053340 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.018908 #CONJOIN_DISJUNCTIVE : 50 #RENAME_VARIABLES : 74 #UNFREEZE : 0 #CONJOIN : 90 #PROJECTAWAY : 66 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 71 #ADD_EQUALITY : 58 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 228 LocStat_NO_SUPPORTING_DISEQUALITIES : 51 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 27 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 57 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.953607 RENAME_VARIABLES(MILLISECONDS) : 0.591938 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.894256 PROJECTAWAY(MILLISECONDS) : 0.388996 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001185 DISJOIN(MILLISECONDS) : 0.522021 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.635756 ADD_EQUALITY(MILLISECONDS) : 0.042943 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017589 #CONJOIN_DISJUNCTIVE : 50 #RENAME_VARIABLES : 74 #UNFREEZE : 0 #CONJOIN : 90 #PROJECTAWAY : 66 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 71 #ADD_EQUALITY : 59 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 26 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 347 LocStat_NO_SUPPORTING_DISEQUALITIES : 81 LocStat_NO_DISJUNCTIONS : -52 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 60 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.387296 RENAME_VARIABLES(MILLISECONDS) : 0.248380 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.621394 PROJECTAWAY(MILLISECONDS) : 0.052655 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001151 DISJOIN(MILLISECONDS) : 0.474325 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.282230 ADD_EQUALITY(MILLISECONDS) : 0.022003 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016069 #CONJOIN_DISJUNCTIVE : 69 #RENAME_VARIABLES : 110 #UNFREEZE : 0 #CONJOIN : 109 #PROJECTAWAY : 90 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 12 #RENAME_VARIABLES_DISJUNCTIVE : 107 #ADD_EQUALITY : 62 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 40 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 559 LocStat_NO_SUPPORTING_DISEQUALITIES : 134 LocStat_NO_DISJUNCTIONS : -80 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 48 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 69 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 48 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.667532 RENAME_VARIABLES(MILLISECONDS) : 0.019290 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.348968 PROJECTAWAY(MILLISECONDS) : 1.075744 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002800 DISJOIN(MILLISECONDS) : 0.379038 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.037213 ADD_EQUALITY(MILLISECONDS) : 0.036716 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.032448 #CONJOIN_DISJUNCTIVE : 145 #RENAME_VARIABLES : 272 #UNFREEZE : 0 #CONJOIN : 205 #PROJECTAWAY : 196 #ADD_WEAK_EQUALITY : 14 #DISJOIN : 13 #RENAME_VARIABLES_DISJUNCTIVE : 272 #ADD_EQUALITY : 71 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_old(#valid)_BEFORE_CALL_6| term size 31 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_old(#valid)_BEFORE_CALL_6| term size 31: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-45-34-779.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-45-34-779.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-45-34-779.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_16-45-34-779.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_16-45-34-779.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_16-45-34-779.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_16-45-34-779.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_16-45-34-779.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_16-45-34-779.csv Received shutdown request...