java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:16:58,006 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:16:58,007 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:16:58,017 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:16:58,017 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:16:58,018 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:16:58,019 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:16:58,021 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:16:58,022 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:16:58,022 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:16:58,023 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:16:58,023 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:16:58,024 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:16:58,025 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:16:58,026 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:16:58,028 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:16:58,029 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:16:58,031 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:16:58,032 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:16:58,033 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:16:58,034 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:16:58,035 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:16:58,035 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:16:58,036 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:16:58,036 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:16:58,037 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:16:58,038 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:16:58,038 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:16:58,038 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:16:58,038 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:16:58,039 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:16:58,039 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:16:58,049 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:16:58,049 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:16:58,050 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:16:58,050 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:16:58,050 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:16:58,050 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:16:58,051 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:16:58,051 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:16:58,051 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:16:58,051 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:16:58,051 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:16:58,051 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:16:58,051 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:16:58,052 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:16:58,052 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:16:58,052 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:16:58,052 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:16:58,052 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:16:58,052 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:16:58,052 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:16:58,053 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:16:58,053 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:16:58,053 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:16:58,053 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:16:58,080 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:16:58,095 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:16:58,098 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:16:58,101 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:16:58,101 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:16:58,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:16:58,250 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:16:58,251 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:16:58,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:16:58,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:16:58,258 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:16:58,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:16:58" (1/1) ... [2018-02-04 17:16:58,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@454f3215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:58, skipping insertion in model container [2018-02-04 17:16:58,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:16:58" (1/1) ... [2018-02-04 17:16:58,277 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:16:58,309 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:16:58,401 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:16:58,413 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:16:58,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:58 WrapperNode [2018-02-04 17:16:58,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:16:58,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:16:58,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:16:58,419 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:16:58,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:58" (1/1) ... [2018-02-04 17:16:58,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:58" (1/1) ... [2018-02-04 17:16:58,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:58" (1/1) ... [2018-02-04 17:16:58,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:58" (1/1) ... [2018-02-04 17:16:58,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:58" (1/1) ... [2018-02-04 17:16:58,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:58" (1/1) ... [2018-02-04 17:16:58,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:58" (1/1) ... [2018-02-04 17:16:58,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:16:58,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:16:58,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:16:58,447 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:16:58,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:58" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:16:58,482 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:16:58,483 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:16:58,483 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-02-04 17:16:58,483 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:16:58,483 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:16:58,483 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:16:58,483 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:16:58,483 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:16:58,483 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:16:58,484 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:16:58,484 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-02-04 17:16:58,484 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:16:58,484 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:16:58,484 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:16:58,617 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:16:58,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:16:58 BoogieIcfgContainer [2018-02-04 17:16:58,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:16:58,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:16:58,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:16:58,620 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:16:58,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:16:58" (1/3) ... [2018-02-04 17:16:58,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6465b1ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:16:58, skipping insertion in model container [2018-02-04 17:16:58,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:58" (2/3) ... [2018-02-04 17:16:58,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6465b1ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:16:58, skipping insertion in model container [2018-02-04 17:16:58,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:16:58" (3/3) ... [2018-02-04 17:16:58,622 INFO L107 eAbstractionObserver]: Analyzing ICFG array02-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:16:58,627 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:16:58,631 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-04 17:16:58,660 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:16:58,660 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:16:58,660 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:16:58,660 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:16:58,660 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:16:58,661 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:16:58,661 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:16:58,661 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:16:58,662 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:16:58,673 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-02-04 17:16:58,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 17:16:58,681 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:58,682 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:58,683 INFO L371 AbstractCegarLoop]: === Iteration 1 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:16:58,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1926055157, now seen corresponding path program 1 times [2018-02-04 17:16:58,690 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:58,690 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:58,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:58,735 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:58,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:58,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:58,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:58,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:16:58,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:16:58,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:16:58,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:16:58,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:16:58,880 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 6 states. [2018-02-04 17:16:59,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:59,010 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-02-04 17:16:59,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:16:59,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-04 17:16:59,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:59,016 INFO L225 Difference]: With dead ends: 43 [2018-02-04 17:16:59,017 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 17:16:59,018 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-04 17:16:59,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 17:16:59,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-04 17:16:59,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 17:16:59,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-04 17:16:59,081 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 15 [2018-02-04 17:16:59,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:59,082 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-04 17:16:59,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:16:59,082 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-04 17:16:59,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 17:16:59,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:59,082 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:59,083 INFO L371 AbstractCegarLoop]: === Iteration 2 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:16:59,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1926055156, now seen corresponding path program 1 times [2018-02-04 17:16:59,083 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:59,083 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:59,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:59,084 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:59,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:59,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:59,186 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:16:59,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:16:59,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:16:59,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:16:59,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:16:59,187 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 7 states. [2018-02-04 17:16:59,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:59,340 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-02-04 17:16:59,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:16:59,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-02-04 17:16:59,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:59,343 INFO L225 Difference]: With dead ends: 59 [2018-02-04 17:16:59,343 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 17:16:59,344 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:16:59,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 17:16:59,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-02-04 17:16:59,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 17:16:59,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-02-04 17:16:59,349 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 15 [2018-02-04 17:16:59,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:59,350 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-02-04 17:16:59,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:16:59,350 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-02-04 17:16:59,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 17:16:59,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:59,351 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-04 17:16:59,351 INFO L371 AbstractCegarLoop]: === Iteration 3 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:16:59,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1643065362, now seen corresponding path program 1 times [2018-02-04 17:16:59,351 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:59,351 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:59,352 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:59,352 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:59,352 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:59,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:59,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:16:59,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:16:59,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:16:59,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:16:59,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:16:59,393 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 5 states. [2018-02-04 17:16:59,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:59,444 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-02-04 17:16:59,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:16:59,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 17:16:59,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:59,446 INFO L225 Difference]: With dead ends: 59 [2018-02-04 17:16:59,446 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 17:16:59,446 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:16:59,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 17:16:59,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-02-04 17:16:59,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 17:16:59,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-02-04 17:16:59,450 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 18 [2018-02-04 17:16:59,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:59,451 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-02-04 17:16:59,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:16:59,451 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-02-04 17:16:59,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 17:16:59,451 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:59,452 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:59,452 INFO L371 AbstractCegarLoop]: === Iteration 4 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:16:59,452 INFO L82 PathProgramCache]: Analyzing trace with hash 417458597, now seen corresponding path program 1 times [2018-02-04 17:16:59,452 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:59,452 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:59,453 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:59,453 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:59,453 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:59,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:59,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:59,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:16:59,536 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:16:59,537 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:59,559 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:16:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:59,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:16:59,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2018-02-04 17:16:59,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:16:59,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:16:59,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:16:59,602 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 12 states. [2018-02-04 17:16:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:59,710 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-02-04 17:16:59,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:16:59,710 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-02-04 17:16:59,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:59,711 INFO L225 Difference]: With dead ends: 85 [2018-02-04 17:16:59,711 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 17:16:59,711 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:16:59,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 17:16:59,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-02-04 17:16:59,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 17:16:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-04 17:16:59,715 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 24 [2018-02-04 17:16:59,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:59,715 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-04 17:16:59,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:16:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-04 17:16:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 17:16:59,716 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:59,716 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:59,716 INFO L371 AbstractCegarLoop]: === Iteration 5 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:16:59,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1576686109, now seen corresponding path program 1 times [2018-02-04 17:16:59,716 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:59,716 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:59,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:59,717 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:59,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:59,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:59,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:16:59,812 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:16:59,813 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:59,835 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:16:59,853 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-02-04 17:16:59,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:59,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:16:59,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:17:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:17:00,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:17:00,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-02-04 17:17:00,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:17:00,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:17:00,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:17:00,038 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 16 states. [2018-02-04 17:17:00,360 WARN L146 SmtUtils]: Spent 234ms on a formula simplification. DAG size of input: 34 DAG size of output 28 [2018-02-04 17:17:00,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:17:00,506 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-02-04 17:17:00,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:17:00,506 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-02-04 17:17:00,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:17:00,507 INFO L225 Difference]: With dead ends: 76 [2018-02-04 17:17:00,507 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 17:17:00,508 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:17:00,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 17:17:00,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2018-02-04 17:17:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 17:17:00,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-02-04 17:17:00,513 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 24 [2018-02-04 17:17:00,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:17:00,514 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-02-04 17:17:00,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:17:00,514 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-02-04 17:17:00,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 17:17:00,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:17:00,515 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-04 17:17:00,515 INFO L371 AbstractCegarLoop]: === Iteration 6 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:17:00,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1727082791, now seen corresponding path program 1 times [2018-02-04 17:17:00,515 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:17:00,515 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:17:00,516 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:00,516 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:00,516 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:00,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:17:00,531 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:17:00,531 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:17:00,531 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:17:00,531 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:00,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:17:00,559 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:17:00,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 17:17:00,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:17:00,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:17:00,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 17:17:00,577 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= |c_#valid| (store |c_old(#valid)| |main_#t~malloc10.base| 0)))) is different from true [2018-02-04 17:17:00,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 17:17:00,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:17:00,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:17:00,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:17:00,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:17:00,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-02-04 17:17:00,579 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 6 states. [2018-02-04 17:17:00,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:17:00,615 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-02-04 17:17:00,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:17:00,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-04 17:17:00,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:17:00,616 INFO L225 Difference]: With dead ends: 60 [2018-02-04 17:17:00,616 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 17:17:00,616 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2018-02-04 17:17:00,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 17:17:00,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 17:17:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 17:17:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 17:17:00,616 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-02-04 17:17:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:17:00,616 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 17:17:00,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:17:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 17:17:00,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 17:17:00,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:17:00 BoogieIcfgContainer [2018-02-04 17:17:00,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:17:00,620 INFO L168 Benchmark]: Toolchain (without parser) took 2370.39 ms. Allocated memory was 393.2 MB in the beginning and 612.4 MB in the end (delta: 219.2 MB). Free memory was 351.4 MB in the beginning and 514.0 MB in the end (delta: -162.6 MB). Peak memory consumption was 56.5 MB. Max. memory is 5.3 GB. [2018-02-04 17:17:00,621 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 393.2 MB. Free memory is still 356.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:17:00,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.22 ms. Allocated memory is still 393.2 MB. Free memory was 350.1 MB in the beginning and 340.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:17:00,622 INFO L168 Benchmark]: Boogie Preprocessor took 27.92 ms. Allocated memory is still 393.2 MB. Free memory was 340.8 MB in the beginning and 338.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:17:00,622 INFO L168 Benchmark]: RCFGBuilder took 170.79 ms. Allocated memory is still 393.2 MB. Free memory was 338.2 MB in the beginning and 320.1 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-02-04 17:17:00,622 INFO L168 Benchmark]: TraceAbstraction took 2002.29 ms. Allocated memory was 393.2 MB in the beginning and 612.4 MB in the end (delta: 219.2 MB). Free memory was 318.8 MB in the beginning and 514.0 MB in the end (delta: -195.2 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-02-04 17:17:00,623 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.18 ms. Allocated memory is still 393.2 MB. Free memory is still 356.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.22 ms. Allocated memory is still 393.2 MB. Free memory was 350.1 MB in the beginning and 340.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.92 ms. Allocated memory is still 393.2 MB. Free memory was 340.8 MB in the beginning and 338.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 170.79 ms. Allocated memory is still 393.2 MB. Free memory was 338.2 MB in the beginning and 320.1 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2002.29 ms. Allocated memory was 393.2 MB in the beginning and 612.4 MB in the end (delta: 219.2 MB). Free memory was 318.8 MB in the beginning and 514.0 MB in the end (delta: -195.2 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 556]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 13 error locations. SAFE Result, 1.9s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 179 SDtfs, 441 SDslu, 674 SDs, 0 SdLazy, 547 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 163 ConstructedInterpolants, 30 QuantifiedInterpolants, 26358 SizeOfPredicates, 10 NumberOfNonLiveVariables, 269 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 12/18 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/array02-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-17-00-630.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array02-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-17-00-630.csv Received shutdown request...