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_imprecise.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 01:01:31,883 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 01:01:31,885 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 01:01:31,900 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 01:01:31,901 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 01:01:31,902 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 01:01:31,903 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 01:01:31,905 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 01:01:31,907 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 01:01:31,908 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 01:01:31,909 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 01:01:31,909 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 01:01:31,910 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 01:01:31,911 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 01:01:31,912 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 01:01:31,915 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 01:01:31,917 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 01:01:31,919 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 01:01:31,920 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 01:01:31,922 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 01:01:31,924 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 01:01:31,925 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 01:01:31,925 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 01:01:31,926 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 01:01:31,927 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 01:01:31,928 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 01:01:31,928 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 01:01:31,929 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 01:01:31,929 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 01:01:31,929 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 01:01:31,930 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 01:01:31,930 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_imprecise.epf [2018-01-21 01:01:31,939 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 01:01:31,939 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 01:01:31,940 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 01:01:31,940 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 01:01:31,940 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 01:01:31,940 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 01:01:31,940 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 01:01:31,940 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 01:01:31,941 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 01:01:31,941 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 01:01:31,941 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 01:01:31,941 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 01:01:31,941 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 01:01:31,941 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 01:01:31,942 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 01:01:31,942 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 01:01:31,942 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 01:01:31,942 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 01:01:31,942 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 01:01:31,942 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 01:01:31,942 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 01:01:31,942 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 01:01:31,943 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 01:01:31,943 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 01:01:31,943 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 01:01:31,943 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 01:01:31,943 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 01:01:31,944 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 01:01:31,944 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 01:01:31,944 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 01:01:31,944 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 01:01:31,944 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 01:01:31,944 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 01:01:31,944 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 01:01:31,944 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 01:01:31,945 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 01:01:31,945 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 01:01:31,945 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 01:01:31,945 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 01:01:31,977 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 01:01:31,988 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 01:01:31,992 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 01:01:31,993 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 01:01:31,993 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 01:01:31,994 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:01:32,160 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 01:01:32,164 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 01:01:32,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 01:01:32,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 01:01:32,170 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 01:01:32,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:01:32" (1/1) ... [2018-01-21 01:01:32,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c1589c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:32, skipping insertion in model container [2018-01-21 01:01:32,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:01:32" (1/1) ... [2018-01-21 01:01:32,188 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:01:32,229 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:01:32,358 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:01:32,385 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:01:32,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:32 WrapperNode [2018-01-21 01:01:32,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 01:01:32,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 01:01:32,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 01:01:32,396 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 01:01:32,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:32" (1/1) ... [2018-01-21 01:01:32,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:32" (1/1) ... [2018-01-21 01:01:32,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:32" (1/1) ... [2018-01-21 01:01:32,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:32" (1/1) ... [2018-01-21 01:01:32,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:32" (1/1) ... [2018-01-21 01:01:32,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:32" (1/1) ... [2018-01-21 01:01:32,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:32" (1/1) ... [2018-01-21 01:01:32,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 01:01:32,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 01:01:32,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 01:01:32,439 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 01:01:32,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:32" (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-21 01:01:32,490 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 01:01:32,490 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 01:01:32,490 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 01:01:32,491 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 01:01:32,491 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 01:01:32,491 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 01:01:32,491 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 01:01:32,491 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 01:01:32,492 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 01:01:32,492 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 01:01:32,492 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 01:01:32,492 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 01:01:32,492 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 01:01:32,492 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 01:01:32,493 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 01:01:32,937 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 01:01:32,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:01:32 BoogieIcfgContainer [2018-01-21 01:01:32,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 01:01:32,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 01:01:32,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 01:01:32,940 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 01:01:32,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 01:01:32" (1/3) ... [2018-01-21 01:01:32,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9d7237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:01:32, skipping insertion in model container [2018-01-21 01:01:32,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:01:32" (2/3) ... [2018-01-21 01:01:32,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9d7237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:01:32, skipping insertion in model container [2018-01-21 01:01:32,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:01:32" (3/3) ... [2018-01-21 01:01:32,943 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-01_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:01:32,949 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 01:01:32,955 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 01:01:33,006 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:01:33,007 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:01:33,007 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:01:33,007 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:01:33,007 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:01:33,007 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:01:33,007 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:01:33,008 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 01:01:33,008 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:01:33,031 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-01-21 01:01:33,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 01:01:33,036 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:33,037 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 01:01:33,038 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 01:01:33,042 INFO L82 PathProgramCache]: Analyzing trace with hash 396895, now seen corresponding path program 1 times [2018-01-21 01:01:33,044 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:33,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:33,084 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:33,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:33,085 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:01:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:01:33,136 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:01:33,142 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:01:33,150 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:01:33,151 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:01:33,151 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:01:33,151 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:01:33,151 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:01:33,151 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:01:33,152 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:01:33,152 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 01:01:33,152 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:01:33,156 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-01-21 01:01:33,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 01:01:33,159 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:33,159 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-21 01:01:33,159 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:01:33,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1539010196, now seen corresponding path program 1 times [2018-01-21 01:01:33,160 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:33,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:33,161 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:33,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:33,161 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:33,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:01:33,221 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-21 01:01:33,223 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:01:33,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:01:33,224 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:01:33,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:01:33,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:01:33,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:01:33,330 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 2 states. [2018-01-21 01:01:33,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:01:33,361 INFO L93 Difference]: Finished difference Result 244 states and 348 transitions. [2018-01-21 01:01:33,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:01:33,362 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-21 01:01:33,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:01:33,374 INFO L225 Difference]: With dead ends: 244 [2018-01-21 01:01:33,374 INFO L226 Difference]: Without dead ends: 124 [2018-01-21 01:01:33,377 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-21 01:01:33,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-21 01:01:33,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-01-21 01:01:33,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-21 01:01:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2018-01-21 01:01:33,413 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 24 [2018-01-21 01:01:33,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:01:33,413 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2018-01-21 01:01:33,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:01:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2018-01-21 01:01:33,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 01:01:33,415 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:33,415 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:01:33,415 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:01:33,415 INFO L82 PathProgramCache]: Analyzing trace with hash 849242386, now seen corresponding path program 1 times [2018-01-21 01:01:33,415 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:33,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:33,416 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:33,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:33,416 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:33,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:01:33,603 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-21 01:01:33,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:01:33,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:01:33,603 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:01:33,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:01:33,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:01:33,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:01:33,606 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand 5 states. [2018-01-21 01:01:33,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:01:33,897 INFO L93 Difference]: Finished difference Result 287 states and 310 transitions. [2018-01-21 01:01:33,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 01:01:33,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-21 01:01:33,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:01:33,902 INFO L225 Difference]: With dead ends: 287 [2018-01-21 01:01:33,902 INFO L226 Difference]: Without dead ends: 192 [2018-01-21 01:01:33,903 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 01:01:33,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-21 01:01:33,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 128. [2018-01-21 01:01:33,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-21 01:01:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-01-21 01:01:33,912 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 37 [2018-01-21 01:01:33,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:01:33,912 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-01-21 01:01:33,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:01:33,912 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-01-21 01:01:33,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-21 01:01:33,913 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:33,913 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:01:33,913 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:01:33,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1513386891, now seen corresponding path program 1 times [2018-01-21 01:01:33,914 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:33,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:33,914 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:33,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:33,915 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:33,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:01:33,979 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-21 01:01:33,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:01:33,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:01:33,980 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:01:33,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:01:33,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:01:33,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:01:33,981 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 5 states. [2018-01-21 01:01:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:01:34,119 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2018-01-21 01:01:34,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:01:34,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-01-21 01:01:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:01:34,122 INFO L225 Difference]: With dead ends: 213 [2018-01-21 01:01:34,123 INFO L226 Difference]: Without dead ends: 186 [2018-01-21 01:01:34,123 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-21 01:01:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-21 01:01:34,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 132. [2018-01-21 01:01:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-21 01:01:34,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2018-01-21 01:01:34,137 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 39 [2018-01-21 01:01:34,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:01:34,137 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2018-01-21 01:01:34,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:01:34,137 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2018-01-21 01:01:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-21 01:01:34,140 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:34,140 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:01:34,140 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:01:34,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1547435689, now seen corresponding path program 1 times [2018-01-21 01:01:34,141 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:34,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:34,142 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:34,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:34,142 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:01:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:01:34,203 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:01:34,215 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:01:34,226 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:01:34,226 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:01:34,245 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:01:34,245 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:01:34,245 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:01:34,246 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:01:34,246 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:01:34,246 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:01:34,246 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:01:34,246 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 01:01:34,246 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:01:34,248 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-01-21 01:01:34,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 01:01:34,250 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:34,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] [2018-01-21 01:01:34,250 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 01:01:34,250 INFO L82 PathProgramCache]: Analyzing trace with hash 565995656, now seen corresponding path program 1 times [2018-01-21 01:01:34,251 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:34,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:34,252 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:34,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:34,252 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:34,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:01:34,268 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-21 01:01:34,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:01:34,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:01:34,269 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:01:34,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:01:34,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:01:34,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:01:34,270 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 2 states. [2018-01-21 01:01:34,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:01:34,275 INFO L93 Difference]: Finished difference Result 244 states and 348 transitions. [2018-01-21 01:01:34,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:01:34,275 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-01-21 01:01:34,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:01:34,276 INFO L225 Difference]: With dead ends: 244 [2018-01-21 01:01:34,276 INFO L226 Difference]: Without dead ends: 122 [2018-01-21 01:01:34,277 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-21 01:01:34,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-21 01:01:34,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-01-21 01:01:34,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-21 01:01:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-01-21 01:01:34,286 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 22 [2018-01-21 01:01:34,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:01:34,286 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-01-21 01:01:34,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:01:34,287 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-01-21 01:01:34,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 01:01:34,288 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:34,288 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:01:34,288 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 01:01:34,288 INFO L82 PathProgramCache]: Analyzing trace with hash -673975890, now seen corresponding path program 1 times [2018-01-21 01:01:34,288 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:34,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:34,289 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:34,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:34,289 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:34,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:01:34,405 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-21 01:01:34,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:01:34,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:01:34,405 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:01:34,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:01:34,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:01:34,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:01:34,406 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 5 states. [2018-01-21 01:01:34,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:01:34,557 INFO L93 Difference]: Finished difference Result 283 states and 305 transitions. [2018-01-21 01:01:34,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 01:01:34,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-01-21 01:01:34,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:01:34,559 INFO L225 Difference]: With dead ends: 283 [2018-01-21 01:01:34,559 INFO L226 Difference]: Without dead ends: 190 [2018-01-21 01:01:34,560 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-21 01:01:34,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-21 01:01:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 126. [2018-01-21 01:01:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-21 01:01:34,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-01-21 01:01:34,571 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 35 [2018-01-21 01:01:34,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:01:34,572 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-01-21 01:01:34,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:01:34,572 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-01-21 01:01:34,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 01:01:34,574 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:34,574 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:01:34,574 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 01:01:34,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1839763921, now seen corresponding path program 1 times [2018-01-21 01:01:34,575 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:34,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:34,576 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:34,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:34,576 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:34,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:01:34,629 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-21 01:01:34,629 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:01:34,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:01:34,635 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:01:34,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:01:34,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:01:34,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:01:34,636 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 5 states. [2018-01-21 01:01:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:01:34,776 INFO L93 Difference]: Finished difference Result 209 states and 225 transitions. [2018-01-21 01:01:34,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:01:34,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-21 01:01:34,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:01:34,779 INFO L225 Difference]: With dead ends: 209 [2018-01-21 01:01:34,779 INFO L226 Difference]: Without dead ends: 184 [2018-01-21 01:01:34,779 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-21 01:01:34,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-21 01:01:34,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 130. [2018-01-21 01:01:34,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-21 01:01:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2018-01-21 01:01:34,789 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 37 [2018-01-21 01:01:34,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:01:34,790 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2018-01-21 01:01:34,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:01:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2018-01-21 01:01:34,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-21 01:01:34,791 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:34,792 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, 1, 1, 1, 1, 1] [2018-01-21 01:01:34,792 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 01:01:34,792 INFO L82 PathProgramCache]: Analyzing trace with hash 171442437, now seen corresponding path program 1 times [2018-01-21 01:01:34,792 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:34,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:34,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:34,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:34,794 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:34,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:01:34,958 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-21 01:01:34,959 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:01:34,959 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:01:34,960 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-01-21 01:01:34,962 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [8], [9], [10], [14], [19], [23], [29], [32], [33], [47], [48], [49], [54], [55], [56], [62], [66], [72], [76], [78], [81], [173], [177], [182], [186], [194], [198], [200], [201], [202], [206], [210], [279], [284], [288], [294], [295], [301], [305], [307], [308], [309], [370], [372], [373], [374], [375], [379], [381], [382], [383], [384] [2018-01-21 01:01:35,015 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:01:35,015 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:01:35,350 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:399) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:214) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:296) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.term(DiffWrapperScript.java:286) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.CongruenceClosureSmtUtils.lambda$1(CongruenceClosureSmtUtils.java:29) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.Iterator.forEachRemaining(Iterator.java:116) at java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.CongruenceClosureSmtUtils.congruenceClosureToCube(CongruenceClosureSmtUtils.java:30) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCcManager.weqCcToTerm(WeqCcManager.java:935) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqConstraint.getTerm(EqConstraint.java:185) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqDisjunctiveConstraint.lambda$2(EqDisjunctiveConstraint.java:121) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1548) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqDisjunctiveConstraint.getTerm(EqDisjunctiveConstraint.java:121) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPredicate.(EqPredicate.java:64) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqStateFactory.stateToPredicate(EqStateFactory.java:112) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqState.toEqPredicate(EqState.java:224) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPostOperator.apply(EqPostOperator.java:121) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPostOperator.apply(EqPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$16(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:443) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:148) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:388) ... 21 more [2018-01-21 01:01:35,354 INFO L168 Benchmark]: Toolchain (without parser) took 3193.52 ms. Allocated memory was 296.2 MB in the beginning and 467.7 MB in the end (delta: 171.4 MB). Free memory was 254.5 MB in the beginning and 304.7 MB in the end (delta: -50.2 MB). Peak memory consumption was 121.2 MB. Max. memory is 5.3 GB. [2018-01-21 01:01:35,356 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 296.2 MB. Free memory is still 260.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 01:01:35,356 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.45 ms. Allocated memory is still 296.2 MB. Free memory was 253.5 MB in the beginning and 241.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-21 01:01:35,357 INFO L168 Benchmark]: Boogie Preprocessor took 42.01 ms. Allocated memory is still 296.2 MB. Free memory was 241.4 MB in the beginning and 238.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:01:35,357 INFO L168 Benchmark]: RCFGBuilder took 499.45 ms. Allocated memory is still 296.2 MB. Free memory was 238.4 MB in the beginning and 205.9 MB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 5.3 GB. [2018-01-21 01:01:35,357 INFO L168 Benchmark]: TraceAbstraction took 2414.80 ms. Allocated memory was 296.2 MB in the beginning and 467.7 MB in the end (delta: 171.4 MB). Free memory was 205.9 MB in the beginning and 304.7 MB in the end (delta: -98.8 MB). Peak memory consumption was 72.6 MB. Max. memory is 5.3 GB. [2018-01-21 01:01:35,358 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.13 ms. Allocated memory is still 296.2 MB. Free memory is still 260.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 230.45 ms. Allocated memory is still 296.2 MB. Free memory was 253.5 MB in the beginning and 241.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.01 ms. Allocated memory is still 296.2 MB. Free memory was 241.4 MB in the beginning and 238.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 499.45 ms. Allocated memory is still 296.2 MB. Free memory was 238.4 MB in the beginning and 205.9 MB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2414.80 ms. Allocated memory was 296.2 MB in the beginning and 467.7 MB in the end (delta: 171.4 MB). Free memory was 205.9 MB in the beginning and 304.7 MB in the end (delta: -98.8 MB). Peak memory consumption was 72.6 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, 127 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=127occurred 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: [L992] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={14:0}] [L992] SLL* list = malloc(sizeof(SLL)); VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L993] FCALL list->next = ((void*)0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L994] FCALL list->prev = ((void*)0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(!(list != ((void*)0))) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND TRUE __VERIFIER_nondet_int() [L995] FCALL list->inner = ((void*)0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] EXPR, FCALL list->inner VAL [list={14:0}, list->inner={0:0}, malloc(sizeof(SLL))={14:0}] [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={14:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=0, malloc(sizeof(SLL))={14:0}] [L995] EXPR, FCALL list->inner VAL [list={14:0}, list->inner={0:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=0, malloc(sizeof(SLL))={14:0}] [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={14:0}, list->inner={0:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] COND FALSE !(0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L997] SLL* end = list; VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1011] end = ((void*)0) [L1012] end = list VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1015] COND FALSE !(!(((void*)0) != end)) VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1015] COND FALSE !(0) VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1017] COND TRUE ((void*)0) != end [L1019] int len = 0; VAL [end={14:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1020] EXPR, FCALL end->inner VAL [end={14:0}, end->inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1020] SLL* inner = end->inner; [L1021] COND FALSE !(((void*)0) != inner) VAL [end={14:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1032] COND FALSE !(!(len <= 1)) VAL [end={14:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1032] COND FALSE !(0) VAL [end={14:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1034] EXPR, FCALL end->next VAL [end={14:0}, end->next={0:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1034] end = end->next [L1017] COND FALSE !(((void*)0) != end) VAL [end={0:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1038] COND TRUE ((void*)0) != list VAL [end={0:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1040] EXPR, FCALL list->inner VAL [end={0:0}, inner={0:0}, len=0, list={14:0}, list->inner={0:0}, malloc(sizeof(SLL))={14:0}] [L1040] end = list->inner [L1042] COND FALSE !(((void*)0) != end) VAL [end={0:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1050] EXPR, FCALL list->next VAL [end={0:0}, inner={0:0}, len=0, list={14:0}, list->next={0:0}, malloc(sizeof(SLL))={14:0}] [L1050] end = list->next [L1051] FCALL free(list) VAL [end={0:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1052] list = end VAL [end={0:0}, inner={0:0}, len=0, list={0:0}, malloc(sizeof(SLL))={14:0}] [L1038] COND FALSE !(((void*)0) != list) VAL [end={0:0}, inner={0:0}, len=0, list={0:0}, malloc(sizeof(SLL))={14:0}] [L1055] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 127 locations, 3 error locations. UNSAFE Result, 1.0s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 357 SDtfs, 432 SDslu, 434 SDs, 0 SdLazy, 175 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred 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, 118 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 7895 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:399) 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-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_01-01-35-367.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_01-01-35-367.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_01-01-35-367.csv Received shutdown request...