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_smtcomp.epf -i ../../../trunk/examples/svcomp/array-memsafety/lis_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:19:02,524 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:19:02,526 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:19:02,542 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:19:02,542 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:19:02,543 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:19:02,544 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:19:02,546 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:19:02,548 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:19:02,549 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:19:02,550 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:19:02,550 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:19:02,551 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:19:02,553 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:19:02,553 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:19:02,556 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:19:02,558 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:19:02,560 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:19:02,562 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:19:02,563 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:19:02,566 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:19:02,566 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:19:02,566 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:19:02,567 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:19:02,568 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:19:02,570 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:19:02,570 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:19:02,571 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:19:02,571 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:19:02,571 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:19:02,572 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:19:02,572 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_smtcomp.epf [2018-01-25 05:19:02,580 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:19:02,581 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:19:02,582 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:19:02,582 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:19:02,582 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:19:02,582 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:19:02,582 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:19:02,582 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:19:02,583 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:19:02,583 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:19:02,583 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:19:02,583 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:19:02,583 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:19:02,583 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:19:02,584 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:19:02,584 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:19:02,584 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:19:02,584 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:19:02,584 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:19:02,584 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:19:02,584 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:19:02,585 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:19:02,585 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:19:02,585 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:19:02,585 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:19:02,585 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:19:02,586 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:19:02,586 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:19:02,586 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:19:02,586 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:19:02,586 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:19:02,586 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:19:02,586 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:19:02,586 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:19:02,587 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:19:02,587 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:19:02,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:19:02,636 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:19:02,640 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:19:02,642 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:19:02,642 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:19:02,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/lis_unsafe_false-valid-deref.i [2018-01-25 05:19:02,850 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:19:02,857 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:19:02,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:19:02,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:19:02,865 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:19:02,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:19:02" (1/1) ... [2018-01-25 05:19:02,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@376b2429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:02, skipping insertion in model container [2018-01-25 05:19:02,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:19:02" (1/1) ... [2018-01-25 05:19:02,888 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:19:02,928 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:19:03,066 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:19:03,082 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:19:03,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:03 WrapperNode [2018-01-25 05:19:03,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:19:03,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:19:03,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:19:03,093 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:19:03,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:03" (1/1) ... [2018-01-25 05:19:03,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:03" (1/1) ... [2018-01-25 05:19:03,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:03" (1/1) ... [2018-01-25 05:19:03,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:03" (1/1) ... [2018-01-25 05:19:03,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:03" (1/1) ... [2018-01-25 05:19:03,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:03" (1/1) ... [2018-01-25 05:19:03,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:03" (1/1) ... [2018-01-25 05:19:03,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:19:03,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:19:03,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:19:03,130 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:19:03,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:03" (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-25 05:19:03,175 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:19:03,176 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:19:03,176 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-01-25 05:19:03,176 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:19:03,176 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:19:03,176 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:19:03,176 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:19:03,177 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:19:03,177 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:19:03,177 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:19:03,177 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:19:03,177 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:19:03,177 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-01-25 05:19:03,178 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:19:03,178 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:19:03,178 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:19:03,495 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:19:03,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:19:03 BoogieIcfgContainer [2018-01-25 05:19:03,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:19:03,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:19:03,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:19:03,500 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:19:03,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:19:02" (1/3) ... [2018-01-25 05:19:03,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c73d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:19:03, skipping insertion in model container [2018-01-25 05:19:03,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:19:03" (2/3) ... [2018-01-25 05:19:03,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c73d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:19:03, skipping insertion in model container [2018-01-25 05:19:03,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:19:03" (3/3) ... [2018-01-25 05:19:03,504 INFO L105 eAbstractionObserver]: Analyzing ICFG lis_unsafe_false-valid-deref.i [2018-01-25 05:19:03,514 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:19:03,522 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-01-25 05:19:03,570 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:19:03,570 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:19:03,570 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:19:03,570 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:19:03,570 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:19:03,570 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:19:03,570 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:19:03,571 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:19:03,571 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:19:03,587 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-01-25 05:19:03,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:19:03,592 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:19:03,592 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:19:03,593 INFO L371 AbstractCegarLoop]: === Iteration 1 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:19:03,596 INFO L82 PathProgramCache]: Analyzing trace with hash -40654889, now seen corresponding path program 1 times [2018-01-25 05:19:03,598 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:19:03,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:03,640 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:03,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:03,640 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:19:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:03,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:19:03,830 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-25 05:19:03,833 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:19:03,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:19:03,834 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:19:03,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:19:03,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:19:03,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:19:03,927 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 4 states. [2018-01-25 05:19:04,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:19:04,089 INFO L93 Difference]: Finished difference Result 134 states and 159 transitions. [2018-01-25 05:19:04,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:19:04,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 05:19:04,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:19:04,106 INFO L225 Difference]: With dead ends: 134 [2018-01-25 05:19:04,106 INFO L226 Difference]: Without dead ends: 70 [2018-01-25 05:19:04,113 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:19:04,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-25 05:19:04,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-25 05:19:04,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 05:19:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-25 05:19:04,157 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 15 [2018-01-25 05:19:04,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:19:04,158 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-25 05:19:04,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:19:04,158 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-25 05:19:04,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:19:04,158 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:19:04,158 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:19:04,159 INFO L371 AbstractCegarLoop]: === Iteration 2 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:19:04,159 INFO L82 PathProgramCache]: Analyzing trace with hash -40654888, now seen corresponding path program 1 times [2018-01-25 05:19:04,159 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:19:04,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:04,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:04,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:04,160 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:19:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:04,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:19:04,298 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-25 05:19:04,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:19:04,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:19:04,299 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:19:04,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:19:04,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:19:04,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:19:04,301 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 7 states. [2018-01-25 05:19:04,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:19:04,569 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2018-01-25 05:19:04,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:19:04,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-01-25 05:19:04,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:19:04,573 INFO L225 Difference]: With dead ends: 95 [2018-01-25 05:19:04,573 INFO L226 Difference]: Without dead ends: 91 [2018-01-25 05:19:04,574 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-25 05:19:04,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-25 05:19:04,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2018-01-25 05:19:04,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-25 05:19:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-01-25 05:19:04,586 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 15 [2018-01-25 05:19:04,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:19:04,587 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-01-25 05:19:04,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:19:04,587 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-01-25 05:19:04,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 05:19:04,588 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:19:04,588 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:19:04,588 INFO L371 AbstractCegarLoop]: === Iteration 3 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:19:04,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1260301570, now seen corresponding path program 1 times [2018-01-25 05:19:04,589 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:19:04,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:04,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:04,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:04,590 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:19:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:04,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:19:04,643 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-25 05:19:04,643 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:19:04,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:19:04,657 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:19:04,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:19:04,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:19:04,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:19:04,658 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 4 states. [2018-01-25 05:19:04,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:19:04,728 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2018-01-25 05:19:04,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:19:04,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-25 05:19:04,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:19:04,730 INFO L225 Difference]: With dead ends: 77 [2018-01-25 05:19:04,730 INFO L226 Difference]: Without dead ends: 75 [2018-01-25 05:19:04,731 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-25 05:19:04,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-25 05:19:04,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-25 05:19:04,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-25 05:19:04,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2018-01-25 05:19:04,738 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 16 [2018-01-25 05:19:04,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:19:04,739 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2018-01-25 05:19:04,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:19:04,739 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2018-01-25 05:19:04,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 05:19:04,739 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:19:04,740 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:19:04,740 INFO L371 AbstractCegarLoop]: === Iteration 4 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:19:04,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1260301569, now seen corresponding path program 1 times [2018-01-25 05:19:04,740 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:19:04,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:04,742 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:04,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:04,742 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:19:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:04,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:19:04,843 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-25 05:19:04,843 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:19:04,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:19:04,844 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:19:04,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:19:04,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:19:04,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:19:04,845 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 8 states. [2018-01-25 05:19:05,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:19:05,018 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2018-01-25 05:19:05,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:19:05,019 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-01-25 05:19:05,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:19:05,020 INFO L225 Difference]: With dead ends: 94 [2018-01-25 05:19:05,020 INFO L226 Difference]: Without dead ends: 91 [2018-01-25 05:19:05,021 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:19:05,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-25 05:19:05,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2018-01-25 05:19:05,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-25 05:19:05,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-01-25 05:19:05,031 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2018-01-25 05:19:05,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:19:05,032 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-01-25 05:19:05,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:19:05,032 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-01-25 05:19:05,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:19:05,033 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:19:05,033 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] [2018-01-25 05:19:05,033 INFO L371 AbstractCegarLoop]: === Iteration 5 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:19:05,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1752664061, now seen corresponding path program 1 times [2018-01-25 05:19:05,034 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:19:05,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:05,034 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:05,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:05,035 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:19:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:05,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:19:05,111 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-25 05:19:05,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:19:05,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:19:05,112 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:19:05,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:19:05,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:19:05,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:19:05,113 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 5 states. [2018-01-25 05:19:05,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:19:05,225 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2018-01-25 05:19:05,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:19:05,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 05:19:05,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:19:05,226 INFO L225 Difference]: With dead ends: 141 [2018-01-25 05:19:05,226 INFO L226 Difference]: Without dead ends: 91 [2018-01-25 05:19:05,227 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:19:05,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-25 05:19:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2018-01-25 05:19:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-25 05:19:05,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-01-25 05:19:05,234 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 20 [2018-01-25 05:19:05,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:19:05,235 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-01-25 05:19:05,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:19:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-01-25 05:19:05,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:19:05,235 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:19:05,236 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:19:05,236 INFO L371 AbstractCegarLoop]: === Iteration 6 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:19:05,236 INFO L82 PathProgramCache]: Analyzing trace with hash -304076685, now seen corresponding path program 1 times [2018-01-25 05:19:05,236 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:19:05,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:05,237 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:05,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:05,237 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:19:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:05,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:19:05,426 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-25 05:19:05,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:19:05,427 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:19:05,428 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-01-25 05:19:05,430 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [10], [15], [16], [18], [19], [23], [128], [133], [134], [135], [137] [2018-01-25 05:19:05,475 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:19:05,475 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:19:08,351 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:19:08,352 INFO L268 AbstractInterpreter]: Visited 18 different actions 28 times. Merged at 6 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-25 05:19:08,372 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:19:08,372 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:19:08,372 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-25 05:19:08,383 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:08,383 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:19:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:08,425 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:19:08,447 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-25 05:19:08,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:19:08,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:19:08,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 05:19:08,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-25 05:19:08,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:19:08,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:19:08,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-25 05:19:08,637 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-25 05:19:08,637 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:19:08,912 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-25 05:19:08,934 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:19:08,934 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:19:08,952 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:08,952 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:19:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:08,985 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:19:09,001 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-25 05:19:09,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:19:09,026 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-25 05:19:09,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:19:09,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:19:09,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-25 05:19:09,040 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:19:09,041 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-25 05:19:09,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:19:09,062 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:19:09,063 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:19:09,064 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-25 05:19:09,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:19:09,075 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-25 05:19:09,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:22 [2018-01-25 05:19:09,173 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-25 05:19:09,173 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:19:09,354 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-25 05:19:09,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:19:09,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 22 [2018-01-25 05:19:09,356 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:19:09,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 05:19:09,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 05:19:09,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-01-25 05:19:09,356 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 11 states. [2018-01-25 05:19:09,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:19:09,722 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-01-25 05:19:09,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:19:09,722 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-01-25 05:19:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:19:09,724 INFO L225 Difference]: With dead ends: 91 [2018-01-25 05:19:09,724 INFO L226 Difference]: Without dead ends: 86 [2018-01-25 05:19:09,724 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=647, Unknown=0, NotChecked=0, Total=870 [2018-01-25 05:19:09,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-25 05:19:09,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2018-01-25 05:19:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 05:19:09,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-01-25 05:19:09,733 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 20 [2018-01-25 05:19:09,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:19:09,734 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-01-25 05:19:09,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 05:19:09,734 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-01-25 05:19:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:19:09,735 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:19:09,735 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] [2018-01-25 05:19:09,735 INFO L371 AbstractCegarLoop]: === Iteration 7 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:19:09,735 INFO L82 PathProgramCache]: Analyzing trace with hash -692554244, now seen corresponding path program 1 times [2018-01-25 05:19:09,735 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:19:09,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:09,736 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:09,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:09,737 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:19:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:09,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:19:09,822 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-25 05:19:09,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:19:09,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:19:09,822 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:19:09,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:19:09,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:19:09,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:19:09,823 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 7 states. [2018-01-25 05:19:09,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:19:09,935 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2018-01-25 05:19:09,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:19:09,936 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-01-25 05:19:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:19:09,937 INFO L225 Difference]: With dead ends: 70 [2018-01-25 05:19:09,938 INFO L226 Difference]: Without dead ends: 69 [2018-01-25 05:19:09,938 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:19:09,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-25 05:19:09,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-25 05:19:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-25 05:19:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2018-01-25 05:19:09,946 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 22 [2018-01-25 05:19:09,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:19:09,947 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2018-01-25 05:19:09,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:19:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-01-25 05:19:09,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 05:19:09,948 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:19:09,948 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] [2018-01-25 05:19:09,948 INFO L371 AbstractCegarLoop]: === Iteration 8 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:19:09,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1804279880, now seen corresponding path program 1 times [2018-01-25 05:19:09,949 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:19:09,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:09,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:09,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:09,950 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:19:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:09,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:19:10,038 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-25 05:19:10,038 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:19:10,038 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:19:10,039 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-25 05:19:10,039 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [10], [13], [15], [16], [19], [23], [27], [31], [36], [40], [45], [48], [128], [133], [134], [135], [137] [2018-01-25 05:19:10,040 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:19:10,041 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:19:14,331 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:19:14,331 INFO L268 AbstractInterpreter]: Visited 24 different actions 46 times. Merged at 12 different actions 22 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-25 05:19:14,337 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:19:14,337 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:19:14,337 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:19:14,342 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:14,342 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:19:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:14,358 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:19:14,382 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-25 05:19:14,382 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:19:14,405 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-25 05:19:14,425 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:19:14,425 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:19:14,428 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:14,428 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:19:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:14,456 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:19:14,461 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-25 05:19:14,461 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:19:14,495 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-25 05:19:14,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:19:14,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 9 [2018-01-25 05:19:14,497 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:19:14,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:19:14,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:19:14,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:19:14,497 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 8 states. [2018-01-25 05:19:14,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:19:14,598 INFO L93 Difference]: Finished difference Result 189 states and 216 transitions. [2018-01-25 05:19:14,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:19:14,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-25 05:19:14,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:19:14,599 INFO L225 Difference]: With dead ends: 189 [2018-01-25 05:19:14,599 INFO L226 Difference]: Without dead ends: 141 [2018-01-25 05:19:14,600 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 90 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:19:14,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-25 05:19:14,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 84. [2018-01-25 05:19:14,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-25 05:19:14,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2018-01-25 05:19:14,610 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 25 [2018-01-25 05:19:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:19:14,610 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2018-01-25 05:19:14,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:19:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2018-01-25 05:19:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:19:14,612 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:19:14,612 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:19:14,612 INFO L371 AbstractCegarLoop]: === Iteration 9 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:19:14,612 INFO L82 PathProgramCache]: Analyzing trace with hash -186387055, now seen corresponding path program 1 times [2018-01-25 05:19:14,612 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:19:14,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:14,613 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:14,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:14,613 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:19:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:14,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:19:14,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:19:14,902 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:19:14,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:19:14,923 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:19:14,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:19:14,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:19:14,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:19:14,924 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand 8 states. [2018-01-25 05:19:15,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:19:15,211 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2018-01-25 05:19:15,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:19:15,211 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-01-25 05:19:15,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:19:15,212 INFO L225 Difference]: With dead ends: 84 [2018-01-25 05:19:15,212 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 05:19:15,212 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:19:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 05:19:15,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-01-25 05:19:15,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 05:19:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-25 05:19:15,219 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 27 [2018-01-25 05:19:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:19:15,219 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-25 05:19:15,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:19:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-25 05:19:15,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:19:15,220 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:19:15,220 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] [2018-01-25 05:19:15,220 INFO L371 AbstractCegarLoop]: === Iteration 10 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:19:15,221 INFO L82 PathProgramCache]: Analyzing trace with hash -324019421, now seen corresponding path program 2 times [2018-01-25 05:19:15,221 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:19:15,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:15,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:15,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:15,222 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:19:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 05:19:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 05:19:15,276 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-25 05:19:15,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:19:15 BoogieIcfgContainer [2018-01-25 05:19:15,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:19:15,322 INFO L168 Benchmark]: Toolchain (without parser) took 12470.80 ms. Allocated memory was 300.4 MB in the beginning and 878.2 MB in the end (delta: 577.8 MB). Free memory was 260.5 MB in the beginning and 363.5 MB in the end (delta: -103.0 MB). Peak memory consumption was 474.7 MB. Max. memory is 5.3 GB. [2018-01-25 05:19:15,322 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 300.4 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:19:15,323 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.60 ms. Allocated memory is still 300.4 MB. Free memory was 259.5 MB in the beginning and 249.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:19:15,323 INFO L168 Benchmark]: Boogie Preprocessor took 36.23 ms. Allocated memory is still 300.4 MB. Free memory was 249.4 MB in the beginning and 247.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:19:15,323 INFO L168 Benchmark]: RCFGBuilder took 366.73 ms. Allocated memory is still 300.4 MB. Free memory was 247.4 MB in the beginning and 223.9 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:19:15,324 INFO L168 Benchmark]: TraceAbstraction took 11823.72 ms. Allocated memory was 300.4 MB in the beginning and 878.2 MB in the end (delta: 577.8 MB). Free memory was 223.9 MB in the beginning and 363.5 MB in the end (delta: -139.6 MB). Peak memory consumption was 438.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:19:15,325 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.19 ms. Allocated memory is still 300.4 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 234.60 ms. Allocated memory is still 300.4 MB. Free memory was 259.5 MB in the beginning and 249.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.23 ms. Allocated memory is still 300.4 MB. Free memory was 249.4 MB in the beginning and 247.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 366.73 ms. Allocated memory is still 300.4 MB. Free memory was 247.4 MB in the beginning and 223.9 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 11823.72 ms. Allocated memory was 300.4 MB in the beginning and 878.2 MB in the end (delta: 577.8 MB). Free memory was 223.9 MB in the beginning and 363.5 MB in the end (delta: -139.6 MB). Peak memory consumption was 438.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 17 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 222 LocStat_NO_SUPPORTING_DISEQUALITIES : 32 LocStat_NO_DISJUNCTIONS : -34 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 24 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 49 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 25 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 35.285088 RENAME_VARIABLES(MILLISECONDS) : 5.366076 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 17.626160 PROJECTAWAY(MILLISECONDS) : 0.437626 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.110376 DISJOIN(MILLISECONDS) : 4.579502 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 5.427620 ADD_EQUALITY(MILLISECONDS) : 0.083978 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.038230 #CONJOIN_DISJUNCTIVE : 53 #RENAME_VARIABLES : 88 #UNFREEZE : 0 #CONJOIN : 92 #PROJECTAWAY : 71 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 83 #ADD_EQUALITY : 51 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 350 LocStat_NO_SUPPORTING_DISEQUALITIES : 56 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 52 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 33.572981 RENAME_VARIABLES(MILLISECONDS) : 7.569232 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 12.077331 PROJECTAWAY(MILLISECONDS) : 0.396251 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.071724 DISJOIN(MILLISECONDS) : 2.868211 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 7.636734 ADD_EQUALITY(MILLISECONDS) : 0.040052 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013056 #CONJOIN_DISJUNCTIVE : 84 #RENAME_VARIABLES : 148 #UNFREEZE : 0 #CONJOIN : 123 #PROJECTAWAY : 107 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 143 #ADD_EQUALITY : 54 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L559] int *a; [L560] int N = __VERIFIER_nondet_int(); [L561] CALL lis(a, N) VAL [\old(N)=2, a={10:-5}] [L542] int *best, *prev, i, j, max = 0; VAL [\old(N)=2, a={10:-5}, a={10:-5}, max=0, N=2] [L543] EXPR, FCALL malloc(sizeof(int) * N) VAL [\old(N)=2, a={10:-5}, a={10:-5}, malloc(sizeof(int) * N)={11:0}, max=0, N=2] [L543] best = (int*) malloc(sizeof(int) * N) VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={11:0}, malloc(sizeof(int) * N)={11:0}, max=0, N=2] [L544] EXPR, FCALL malloc(sizeof(int) * N) VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={11:0}, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={11:0}, max=0, N=2] [L544] prev = (int*) malloc(sizeof(int) * N) [L545] i = 0 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={11:0}, i=0, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={11:0}, max=0, N=2, prev={12:0}] [L545] COND TRUE i < N VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={11:0}, i=0, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={11:0}, max=0, N=2, prev={12:0}] [L546] FCALL best[i] = 1 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={11:0}, i=0, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={11:0}, max=0, N=2, prev={12:0}] [L546] FCALL prev[i] = i VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={11:0}, i=0, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={11:0}, max=0, N=2, prev={12:0}] [L545] i++ VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={11:0}, i=1, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={11:0}, max=0, N=2, prev={12:0}] [L545] COND TRUE i < N VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={11:0}, i=1, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={11:0}, max=0, N=2, prev={12:0}] [L546] FCALL best[i] = 1 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={11:0}, i=1, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={11:0}, max=0, N=2, prev={12:0}] [L546] FCALL prev[i] = i VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={11:0}, i=1, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={11:0}, max=0, N=2, prev={12:0}] [L545] i++ VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={11:0}, i=2, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={11:0}, max=0, N=2, prev={12:0}] [L545] COND FALSE !(i < N) VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={11:0}, i=2, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={11:0}, max=0, N=2, prev={12:0}] [L547] i = 1 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={11:0}, i=1, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={11:0}, max=0, N=2, prev={12:0}] [L547] COND TRUE i < N [L548] j = 0 VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={11:0}, i=1, j=0, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={11:0}, max=0, N=2, prev={12:0}] [L548] COND TRUE j < i VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={11:0}, i=1, j=0, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={11:0}, max=0, N=2, prev={12:0}] [L549] FCALL a[i] VAL [\old(N)=2, a={10:-5}, a={10:-5}, best={11:0}, i=1, j=0, malloc(sizeof(int) * N)={12:0}, malloc(sizeof(int) * N)={11:0}, max=0, N=2, prev={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 81 locations, 27 error locations. UNSAFE Result, 11.7s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 425 SDtfs, 1346 SDslu, 795 SDs, 0 SdLazy, 866 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 259 GetRequests, 158 SyntacticMatches, 15 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.2s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 118 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 339 ConstructedInterpolants, 26 QuantifiedInterpolants, 55169 SizeOfPredicates, 22 NumberOfNonLiveVariables, 384 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 6/25 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-19-15-336.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-19-15-336.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-19-15-336.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-19-15-336.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-19-15-336.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-19-15-336.csv Received shutdown request...