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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 15:07:20,870 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 15:07:20,872 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 15:07:20,883 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 15:07:20,883 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 15:07:20,884 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 15:07:20,885 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 15:07:20,886 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 15:07:20,888 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 15:07:20,888 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 15:07:20,889 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 15:07:20,889 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 15:07:20,890 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 15:07:20,891 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 15:07:20,891 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 15:07:20,893 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 15:07:20,895 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 15:07:20,896 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 15:07:20,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 15:07:20,898 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 15:07:20,899 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 15:07:20,900 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 15:07:20,900 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 15:07:20,901 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 15:07:20,901 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 15:07:20,902 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 15:07:20,903 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 15:07:20,903 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 15:07:20,903 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 15:07:20,903 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 15:07:20,904 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 15:07:20,904 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 15:07:20,912 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 15:07:20,913 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 15:07:20,914 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 15:07:20,914 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 15:07:20,914 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 15:07:20,914 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 15:07:20,914 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 15:07:20,914 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 15:07:20,914 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 15:07:20,915 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 15:07:20,915 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 15:07:20,915 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 15:07:20,915 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 15:07:20,915 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 15:07:20,915 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 15:07:20,915 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 15:07:20,916 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 15:07:20,916 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 15:07:20,916 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 15:07:20,916 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 15:07:20,916 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 15:07:20,916 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 15:07:20,941 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 15:07:20,949 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 15:07:20,951 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 15:07:20,952 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 15:07:20,952 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 15:07:20,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-02-04 15:07:21,062 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 15:07:21,063 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 15:07:21,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 15:07:21,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 15:07:21,067 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 15:07:21,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:07:21" (1/1) ... [2018-02-04 15:07:21,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a67664e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:21, skipping insertion in model container [2018-02-04 15:07:21,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:07:21" (1/1) ... [2018-02-04 15:07:21,079 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:07:21,105 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:07:21,187 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:07:21,199 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:07:21,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:21 WrapperNode [2018-02-04 15:07:21,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 15:07:21,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 15:07:21,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 15:07:21,205 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 15:07:21,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:21" (1/1) ... [2018-02-04 15:07:21,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:21" (1/1) ... [2018-02-04 15:07:21,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:21" (1/1) ... [2018-02-04 15:07:21,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:21" (1/1) ... [2018-02-04 15:07:21,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:21" (1/1) ... [2018-02-04 15:07:21,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:21" (1/1) ... [2018-02-04 15:07:21,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:21" (1/1) ... [2018-02-04 15:07:21,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 15:07:21,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 15:07:21,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 15:07:21,227 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 15:07:21,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:21" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 15:07:21,264 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 15:07:21,264 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 15:07:21,264 INFO L136 BoogieDeclarations]: Found implementation of procedure sumOfThirdBytes [2018-02-04 15:07:21,264 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 15:07:21,264 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 15:07:21,265 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 15:07:21,265 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 15:07:21,265 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 15:07:21,265 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 15:07:21,265 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 15:07:21,265 INFO L128 BoogieDeclarations]: Found specification of procedure sumOfThirdBytes [2018-02-04 15:07:21,265 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 15:07:21,265 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 15:07:21,266 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 15:07:21,370 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 15:07:21,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:07:21 BoogieIcfgContainer [2018-02-04 15:07:21,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 15:07:21,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 15:07:21,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 15:07:21,373 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 15:07:21,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:07:21" (1/3) ... [2018-02-04 15:07:21,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e9fdc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:07:21, skipping insertion in model container [2018-02-04 15:07:21,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:21" (2/3) ... [2018-02-04 15:07:21,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e9fdc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:07:21, skipping insertion in model container [2018-02-04 15:07:21,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:07:21" (3/3) ... [2018-02-04 15:07:21,375 INFO L107 eAbstractionObserver]: Analyzing ICFG stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-02-04 15:07:21,380 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 15:07:21,384 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-02-04 15:07:21,416 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 15:07:21,416 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 15:07:21,416 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 15:07:21,416 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 15:07:21,416 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 15:07:21,417 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 15:07:21,417 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 15:07:21,417 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 15:07:21,417 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 15:07:21,428 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-02-04 15:07:21,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 15:07:21,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:21,439 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:21,439 INFO L371 AbstractCegarLoop]: === Iteration 1 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:21,443 INFO L82 PathProgramCache]: Analyzing trace with hash -55325045, now seen corresponding path program 1 times [2018-02-04 15:07:21,488 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:21,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:21,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:21,643 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:21,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 15:07:21,644 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:21,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:21,644 INFO L182 omatonBuilderFactory]: Interpolants [41#true, 42#false, 43#(= 1 (select |#valid| |main_#t~malloc6.base|)), 44#(= 1 (select |#valid| main_~numbers~0.base)), 45#(= 1 (select |#valid| |sumOfThirdBytes_#in~numbers.base|)), 46#(= 1 (select |#valid| |sumOfThirdBytes_~#numbers.base|)), 47#(= 1 (select |#valid| sumOfThirdBytes_~p~0.base))] [2018-02-04 15:07:21,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:21,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 15:07:21,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 15:07:21,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:07:21,655 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 7 states. [2018-02-04 15:07:21,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:21,778 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-04 15:07:21,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 15:07:21,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-02-04 15:07:21,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:21,787 INFO L225 Difference]: With dead ends: 40 [2018-02-04 15:07:21,787 INFO L226 Difference]: Without dead ends: 37 [2018-02-04 15:07:21,789 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 15:07:21,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-04 15:07:21,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-02-04 15:07:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-04 15:07:21,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-02-04 15:07:21,887 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2018-02-04 15:07:21,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:21,888 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-02-04 15:07:21,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 15:07:21,888 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-02-04 15:07:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 15:07:21,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:21,888 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:21,888 INFO L371 AbstractCegarLoop]: === Iteration 2 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:21,889 INFO L82 PathProgramCache]: Analyzing trace with hash -55325044, now seen corresponding path program 1 times [2018-02-04 15:07:21,889 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:21,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:22,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:22,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 15:07:22,002 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:22,002 INFO L182 omatonBuilderFactory]: Interpolants [128#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc6.base|)) (= 0 |main_#t~malloc6.offset|)), 129#(and (= 0 main_~numbers~0.offset) (= (* 4 main_~array_size~0) (select |#length| main_~numbers~0.base))), 130#(and (= 0 |sumOfThirdBytes_#in~numbers.offset|) (<= (* 4 |sumOfThirdBytes_#in~array_size|) (select |#length| |sumOfThirdBytes_#in~numbers.base|))), 131#(and (= sumOfThirdBytes_~i~0 0) (<= (* 4 sumOfThirdBytes_~array_size) (select |#length| |sumOfThirdBytes_~#numbers.base|)) (= |sumOfThirdBytes_~#numbers.offset| 0)), 132#(and (<= 2 sumOfThirdBytes_~p~0.offset) (<= (+ sumOfThirdBytes_~p~0.offset 2) (select |#length| sumOfThirdBytes_~p~0.base))), 126#true, 127#false] [2018-02-04 15:07:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:22,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 15:07:22,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 15:07:22,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:07:22,005 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2018-02-04 15:07:22,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:22,176 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-04 15:07:22,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 15:07:22,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-02-04 15:07:22,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:22,178 INFO L225 Difference]: With dead ends: 50 [2018-02-04 15:07:22,178 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 15:07:22,179 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-02-04 15:07:22,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 15:07:22,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2018-02-04 15:07:22,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 15:07:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-04 15:07:22,185 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 15 [2018-02-04 15:07:22,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:22,185 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-04 15:07:22,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 15:07:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-04 15:07:22,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 15:07:22,186 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:22,186 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:22,186 INFO L371 AbstractCegarLoop]: === Iteration 3 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:22,187 INFO L82 PathProgramCache]: Analyzing trace with hash -195737667, now seen corresponding path program 1 times [2018-02-04 15:07:22,187 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:22,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:22,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:22,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 15:07:22,239 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:22,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:22,239 INFO L182 omatonBuilderFactory]: Interpolants [232#true, 233#false, 234#(<= 1 main_~array_size~0), 235#(and (= sumOfThirdBytes_~i~0 0) (<= |sumOfThirdBytes_#in~array_size| sumOfThirdBytes_~array_size)), 236#(<= |sumOfThirdBytes_#in~array_size| 0)] [2018-02-04 15:07:22,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:22,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:07:22,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:07:22,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:07:22,240 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-02-04 15:07:22,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:22,259 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-02-04 15:07:22,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:07:22,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 15:07:22,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:22,260 INFO L225 Difference]: With dead ends: 45 [2018-02-04 15:07:22,260 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 15:07:22,261 INFO L554 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-02-04 15:07:22,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 15:07:22,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-02-04 15:07:22,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 15:07:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-04 15:07:22,263 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 20 [2018-02-04 15:07:22,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:22,263 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-04 15:07:22,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:07:22,263 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-04 15:07:22,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 15:07:22,264 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:22,264 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:22,264 INFO L371 AbstractCegarLoop]: === Iteration 4 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:22,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1506152513, now seen corresponding path program 1 times [2018-02-04 15:07:22,265 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:22,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:22,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:22,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 15:07:22,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:22,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:22,348 INFO L182 omatonBuilderFactory]: Interpolants [325#true, 326#false, 327#(<= main_~array_size~0 1), 328#(and (<= main_~array_size~0 1) (= 0 |main_#t~malloc6.offset|)), 329#(and (<= main_~array_size~0 1) (= 0 main_~numbers~0.offset)), 330#(and (= 0 |sumOfThirdBytes_#in~numbers.offset|) (<= |sumOfThirdBytes_#in~array_size| 1)), 331#(and (<= sumOfThirdBytes_~array_size 1) (= |sumOfThirdBytes_~#numbers.offset| 0)), 332#(and (<= (+ sumOfThirdBytes_~p~0.offset (* 4 sumOfThirdBytes_~array_size)) (+ (* 4 sumOfThirdBytes_~i~0) |sumOfThirdBytes_~#numbers.offset| 6)) (= |sumOfThirdBytes_~#numbers.offset| 0)), 333#(and (<= (* 4 sumOfThirdBytes_~array_size) (+ (* 4 sumOfThirdBytes_~i~0) |sumOfThirdBytes_~#numbers.offset| 6)) (= |sumOfThirdBytes_~#numbers.offset| 0)), 334#(and (<= (* 4 sumOfThirdBytes_~array_size) (+ (* 4 sumOfThirdBytes_~i~0) |sumOfThirdBytes_~#numbers.offset| 2)) (= |sumOfThirdBytes_~#numbers.offset| 0))] [2018-02-04 15:07:22,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:22,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 15:07:22,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 15:07:22,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 15:07:22,349 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 10 states. [2018-02-04 15:07:22,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:22,462 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-02-04 15:07:22,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 15:07:22,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-02-04 15:07:22,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:22,464 INFO L225 Difference]: With dead ends: 65 [2018-02-04 15:07:22,464 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 15:07:22,464 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-02-04 15:07:22,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 15:07:22,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-02-04 15:07:22,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 15:07:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-02-04 15:07:22,470 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 21 [2018-02-04 15:07:22,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:22,470 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-02-04 15:07:22,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 15:07:22,470 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-02-04 15:07:22,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 15:07:22,472 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:22,472 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:22,472 INFO L371 AbstractCegarLoop]: === Iteration 5 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:22,472 INFO L82 PathProgramCache]: Analyzing trace with hash 226288835, now seen corresponding path program 1 times [2018-02-04 15:07:22,475 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:22,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:22,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:22,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:22,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 15:07:22,627 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:22,628 INFO L182 omatonBuilderFactory]: Interpolants [468#true, 469#false, 470#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc6.base|)) (= 0 |main_#t~malloc6.offset|)), 471#(and (= 0 main_~numbers~0.offset) (= (* 4 main_~array_size~0) (select |#length| main_~numbers~0.base))), 472#(and (= 0 |sumOfThirdBytes_#in~numbers.offset|) (<= (* 4 |sumOfThirdBytes_#in~array_size|) (select |#length| |sumOfThirdBytes_#in~numbers.base|))), 473#(and (<= (* 4 sumOfThirdBytes_~array_size) (select |#length| |sumOfThirdBytes_~#numbers.base|)) (= |sumOfThirdBytes_~#numbers.offset| 0)), 474#(and (<= (* 4 sumOfThirdBytes_~array_size) (select |#length| |sumOfThirdBytes_~#numbers.base|)) (<= sumOfThirdBytes_~p~0.offset (+ (* 4 sumOfThirdBytes_~i~0) |sumOfThirdBytes_~#numbers.offset| 2)) (= |sumOfThirdBytes_~#numbers.offset| 0)), 475#(and (<= 0 (+ (* 4 sumOfThirdBytes_~i~0) |sumOfThirdBytes_~#numbers.offset| 2)) (<= (* 4 sumOfThirdBytes_~array_size) (select |#length| |sumOfThirdBytes_~#numbers.base|)) (= |sumOfThirdBytes_~#numbers.offset| 0)), 476#(and (<= 2 (+ (* 4 sumOfThirdBytes_~i~0) |sumOfThirdBytes_~#numbers.offset|)) (<= (* 4 sumOfThirdBytes_~array_size) (select |#length| |sumOfThirdBytes_~#numbers.base|)) (= |sumOfThirdBytes_~#numbers.offset| 0)), 477#(and (<= 4 sumOfThirdBytes_~p~0.offset) (<= (+ sumOfThirdBytes_~p~0.offset 2) (select |#length| sumOfThirdBytes_~p~0.base)))] [2018-02-04 15:07:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:22,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 15:07:22,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 15:07:22,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 15:07:22,629 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 10 states. [2018-02-04 15:07:22,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:22,824 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-04 15:07:22,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 15:07:22,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-02-04 15:07:22,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:22,825 INFO L225 Difference]: With dead ends: 63 [2018-02-04 15:07:22,825 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 15:07:22,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-02-04 15:07:22,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 15:07:22,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2018-02-04 15:07:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 15:07:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-02-04 15:07:22,830 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 21 [2018-02-04 15:07:22,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:22,830 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-02-04 15:07:22,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 15:07:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-02-04 15:07:22,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 15:07:22,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:22,831 INFO L351 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-02-04 15:07:22,831 INFO L371 AbstractCegarLoop]: === Iteration 6 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:22,832 INFO L82 PathProgramCache]: Analyzing trace with hash 308334376, now seen corresponding path program 1 times [2018-02-04 15:07:22,832 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:22,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 15:07:22,882 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:22,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:07:22,882 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:22,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:22,882 INFO L182 omatonBuilderFactory]: Interpolants [601#true, 602#false, 603#(= |#valid| |old(#valid)|), 604#(= (store |#valid| |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|)) |old(#valid)|)] [2018-02-04 15:07:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 15:07:22,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:07:22,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:07:22,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:07:22,885 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 4 states. [2018-02-04 15:07:22,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:22,921 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-02-04 15:07:22,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:07:22,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-02-04 15:07:22,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:22,921 INFO L225 Difference]: With dead ends: 49 [2018-02-04 15:07:22,921 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 15:07:22,922 INFO L554 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-02-04 15:07:22,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 15:07:22,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 15:07:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 15:07:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 15:07:22,922 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-02-04 15:07:22,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:22,922 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 15:07:22,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:07:22,923 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 15:07:22,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 15:07:22,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:07:22 BoogieIcfgContainer [2018-02-04 15:07:22,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 15:07:22,928 INFO L168 Benchmark]: Toolchain (without parser) took 1864.65 ms. Allocated memory was 406.3 MB in the beginning and 606.6 MB in the end (delta: 200.3 MB). Free memory was 364.3 MB in the beginning and 418.0 MB in the end (delta: -53.7 MB). Peak memory consumption was 146.6 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:22,929 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 406.3 MB. Free memory is still 369.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 15:07:22,929 INFO L168 Benchmark]: CACSL2BoogieTranslator took 141.76 ms. Allocated memory is still 406.3 MB. Free memory was 363.0 MB in the beginning and 353.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:22,929 INFO L168 Benchmark]: Boogie Preprocessor took 21.50 ms. Allocated memory is still 406.3 MB. Free memory was 353.7 MB in the beginning and 351.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:22,930 INFO L168 Benchmark]: RCFGBuilder took 143.81 ms. Allocated memory is still 406.3 MB. Free memory was 351.1 MB in the beginning and 333.8 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:22,930 INFO L168 Benchmark]: TraceAbstraction took 1555.26 ms. Allocated memory was 406.3 MB in the beginning and 606.6 MB in the end (delta: 200.3 MB). Free memory was 333.8 MB in the beginning and 418.0 MB in the end (delta: -84.2 MB). Peak memory consumption was 116.0 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:22,931 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.10 ms. Allocated memory is still 406.3 MB. Free memory is still 369.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 141.76 ms. Allocated memory is still 406.3 MB. Free memory was 363.0 MB in the beginning and 353.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.50 ms. Allocated memory is still 406.3 MB. Free memory was 353.7 MB in the beginning and 351.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 143.81 ms. Allocated memory is still 406.3 MB. Free memory was 351.1 MB in the beginning and 333.8 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1555.26 ms. Allocated memory was 406.3 MB in the beginning and 606.6 MB in the end (delta: 200.3 MB). Free memory was 333.8 MB in the beginning and 418.0 MB in the end (delta: -84.2 MB). Peak memory consumption was 116.0 MB. Max. memory is 5.3 GB. * 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: 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: 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: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 7 error locations. SAFE Result, 1.5s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 164 SDtfs, 291 SDslu, 491 SDs, 0 SdLazy, 345 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 6/10 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 33 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 11140 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 6/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/stroeder2-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_15-07-22-935.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/stroeder2-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_15-07-22-935.csv Received shutdown request...