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_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/array-memsafety/stroeder1-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:31:58,973 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:31:58,975 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:31:58,990 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:31:58,990 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:31:58,991 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:31:58,993 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:31:58,994 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:31:58,996 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:31:58,997 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:31:58,998 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:31:58,998 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:31:58,999 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:31:59,000 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:31:59,001 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:31:59,004 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:31:59,006 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:31:59,008 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:31:59,010 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:31:59,011 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:31:59,013 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:31:59,013 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:31:59,014 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:31:59,015 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:31:59,016 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:31:59,017 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:31:59,017 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:31:59,018 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:31:59,018 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:31:59,018 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:31:59,019 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:31:59,019 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 05:31:59,028 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:31:59,028 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:31:59,029 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:31:59,029 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:31:59,029 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:31:59,029 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:31:59,029 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:31:59,030 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:31:59,030 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:31:59,030 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:31:59,030 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:31:59,031 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:31:59,031 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:31:59,031 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:31:59,031 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:31:59,031 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:31:59,031 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:31:59,031 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:31:59,031 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:31:59,032 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:31:59,032 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:31:59,032 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:31:59,032 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:31:59,032 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:31:59,032 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:31:59,033 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:31:59,033 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:31:59,033 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:31:59,033 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:31:59,033 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:31:59,033 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:31:59,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:31:59,034 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:31:59,034 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:31:59,034 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:31:59,035 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:31:59,066 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:31:59,077 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:31:59,080 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:31:59,081 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:31:59,081 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:31:59,082 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-25 05:31:59,247 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:31:59,253 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:31:59,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:31:59,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:31:59,259 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:31:59,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:31:59" (1/1) ... [2018-01-25 05:31:59,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d3f258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:59, skipping insertion in model container [2018-01-25 05:31:59,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:31:59" (1/1) ... [2018-01-25 05:31:59,276 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:31:59,313 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:31:59,424 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:31:59,441 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:31:59,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:59 WrapperNode [2018-01-25 05:31:59,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:31:59,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:31:59,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:31:59,449 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:31:59,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:59" (1/1) ... [2018-01-25 05:31:59,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:59" (1/1) ... [2018-01-25 05:31:59,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:59" (1/1) ... [2018-01-25 05:31:59,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:59" (1/1) ... [2018-01-25 05:31:59,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:59" (1/1) ... [2018-01-25 05:31:59,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:59" (1/1) ... [2018-01-25 05:31:59,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:59" (1/1) ... [2018-01-25 05:31:59,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:31:59,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:31:59,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:31:59,485 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:31:59,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:59" (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-25 05:31:59,534 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:31:59,534 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:31:59,534 INFO L136 BoogieDeclarations]: Found implementation of procedure sumOfThirdBytes [2018-01-25 05:31:59,534 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:31:59,534 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:31:59,534 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:31:59,534 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:31:59,535 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:31:59,535 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:31:59,535 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:31:59,535 INFO L128 BoogieDeclarations]: Found specification of procedure sumOfThirdBytes [2018-01-25 05:31:59,535 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:31:59,535 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:31:59,535 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:31:59,661 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:31:59,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:31:59 BoogieIcfgContainer [2018-01-25 05:31:59,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:31:59,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:31:59,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:31:59,664 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:31:59,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:31:59" (1/3) ... [2018-01-25 05:31:59,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3367146e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:31:59, skipping insertion in model container [2018-01-25 05:31:59,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:59" (2/3) ... [2018-01-25 05:31:59,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3367146e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:31:59, skipping insertion in model container [2018-01-25 05:31:59,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:31:59" (3/3) ... [2018-01-25 05:31:59,668 INFO L105 eAbstractionObserver]: Analyzing ICFG stroeder1-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:31:59,674 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:31:59,679 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-25 05:31:59,714 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:31:59,715 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:31:59,715 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:31:59,715 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:31:59,715 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:31:59,715 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:31:59,715 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:31:59,716 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:31:59,716 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:31:59,737 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-01-25 05:31:59,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:31:59,744 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:31:59,745 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:31:59,745 INFO L371 AbstractCegarLoop]: === Iteration 1 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:31:59,751 INFO L82 PathProgramCache]: Analyzing trace with hash -443509723, now seen corresponding path program 1 times [2018-01-25 05:31:59,754 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:31:59,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:59,811 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:59,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:59,811 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:31:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:59,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:00,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-01-25 05:32:00,005 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:00,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:32:00,006 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:00,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:32:00,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:32:00,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:32:00,027 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 7 states. [2018-01-25 05:32:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:00,255 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-01-25 05:32:00,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:32:00,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-25 05:32:00,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:00,265 INFO L225 Difference]: With dead ends: 45 [2018-01-25 05:32:00,265 INFO L226 Difference]: Without dead ends: 30 [2018-01-25 05:32:00,268 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-25 05:32:00,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-25 05:32:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2018-01-25 05:32:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-25 05:32:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-01-25 05:32:00,295 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 14 [2018-01-25 05:32:00,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:00,295 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-01-25 05:32:00,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:32:00,296 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-01-25 05:32:00,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:32:00,296 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:00,296 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:00,296 INFO L371 AbstractCegarLoop]: === Iteration 2 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:32:00,296 INFO L82 PathProgramCache]: Analyzing trace with hash -443509722, now seen corresponding path program 1 times [2018-01-25 05:32:00,296 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:00,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:00,297 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:00,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:00,298 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:00,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:00,484 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-25 05:32:00,484 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:00,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:32:00,485 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:00,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:32:00,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:32:00,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:32:00,489 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 7 states. [2018-01-25 05:32:00,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:00,732 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-01-25 05:32:00,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:32:00,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-25 05:32:00,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:00,734 INFO L225 Difference]: With dead ends: 39 [2018-01-25 05:32:00,734 INFO L226 Difference]: Without dead ends: 38 [2018-01-25 05:32:00,735 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-25 05:32:00,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-25 05:32:00,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-01-25 05:32:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-25 05:32:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-01-25 05:32:00,746 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 14 [2018-01-25 05:32:00,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:00,747 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-01-25 05:32:00,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:32:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-01-25 05:32:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:32:00,748 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:00,748 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:00,748 INFO L371 AbstractCegarLoop]: === Iteration 3 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:32:00,748 INFO L82 PathProgramCache]: Analyzing trace with hash -537553629, now seen corresponding path program 1 times [2018-01-25 05:32:00,749 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:00,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:00,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:00,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:00,752 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:00,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:00,880 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-25 05:32:00,880 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:00,880 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:32:00,882 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-01-25 05:32:00,883 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [15], [17], [26], [29], [33], [34], [41], [42], [43], [45] [2018-01-25 05:32:00,929 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:32:00,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:32:01,192 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:32:01,193 INFO L268 AbstractInterpreter]: Visited 17 different actions 23 times. Merged at 6 different actions 6 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-01-25 05:32:01,207 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:32:01,207 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:01,208 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:32:01,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:01,219 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:32:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:01,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:01,371 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-25 05:32:01,372 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:01,423 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-25 05:32:01,456 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:32:01,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [10] total 15 [2018-01-25 05:32:01,457 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:01,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:32:01,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:32:01,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:32:01,458 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 6 states. [2018-01-25 05:32:01,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:01,519 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-01-25 05:32:01,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:32:01,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 05:32:01,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:01,520 INFO L225 Difference]: With dead ends: 64 [2018-01-25 05:32:01,520 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 05:32:01,521 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-01-25 05:32:01,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 05:32:01,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-01-25 05:32:01,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 05:32:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-01-25 05:32:01,538 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 19 [2018-01-25 05:32:01,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:01,538 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-01-25 05:32:01,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:32:01,538 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-01-25 05:32:01,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:32:01,539 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:01,539 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:01,539 INFO L371 AbstractCegarLoop]: === Iteration 4 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:32:01,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1124359643, now seen corresponding path program 1 times [2018-01-25 05:32:01,539 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:01,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:01,540 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:01,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:01,540 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:01,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:01,688 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-25 05:32:01,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:01,689 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:32:01,689 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-01-25 05:32:01,689 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [15], [17], [26], [31], [33], [34], [41], [42], [43], [45] [2018-01-25 05:32:01,690 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:32:01,690 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:32:01,840 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:32:01,840 INFO L268 AbstractInterpreter]: Visited 17 different actions 23 times. Merged at 6 different actions 6 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-01-25 05:32:01,850 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:32:01,850 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:01,851 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 05:32:01,864 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:01,865 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:32:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:01,884 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:01,905 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-25 05:32:01,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:01,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:01,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 05:32:02,075 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-25 05:32:02,075 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:02,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:02,359 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:02,359 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:32:02,362 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:02,363 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:32:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:02,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:02,393 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-25 05:32:02,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:02,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:02,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 05:32:02,433 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-25 05:32:02,433 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:02,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:02,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:32:02,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 7, 7] total 19 [2018-01-25 05:32:02,503 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:32:02,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-25 05:32:02,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-25 05:32:02,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-01-25 05:32:02,505 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 14 states. [2018-01-25 05:32:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:02,818 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-01-25 05:32:02,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:32:02,818 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2018-01-25 05:32:02,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:02,820 INFO L225 Difference]: With dead ends: 55 [2018-01-25 05:32:02,820 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 05:32:02,820 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2018-01-25 05:32:02,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 05:32:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2018-01-25 05:32:02,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-25 05:32:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-01-25 05:32:02,829 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 19 [2018-01-25 05:32:02,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:02,829 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-01-25 05:32:02,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-25 05:32:02,830 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-01-25 05:32:02,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:32:02,830 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:02,831 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-25 05:32:02,831 INFO L371 AbstractCegarLoop]: === Iteration 5 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:32:02,831 INFO L82 PathProgramCache]: Analyzing trace with hash 950757514, now seen corresponding path program 1 times [2018-01-25 05:32:02,831 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:02,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:02,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:02,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:02,832 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:02,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:02,877 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-25 05:32:02,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:02,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:32:02,877 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:02,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:32:02,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:32:02,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:32:02,878 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 5 states. [2018-01-25 05:32:02,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:02,906 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-01-25 05:32:02,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:32:02,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 05:32:02,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:02,907 INFO L225 Difference]: With dead ends: 54 [2018-01-25 05:32:02,907 INFO L226 Difference]: Without dead ends: 43 [2018-01-25 05:32:02,908 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-25 05:32:02,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-25 05:32:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-01-25 05:32:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-25 05:32:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-01-25 05:32:02,916 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 20 [2018-01-25 05:32:02,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:02,916 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-01-25 05:32:02,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:32:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-01-25 05:32:02,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 05:32:02,917 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:02,918 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-25 05:32:02,918 INFO L371 AbstractCegarLoop]: === Iteration 6 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:32:02,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1524168647, now seen corresponding path program 1 times [2018-01-25 05:32:02,918 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:02,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:02,919 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:02,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:02,919 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:02,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:02,988 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-25 05:32:02,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:02,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:32:02,989 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:02,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:32:02,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:32:02,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:32:02,989 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 4 states. [2018-01-25 05:32:03,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:03,023 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-01-25 05:32:03,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:32:03,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-25 05:32:03,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:03,024 INFO L225 Difference]: With dead ends: 40 [2018-01-25 05:32:03,024 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 05:32:03,025 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-25 05:32:03,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 05:32:03,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 05:32:03,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 05:32:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 05:32:03,025 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-25 05:32:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:03,025 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 05:32:03,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:32:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 05:32:03,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 05:32:03,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 05:32:03,484 WARN L146 SmtUtils]: Spent 353ms on a formula simplification. DAG size of input: 72 DAG size of output 52 [2018-01-25 05:32:03,499 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-25 05:32:03,499 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:32:03,499 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-25 05:32:03,499 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesErr1RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-25 05:32:03,499 INFO L397 ceAbstractionStarter]: At program point L545'''(lines 545 549) the Hoare annotation is: (let ((.cse0 (not (= (select |#valid| |sumOfThirdBytes_#in~numbers.base|) 1))) (.cse4 (<= 1 sumOfThirdBytes_~i~2)) (.cse1 (not (exists ((v_main_~array_size~4_BEFORE_CALL_4 Int)) (and (<= |sumOfThirdBytes_#in~array_size| v_main_~array_size~4_BEFORE_CALL_4) (= (select |#length| |sumOfThirdBytes_#in~numbers.base|) (* 4 v_main_~array_size~4_BEFORE_CALL_4)))))) (.cse3 (not (= 0 |sumOfThirdBytes_#in~numbers.offset|)))) (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 .cse2 .cse4))) (or .cse0 (let ((.cse5 (= 1 (select |#valid| |sumOfThirdBytes_~#numbers.base|))) (.cse6 (exists ((v_main_~array_size~4_BEFORE_CALL_4 Int)) (and (<= sumOfThirdBytes_~array_size v_main_~array_size~4_BEFORE_CALL_4) (= (select |#length| |sumOfThirdBytes_~#numbers.base|) (* 4 v_main_~array_size~4_BEFORE_CALL_4))))) (.cse7 (= |sumOfThirdBytes_~#numbers.offset| 0))) (or (and .cse4 (<= sumOfThirdBytes_~p~2.offset (+ |sumOfThirdBytes_~#numbers.offset| (* 4 sumOfThirdBytes_~i~2) 2)) .cse5 .cse6 .cse7) (and (= sumOfThirdBytes_~i~2 0) .cse5 .cse6 .cse7))) .cse1 .cse3))) [2018-01-25 05:32:03,500 INFO L401 ceAbstractionStarter]: For program point L545(lines 545 549) no Hoare annotation was computed. [2018-01-25 05:32:03,500 INFO L401 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-25 05:32:03,500 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesFINAL(lines 540 551) no Hoare annotation was computed. [2018-01-25 05:32:03,500 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesErr0RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-25 05:32:03,500 INFO L401 ceAbstractionStarter]: For program point L545''''(lines 545 549) no Hoare annotation was computed. [2018-01-25 05:32:03,500 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesEXIT(lines 540 551) no Hoare annotation was computed. [2018-01-25 05:32:03,500 INFO L404 ceAbstractionStarter]: At program point sumOfThirdBytesENTRY(lines 540 551) the Hoare annotation is: true [2018-01-25 05:32:03,500 INFO L401 ceAbstractionStarter]: For program point L545''(lines 545 549) no Hoare annotation was computed. [2018-01-25 05:32:03,500 INFO L401 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-25 05:32:03,500 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 559) the Hoare annotation is: true [2018-01-25 05:32:03,500 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-25 05:32:03,500 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 559) the Hoare annotation is: true [2018-01-25 05:32:03,500 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-25 05:32:03,501 INFO L401 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-25 05:32:03,501 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 552 559) no Hoare annotation was computed. [2018-01-25 05:32:03,501 INFO L401 ceAbstractionStarter]: For program point L554(lines 554 556) no Hoare annotation was computed. [2018-01-25 05:32:03,501 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-25 05:32:03,501 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 552 559) no Hoare annotation was computed. [2018-01-25 05:32:03,501 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 552 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:32:03,501 INFO L401 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-25 05:32:03,501 INFO L401 ceAbstractionStarter]: For program point L554''(lines 554 556) no Hoare annotation was computed. [2018-01-25 05:32:03,501 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-25 05:32:03,501 INFO L401 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-25 05:32:03,501 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 552 559) no Hoare annotation was computed. [2018-01-25 05:32:03,507 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,508 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,508 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,509 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,509 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,509 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,510 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,510 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,512 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:03,512 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:03,513 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:03,513 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:03,517 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,518 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,518 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,518 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,518 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,519 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,519 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,519 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,519 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:03,520 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:03,520 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:03,520 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:03,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:32:03 BoogieIcfgContainer [2018-01-25 05:32:03,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:32:03,525 INFO L168 Benchmark]: Toolchain (without parser) took 4276.67 ms. Allocated memory was 302.0 MB in the beginning and 512.2 MB in the end (delta: 210.2 MB). Free memory was 262.0 MB in the beginning and 378.7 MB in the end (delta: -116.6 MB). Peak memory consumption was 93.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:03,526 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 302.0 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:32:03,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.29 ms. Allocated memory is still 302.0 MB. Free memory was 261.0 MB in the beginning and 251.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:03,526 INFO L168 Benchmark]: Boogie Preprocessor took 35.24 ms. Allocated memory is still 302.0 MB. Free memory was 251.0 MB in the beginning and 250.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-25 05:32:03,527 INFO L168 Benchmark]: RCFGBuilder took 177.27 ms. Allocated memory is still 302.0 MB. Free memory was 250.0 MB in the beginning and 235.3 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:03,527 INFO L168 Benchmark]: TraceAbstraction took 3861.61 ms. Allocated memory was 302.0 MB in the beginning and 512.2 MB in the end (delta: 210.2 MB). Free memory was 235.3 MB in the beginning and 378.7 MB in the end (delta: -143.3 MB). Peak memory consumption was 66.9 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:03,529 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.14 ms. Allocated memory is still 302.0 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 194.29 ms. Allocated memory is still 302.0 MB. Free memory was 261.0 MB in the beginning and 251.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.24 ms. Allocated memory is still 302.0 MB. Free memory was 251.0 MB in the beginning and 250.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 177.27 ms. Allocated memory is still 302.0 MB. Free memory was 250.0 MB in the beginning and 235.3 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3861.61 ms. Allocated memory was 302.0 MB in the beginning and 512.2 MB in the end (delta: 210.2 MB). Free memory was 235.3 MB in the beginning and 378.7 MB in the end (delta: -143.3 MB). Peak memory consumption was 66.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 16 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 121 LocStat_NO_SUPPORTING_DISEQUALITIES : 11 LocStat_NO_DISJUNCTIONS : -32 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 23 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 37 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 24 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.280673 RENAME_VARIABLES(MILLISECONDS) : 0.338870 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.235188 PROJECTAWAY(MILLISECONDS) : 0.203924 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.189840 DISJOIN(MILLISECONDS) : 0.480980 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.372545 ADD_EQUALITY(MILLISECONDS) : 0.042357 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.041222 #CONJOIN_DISJUNCTIVE : 38 #RENAME_VARIABLES : 61 #UNFREEZE : 0 #CONJOIN : 64 #PROJECTAWAY : 55 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 59 #ADD_EQUALITY : 37 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 16 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 119 LocStat_NO_SUPPORTING_DISEQUALITIES : 11 LocStat_NO_DISJUNCTIONS : -32 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 23 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 38 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 24 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.061325 RENAME_VARIABLES(MILLISECONDS) : 0.354861 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.990200 PROJECTAWAY(MILLISECONDS) : 0.238471 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.101130 DISJOIN(MILLISECONDS) : 0.372899 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.393180 ADD_EQUALITY(MILLISECONDS) : 0.027412 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.040366 #CONJOIN_DISJUNCTIVE : 38 #RENAME_VARIABLES : 61 #UNFREEZE : 0 #CONJOIN : 64 #PROJECTAWAY : 55 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 59 #ADD_EQUALITY : 38 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 * 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_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,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-25 05:32:03,538 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,538 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,539 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,539 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,539 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,540 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,540 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,540 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,540 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:03,540 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:03,541 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:03,541 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:03,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~4_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:32:03,546 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:03,546 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:03,547 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:03,547 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((!(\valid[numbers] == 1) || !(\exists v_main_~array_size~4_BEFORE_CALL_4 : int :: \old(array_size) <= v_main_~array_size~4_BEFORE_CALL_4 && unknown-#length-unknown[numbers] == 4 * v_main_~array_size~4_BEFORE_CALL_4)) || (array_size <= 1 && \old(array_size) <= array_size)) || 1 < \old(array_size)) || !(0 == numbers)) || (array_size <= 1 && 1 <= i)) && (((!(\valid[numbers] == 1) || ((((1 <= i && p <= numbers + 4 * i + 2) && 1 == \valid[numbers]) && (\exists v_main_~array_size~4_BEFORE_CALL_4 : int :: array_size <= v_main_~array_size~4_BEFORE_CALL_4 && unknown-#length-unknown[numbers] == 4 * v_main_~array_size~4_BEFORE_CALL_4)) && numbers == 0) || (((i == 0 && 1 == \valid[numbers]) && (\exists v_main_~array_size~4_BEFORE_CALL_4 : int :: array_size <= v_main_~array_size~4_BEFORE_CALL_4 && unknown-#length-unknown[numbers] == 4 * v_main_~array_size~4_BEFORE_CALL_4)) && numbers == 0)) || !(\exists v_main_~array_size~4_BEFORE_CALL_4 : int :: \old(array_size) <= v_main_~array_size~4_BEFORE_CALL_4 && unknown-#length-unknown[numbers] == 4 * v_main_~array_size~4_BEFORE_CALL_4)) || !(0 == numbers)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 3 error locations. SAFE Result, 3.7s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 135 SDtfs, 159 SDslu, 389 SDs, 0 SdLazy, 290 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 97 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.2s 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.4s AbstIntTime, 2 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, 635 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 213 ConstructedInterpolants, 34 QuantifiedInterpolants, 31647 SizeOfPredicates, 25 NumberOfNonLiveVariables, 250 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 15/26 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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-32-03-553.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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-32-03-553.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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-32-03-553.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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-32-03-553.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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-32-03-553.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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-32-03-553.csv Received shutdown request...