java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/stroeder1-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:49:10,227 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:49:10,228 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:49:10,243 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:49:10,243 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:49:10,244 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:49:10,246 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:49:10,247 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:49:10,249 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:49:10,250 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:49:10,250 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:49:10,251 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:49:10,251 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:49:10,252 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:49:10,253 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:49:10,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:49:10,258 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:49:10,261 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:49:10,262 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:49:10,263 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:49:10,266 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:49:10,266 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:49:10,267 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:49:10,268 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:49:10,268 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:49:10,270 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:49:10,270 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:49:10,271 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:49:10,271 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:49:10,271 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:49:10,272 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:49:10,272 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 11:49:10,282 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:49:10,283 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:49:10,284 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:49:10,284 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:49:10,284 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:49:10,284 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:49:10,285 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:49:10,285 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:49:10,286 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:49:10,286 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:49:10,286 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:49:10,286 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:49:10,286 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:49:10,287 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:49:10,287 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:49:10,287 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:49:10,287 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:49:10,287 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:49:10,288 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:49:10,288 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:49:10,288 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:49:10,288 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:49:10,289 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:49:10,289 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:49:10,289 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:49:10,289 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:49:10,290 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:49:10,290 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:49:10,290 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:49:10,290 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:49:10,290 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:49:10,290 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:49:10,291 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:49:10,292 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:49:10,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:49:10,341 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:49:10,345 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:49:10,346 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:49:10,347 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:49:10,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/stroeder1-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:49:10,517 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:49:10,524 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:49:10,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:49:10,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:49:10,530 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:49:10,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:49:10" (1/1) ... [2018-01-24 11:49:10,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cdf0e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:10, skipping insertion in model container [2018-01-24 11:49:10,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:49:10" (1/1) ... [2018-01-24 11:49:10,552 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:49:10,592 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:49:10,695 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:49:10,709 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:49:10,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:10 WrapperNode [2018-01-24 11:49:10,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:49:10,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:49:10,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:49:10,717 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:49:10,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:10" (1/1) ... [2018-01-24 11:49:10,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:10" (1/1) ... [2018-01-24 11:49:10,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:10" (1/1) ... [2018-01-24 11:49:10,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:10" (1/1) ... [2018-01-24 11:49:10,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:10" (1/1) ... [2018-01-24 11:49:10,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:10" (1/1) ... [2018-01-24 11:49:10,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:10" (1/1) ... [2018-01-24 11:49:10,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:49:10,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:49:10,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:49:10,751 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:49:10,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:10" (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-24 11:49:10,794 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:49:10,794 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:49:10,795 INFO L136 BoogieDeclarations]: Found implementation of procedure sumOfThirdBytes [2018-01-24 11:49:10,795 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:49:10,795 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:49:10,795 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:49:10,795 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:49:10,795 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:49:10,795 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:49:10,796 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:49:10,796 INFO L128 BoogieDeclarations]: Found specification of procedure sumOfThirdBytes [2018-01-24 11:49:10,796 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:49:10,796 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:49:10,796 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:49:10,930 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:49:10,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:49:10 BoogieIcfgContainer [2018-01-24 11:49:10,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:49:10,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:49:10,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:49:10,933 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:49:10,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:49:10" (1/3) ... [2018-01-24 11:49:10,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0858d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:49:10, skipping insertion in model container [2018-01-24 11:49:10,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:10" (2/3) ... [2018-01-24 11:49:10,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0858d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:49:10, skipping insertion in model container [2018-01-24 11:49:10,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:49:10" (3/3) ... [2018-01-24 11:49:10,937 INFO L105 eAbstractionObserver]: Analyzing ICFG stroeder1-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:49:10,944 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:49:10,949 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-24 11:49:10,992 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:49:10,992 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:49:10,992 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:49:10,992 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:49:10,992 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:49:10,992 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:49:10,992 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:49:10,992 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:49:10,993 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:49:11,009 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-01-24 11:49:11,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:49:11,014 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:11,015 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:11,015 INFO L371 AbstractCegarLoop]: === Iteration 1 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:49:11,018 INFO L82 PathProgramCache]: Analyzing trace with hash -443509723, now seen corresponding path program 1 times [2018-01-24 11:49:11,020 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:11,020 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:11,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:11,065 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:11,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:11,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:11,271 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-24 11:49:11,274 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:49:11,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:49:11,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:49:11,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:49:11,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:49:11,293 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 7 states. [2018-01-24 11:49:11,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:11,439 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-01-24 11:49:11,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 11:49:11,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-24 11:49:11,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:11,526 INFO L225 Difference]: With dead ends: 45 [2018-01-24 11:49:11,526 INFO L226 Difference]: Without dead ends: 30 [2018-01-24 11:49:11,567 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:49:11,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-24 11:49:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2018-01-24 11:49:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-24 11:49:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-01-24 11:49:11,594 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 14 [2018-01-24 11:49:11,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:11,594 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-01-24 11:49:11,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:49:11,595 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-01-24 11:49:11,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:49:11,595 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:11,595 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:11,595 INFO L371 AbstractCegarLoop]: === Iteration 2 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:49:11,596 INFO L82 PathProgramCache]: Analyzing trace with hash -443509722, now seen corresponding path program 1 times [2018-01-24 11:49:11,596 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:11,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:11,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:11,597 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:11,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:11,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:11,746 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-24 11:49:11,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:49:11,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:49:11,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:49:11,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:49:11,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:49:11,749 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 7 states. [2018-01-24 11:49:12,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:12,000 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-01-24 11:49:12,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:49:12,001 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-24 11:49:12,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:12,002 INFO L225 Difference]: With dead ends: 39 [2018-01-24 11:49:12,002 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 11:49:12,003 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:49:12,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 11:49:12,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-01-24 11:49:12,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-24 11:49:12,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-01-24 11:49:12,010 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 14 [2018-01-24 11:49:12,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:12,011 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-01-24 11:49:12,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:49:12,011 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-01-24 11:49:12,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 11:49:12,012 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:12,012 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:12,012 INFO L371 AbstractCegarLoop]: === Iteration 3 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:49:12,012 INFO L82 PathProgramCache]: Analyzing trace with hash -537553629, now seen corresponding path program 1 times [2018-01-24 11:49:12,012 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:12,012 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:12,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:12,013 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:12,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:12,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:12,224 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:49:12,224 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:49:12,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:12,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:49:12,348 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-24 11:49:12,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:49:12,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2018-01-24 11:49:12,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 11:49:12,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 11:49:12,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-24 11:49:12,370 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 13 states. [2018-01-24 11:49:12,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:12,560 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-01-24 11:49:12,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 11:49:12,560 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-01-24 11:49:12,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:12,562 INFO L225 Difference]: With dead ends: 64 [2018-01-24 11:49:12,562 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 11:49:12,563 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-01-24 11:49:12,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 11:49:12,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-01-24 11:49:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 11:49:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-01-24 11:49:12,570 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 19 [2018-01-24 11:49:12,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:12,570 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-01-24 11:49:12,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 11:49:12,570 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-01-24 11:49:12,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 11:49:12,571 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:12,571 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:12,571 INFO L371 AbstractCegarLoop]: === Iteration 4 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:49:12,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1124359643, now seen corresponding path program 1 times [2018-01-24 11:49:12,572 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:12,572 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:12,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:12,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:12,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:12,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:12,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:12,726 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:49:12,726 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:49:12,737 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:12,756 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:49:12,779 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-24 11:49:12,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:49:12,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:49:12,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 11:49:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:12,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:49:12,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2018-01-24 11:49:12,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 11:49:12,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 11:49:12,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-01-24 11:49:12,944 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 14 states. [2018-01-24 11:49:13,348 WARN L146 SmtUtils]: Spent 267ms on a formula simplification. DAG size of input: 33 DAG size of output 31 [2018-01-24 11:49:13,641 WARN L146 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 43 DAG size of output 41 [2018-01-24 11:49:13,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:13,693 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-01-24 11:49:13,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:49:13,694 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2018-01-24 11:49:13,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:13,696 INFO L225 Difference]: With dead ends: 55 [2018-01-24 11:49:13,696 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 11:49:13,696 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-01-24 11:49:13,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 11:49:13,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2018-01-24 11:49:13,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 11:49:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-01-24 11:49:13,707 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 19 [2018-01-24 11:49:13,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:13,708 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-01-24 11:49:13,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 11:49:13,708 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-01-24 11:49:13,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 11:49:13,709 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:13,709 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:13,709 INFO L371 AbstractCegarLoop]: === Iteration 5 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:49:13,709 INFO L82 PathProgramCache]: Analyzing trace with hash 950757514, now seen corresponding path program 1 times [2018-01-24 11:49:13,710 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:13,710 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:13,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:13,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:13,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:13,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:13,782 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-24 11:49:13,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:49:13,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:49:13,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:49:13,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:49:13,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:49:13,783 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 5 states. [2018-01-24 11:49:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:13,835 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-01-24 11:49:13,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:49:13,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 11:49:13,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:13,839 INFO L225 Difference]: With dead ends: 54 [2018-01-24 11:49:13,839 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 11:49:13,840 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:49:13,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 11:49:13,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-01-24 11:49:13,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 11:49:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-01-24 11:49:13,848 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 20 [2018-01-24 11:49:13,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:13,848 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-01-24 11:49:13,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:49:13,848 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-01-24 11:49:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 11:49:13,849 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:13,849 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:13,849 INFO L371 AbstractCegarLoop]: === Iteration 6 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:49:13,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1524168647, now seen corresponding path program 1 times [2018-01-24 11:49:13,850 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:13,850 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:13,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:13,851 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:13,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:13,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 11:49:13,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:49:13,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:49:13,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:49:13,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:49:13,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:49:13,935 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 4 states. [2018-01-24 11:49:13,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:13,973 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-01-24 11:49:13,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:49:13,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-24 11:49:13,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:13,974 INFO L225 Difference]: With dead ends: 40 [2018-01-24 11:49:13,974 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 11:49:13,975 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:49:13,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 11:49:13,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 11:49:13,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 11:49:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 11:49:13,975 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-24 11:49:13,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:13,975 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 11:49:13,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:49:13,976 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 11:49:13,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 11:49:13,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 11:49:14,758 WARN L146 SmtUtils]: Spent 637ms on a formula simplification. DAG size of input: 78 DAG size of output 52 [2018-01-24 11:49:14,773 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-24 11:49:14,773 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:49:14,773 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-24 11:49:14,773 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesErr1RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 11:49:14,773 INFO L397 ceAbstractionStarter]: At program point L545'''(lines 545 549) the Hoare annotation is: (let ((.cse0 (not (= (select |#valid| |sumOfThirdBytes_#in~numbers.base|) 1))) (.cse1 (not (exists ((v_main_~array_size~4_BEFORE_CALL_2 Int)) (and (<= |sumOfThirdBytes_#in~array_size| v_main_~array_size~4_BEFORE_CALL_2) (= (select |#length| |sumOfThirdBytes_#in~numbers.base|) (* 4 v_main_~array_size~4_BEFORE_CALL_2)))))) (.cse3 (not (= 0 |sumOfThirdBytes_#in~numbers.offset|))) (.cse4 (<= 1 sumOfThirdBytes_~i~2))) (and (let ((.cse2 (<= sumOfThirdBytes_~array_size 1))) (or .cse0 .cse1 (and .cse2 (<= |sumOfThirdBytes_#in~array_size| sumOfThirdBytes_~array_size)) (< 1 |sumOfThirdBytes_#in~array_size|) .cse3 (and .cse4 .cse2))) (or .cse0 .cse1 .cse3 (let ((.cse5 (exists ((v_main_~array_size~4_BEFORE_CALL_2 Int)) (and (= (select |#length| |sumOfThirdBytes_~#numbers.base|) (* 4 v_main_~array_size~4_BEFORE_CALL_2)) (<= sumOfThirdBytes_~array_size v_main_~array_size~4_BEFORE_CALL_2)))) (.cse6 (= 1 (select |#valid| |sumOfThirdBytes_~#numbers.base|))) (.cse7 (= |sumOfThirdBytes_~#numbers.offset| 0))) (or (and .cse5 (= sumOfThirdBytes_~i~2 0) .cse6 .cse7) (and .cse4 .cse5 (<= sumOfThirdBytes_~p~2.offset (+ |sumOfThirdBytes_~#numbers.offset| (* 4 sumOfThirdBytes_~i~2) 2)) .cse6 .cse7)))))) [2018-01-24 11:49:14,774 INFO L401 ceAbstractionStarter]: For program point L545(lines 545 549) no Hoare annotation was computed. [2018-01-24 11:49:14,774 INFO L401 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-24 11:49:14,774 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesFINAL(lines 540 551) no Hoare annotation was computed. [2018-01-24 11:49:14,774 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesErr0RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 11:49:14,774 INFO L401 ceAbstractionStarter]: For program point L545''''(lines 545 549) no Hoare annotation was computed. [2018-01-24 11:49:14,774 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesEXIT(lines 540 551) no Hoare annotation was computed. [2018-01-24 11:49:14,774 INFO L404 ceAbstractionStarter]: At program point sumOfThirdBytesENTRY(lines 540 551) the Hoare annotation is: true [2018-01-24 11:49:14,774 INFO L401 ceAbstractionStarter]: For program point L545''(lines 545 549) no Hoare annotation was computed. [2018-01-24 11:49:14,774 INFO L401 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-24 11:49:14,774 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 559) the Hoare annotation is: true [2018-01-24 11:49:14,774 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-24 11:49:14,775 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 559) the Hoare annotation is: true [2018-01-24 11:49:14,775 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-24 11:49:14,775 INFO L401 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-24 11:49:14,775 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 552 559) no Hoare annotation was computed. [2018-01-24 11:49:14,775 INFO L401 ceAbstractionStarter]: For program point L554(lines 554 556) no Hoare annotation was computed. [2018-01-24 11:49:14,775 INFO L397 ceAbstractionStarter]: At program point L558(line 558) the Hoare annotation is: (let ((.cse0 (* 4 main_~array_size~4))) (and (<= 1 main_~array_size~4) (= 1 (select |#valid| |main_#t~malloc3.base|)) (= .cse0 (select |#length| |main_#t~malloc3.base|)) (= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0)) (= 1 (select |#valid| main_~numbers~4.base)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~numbers~4.offset) (= .cse0 (select |#length| main_~numbers~4.base)))) [2018-01-24 11:49:14,775 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 552 559) no Hoare annotation was computed. [2018-01-24 11:49:14,775 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 552 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:49:14,775 INFO L401 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-24 11:49:14,775 INFO L401 ceAbstractionStarter]: For program point L554''(lines 554 556) no Hoare annotation was computed. [2018-01-24 11:49:14,775 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-24 11:49:14,776 INFO L401 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-24 11:49:14,776 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 552 559) no Hoare annotation was computed. [2018-01-24 11:49:14,781 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,782 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,783 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,783 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,783 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,783 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,783 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,784 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,786 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:14,786 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:14,787 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:14,787 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:14,793 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,794 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,794 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,794 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,795 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,795 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,795 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,796 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:14,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:14,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:14,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:14,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:49:14 BoogieIcfgContainer [2018-01-24 11:49:14,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:49:14,802 INFO L168 Benchmark]: Toolchain (without parser) took 4284.02 ms. Allocated memory was 307.8 MB in the beginning and 485.0 MB in the end (delta: 177.2 MB). Free memory was 266.8 MB in the beginning and 317.5 MB in the end (delta: -50.7 MB). Peak memory consumption was 126.5 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:14,803 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 307.8 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:49:14,803 INFO L168 Benchmark]: CACSL2BoogieTranslator took 191.33 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:14,804 INFO L168 Benchmark]: Boogie Preprocessor took 34.66 ms. Allocated memory is still 307.8 MB. Free memory was 256.7 MB in the beginning and 254.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:14,804 INFO L168 Benchmark]: RCFGBuilder took 179.77 ms. Allocated memory is still 307.8 MB. Free memory was 254.7 MB in the beginning and 240.1 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:14,805 INFO L168 Benchmark]: TraceAbstraction took 3869.24 ms. Allocated memory was 307.8 MB in the beginning and 485.0 MB in the end (delta: 177.2 MB). Free memory was 240.1 MB in the beginning and 317.5 MB in the end (delta: -77.4 MB). Peak memory consumption was 99.8 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:14,806 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 307.8 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 191.33 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.66 ms. Allocated memory is still 307.8 MB. Free memory was 256.7 MB in the beginning and 254.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 179.77 ms. Allocated memory is still 307.8 MB. Free memory was 254.7 MB in the beginning and 240.1 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3869.24 ms. Allocated memory was 307.8 MB in the beginning and 485.0 MB in the end (delta: 177.2 MB). Free memory was 240.1 MB in the beginning and 317.5 MB in the end (delta: -77.4 MB). Peak memory consumption was 99.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 545]: Loop Invariant [2018-01-24 11:49:14,812 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,812 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,813 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,813 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,813 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,813 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,814 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,814 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,814 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:14,814 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:14,815 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:14,815 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:14,817 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,818 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,818 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,818 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,819 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,819 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,819 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,819 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:49:14,820 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:14,820 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:14,820 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:14,820 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((!(\valid[numbers] == 1) || !(\exists v_main_~array_size~4_BEFORE_CALL_2 : int :: \old(array_size) <= v_main_~array_size~4_BEFORE_CALL_2 && unknown-#length-unknown[numbers] == 4 * v_main_~array_size~4_BEFORE_CALL_2)) || (array_size <= 1 && \old(array_size) <= array_size)) || 1 < \old(array_size)) || !(0 == numbers)) || (1 <= i && array_size <= 1)) && (((!(\valid[numbers] == 1) || !(\exists v_main_~array_size~4_BEFORE_CALL_2 : int :: \old(array_size) <= v_main_~array_size~4_BEFORE_CALL_2 && unknown-#length-unknown[numbers] == 4 * v_main_~array_size~4_BEFORE_CALL_2)) || !(0 == numbers)) || ((((\exists v_main_~array_size~4_BEFORE_CALL_2 : int :: unknown-#length-unknown[numbers] == 4 * v_main_~array_size~4_BEFORE_CALL_2 && array_size <= v_main_~array_size~4_BEFORE_CALL_2) && i == 0) && 1 == \valid[numbers]) && numbers == 0) || ((((1 <= i && (\exists v_main_~array_size~4_BEFORE_CALL_2 : int :: unknown-#length-unknown[numbers] == 4 * v_main_~array_size~4_BEFORE_CALL_2 && array_size <= v_main_~array_size~4_BEFORE_CALL_2)) && p <= numbers + 4 * i + 2) && 1 == \valid[numbers]) && numbers == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 3 error locations. SAFE Result, 3.7s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 133 SDtfs, 182 SDslu, 484 SDs, 0 SdLazy, 343 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 42 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 13 NumberOfFragments, 173 HoareAnnotationTreeSize, 9 FomulaSimplifications, 445 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 647 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 141 ConstructedInterpolants, 9 QuantifiedInterpolants, 13575 SizeOfPredicates, 12 NumberOfNonLiveVariables, 167 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 10/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/stroeder1-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-49-14-826.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/stroeder1-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-49-14-826.csv Received shutdown request...