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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:46:41,751 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:46:41,752 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:46:41,764 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:46:41,764 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:46:41,765 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:46:41,766 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:46:41,768 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:46:41,769 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:46:41,769 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:46:41,770 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:46:41,770 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:46:41,771 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:46:41,772 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:46:41,773 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:46:41,775 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:46:41,776 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:46:41,777 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:46:41,778 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:46:41,779 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:46:41,781 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:46:41,781 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:46:41,781 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:46:41,782 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:46:41,783 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:46:41,784 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:46:41,784 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:46:41,785 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:46:41,785 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:46:41,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:46:41,786 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:46:41,786 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 09:46:41,796 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:46:41,796 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:46:41,797 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:46:41,797 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:46:41,797 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:46:41,798 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:46:41,798 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:46:41,798 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:46:41,798 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:46:41,798 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:46:41,798 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:46:41,799 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:46:41,799 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:46:41,799 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:46:41,799 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:46:41,799 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:46:41,799 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:46:41,800 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:46:41,800 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:46:41,800 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:46:41,800 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:46:41,800 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:46:41,800 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 09:46:41,828 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:46:41,838 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:46:41,841 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:46:41,842 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:46:41,842 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:46:41,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:46:41,961 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:46:41,962 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:46:41,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:46:41,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:46:41,967 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:46:41,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:46:41" (1/1) ... [2018-02-02 09:46:41,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309783a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:41, skipping insertion in model container [2018-02-02 09:46:41,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:46:41" (1/1) ... [2018-02-02 09:46:41,983 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:46:42,013 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:46:42,101 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:46:42,116 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:46:42,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:42 WrapperNode [2018-02-02 09:46:42,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:46:42,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:46:42,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:46:42,123 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:46:42,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:42" (1/1) ... [2018-02-02 09:46:42,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:42" (1/1) ... [2018-02-02 09:46:42,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:42" (1/1) ... [2018-02-02 09:46:42,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:42" (1/1) ... [2018-02-02 09:46:42,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:42" (1/1) ... [2018-02-02 09:46:42,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:42" (1/1) ... [2018-02-02 09:46:42,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:42" (1/1) ... [2018-02-02 09:46:42,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:46:42,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:46:42,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:46:42,159 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:46:42,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:42" (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-02 09:46:42,205 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:46:42,205 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:46:42,206 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-02-02 09:46:42,206 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:46:42,206 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:46:42,206 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:46:42,206 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:46:42,206 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:46:42,206 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:46:42,206 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:46:42,206 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-02-02 09:46:42,207 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:46:42,207 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:46:42,207 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:46:42,357 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:46:42,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:46:42 BoogieIcfgContainer [2018-02-02 09:46:42,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:46:42,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:46:42,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:46:42,360 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:46:42,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:46:41" (1/3) ... [2018-02-02 09:46:42,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439f9c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:46:42, skipping insertion in model container [2018-02-02 09:46:42,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:46:42" (2/3) ... [2018-02-02 09:46:42,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439f9c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:46:42, skipping insertion in model container [2018-02-02 09:46:42,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:46:42" (3/3) ... [2018-02-02 09:46:42,362 INFO L107 eAbstractionObserver]: Analyzing ICFG array03-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:46:42,369 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:46:42,374 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-02 09:46:42,404 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:46:42,404 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:46:42,404 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 09:46:42,404 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 09:46:42,404 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:46:42,404 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:46:42,404 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:46:42,405 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:46:42,405 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:46:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-02-02 09:46:42,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:46:42,420 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:42,421 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:42,421 INFO L371 AbstractCegarLoop]: === Iteration 1 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:46:42,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1616393893, now seen corresponding path program 1 times [2018-02-02 09:46:42,461 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:42,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:42,571 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-02 09:46:42,573 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:46:42,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:46:42,575 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:42,575 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-02 09:46:42,576 INFO L182 omatonBuilderFactory]: Interpolants [54#true, 55#false, 56#(= 1 (select |#valid| |main_#t~malloc9.base|)), 57#(= 1 (select |#valid| main_~numbers~0.base)), 58#(= 1 (select |#valid| |test_fun_#in~a.base|)), 59#(= 1 (select |#valid| test_fun_~a.base))] [2018-02-02 09:46:42,576 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-02 09:46:42,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:46:42,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:46:42,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:46:42,588 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 6 states. [2018-02-02 09:46:42,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:42,787 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-02-02 09:46:42,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:46:42,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-02-02 09:46:42,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:42,796 INFO L225 Difference]: With dead ends: 44 [2018-02-02 09:46:42,796 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 09:46:42,797 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:46:42,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 09:46:42,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-02 09:46:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 09:46:42,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-02 09:46:42,822 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2018-02-02 09:46:42,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:42,823 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-02 09:46:42,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:46:42,823 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-02 09:46:42,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:46:42,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:42,823 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:42,823 INFO L371 AbstractCegarLoop]: === Iteration 2 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:46:42,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1616393894, now seen corresponding path program 1 times [2018-02-02 09:46:42,824 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:42,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:42,926 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-02 09:46:42,926 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:46:42,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:46:42,927 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:42,927 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-02 09:46:42,927 INFO L182 omatonBuilderFactory]: Interpolants [149#true, 150#false, 151#(<= 1 main_~array_size~0), 152#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|) (<= 1 main_~array_size~0)), 153#(and (= 0 main_~numbers~0.offset) (= (* 4 main_~array_size~0) (select |#length| main_~numbers~0.base)) (<= 1 main_~array_size~0)), 154#(and (<= 4 (select |#length| |test_fun_#in~a.base|)) (= 0 |test_fun_#in~a.offset|)), 155#(and (<= 4 (select |#length| test_fun_~a.base)) (= test_fun_~i~0 0) (= test_fun_~a.offset 0))] [2018-02-02 09:46:42,927 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-02 09:46:42,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:46:42,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:46:42,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:46:42,929 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2018-02-02 09:46:43,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:43,071 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-02-02 09:46:43,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:46:43,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-02 09:46:43,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:43,074 INFO L225 Difference]: With dead ends: 60 [2018-02-02 09:46:43,074 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 09:46:43,075 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:46:43,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 09:46:43,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-02-02 09:46:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 09:46:43,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2018-02-02 09:46:43,080 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 14 [2018-02-02 09:46:43,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:43,081 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-02-02 09:46:43,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:46:43,081 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-02-02 09:46:43,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 09:46:43,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:43,082 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:43,082 INFO L371 AbstractCegarLoop]: === Iteration 3 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:46:43,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1978668179, now seen corresponding path program 1 times [2018-02-02 09:46:43,083 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:43,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:43,126 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-02 09:46:43,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:46:43,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:46:43,127 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:43,127 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-02 09:46:43,127 INFO L182 omatonBuilderFactory]: Interpolants [277#true, 278#false, 279#(<= 1 main_~array_size~0), 280#(and (= test_fun_~i~0 0) (<= |test_fun_#in~N| test_fun_~N)), 281#(<= |test_fun_#in~N| 0)] [2018-02-02 09:46:43,128 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-02 09:46:43,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:46:43,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:46:43,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:46:43,128 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 5 states. [2018-02-02 09:46:43,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:43,184 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-02-02 09:46:43,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:46:43,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 09:46:43,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:43,185 INFO L225 Difference]: With dead ends: 60 [2018-02-02 09:46:43,185 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 09:46:43,185 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-02 09:46:43,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 09:46:43,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-02-02 09:46:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 09:46:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-02-02 09:46:43,188 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 18 [2018-02-02 09:46:43,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:43,188 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-02-02 09:46:43,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:46:43,188 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-02-02 09:46:43,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:46:43,189 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:43,189 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:43,189 INFO L371 AbstractCegarLoop]: === Iteration 4 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:46:43,189 INFO L82 PathProgramCache]: Analyzing trace with hash 35069262, now seen corresponding path program 1 times [2018-02-02 09:46:43,190 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:43,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:43,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:46:43,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:46:43,286 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:43,286 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-02 09:46:43,287 INFO L182 omatonBuilderFactory]: Interpolants [401#true, 402#false, 403#(<= main_~array_size~0 1), 404#(and (= 0 |main_#t~malloc9.offset|) (<= main_~array_size~0 1)), 405#(and (<= main_~array_size~0 1) (= 0 main_~numbers~0.offset)), 406#(and (<= |test_fun_#in~N| 1) (= 0 |test_fun_#in~a.offset|)), 407#(and (= test_fun_~a.offset 0) (<= test_fun_~N 1)), 408#(and (<= (* 4 test_fun_~N) (+ (* 4 test_fun_~i~0) test_fun_~a.offset 4)) (= test_fun_~a.offset 0)), 409#(and (= test_fun_~a.offset 0) (<= (* 4 test_fun_~N) (+ (* 4 test_fun_~i~0) test_fun_~a.offset)))] [2018-02-02 09:46:43,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:43,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:46:43,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:46:43,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:46:43,288 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 9 states. [2018-02-02 09:46:43,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:43,385 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-02-02 09:46:43,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:46:43,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-02 09:46:43,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:43,386 INFO L225 Difference]: With dead ends: 86 [2018-02-02 09:46:43,386 INFO L226 Difference]: Without dead ends: 86 [2018-02-02 09:46:43,387 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:46:43,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-02 09:46:43,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2018-02-02 09:46:43,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 09:46:43,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-02-02 09:46:43,391 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 23 [2018-02-02 09:46:43,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:43,391 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-02-02 09:46:43,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:46:43,391 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-02-02 09:46:43,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:46:43,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:43,392 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:46:43,392 INFO L371 AbstractCegarLoop]: === Iteration 5 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:46:43,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1553278640, now seen corresponding path program 1 times [2018-02-02 09:46:43,392 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:43,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:43,488 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:46:43,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 09:46:43,488 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:43,488 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-02 09:46:43,488 INFO L182 omatonBuilderFactory]: Interpolants [592#(and (= test_fun_~a.offset 0) (<= (+ (* 4 test_fun_~i~0) 4) (select |#length| test_fun_~a.base)) (<= 4 (+ (* 4 test_fun_~i~0) test_fun_~a.offset))), 584#true, 585#false, 586#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|)), 587#(and (= 0 main_~numbers~0.offset) (= (* 4 main_~array_size~0) (select |#length| main_~numbers~0.base))), 588#(and (<= (* 4 |test_fun_#in~N|) (select |#length| |test_fun_#in~a.base|)) (= 0 |test_fun_#in~a.offset|)), 589#(and (= test_fun_~a.offset 0) (<= (* 4 test_fun_~N) (select |#length| test_fun_~a.base))), 590#(and (= test_fun_~a.offset 0) (<= (* 4 test_fun_~N) (select |#length| test_fun_~a.base)) (<= 0 (+ (* 4 test_fun_~i~0) test_fun_~a.offset))), 591#(and (= test_fun_~a.offset 0) (<= (* 4 test_fun_~N) (select |#length| test_fun_~a.base)) (<= 4 (+ (* 4 test_fun_~i~0) test_fun_~a.offset)))] [2018-02-02 09:46:43,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:46:43,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:46:43,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:46:43,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:46:43,489 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 9 states. [2018-02-02 09:46:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:43,622 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-02-02 09:46:43,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:46:43,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-02 09:46:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:43,623 INFO L225 Difference]: With dead ends: 76 [2018-02-02 09:46:43,623 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 09:46:43,624 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:46:43,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 09:46:43,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2018-02-02 09:46:43,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 09:46:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-02-02 09:46:43,629 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 23 [2018-02-02 09:46:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:43,630 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-02-02 09:46:43,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:46:43,630 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-02-02 09:46:43,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 09:46:43,631 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:46:43,631 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, 1] [2018-02-02 09:46:43,631 INFO L371 AbstractCegarLoop]: === Iteration 6 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:46:43,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1156880581, now seen corresponding path program 1 times [2018-02-02 09:46:43,632 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:46:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:46:43,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:46:43,707 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-02 09:46:43,708 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:46:43,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:46:43,708 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:46:43,708 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-02 09:46:43,708 INFO L182 omatonBuilderFactory]: Interpolants [738#true, 739#false, 740#(= |#valid| |old(#valid)|), 741#(= (store |#valid| |main_#t~malloc9.base| 0) |old(#valid)|)] [2018-02-02 09:46:43,709 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-02 09:46:43,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:46:43,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:46:43,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:46:43,709 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 4 states. [2018-02-02 09:46:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:46:43,765 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-02-02 09:46:43,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:46:43,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-02-02 09:46:43,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:46:43,766 INFO L225 Difference]: With dead ends: 60 [2018-02-02 09:46:43,767 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 09:46:43,767 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-02 09:46:43,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 09:46:43,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 09:46:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 09:46:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 09:46:43,768 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-02-02 09:46:43,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:46:43,768 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 09:46:43,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:46:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 09:46:43,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 09:46:43,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:46:43 BoogieIcfgContainer [2018-02-02 09:46:43,773 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:46:43,774 INFO L168 Benchmark]: Toolchain (without parser) took 1812.25 ms. Allocated memory was 401.1 MB in the beginning and 630.7 MB in the end (delta: 229.6 MB). Free memory was 359.3 MB in the beginning and 599.1 MB in the end (delta: -239.8 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:46:43,774 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 401.1 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:46:43,775 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.94 ms. Allocated memory is still 401.1 MB. Free memory was 358.0 MB in the beginning and 347.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:46:43,775 INFO L168 Benchmark]: Boogie Preprocessor took 35.01 ms. Allocated memory is still 401.1 MB. Free memory was 347.4 MB in the beginning and 346.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:46:43,775 INFO L168 Benchmark]: RCFGBuilder took 199.19 ms. Allocated memory is still 401.1 MB. Free memory was 346.1 MB in the beginning and 326.7 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:46:43,775 INFO L168 Benchmark]: TraceAbstraction took 1415.08 ms. Allocated memory was 401.1 MB in the beginning and 630.7 MB in the end (delta: 229.6 MB). Free memory was 326.7 MB in the beginning and 599.1 MB in the end (delta: -272.4 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:46:43,776 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.15 ms. Allocated memory is still 401.1 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 159.94 ms. Allocated memory is still 401.1 MB. Free memory was 358.0 MB in the beginning and 347.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.01 ms. Allocated memory is still 401.1 MB. Free memory was 347.4 MB in the beginning and 346.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 199.19 ms. Allocated memory is still 401.1 MB. Free memory was 346.1 MB in the beginning and 326.7 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1415.08 ms. Allocated memory was 401.1 MB in the beginning and 630.7 MB in the end (delta: 229.6 MB). Free memory was 326.7 MB in the beginning and 599.1 MB in the end (delta: -272.4 MB). There was no memory consumed. 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: 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: 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: 558]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 51 locations, 15 error locations. SAFE Result, 1.3s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 180 SDtfs, 351 SDslu, 457 SDs, 0 SdLazy, 440 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 5/8 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, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 12314 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 5/8 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/array03-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-46-43-784.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array03-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-46-43-784.csv Received shutdown request...