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_smtcomp.epf -i ../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 10:17:33,901 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 10:17:33,902 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 10:17:33,918 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 10:17:33,918 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 10:17:33,919 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 10:17:33,920 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 10:17:33,922 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 10:17:33,924 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 10:17:33,925 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 10:17:33,926 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 10:17:33,926 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 10:17:33,927 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 10:17:33,928 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 10:17:33,929 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 10:17:33,932 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 10:17:33,934 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 10:17:33,936 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 10:17:33,937 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 10:17:33,938 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 10:17:33,941 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 10:17:33,941 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 10:17:33,941 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 10:17:33,942 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 10:17:33,943 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 10:17:33,944 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 10:17:33,944 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 10:17:33,945 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 10:17:33,945 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 10:17:33,945 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 10:17:33,946 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 10:17:33,946 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_smtcomp.epf [2018-01-21 10:17:33,954 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 10:17:33,955 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 10:17:33,955 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 10:17:33,956 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 10:17:33,956 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 10:17:33,956 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 10:17:33,956 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 10:17:33,956 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 10:17:33,956 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 10:17:33,957 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 10:17:33,957 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 10:17:33,957 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 10:17:33,957 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 10:17:33,957 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 10:17:33,957 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 10:17:33,957 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 10:17:33,957 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 10:17:33,958 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 10:17:33,958 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 10:17:33,958 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 10:17:33,958 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 10:17:33,958 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 10:17:33,958 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 10:17:33,958 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 10:17:33,959 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 10:17:33,959 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 10:17:33,959 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:17:33,959 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 10:17:33,959 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 10:17:33,959 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 10:17:33,959 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 10:17:33,960 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 10:17:33,960 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 10:17:33,960 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 10:17:33,960 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 10:17:33,960 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 10:17:33,960 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 10:17:33,961 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 10:17:33,961 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 10:17:33,993 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 10:17:34,003 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 10:17:34,007 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 10:17:34,008 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 10:17:34,008 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 10:17:34,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i [2018-01-21 10:17:34,227 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 10:17:34,233 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 10:17:34,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 10:17:34,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 10:17:34,241 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 10:17:34,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:17:34" (1/1) ... [2018-01-21 10:17:34,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ef8971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:17:34, skipping insertion in model container [2018-01-21 10:17:34,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:17:34" (1/1) ... [2018-01-21 10:17:34,264 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:17:34,303 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:17:34,417 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:17:34,432 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:17:34,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:17:34 WrapperNode [2018-01-21 10:17:34,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 10:17:34,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 10:17:34,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 10:17:34,441 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 10:17:34,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:17:34" (1/1) ... [2018-01-21 10:17:34,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:17:34" (1/1) ... [2018-01-21 10:17:34,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:17:34" (1/1) ... [2018-01-21 10:17:34,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:17:34" (1/1) ... [2018-01-21 10:17:34,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:17:34" (1/1) ... [2018-01-21 10:17:34,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:17:34" (1/1) ... [2018-01-21 10:17:34,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:17:34" (1/1) ... [2018-01-21 10:17:34,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 10:17:34,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 10:17:34,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 10:17:34,478 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 10:17:34,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:17:34" (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 10:17:34,525 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 10:17:34,525 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 10:17:34,525 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 10:17:34,525 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 10:17:34,526 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 10:17:34,526 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 10:17:34,526 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 10:17:34,526 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 10:17:34,526 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 10:17:34,526 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 10:17:34,526 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 10:17:34,526 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 10:17:34,526 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 10:17:34,526 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 10:17:34,720 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 10:17:34,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:17:34 BoogieIcfgContainer [2018-01-21 10:17:34,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 10:17:34,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 10:17:34,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 10:17:34,723 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 10:17:34,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 10:17:34" (1/3) ... [2018-01-21 10:17:34,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9cdf2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:17:34, skipping insertion in model container [2018-01-21 10:17:34,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:17:34" (2/3) ... [2018-01-21 10:17:34,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9cdf2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:17:34, skipping insertion in model container [2018-01-21 10:17:34,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:17:34" (3/3) ... [2018-01-21 10:17:34,726 INFO L105 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer_true-valid-memsafety.i [2018-01-21 10:17:34,732 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 10:17:34,739 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 10:17:34,786 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:17:34,787 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:17:34,787 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:17:34,787 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:17:34,787 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:17:34,787 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:17:34,787 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:17:34,788 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 10:17:34,788 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:17:34,808 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-21 10:17:34,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 10:17:34,815 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:17:34,816 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 10:17:34,816 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 10:17:34,821 INFO L82 PathProgramCache]: Analyzing trace with hash 98024, now seen corresponding path program 1 times [2018-01-21 10:17:34,824 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:17:34,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:34,873 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:34,873 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:34,873 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:17:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:17:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:17:34,926 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:17:34,933 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:17:34,940 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:17:34,940 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:17:34,941 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:17:34,941 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:17:34,941 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:17:34,941 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:17:34,941 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:17:34,941 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 10:17:34,941 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:17:34,942 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-21 10:17:34,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 10:17:34,943 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:17:34,943 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:17:34,943 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:17:34,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1566967016, now seen corresponding path program 1 times [2018-01-21 10:17:34,944 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:17:34,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:34,945 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:34,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:34,945 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:17:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:17:34,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:17:35,008 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 10:17:35,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:17:35,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:17:35,010 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:17:35,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:17:35,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:17:35,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:17:35,029 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-01-21 10:17:35,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:17:35,131 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-01-21 10:17:35,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:17:35,132 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-21 10:17:35,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:17:35,143 INFO L225 Difference]: With dead ends: 60 [2018-01-21 10:17:35,143 INFO L226 Difference]: Without dead ends: 40 [2018-01-21 10:17:35,146 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 10:17:35,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-21 10:17:35,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-21 10:17:35,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-21 10:17:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-21 10:17:35,177 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 18 [2018-01-21 10:17:35,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:17:35,177 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-21 10:17:35,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:17:35,177 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-21 10:17:35,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 10:17:35,178 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:17:35,178 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] [2018-01-21 10:17:35,179 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:17:35,179 INFO L82 PathProgramCache]: Analyzing trace with hash 2022925235, now seen corresponding path program 1 times [2018-01-21 10:17:35,179 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:17:35,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:35,180 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:35,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:35,181 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:17:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:17:35,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:17:35,278 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 10:17:35,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:17:35,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:17:35,278 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:17:35,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:17:35,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:17:35,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:17:35,281 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 5 states. [2018-01-21 10:17:35,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:17:35,437 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-01-21 10:17:35,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 10:17:35,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-21 10:17:35,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:17:35,475 INFO L225 Difference]: With dead ends: 73 [2018-01-21 10:17:35,475 INFO L226 Difference]: Without dead ends: 68 [2018-01-21 10:17:35,476 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-21 10:17:35,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-21 10:17:35,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 45. [2018-01-21 10:17:35,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-21 10:17:35,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-21 10:17:35,483 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 21 [2018-01-21 10:17:35,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:17:35,484 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-21 10:17:35,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:17:35,484 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-21 10:17:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 10:17:35,485 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:17:35,485 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:17:35,485 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:17:35,486 INFO L82 PathProgramCache]: Analyzing trace with hash 745482112, now seen corresponding path program 1 times [2018-01-21 10:17:35,486 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:17:35,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:35,487 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:35,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:35,487 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:17:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:17:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:17:35,533 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:17:35,539 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:17:35,543 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:17:35,544 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:17:35,552 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:17:35,552 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:17:35,552 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:17:35,553 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:17:35,553 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:17:35,553 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:17:35,553 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:17:35,553 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 10:17:35,553 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:17:35,554 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-21 10:17:35,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-21 10:17:35,555 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:17:35,555 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:17:35,556 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 10:17:35,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1567082781, now seen corresponding path program 1 times [2018-01-21 10:17:35,556 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:17:35,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:35,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:35,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:35,557 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:17:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:17:35,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:17:35,582 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 10:17:35,582 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:17:35,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:17:35,582 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:17:35,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:17:35,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:17:35,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:17:35,583 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-01-21 10:17:35,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:17:35,587 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-01-21 10:17:35,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:17:35,588 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-01-21 10:17:35,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:17:35,589 INFO L225 Difference]: With dead ends: 60 [2018-01-21 10:17:35,589 INFO L226 Difference]: Without dead ends: 38 [2018-01-21 10:17:35,589 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 10:17:35,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-21 10:17:35,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-21 10:17:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-21 10:17:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-21 10:17:35,595 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 16 [2018-01-21 10:17:35,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:17:35,595 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-21 10:17:35,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:17:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-21 10:17:35,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 10:17:35,596 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:17:35,596 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:17:35,596 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 10:17:35,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1749589112, now seen corresponding path program 1 times [2018-01-21 10:17:35,597 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:17:35,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:35,598 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:35,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:35,598 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:17:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:17:35,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:17:35,660 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 10:17:35,660 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:17:35,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:17:35,660 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:17:35,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:17:35,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:17:35,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:17:35,662 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 5 states. [2018-01-21 10:17:35,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:17:35,761 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-01-21 10:17:35,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 10:17:35,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-21 10:17:35,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:17:35,763 INFO L225 Difference]: With dead ends: 69 [2018-01-21 10:17:35,763 INFO L226 Difference]: Without dead ends: 66 [2018-01-21 10:17:35,763 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-21 10:17:35,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-21 10:17:35,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2018-01-21 10:17:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 10:17:35,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-21 10:17:35,769 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2018-01-21 10:17:35,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:17:35,769 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-21 10:17:35,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:17:35,770 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-21 10:17:35,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 10:17:35,770 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:17:35,770 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:17:35,771 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 10:17:35,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1944907653, now seen corresponding path program 1 times [2018-01-21 10:17:35,771 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:17:35,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:35,772 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:17:35,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:17:35,772 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:17:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:17:35,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:17:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:17:35,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:17:35,992 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:17:35,994 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-21 10:17:35,995 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [8], [9], [10], [11], [12], [13], [17], [19], [22], [45], [49], [51], [52], [53], [54], [62], [64], [68], [70], [71], [72], [73] [2018-01-21 10:17:36,043 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:17:36,044 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:18:23,778 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 10:18:23,779 INFO L268 AbstractInterpreter]: Visited 25 different actions 58 times. Merged at 10 different actions 31 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-21 10:18:23,796 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 10:18:23,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:18:23,796 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:18:23,802 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:18:23,802 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:18:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:18:23,828 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:18:23,995 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~y~4.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~y~4.base 0)) (= 0 (select |c_old(#valid)| main_~y~4.base)) (not (= main_~y~4.base 0)))) is different from true [2018-01-21 10:18:24,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-21 10:18:24,004 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:18:24,271 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_3| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_3|))) (= 0 |v_main_#t~malloc0.base_3|) (= (store |c_#valid| |v_main_#t~malloc0.base_3| 0) |c_old(#valid)|))) is different from false [2018-01-21 10:18:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:18:24,305 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:18:24,305 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:18:24,311 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:18:24,311 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:18:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:18:24,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:18:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:18:24,477 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:18:24,499 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_4| Int)) (or (= (store |c_#valid| |v_main_#t~malloc0.base_4| 0) |c_old(#valid)|) (= 0 |v_main_#t~malloc0.base_4|) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_4|))))) is different from false [2018-01-21 10:18:24,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:18:24,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:18:24,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7, 8, 6] total 23 [2018-01-21 10:18:24,522 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:18:24,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-21 10:18:24,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-21 10:18:24,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=348, Unknown=7, NotChecked=120, Total=552 [2018-01-21 10:18:24,523 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2018-01-21 10:18:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:18:24,862 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2018-01-21 10:18:24,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 10:18:24,863 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-01-21 10:18:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:18:24,864 INFO L225 Difference]: With dead ends: 63 [2018-01-21 10:18:24,865 INFO L226 Difference]: Without dead ends: 60 [2018-01-21 10:18:24,865 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=532, Unknown=7, NotChecked=150, Total=812 [2018-01-21 10:18:24,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-21 10:18:24,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2018-01-21 10:18:24,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-21 10:18:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-21 10:18:24,872 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 26 [2018-01-21 10:18:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:18:24,872 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-21 10:18:24,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-21 10:18:24,872 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-21 10:18:24,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 10:18:24,873 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:18:24,874 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:18:24,874 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 10:18:24,874 INFO L82 PathProgramCache]: Analyzing trace with hash 66158503, now seen corresponding path program 1 times [2018-01-21 10:18:24,874 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:18:24,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:18:24,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:18:24,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:18:24,875 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:18:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:18:24,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:18:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:18:25,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:18:25,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-21 10:18:25,026 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:18:25,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-21 10:18:25,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-21 10:18:25,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-21 10:18:25,027 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 7 states. [2018-01-21 10:18:25,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:18:25,185 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-01-21 10:18:25,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 10:18:25,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-21 10:18:25,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:18:25,186 INFO L225 Difference]: With dead ends: 71 [2018-01-21 10:18:25,186 INFO L226 Difference]: Without dead ends: 58 [2018-01-21 10:18:25,186 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-01-21 10:18:25,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-21 10:18:25,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-01-21 10:18:25,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-21 10:18:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-21 10:18:25,190 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 29 [2018-01-21 10:18:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:18:25,190 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-21 10:18:25,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-21 10:18:25,191 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-21 10:18:25,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 10:18:25,191 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:18:25,191 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] [2018-01-21 10:18:25,191 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-21 10:18:25,191 INFO L82 PathProgramCache]: Analyzing trace with hash 304338011, now seen corresponding path program 1 times [2018-01-21 10:18:25,192 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:18:25,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:18:25,192 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:18:25,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:18:25,192 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:18:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:18:25,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:18:25,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:18:25,245 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:18:25,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:18:25,245 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:18:25,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:18:25,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:18:25,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:18:25,246 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-01-21 10:18:25,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:18:25,339 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2018-01-21 10:18:25,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:18:25,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-21 10:18:25,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:18:25,340 INFO L225 Difference]: With dead ends: 91 [2018-01-21 10:18:25,340 INFO L226 Difference]: Without dead ends: 88 [2018-01-21 10:18:25,341 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 10:18:25,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-21 10:18:25,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 50. [2018-01-21 10:18:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-21 10:18:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-21 10:18:25,346 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 30 [2018-01-21 10:18:25,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:18:25,347 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-21 10:18:25,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:18:25,347 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-21 10:18:25,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-21 10:18:25,348 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:18:25,348 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:18:25,348 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-21 10:18:25,349 INFO L82 PathProgramCache]: Analyzing trace with hash 264537048, now seen corresponding path program 2 times [2018-01-21 10:18:25,349 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:18:25,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:18:25,350 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:18:25,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:18:25,350 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:18:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:18:25,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:18:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:18:25,472 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:18:25,472 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:18:25,472 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:18:25,472 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:18:25,473 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:18:25,473 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:18:25,482 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 10:18:25,482 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:18:25,497 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:18:25,507 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:18:25,508 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:18:25,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:18:25,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 10:18:25,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 10:18:25,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-21 10:18:25,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 10:18:25,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:18:25,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-21 10:18:25,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-21 10:18:25,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-21 10:18:25,600 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:18:25,601 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:18:25,601 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:18:25,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-21 10:18:25,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-21 10:18:25,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-01-21 10:18:25,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-01-21 10:18:25,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:3 [2018-01-21 10:18:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:18:25,689 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:18:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:18:25,751 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:18:25,751 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:18:25,763 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 10:18:25,763 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:18:25,781 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:18:25,806 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:18:25,830 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:18:25,836 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:18:25,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 10:18:25,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 10:18:25,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-21 10:18:25,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 10:18:25,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:18:25,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-21 10:18:25,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-21 10:18:25,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-21 10:18:25,938 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:18:25,939 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:18:25,939 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:18:25,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-21 10:18:25,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-21 10:18:25,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-01-21 10:18:25,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-01-21 10:18:25,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:18:25,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:3 [2018-01-21 10:18:25,986 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:18:25,986 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:18:26,025 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:18:26,026 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:18:26,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 7, 11, 7] total 18 [2018-01-21 10:18:26,027 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:18:26,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-21 10:18:26,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-21 10:18:26,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-01-21 10:18:26,028 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 15 states. [2018-01-21 10:18:26,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:18:26,303 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-01-21 10:18:26,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-21 10:18:26,303 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-01-21 10:18:26,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:18:26,304 INFO L225 Difference]: With dead ends: 68 [2018-01-21 10:18:26,304 INFO L226 Difference]: Without dead ends: 46 [2018-01-21 10:18:26,304 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 117 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2018-01-21 10:18:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-21 10:18:26,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-01-21 10:18:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 10:18:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-21 10:18:26,309 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 33 [2018-01-21 10:18:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:18:26,310 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-21 10:18:26,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-21 10:18:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-21 10:18:26,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 10:18:26,311 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:18:26,311 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:18:26,311 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-21 10:18:26,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1962892734, now seen corresponding path program 1 times [2018-01-21 10:18:26,312 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:18:26,312 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:18:26,312 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:18:26,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:18:26,313 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:18:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:18:26,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:18:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:18:26,770 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:18:26,771 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:18:26,771 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-21 10:18:26,771 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [8], [9], [10], [11], [12], [13], [17], [19], [22], [24], [25], [26], [27], [28], [29], [36], [37], [39], [45], [49], [51], [52], [53], [54], [62], [64], [68], [70], [71], [72], [73] [2018-01-21 10:18:26,773 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:18:26,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-21 10:18:37,655 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-21 10:18:37,655 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-21 10:18:37,655 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:18:37,655 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:18:37,655 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:18:37,660 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:18:37,661 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:18:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:18:37,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:18:37,680 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-21 10:18:37,681 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 10:18:37,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 10:18:37 BoogieIcfgContainer [2018-01-21 10:18:37,683 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 10:18:37,684 INFO L168 Benchmark]: Toolchain (without parser) took 63455.96 ms. Allocated memory was 297.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 255.6 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 706.8 MB. Max. memory is 5.3 GB. [2018-01-21 10:18:37,685 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 297.3 MB. Free memory is still 261.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:18:37,685 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.30 ms. Allocated memory is still 297.3 MB. Free memory was 254.6 MB in the beginning and 244.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-21 10:18:37,685 INFO L168 Benchmark]: Boogie Preprocessor took 36.63 ms. Allocated memory is still 297.3 MB. Free memory was 244.6 MB in the beginning and 242.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:18:37,686 INFO L168 Benchmark]: RCFGBuilder took 243.40 ms. Allocated memory is still 297.3 MB. Free memory was 242.6 MB in the beginning and 224.9 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. [2018-01-21 10:18:37,686 INFO L168 Benchmark]: TraceAbstraction took 62961.73 ms. Allocated memory was 297.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 224.9 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 676.1 MB. Max. memory is 5.3 GB. [2018-01-21 10:18:37,688 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 297.3 MB. Free memory is still 261.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 206.30 ms. Allocated memory is still 297.3 MB. Free memory was 254.6 MB in the beginning and 244.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.63 ms. Allocated memory is still 297.3 MB. Free memory was 244.6 MB in the beginning and 242.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 243.40 ms. Allocated memory is still 297.3 MB. Free memory was 242.6 MB in the beginning and 224.9 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 62961.73 ms. Allocated memory was 297.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 224.9 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 676.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 22 LocStat_MAX_SIZEOF_WEQEDGELABEL : 7 LocStat_NO_SUPPORTING_EQUALITIES : 276 LocStat_NO_SUPPORTING_DISEQUALITIES : 58 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 66 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 42.492480 RENAME_VARIABLES(MILLISECONDS) : 21.677071 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 42.425756 PROJECTAWAY(MILLISECONDS) : 0.165691 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.091164 DISJOIN(MILLISECONDS) : 16.057322 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 21.737135 ADD_EQUALITY(MILLISECONDS) : 0.030277 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014692 #CONJOIN_DISJUNCTIVE : 111 #RENAME_VARIABLES : 219 #UNFREEZE : 0 #CONJOIN : 193 #PROJECTAWAY : 131 #ADD_WEAK_EQUALITY : 16 #DISJOIN : 33 #RENAME_VARIABLES_DISJUNCTIVE : 189 #ADD_EQUALITY : 62 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * 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, 43 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=43occurred 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: [L633] Node* list = ((void *)0); [L634] Node* y = ((void *)0); VAL [list={0:0}, y={0:0}] [L635] EXPR, FCALL malloc(sizeof(*y)) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={0:0}] [L635] y = malloc(sizeof(*y)) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L636] FCALL y->next = ((void *)0) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L637] FCALL y->prev = ((void *)0) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L638] FCALL y->pData = &y->data VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L639] list = y VAL [list={15:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L640] COND FALSE !(__VERIFIER_nondet_int()) [L655] COND TRUE ((void *)0) != list [L657] y = list VAL [list={15:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L658] EXPR, FCALL list->next VAL [list={15:0}, list->next={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L658] list = list->next [L659] EXPR, FCALL y->pData VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}, y->pData={15:12}] [L659] COND FALSE !(&y->data != y->pData) [L663] FCALL free(y) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L655] COND FALSE !(((void *)0) != list) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L665] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 43 locations, 3 error locations. UNSAFE Result, 0.6s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 75 SDtfs, 96 SDslu, 58 SDs, 0 SdLazy, 44 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=2, 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, 2 MinimizatonAttempts, 23 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 1289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 43 locations, 3 error locations. TIMEOUT Result, 62.1s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 220 SDtfs, 445 SDslu, 551 SDs, 0 SdLazy, 484 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 297 GetRequests, 211 SyntacticMatches, 13 SemanticMatches, 73 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 58.6s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 82 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 375 ConstructedInterpolants, 12 QuantifiedInterpolants, 76427 SizeOfPredicates, 34 NumberOfNonLiveVariables, 446 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 30/70 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_10-18-37-698.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_10-18-37-698.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_10-18-37-698.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_10-18-37-698.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_10-18-37-698.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_10-18-37-698.csv Completed graceful shutdown