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_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-optional_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:53:14,367 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:53:14,369 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:53:14,382 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:53:14,382 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:53:14,383 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:53:14,384 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:53:14,386 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:53:14,388 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:53:14,389 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:53:14,390 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:53:14,390 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:53:14,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:53:14,391 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:53:14,392 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:53:14,395 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:53:14,397 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:53:14,399 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:53:14,400 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:53:14,402 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:53:14,404 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:53:14,404 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:53:14,405 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:53:14,406 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:53:14,406 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:53:14,408 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:53:14,408 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:53:14,409 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:53:14,409 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:53:14,409 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:53:14,410 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:53:14,410 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:53:14,420 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:53:14,420 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:53:14,421 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:53:14,421 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:53:14,421 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:53:14,422 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:53:14,422 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:53:14,422 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:53:14,423 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:53:14,423 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:53:14,423 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:53:14,423 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:53:14,423 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:53:14,424 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:53:14,424 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:53:14,424 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:53:14,424 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:53:14,424 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:53:14,424 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:53:14,425 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:53:14,425 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:53:14,425 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:53:14,425 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:53:14,425 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:53:14,426 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:53:14,426 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:53:14,426 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:53:14,426 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:53:14,426 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:53:14,427 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:53:14,427 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:53:14,427 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:53:14,427 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:53:14,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:53:14,427 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:53:14,428 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:53:14,428 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:53:14,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:53:14,475 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:53:14,479 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:53:14,481 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:53:14,481 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:53:14,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-23 14:53:14,664 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:53:14,670 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:53:14,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:53:14,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:53:14,676 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:53:14,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:53:14" (1/1) ... [2018-01-23 14:53:14,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@860cd99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:53:14, skipping insertion in model container [2018-01-23 14:53:14,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:53:14" (1/1) ... [2018-01-23 14:53:14,694 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:53:14,735 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:53:14,854 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:53:14,875 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:53:14,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:53:14 WrapperNode [2018-01-23 14:53:14,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:53:14,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:53:14,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:53:14,885 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:53:14,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:53:14" (1/1) ... [2018-01-23 14:53:14,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:53:14" (1/1) ... [2018-01-23 14:53:14,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:53:14" (1/1) ... [2018-01-23 14:53:14,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:53:14" (1/1) ... [2018-01-23 14:53:14,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:53:14" (1/1) ... [2018-01-23 14:53:14,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:53:14" (1/1) ... [2018-01-23 14:53:14,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:53:14" (1/1) ... [2018-01-23 14:53:14,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:53:14,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:53:14,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:53:14,927 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:53:14,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:53:14" (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-23 14:53:14,975 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:53:14,975 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:53:14,975 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:53:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:53:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:53:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:53:14,975 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:53:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:53:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:53:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:53:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:53:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:53:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:53:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-23 14:53:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:53:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:53:14,976 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:53:15,361 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:53:15,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:53:15 BoogieIcfgContainer [2018-01-23 14:53:15,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:53:15,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:53:15,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:53:15,365 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:53:15,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:53:14" (1/3) ... [2018-01-23 14:53:15,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d84a816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:53:15, skipping insertion in model container [2018-01-23 14:53:15,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:53:14" (2/3) ... [2018-01-23 14:53:15,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d84a816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:53:15, skipping insertion in model container [2018-01-23 14:53:15,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:53:15" (3/3) ... [2018-01-23 14:53:15,369 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-23 14:53:15,375 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:53:15,381 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-23 14:53:15,416 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:53:15,416 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:53:15,416 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:53:15,417 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:53:15,417 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:53:15,417 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:53:15,417 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:53:15,417 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:53:15,418 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:53:15,433 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2018-01-23 14:53:15,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:53:15,438 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:53:15,439 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:53:15,439 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:53:15,443 INFO L82 PathProgramCache]: Analyzing trace with hash 199372, now seen corresponding path program 1 times [2018-01-23 14:53:15,444 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:53:15,444 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:53:15,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:15,483 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:53:15,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:53:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:53:15,531 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:53:15,537 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:53:15,544 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:53:15,544 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:53:15,544 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:53:15,544 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:53:15,545 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:53:15,545 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:53:15,545 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:53:15,545 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:53:15,545 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:53:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2018-01-23 14:53:15,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-23 14:53:15,550 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:53:15,550 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] [2018-01-23 14:53:15,551 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:53:15,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2056818696, now seen corresponding path program 1 times [2018-01-23 14:53:15,551 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:53:15,551 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:53:15,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:15,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:53:15,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:53:15,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:53:15,732 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-23 14:53:15,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:53:15,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:53:15,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:53:15,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:53:15,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:53:15,753 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 2 states. [2018-01-23 14:53:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:53:15,779 INFO L93 Difference]: Finished difference Result 128 states and 154 transitions. [2018-01-23 14:53:15,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:53:15,780 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-23 14:53:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:53:15,789 INFO L225 Difference]: With dead ends: 128 [2018-01-23 14:53:15,789 INFO L226 Difference]: Without dead ends: 85 [2018-01-23 14:53:15,792 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-23 14:53:15,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-23 14:53:15,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-23 14:53:15,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-23 14:53:15,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-01-23 14:53:15,832 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 24 [2018-01-23 14:53:15,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:53:15,833 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-01-23 14:53:15,833 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:53:15,833 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-01-23 14:53:15,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-23 14:53:15,834 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:53:15,834 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] [2018-01-23 14:53:15,834 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:53:15,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1534244515, now seen corresponding path program 1 times [2018-01-23 14:53:15,835 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:53:15,835 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:53:15,836 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:15,836 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:53:15,836 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:53:15,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:53:15,931 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-23 14:53:15,931 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:53:15,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:53:15,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:53:15,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:53:15,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:53:15,933 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 5 states. [2018-01-23 14:53:16,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:53:16,130 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2018-01-23 14:53:16,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:53:16,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-23 14:53:16,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:53:16,135 INFO L225 Difference]: With dead ends: 148 [2018-01-23 14:53:16,135 INFO L226 Difference]: Without dead ends: 132 [2018-01-23 14:53:16,136 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:53:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-23 14:53:16,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 89. [2018-01-23 14:53:16,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-23 14:53:16,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-01-23 14:53:16,147 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 28 [2018-01-23 14:53:16,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:53:16,147 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-01-23 14:53:16,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:53:16,147 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-01-23 14:53:16,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-23 14:53:16,149 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:53:16,149 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, 1, 1, 1, 1, 1] [2018-01-23 14:53:16,149 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:53:16,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1052367185, now seen corresponding path program 1 times [2018-01-23 14:53:16,150 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:53:16,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:53:16,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:16,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:53:16,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:53:16,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:53:16,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:53:16,244 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:53:16,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:53:16,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:53:16,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:53:16,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:53:16,246 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 5 states. [2018-01-23 14:53:16,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:53:16,294 INFO L93 Difference]: Finished difference Result 140 states and 158 transitions. [2018-01-23 14:53:16,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-23 14:53:16,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-01-23 14:53:16,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:53:16,295 INFO L225 Difference]: With dead ends: 140 [2018-01-23 14:53:16,296 INFO L226 Difference]: Without dead ends: 101 [2018-01-23 14:53:16,296 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-23 14:53:16,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-23 14:53:16,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2018-01-23 14:53:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-23 14:53:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-01-23 14:53:16,303 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 49 [2018-01-23 14:53:16,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:53:16,303 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-01-23 14:53:16,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:53:16,303 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-01-23 14:53:16,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-23 14:53:16,304 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:53:16,304 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:53:16,304 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:53:16,305 INFO L82 PathProgramCache]: Analyzing trace with hash -280906860, now seen corresponding path program 1 times [2018-01-23 14:53:16,305 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:53:16,305 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:53:16,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:16,306 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:53:16,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:53:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:53:16,370 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:53:16,378 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:53:16,385 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:53:16,386 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:53:16,398 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:53:16,398 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:53:16,398 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:53:16,398 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:53:16,398 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:53:16,398 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:53:16,398 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:53:16,398 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:53:16,398 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:53:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2018-01-23 14:53:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-23 14:53:16,400 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:53:16,401 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-23 14:53:16,401 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:53:16,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1857075517, now seen corresponding path program 1 times [2018-01-23 14:53:16,401 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:53:16,401 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:53:16,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:16,402 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:53:16,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:53:16,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:53:16,426 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-23 14:53:16,426 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:53:16,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:53:16,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:53:16,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:53:16,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:53:16,427 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 2 states. [2018-01-23 14:53:16,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:53:16,432 INFO L93 Difference]: Finished difference Result 128 states and 154 transitions. [2018-01-23 14:53:16,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:53:16,432 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-01-23 14:53:16,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:53:16,433 INFO L225 Difference]: With dead ends: 128 [2018-01-23 14:53:16,433 INFO L226 Difference]: Without dead ends: 83 [2018-01-23 14:53:16,434 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-23 14:53:16,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-23 14:53:16,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-23 14:53:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-23 14:53:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-01-23 14:53:16,440 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 22 [2018-01-23 14:53:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:53:16,441 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-01-23 14:53:16,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:53:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-01-23 14:53:16,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-23 14:53:16,442 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:53:16,442 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] [2018-01-23 14:53:16,442 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:53:16,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1003988962, now seen corresponding path program 1 times [2018-01-23 14:53:16,443 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:53:16,443 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:53:16,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:16,444 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:53:16,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:53:16,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:53:16,494 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-23 14:53:16,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:53:16,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:53:16,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:53:16,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:53:16,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:53:16,495 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 5 states. [2018-01-23 14:53:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:53:16,730 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2018-01-23 14:53:16,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:53:16,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-23 14:53:16,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:53:16,732 INFO L225 Difference]: With dead ends: 144 [2018-01-23 14:53:16,732 INFO L226 Difference]: Without dead ends: 130 [2018-01-23 14:53:16,733 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:53:16,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-23 14:53:16,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 87. [2018-01-23 14:53:16,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-23 14:53:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-01-23 14:53:16,743 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 26 [2018-01-23 14:53:16,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:53:16,743 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-01-23 14:53:16,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:53:16,743 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-01-23 14:53:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-23 14:53:16,744 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:53:16,744 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, 1, 1, 1] [2018-01-23 14:53:16,744 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:53:16,745 INFO L82 PathProgramCache]: Analyzing trace with hash 68134102, now seen corresponding path program 1 times [2018-01-23 14:53:16,745 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:53:16,745 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:53:16,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:16,746 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:53:16,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:53:16,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:53:16,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:53:16,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:53:16,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:53:16,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:53:16,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:53:16,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:53:16,828 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 5 states. [2018-01-23 14:53:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:53:16,897 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2018-01-23 14:53:16,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-23 14:53:16,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-01-23 14:53:16,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:53:16,898 INFO L225 Difference]: With dead ends: 136 [2018-01-23 14:53:16,899 INFO L226 Difference]: Without dead ends: 99 [2018-01-23 14:53:16,899 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-23 14:53:16,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-23 14:53:16,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2018-01-23 14:53:16,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-23 14:53:16,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2018-01-23 14:53:16,906 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 47 [2018-01-23 14:53:16,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:53:16,906 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-01-23 14:53:16,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:53:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-01-23 14:53:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-23 14:53:16,907 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:53:16,908 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, 1, 1, 1, 1, 1] [2018-01-23 14:53:16,908 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:53:16,908 INFO L82 PathProgramCache]: Analyzing trace with hash -2109787175, now seen corresponding path program 1 times [2018-01-23 14:53:16,908 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:53:16,908 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:53:16,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:16,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:53:16,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:53:16,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:53:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:53:17,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:53:17,167 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-23 14:53:17,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:53:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:53:17,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:53:17,392 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~head~5.base Int)) (and (= (store |c_old(#valid)| main_~head~5.base 0) |c_#valid|) (not (= 0 main_~head~5.base)) (= 0 (select |c_old(#valid)| main_~head~5.base)))) is different from true [2018-01-23 14:53:17,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-01-23 14:53:17,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:53:17,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-01-23 14:53:17,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-23 14:53:17,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-23 14:53:17,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=73, Unknown=1, NotChecked=16, Total=110 [2018-01-23 14:53:17,436 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 11 states. [2018-01-23 14:53:18,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:53:18,113 INFO L93 Difference]: Finished difference Result 169 states and 189 transitions. [2018-01-23 14:53:18,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-23 14:53:18,114 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-01-23 14:53:18,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:53:18,115 INFO L225 Difference]: With dead ends: 169 [2018-01-23 14:53:18,116 INFO L226 Difference]: Without dead ends: 166 [2018-01-23 14:53:18,117 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=160, Unknown=1, NotChecked=26, Total=240 [2018-01-23 14:53:18,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-23 14:53:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 131. [2018-01-23 14:53:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-23 14:53:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2018-01-23 14:53:18,130 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 49 [2018-01-23 14:53:18,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:53:18,130 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2018-01-23 14:53:18,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-23 14:53:18,130 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2018-01-23 14:53:18,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-23 14:53:18,132 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:53:18,132 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:53:18,132 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-23 14:53:18,133 INFO L82 PathProgramCache]: Analyzing trace with hash 726223231, now seen corresponding path program 1 times [2018-01-23 14:53:18,133 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:53:18,133 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:53:18,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:18,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:53:18,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:53:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:53:18,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:53:18,273 ERROR L119 erpolLogProxyWrapper]: Interpolant 36 not inductive: (Check returned sat) [2018-01-23 14:53:18,278 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1003) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-23 14:53:18,281 INFO L168 Benchmark]: Toolchain (without parser) took 3616.32 ms. Allocated memory was 302.0 MB in the beginning and 481.3 MB in the end (delta: 179.3 MB). Free memory was 260.3 MB in the beginning and 316.3 MB in the end (delta: -55.9 MB). Peak memory consumption was 123.4 MB. Max. memory is 5.3 GB. [2018-01-23 14:53:18,283 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 302.0 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:53:18,283 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.83 ms. Allocated memory is still 302.0 MB. Free memory was 259.3 MB in the beginning and 247.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:53:18,283 INFO L168 Benchmark]: Boogie Preprocessor took 41.63 ms. Allocated memory is still 302.0 MB. Free memory was 247.3 MB in the beginning and 245.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:53:18,284 INFO L168 Benchmark]: RCFGBuilder took 435.84 ms. Allocated memory is still 302.0 MB. Free memory was 245.3 MB in the beginning and 217.7 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 5.3 GB. [2018-01-23 14:53:18,284 INFO L168 Benchmark]: TraceAbstraction took 2916.86 ms. Allocated memory was 302.0 MB in the beginning and 481.3 MB in the end (delta: 179.3 MB). Free memory was 217.7 MB in the beginning and 316.3 MB in the end (delta: -98.5 MB). Peak memory consumption was 80.8 MB. Max. memory is 5.3 GB. [2018-01-23 14:53:18,286 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.21 ms. Allocated memory is still 302.0 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 213.83 ms. Allocated memory is still 302.0 MB. Free memory was 259.3 MB in the beginning and 247.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.63 ms. Allocated memory is still 302.0 MB. Free memory was 247.3 MB in the beginning and 245.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 435.84 ms. Allocated memory is still 302.0 MB. Free memory was 245.3 MB in the beginning and 217.7 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2916.86 ms. Allocated memory was 302.0 MB in the beginning and 481.3 MB in the end (delta: 179.3 MB). Free memory was 217.7 MB in the beginning and 316.3 MB in the end (delta: -98.5 MB). Peak memory consumption was 80.8 MB. Max. memory is 5.3 GB. * 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) * 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 3 procedures, 88 locations, 3 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=88occurred 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 - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L986] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={21:0}] [L986] SLL* head = malloc(sizeof(SLL)); VAL [head={21:0}, malloc(sizeof(SLL))={21:0}] [L987] FCALL head->next = ((void*)0) VAL [head={21:0}, malloc(sizeof(SLL))={21:0}] [L988] FCALL head->prev = ((void*)0) VAL [head={21:0}, malloc(sizeof(SLL))={21:0}] [L989] COND FALSE !(__VERIFIER_nondet_int()) [L989] COND TRUE __VERIFIER_nondet_int() [L989] FCALL head->data = 1 VAL [head={21:0}, malloc(sizeof(SLL))={21:0}] [L989] FCALL head->opt = head VAL [head={21:0}, malloc(sizeof(SLL))={21:0}] [L990] SLL* x = head; VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}] [L992] COND FALSE !(__VERIFIER_nondet_int()) [L995] x = head VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}] [L996] COND TRUE x != ((void*)0) VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}] [L998] EXPR, FCALL x->data VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}, x->data=1] [L998] EXPR x->data == 2 && x->opt != x VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}, x->data=1, x->data == 2 && x->opt != x=0] [L998] EXPR x->data == 2 && x->opt != x && x->opt->next == ((void*)0) VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}, x->data=1, x->data == 2 && x->opt != x=0, x->data == 2 && x->opt != x && x->opt->next == ((void*)0)=0] [L998] EXPR (x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x VAL [(x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x=0, head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}, x->data=1, x->data == 2 && x->opt != x=0, x->data == 2 && x->opt != x && x->opt->next == ((void*)0)=0] [L998] EXPR, FCALL x->opt VAL [(x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x=0, head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}, x->data=1, x->data == 2 && x->opt != x=0, x->data == 2 && x->opt != x && x->opt->next == ((void*)0)=0, x->opt={21:0}] [L998] EXPR (x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x VAL [(x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x=1, head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}, x->data=1, x->data == 2 && x->opt != x=0, x->data == 2 && x->opt != x && x->opt->next == ((void*)0)=0, x->opt={21:0}] [L998] COND FALSE !(!((x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x)) [L998] COND FALSE !(0) VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}] [L999] EXPR, FCALL x->next VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}, x->next={0:0}] [L999] x = x->next [L996] COND FALSE !(x != ((void*)0)) VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={0:0}] [L1002] x = head VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}] [L1004] COND TRUE x != ((void*)0) [L1006] head = x VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}] [L1007] EXPR, FCALL x->next VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}, x->next={0:0}] [L1007] x = x->next [L1008] EXPR, FCALL head->data VAL [head={21:0}, head->data=1, malloc(sizeof(SLL))={21:0}, x={0:0}] [L1008] COND FALSE !(head->data == 2) [L1010] FCALL free(head) VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={0:0}] [L1004] COND FALSE !(x != ((void*)0)) VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={0:0}] [L1013] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 88 locations, 3 error locations. UNSAFE Result, 0.8s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 254 SDtfs, 297 SDslu, 340 SDs, 0 SdLazy, 96 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=3, 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, 3 MinimizatonAttempts, 51 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 4969 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1003) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-optional_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-53-18-295.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-optional_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-53-18-295.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-optional_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-53-18-295.csv Received shutdown request...