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/mempurity-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/knapsack_alloca_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 23:23:07,001 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 23:23:07,003 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 23:23:07,020 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 23:23:07,020 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 23:23:07,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 23:23:07,022 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 23:23:07,024 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 23:23:07,026 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 23:23:07,027 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 23:23:07,028 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 23:23:07,028 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 23:23:07,029 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 23:23:07,031 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 23:23:07,032 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 23:23:07,035 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 23:23:07,037 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 23:23:07,040 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 23:23:07,041 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 23:23:07,042 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 23:23:07,045 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 23:23:07,046 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 23:23:07,046 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 23:23:07,047 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 23:23:07,048 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 23:23:07,049 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 23:23:07,050 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 23:23:07,051 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 23:23:07,051 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 23:23:07,051 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 23:23:07,052 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 23:23:07,052 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-20 23:23:07,062 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 23:23:07,062 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 23:23:07,063 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 23:23:07,063 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 23:23:07,063 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 23:23:07,063 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 23:23:07,064 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 23:23:07,064 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 23:23:07,064 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 23:23:07,064 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 23:23:07,064 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 23:23:07,065 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 23:23:07,065 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 23:23:07,065 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 23:23:07,065 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 23:23:07,065 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 23:23:07,065 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 23:23:07,065 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 23:23:07,066 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 23:23:07,066 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 23:23:07,066 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 23:23:07,066 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 23:23:07,066 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 23:23:07,066 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 23:23:07,067 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 23:23:07,067 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:23:07,067 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 23:23:07,067 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 23:23:07,067 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 23:23:07,068 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 23:23:07,068 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 23:23:07,068 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-20 23:23:07,068 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 23:23:07,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 23:23:07,068 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 23:23:07,068 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-20 23:23:07,069 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 23:23:07,069 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 23:23:07,103 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 23:23:07,114 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 23:23:07,117 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 23:23:07,119 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 23:23:07,119 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 23:23:07,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/knapsack_alloca_unsafe_false-valid-deref.i [2018-01-20 23:23:07,297 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 23:23:07,303 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 23:23:07,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 23:23:07,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 23:23:07,309 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 23:23:07,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:23:07" (1/1) ... [2018-01-20 23:23:07,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@719878db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:07, skipping insertion in model container [2018-01-20 23:23:07,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:23:07" (1/1) ... [2018-01-20 23:23:07,333 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:23:07,376 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:23:07,500 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:23:07,522 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:23:07,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:07 WrapperNode [2018-01-20 23:23:07,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 23:23:07,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 23:23:07,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 23:23:07,529 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 23:23:07,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:07" (1/1) ... [2018-01-20 23:23:07,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:07" (1/1) ... [2018-01-20 23:23:07,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:07" (1/1) ... [2018-01-20 23:23:07,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:07" (1/1) ... [2018-01-20 23:23:07,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:07" (1/1) ... [2018-01-20 23:23:07,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:07" (1/1) ... [2018-01-20 23:23:07,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:07" (1/1) ... [2018-01-20 23:23:07,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 23:23:07,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 23:23:07,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 23:23:07,560 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 23:23:07,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:07" (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-20 23:23:07,606 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 23:23:07,607 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 23:23:07,607 INFO L136 BoogieDeclarations]: Found implementation of procedure knapsack [2018-01-20 23:23:07,607 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 23:23:07,607 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 23:23:07,607 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 23:23:07,607 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 23:23:07,607 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 23:23:07,607 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 23:23:07,607 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 23:23:07,607 INFO L128 BoogieDeclarations]: Found specification of procedure knapsack [2018-01-20 23:23:07,608 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 23:23:07,608 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 23:23:07,608 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 23:23:07,819 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 23:23:07,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:23:07 BoogieIcfgContainer [2018-01-20 23:23:07,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 23:23:07,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 23:23:07,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 23:23:07,822 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 23:23:07,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 11:23:07" (1/3) ... [2018-01-20 23:23:07,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b805687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:23:07, skipping insertion in model container [2018-01-20 23:23:07,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:23:07" (2/3) ... [2018-01-20 23:23:07,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b805687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:23:07, skipping insertion in model container [2018-01-20 23:23:07,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:23:07" (3/3) ... [2018-01-20 23:23:07,825 INFO L105 eAbstractionObserver]: Analyzing ICFG knapsack_alloca_unsafe_false-valid-deref.i [2018-01-20 23:23:07,833 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 23:23:07,839 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-20 23:23:07,880 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:23:07,880 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:23:07,880 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:23:07,880 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:23:07,881 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:23:07,881 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:23:07,881 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:23:07,881 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 23:23:07,882 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:23:07,903 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-20 23:23:07,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 23:23:07,909 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:07,909 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 23:23:07,909 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 23:23:07,913 INFO L82 PathProgramCache]: Analyzing trace with hash 118205, now seen corresponding path program 1 times [2018-01-20 23:23:07,915 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:07,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:07,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:07,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:07,954 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:23:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:23:08,007 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:23:08,013 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:23:08,019 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:23:08,019 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:23:08,020 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:23:08,020 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:23:08,020 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:23:08,020 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:23:08,020 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:23:08,020 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == knapsackErr0EnsuresViolation======== [2018-01-20 23:23:08,020 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:23:08,022 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-20 23:23:08,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-20 23:23:08,023 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:08,023 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-20 23:23:08,023 INFO L371 AbstractCegarLoop]: === Iteration 1 === [knapsackErr0EnsuresViolation]=== [2018-01-20 23:23:08,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1365807540, now seen corresponding path program 1 times [2018-01-20 23:23:08,023 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:08,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:08,024 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:08,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:08,024 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:08,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:08,104 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-20 23:23:08,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:23:08,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:23:08,106 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:23:08,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:23:08,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:23:08,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:23:08,121 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-01-20 23:23:08,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:08,213 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-01-20 23:23:08,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:23:08,214 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-20 23:23:08,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:08,219 INFO L225 Difference]: With dead ends: 92 [2018-01-20 23:23:08,220 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:23:08,222 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:23:08,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:23:08,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:23:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:23:08,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:23:08,241 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-20 23:23:08,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:08,241 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:23:08,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:23:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:23:08,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:23:08,245 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:23:08,245 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:23:08,245 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:23:08,245 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:23:08,245 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:23:08,245 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:23:08,245 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:23:08,246 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 23:23:08,246 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:23:08,248 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-20 23:23:08,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-20 23:23:08,250 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:08,250 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:23:08,250 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:23:08,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1369908330, now seen corresponding path program 1 times [2018-01-20 23:23:08,250 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:08,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:08,251 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:08,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:08,252 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:08,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:08,305 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-20 23:23:08,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:23:08,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:23:08,305 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:23:08,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:23:08,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:23:08,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:23:08,306 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-01-20 23:23:08,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:08,313 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-01-20 23:23:08,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:23:08,313 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2018-01-20 23:23:08,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:08,317 INFO L225 Difference]: With dead ends: 92 [2018-01-20 23:23:08,317 INFO L226 Difference]: Without dead ends: 52 [2018-01-20 23:23:08,318 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:23:08,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-20 23:23:08,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-20 23:23:08,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-20 23:23:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-20 23:23:08,331 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 33 [2018-01-20 23:23:08,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:08,332 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-20 23:23:08,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:23:08,332 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-20 23:23:08,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-20 23:23:08,334 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:08,334 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:23:08,334 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:23:08,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1841804872, now seen corresponding path program 1 times [2018-01-20 23:23:08,334 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:08,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:08,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:08,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:08,336 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:08,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:08,467 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-20 23:23:08,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:23:08,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:23:08,467 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:23:08,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:23:08,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:23:08,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:23:08,470 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-20 23:23:08,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:08,599 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-01-20 23:23:08,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:23:08,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-20 23:23:08,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:08,601 INFO L225 Difference]: With dead ends: 86 [2018-01-20 23:23:08,601 INFO L226 Difference]: Without dead ends: 71 [2018-01-20 23:23:08,602 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:23:08,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-20 23:23:08,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2018-01-20 23:23:08,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-20 23:23:08,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-20 23:23:08,607 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 34 [2018-01-20 23:23:08,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:08,608 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-20 23:23:08,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:23:08,608 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-20 23:23:08,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-20 23:23:08,609 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:08,610 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:23:08,610 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:23:08,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1329272689, now seen corresponding path program 1 times [2018-01-20 23:23:08,610 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:08,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:08,611 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:08,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:08,611 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:08,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:08,713 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-20 23:23:08,713 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:08,714 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-20 23:23:08,714 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-01-20 23:23:08,716 INFO L201 CegarAbsIntRunner]: [0], [1], [3], [7], [10], [12], [16], [19], [49], [53], [58], [59], [64], [68], [72], [73], [74], [75], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88], [89], [90], [92], [93], [94], [95], [96], [97] [2018-01-20 23:23:08,769 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-20 23:23:08,770 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-20 23:23:10,312 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-20 23:23:10,313 INFO L268 AbstractInterpreter]: Visited 38 different actions 46 times. Merged at 7 different actions 7 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 31 variables. [2018-01-20 23:23:10,320 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-20 23:23:10,320 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:10,320 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-20 23:23:10,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:10,336 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-20 23:23:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:10,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:23:10,456 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-20 23:23:10,456 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:23:10,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:23:10,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-20 23:23:10,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 9 [2018-01-20 23:23:10,692 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:23:10,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 23:23:10,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 23:23:10,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-20 23:23:10,694 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-01-20 23:23:10,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:10,806 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2018-01-20 23:23:10,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 23:23:10,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-01-20 23:23:10,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:10,808 INFO L225 Difference]: With dead ends: 90 [2018-01-20 23:23:10,808 INFO L226 Difference]: Without dead ends: 56 [2018-01-20 23:23:10,809 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-20 23:23:10,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-20 23:23:10,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-20 23:23:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-20 23:23:10,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-01-20 23:23:10,823 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 39 [2018-01-20 23:23:10,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:10,824 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-01-20 23:23:10,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 23:23:10,824 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-01-20 23:23:10,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-20 23:23:10,825 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:10,825 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-20 23:23:10,826 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:23:10,826 INFO L82 PathProgramCache]: Analyzing trace with hash -604724168, now seen corresponding path program 1 times [2018-01-20 23:23:10,826 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:10,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:10,827 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:10,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:10,828 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:23:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:23:10,892 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:23:10,906 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:23:10,915 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:23:10,918 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:23:10,919 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:23:10,940 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:23:10,940 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:23:10,940 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:23:10,940 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:23:10,941 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:23:10,941 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:23:10,941 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:23:10,941 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 23:23:10,941 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:23:10,942 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-20 23:23:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-20 23:23:10,944 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:10,944 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:23:10,944 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 23:23:10,944 INFO L82 PathProgramCache]: Analyzing trace with hash -2039412068, now seen corresponding path program 1 times [2018-01-20 23:23:10,944 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:10,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:10,945 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:10,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:10,946 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:10,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:10,973 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-20 23:23:10,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:23:10,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:23:10,974 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:23:10,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:23:10,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:23:10,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:23:10,975 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-01-20 23:23:10,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:10,979 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-01-20 23:23:10,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:23:10,979 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-01-20 23:23:10,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:10,980 INFO L225 Difference]: With dead ends: 92 [2018-01-20 23:23:10,980 INFO L226 Difference]: Without dead ends: 50 [2018-01-20 23:23:10,981 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:23:10,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-20 23:23:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-20 23:23:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-20 23:23:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-20 23:23:10,986 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 31 [2018-01-20 23:23:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:10,986 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-20 23:23:10,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:23:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-20 23:23:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 23:23:10,988 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:23:10,988 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 23:23:10,988 INFO L82 PathProgramCache]: Analyzing trace with hash 976853310, now seen corresponding path program 1 times [2018-01-20 23:23:10,988 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:10,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:10,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:10,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:10,989 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:11,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:11,064 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-20 23:23:11,065 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:23:11,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:23:11,065 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:23:11,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:23:11,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:23:11,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:23:11,066 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-01-20 23:23:11,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:11,163 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-01-20 23:23:11,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:23:11,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-20 23:23:11,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:11,164 INFO L225 Difference]: With dead ends: 82 [2018-01-20 23:23:11,165 INFO L226 Difference]: Without dead ends: 69 [2018-01-20 23:23:11,165 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:23:11,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-20 23:23:11,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2018-01-20 23:23:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-20 23:23:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-20 23:23:11,169 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 32 [2018-01-20 23:23:11,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:11,169 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-20 23:23:11,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:23:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-20 23:23:11,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 23:23:11,170 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:11,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:23:11,171 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 23:23:11,171 INFO L82 PathProgramCache]: Analyzing trace with hash -935460395, now seen corresponding path program 1 times [2018-01-20 23:23:11,171 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:11,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:11,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:11,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:11,172 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:11,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:11,272 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-20 23:23:11,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:11,273 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-20 23:23:11,273 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-20 23:23:11,273 INFO L201 CegarAbsIntRunner]: [0], [1], [3], [7], [10], [12], [16], [19], [49], [53], [59], [64], [68], [72], [73], [74], [75], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88], [89], [91], [92], [93], [94], [96], [97] [2018-01-20 23:23:11,275 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-20 23:23:11,275 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-20 23:23:12,667 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-20 23:23:12,667 INFO L268 AbstractInterpreter]: Visited 36 different actions 44 times. Merged at 7 different actions 7 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 31 variables. [2018-01-20 23:23:12,677 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-20 23:23:12,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:23:12,678 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-20 23:23:12,686 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:12,687 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-20 23:23:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:12,719 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:23:12,738 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-20 23:23:12,738 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:23:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:23:12,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-20 23:23:12,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 9 [2018-01-20 23:23:12,887 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:23:12,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 23:23:12,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 23:23:12,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-20 23:23:12,888 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2018-01-20 23:23:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:12,977 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-01-20 23:23:12,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 23:23:12,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-01-20 23:23:12,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:12,978 INFO L225 Difference]: With dead ends: 86 [2018-01-20 23:23:12,978 INFO L226 Difference]: Without dead ends: 54 [2018-01-20 23:23:12,979 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-20 23:23:12,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-20 23:23:12,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-20 23:23:12,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-20 23:23:12,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-20 23:23:12,984 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 37 [2018-01-20 23:23:12,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:12,984 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-20 23:23:12,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 23:23:12,984 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-20 23:23:12,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-20 23:23:12,985 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:23:12,985 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] [2018-01-20 23:23:12,985 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 23:23:12,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1001745474, now seen corresponding path program 1 times [2018-01-20 23:23:12,986 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:23:12,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:12,987 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:23:12,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:23:12,987 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:23:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:23:13,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:23:13,488 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 37 DAG size of output 17 [2018-01-20 23:23:13,773 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-20 23:23:13,773 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:23:13,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-20 23:23:13,773 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:23:13,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-20 23:23:13,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-20 23:23:13,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-20 23:23:13,774 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 10 states. [2018-01-20 23:23:14,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:23:14,011 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-01-20 23:23:14,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-20 23:23:14,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-01-20 23:23:14,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:23:14,012 INFO L225 Difference]: With dead ends: 54 [2018-01-20 23:23:14,012 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:23:14,012 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-20 23:23:14,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:23:14,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:23:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:23:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:23:14,013 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-01-20 23:23:14,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:23:14,013 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:23:14,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-20 23:23:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:23:14,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:23:14,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 11:23:14 BoogieIcfgContainer [2018-01-20 23:23:14,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 23:23:14,017 INFO L168 Benchmark]: Toolchain (without parser) took 6718.93 ms. Allocated memory was 306.7 MB in the beginning and 668.5 MB in the end (delta: 361.8 MB). Free memory was 263.6 MB in the beginning and 371.7 MB in the end (delta: -108.0 MB). Peak memory consumption was 253.7 MB. Max. memory is 5.3 GB. [2018-01-20 23:23:14,018 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 306.7 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:23:14,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.79 ms. Allocated memory is still 306.7 MB. Free memory was 263.6 MB in the beginning and 253.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:23:14,018 INFO L168 Benchmark]: Boogie Preprocessor took 31.06 ms. Allocated memory is still 306.7 MB. Free memory was 253.7 MB in the beginning and 251.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:23:14,019 INFO L168 Benchmark]: RCFGBuilder took 259.99 ms. Allocated memory is still 306.7 MB. Free memory was 251.7 MB in the beginning and 230.7 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. [2018-01-20 23:23:14,019 INFO L168 Benchmark]: TraceAbstraction took 6195.60 ms. Allocated memory was 306.7 MB in the beginning and 668.5 MB in the end (delta: 361.8 MB). Free memory was 230.7 MB in the beginning and 371.7 MB in the end (delta: -140.9 MB). Peak memory consumption was 220.8 MB. Max. memory is 5.3 GB. [2018-01-20 23:23:14,021 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.17 ms. Allocated memory is still 306.7 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 224.79 ms. Allocated memory is still 306.7 MB. Free memory was 263.6 MB in the beginning and 253.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.06 ms. Allocated memory is still 306.7 MB. Free memory was 253.7 MB in the beginning and 251.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 259.99 ms. Allocated memory is still 306.7 MB. Free memory was 251.7 MB in the beginning and 230.7 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6195.60 ms. Allocated memory was 306.7 MB in the beginning and 668.5 MB in the end (delta: 361.8 MB). Free memory was 230.7 MB in the beginning and 371.7 MB in the end (delta: -140.9 MB). Peak memory consumption was 220.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 37 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 4 LocStat_NO_SUPPORTING_EQUALITIES : 652 LocStat_NO_SUPPORTING_DISEQUALITIES : 239 LocStat_NO_DISJUNCTIONS : -74 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 44 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 74 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 44 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.211786 RENAME_VARIABLES(MILLISECONDS) : 0.073781 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.154970 PROJECTAWAY(MILLISECONDS) : 0.087221 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.107285 DISJOIN(MILLISECONDS) : 0.384089 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.103035 ADD_EQUALITY(MILLISECONDS) : 0.043201 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016545 #CONJOIN_DISJUNCTIVE : 69 #RENAME_VARIABLES : 123 #UNFREEZE : 0 #CONJOIN : 131 #PROJECTAWAY : 117 #ADD_WEAK_EQUALITY : 13 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 123 #ADD_EQUALITY : 74 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 35 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 4 LocStat_NO_SUPPORTING_EQUALITIES : 643 LocStat_NO_SUPPORTING_DISEQUALITIES : 239 LocStat_NO_DISJUNCTIONS : -70 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 42 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 72 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 42 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.882940 RENAME_VARIABLES(MILLISECONDS) : 0.186257 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.806117 PROJECTAWAY(MILLISECONDS) : 0.118344 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.112495 DISJOIN(MILLISECONDS) : 0.400423 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.215314 ADD_EQUALITY(MILLISECONDS) : 0.039833 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011766 #CONJOIN_DISJUNCTIVE : 67 #RENAME_VARIABLES : 116 #UNFREEZE : 0 #CONJOIN : 125 #PROJECTAWAY : 107 #ADD_WEAK_EQUALITY : 13 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 116 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 56 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: knapsackErr0EnsuresViolation CFG has 4 procedures, 56 locations, 4 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 60 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L555] int N = __VERIFIER_nondet_int(); [L556] int M = __VERIFIER_nondet_int(); [L557] COND FALSE !(N < 1) VAL [M=0, N=1] [L560] COND TRUE M < 1 [L561] M = 1 VAL [M=1, N=1] [L563] EXPR, FCALL __builtin_alloca (N * sizeof(int)) VAL [__builtin_alloca (N * sizeof(int))={6:0}, M=1, N=1] [L563] int *size = (int*) __builtin_alloca (N * sizeof(int)); VAL [__builtin_alloca (N * sizeof(int))={6:0}, M=1, N=1, size={6:0}] [L564] EXPR, FCALL __builtin_alloca (N * sizeof(int)) VAL [__builtin_alloca (N * sizeof(int))={6:0}, __builtin_alloca (N * sizeof(int))={10:0}, M=1, N=1, size={6:0}] [L564] int *val = (int*) __builtin_alloca (N * sizeof(int)); VAL [__builtin_alloca (N * sizeof(int))={6:0}, __builtin_alloca (N * sizeof(int))={10:0}, M=1, N=1, size={6:0}, val={10:0}] [L565] EXPR, FCALL __builtin_alloca (M * sizeof(int)) VAL [__builtin_alloca (M * sizeof(int))={8:0}, __builtin_alloca (N * sizeof(int))={6:0}, __builtin_alloca (N * sizeof(int))={10:0}, M=1, N=1, size={6:0}, val={10:0}] [L565] int *cost = (int*) __builtin_alloca (M * sizeof(int)); VAL [__builtin_alloca (M * sizeof(int))={8:0}, __builtin_alloca (N * sizeof(int))={6:0}, __builtin_alloca (N * sizeof(int))={10:0}, cost={8:0}, M=1, N=1, size={6:0}, val={10:0}] [L566] EXPR, FCALL __builtin_alloca (M * sizeof(int)) VAL [__builtin_alloca (M * sizeof(int))={8:0}, __builtin_alloca (M * sizeof(int))={7:0}, __builtin_alloca (N * sizeof(int))={6:0}, __builtin_alloca (N * sizeof(int))={10:0}, cost={8:0}, M=1, N=1, size={6:0}, val={10:0}] [L566] int *best = (int*) __builtin_alloca (M * sizeof(int)); VAL [__builtin_alloca (M * sizeof(int))={8:0}, __builtin_alloca (M * sizeof(int))={7:0}, __builtin_alloca (N * sizeof(int))={6:0}, __builtin_alloca (N * sizeof(int))={10:0}, best={7:0}, cost={8:0}, M=1, N=1, size={6:0}, val={10:0}] [L567] CALL knapsack(size, val, N, cost, best, M) VAL [\old(M)=1, \old(N)=1, best={7:0}, cost={8:0}, size={6:0}, val={10:0}] [L542] int i, j; [L543] j = 1 VAL [\old(M)=1, \old(N)=1, best={7:0}, best={7:0}, cost={8:0}, cost={8:0}, j=1, M=1, N=1, size={6:0}, size={6:0}, val={10:0}, val={10:0}] [L543] COND TRUE j <= N [L544] i = 1 VAL [\old(M)=1, \old(N)=1, best={7:0}, best={7:0}, cost={8:0}, cost={8:0}, i=1, j=1, M=1, N=1, size={6:0}, size={6:0}, val={10:0}, val={10:0}] [L544] COND TRUE i <= M VAL [\old(M)=1, \old(N)=1, best={7:0}, best={7:0}, cost={8:0}, cost={8:0}, i=1, j=1, M=1, N=1, size={6:0}, size={6:0}, val={10:0}, val={10:0}] [L545] EXPR, FCALL size[j] VAL [\old(M)=1, \old(N)=1, best={7:0}, best={7:0}, cost={8:0}, cost={8:0}, i=1, j=1, M=1, N=1, size={6:0}, size={6:0}, size[j]=2, val={10:0}, val={10:0}] [L545] COND FALSE !(i >= size[j]) [L544] i++ VAL [\old(M)=1, \old(N)=1, best={7:0}, best={7:0}, cost={8:0}, cost={8:0}, i=2, j=1, M=1, N=1, size={6:0}, size={6:0}, val={10:0}, val={10:0}] [L544] COND FALSE !(i <= M) VAL [\old(M)=1, \old(N)=1, best={7:0}, best={7:0}, cost={8:0}, cost={8:0}, i=2, j=1, M=1, N=1, size={6:0}, size={6:0}, val={10:0}, val={10:0}] [L543] j++ VAL [\old(M)=1, \old(N)=1, best={7:0}, best={7:0}, cost={8:0}, cost={8:0}, i=2, j=2, M=1, N=1, size={6:0}, size={6:0}, val={10:0}, val={10:0}] [L543] COND FALSE, RET !(j <= N) VAL [\old(M)=1, \old(N)=1, best={7:0}, best={7:0}, cost={8:0}, cost={8:0}, i=2, j=2, M=1, N=1, size={6:0}, size={6:0}, val={10:0}, val={10:0}] [L567] knapsack(size, val, N, cost, best, M) VAL [__builtin_alloca (M * sizeof(int))={8:0}, __builtin_alloca (M * sizeof(int))={7:0}, __builtin_alloca (N * sizeof(int))={6:0}, __builtin_alloca (N * sizeof(int))={10:0}, best={7:0}, cost={8:0}, M=1, N=1, size={6:0}, val={10:0}] [L568] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 56 locations, 4 error locations. UNSAFE Result, 2.6s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 171 SDtfs, 112 SDslu, 230 SDs, 0 SdLazy, 88 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 179 ConstructedInterpolants, 0 QuantifiedInterpolants, 12953 SizeOfPredicates, 3 NumberOfNonLiveVariables, 153 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 2/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 554]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 56 locations, 4 error locations. SAFE Result, 3.0s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 207 SDtfs, 138 SDslu, 302 SDs, 0 SdLazy, 431 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 31626 SizeOfPredicates, 3 NumberOfNonLiveVariables, 150 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 6/10 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/knapsack_alloca_unsafe_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_23-23-14-033.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/knapsack_alloca_unsafe_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-20_23-23-14-033.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/knapsack_alloca_unsafe_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-20_23-23-14-033.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/knapsack_alloca_unsafe_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-20_23-23-14-033.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/knapsack_alloca_unsafe_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-20_23-23-14-033.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/knapsack_alloca_unsafe_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_23-23-14-033.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/knapsack_alloca_unsafe_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_23-23-14-033.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/knapsack_alloca_unsafe_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_23-23-14-033.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/knapsack_alloca_unsafe_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_23-23-14-033.csv Received shutdown request...