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/array03-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:17:02,096 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:17:02,097 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:17:02,110 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:17:02,111 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:17:02,111 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:17:02,112 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:17:02,114 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:17:02,115 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:17:02,116 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:17:02,117 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:17:02,117 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:17:02,118 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:17:02,119 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:17:02,120 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:17:02,121 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:17:02,123 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:17:02,125 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:17:02,126 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:17:02,127 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:17:02,129 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:17:02,129 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:17:02,129 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:17:02,130 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:17:02,131 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:17:02,132 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:17:02,132 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:17:02,133 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:17:02,133 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:17:02,133 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:17:02,134 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:17:02,134 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:17:02,144 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:17:02,144 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:17:02,145 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:17:02,146 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:17:02,146 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:17:02,146 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:17:02,146 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:17:02,146 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:17:02,146 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:17:02,147 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:17:02,147 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:17:02,147 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:17:02,147 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:17:02,147 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:17:02,147 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:17:02,147 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:17:02,148 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:17:02,148 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:17:02,148 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:17:02,148 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:17:02,148 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:17:02,148 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:17:02,148 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:17:02,149 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:17:02,176 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:17:02,186 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:17:02,191 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:17:02,192 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:17:02,193 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:17:02,193 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-04 17:17:02,307 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:17:02,308 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:17:02,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:17:02,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:17:02,314 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:17:02,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:17:02" (1/1) ... [2018-02-04 17:17:02,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c9c24f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:02, skipping insertion in model container [2018-02-04 17:17:02,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:17:02" (1/1) ... [2018-02-04 17:17:02,327 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:17:02,355 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:17:02,445 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:17:02,460 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:17:02,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:02 WrapperNode [2018-02-04 17:17:02,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:17:02,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:17:02,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:17:02,467 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:17:02,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:02" (1/1) ... [2018-02-04 17:17:02,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:02" (1/1) ... [2018-02-04 17:17:02,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:02" (1/1) ... [2018-02-04 17:17:02,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:02" (1/1) ... [2018-02-04 17:17:02,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:02" (1/1) ... [2018-02-04 17:17:02,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:02" (1/1) ... [2018-02-04 17:17:02,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:02" (1/1) ... [2018-02-04 17:17:02,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:17:02,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:17:02,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:17:02,496 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:17:02,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:02" (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:17:02,546 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:17:02,546 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:17:02,546 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-02-04 17:17:02,546 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:17:02,546 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:17:02,546 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:17:02,546 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:17:02,547 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:17:02,547 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:17:02,547 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:17:02,547 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-02-04 17:17:02,547 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:17:02,547 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:17:02,547 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:17:02,712 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:17:02,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:17:02 BoogieIcfgContainer [2018-02-04 17:17:02,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:17:02,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:17:02,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:17:02,715 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:17:02,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:17:02" (1/3) ... [2018-02-04 17:17:02,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32edcf0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:17:02, skipping insertion in model container [2018-02-04 17:17:02,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:17:02" (2/3) ... [2018-02-04 17:17:02,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32edcf0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:17:02, skipping insertion in model container [2018-02-04 17:17:02,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:17:02" (3/3) ... [2018-02-04 17:17:02,717 INFO L107 eAbstractionObserver]: Analyzing ICFG array03-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:17:02,722 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:17:02,727 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 17:17:02,757 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:17:02,757 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:17:02,758 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:17:02,758 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:17:02,758 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:17:02,758 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:17:02,758 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:17:02,758 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:17:02,759 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:17:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-02-04 17:17:02,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:17:02,780 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:17:02,780 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:17:02,781 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-04 17:17:02,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1616393893, now seen corresponding path program 1 times [2018-02-04 17:17:02,786 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:17:02,787 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:17:02,820 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:02,820 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:02,820 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:02,865 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:02,956 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:17:02,959 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:17:02,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:17:02,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:17:02,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:17:02,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:17:02,970 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 6 states. [2018-02-04 17:17:03,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:17:03,166 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-02-04 17:17:03,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:17:03,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-02-04 17:17:03,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:17:03,233 INFO L225 Difference]: With dead ends: 44 [2018-02-04 17:17:03,233 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 17:17:03,235 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:17:03,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 17:17:03,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 17:17:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 17:17:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-04 17:17:03,271 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2018-02-04 17:17:03,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:17:03,271 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-04 17:17:03,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:17:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-04 17:17:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:17:03,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:17:03,272 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:17:03,272 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-04 17:17:03,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1616393894, now seen corresponding path program 1 times [2018-02-04 17:17:03,272 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:17:03,272 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:17:03,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:03,273 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:03,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:03,287 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:03,370 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:17:03,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:17:03,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:17:03,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:17:03,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:17:03,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:17:03,372 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2018-02-04 17:17:03,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:17:03,556 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-02-04 17:17:03,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:17:03,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-04 17:17:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:17:03,558 INFO L225 Difference]: With dead ends: 60 [2018-02-04 17:17:03,559 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 17:17:03,559 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-04 17:17:03,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 17:17:03,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-02-04 17:17:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 17:17:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2018-02-04 17:17:03,565 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 14 [2018-02-04 17:17:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:17:03,565 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-02-04 17:17:03,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:17:03,566 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-02-04 17:17:03,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 17:17:03,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:17:03,566 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:17:03,566 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-04 17:17:03,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1978668179, now seen corresponding path program 1 times [2018-02-04 17:17:03,567 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:17:03,567 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:17:03,568 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:03,568 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:03,568 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:03,583 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:03,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:17:03,642 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:17:03,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:17:03,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:17:03,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:17:03,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:17:03,643 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 5 states. [2018-02-04 17:17:03,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:17:03,685 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-02-04 17:17:03,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:17:03,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 17:17:03,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:17:03,686 INFO L225 Difference]: With dead ends: 60 [2018-02-04 17:17:03,686 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 17:17:03,687 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:17:03,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 17:17:03,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-02-04 17:17:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 17:17:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-02-04 17:17:03,690 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 18 [2018-02-04 17:17:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:17:03,690 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-02-04 17:17:03,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:17:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-02-04 17:17:03,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:17:03,691 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:17:03,691 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-04 17:17:03,691 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-04 17:17:03,691 INFO L82 PathProgramCache]: Analyzing trace with hash 35069262, now seen corresponding path program 1 times [2018-02-04 17:17:03,691 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:17:03,692 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:17:03,692 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:03,692 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:03,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:03,705 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:03,786 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-04 17:17:03,786 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:17:03,786 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:17:03,787 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:03,808 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:17:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:17:03,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:17:03,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2018-02-04 17:17:03,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:17:03,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:17:03,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:17:03,852 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 12 states. [2018-02-04 17:17:03,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:17:03,980 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-02-04 17:17:03,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:17:03,981 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-02-04 17:17:03,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:17:03,982 INFO L225 Difference]: With dead ends: 86 [2018-02-04 17:17:03,982 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 17:17:03,982 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:17:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 17:17:03,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2018-02-04 17:17:03,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 17:17:03,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-02-04 17:17:03,988 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 23 [2018-02-04 17:17:03,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:17:03,989 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-02-04 17:17:03,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:17:03,989 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-02-04 17:17:03,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:17:03,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:17:03,990 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-04 17:17:03,990 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-04 17:17:03,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1553278640, now seen corresponding path program 1 times [2018-02-04 17:17:03,990 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:17:03,990 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:17:03,991 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:03,991 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:03,991 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:04,003 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:04,089 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-04 17:17:04,089 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:17:04,090 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:17:04,090 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:04,109 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:17:04,129 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:17:04,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:17:04,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:17:04,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:17:04,483 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-04 17:17:04,484 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:17:04,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-02-04 17:17:04,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:17:04,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:17:04,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=202, Unknown=1, NotChecked=0, Total=240 [2018-02-04 17:17:04,485 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 16 states. [2018-02-04 17:17:04,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:17:04,780 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-02-04 17:17:04,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:17:04,780 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-02-04 17:17:04,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:17:04,781 INFO L225 Difference]: With dead ends: 76 [2018-02-04 17:17:04,781 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 17:17:04,782 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=336, Unknown=1, NotChecked=0, Total=420 [2018-02-04 17:17:04,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 17:17:04,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2018-02-04 17:17:04,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 17:17:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-02-04 17:17:04,786 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 23 [2018-02-04 17:17:04,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:17:04,787 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-02-04 17:17:04,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:17:04,787 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-02-04 17:17:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 17:17:04,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:17:04,787 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:04,787 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-04 17:17:04,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1156880581, now seen corresponding path program 1 times [2018-02-04 17:17:04,788 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:17:04,788 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:17:04,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:04,788 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:04,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:17:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:04,799 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:04,803 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:17:04,804 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:17:04,804 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:17:04,805 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:17:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:17:04,821 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:17:04,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:17:04,831 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:04,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:17:04,833 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:04,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 17:17:04,848 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc9.base| Int)) (and (= (store |c_old(#valid)| |main_#t~malloc9.base| 0) |c_#valid|) (= 0 (select |c_old(#valid)| |main_#t~malloc9.base|)))) is different from true [2018-02-04 17:17:04,850 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:04,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:17:04,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:17:04,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:17:04,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:17:04,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-02-04 17:17:04,851 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 6 states. [2018-02-04 17:17:04,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:17:04,891 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-02-04 17:17:04,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:17:04,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-04 17:17:04,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:17:04,891 INFO L225 Difference]: With dead ends: 60 [2018-02-04 17:17:04,892 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 17:17:04,892 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:04,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 17:17:04,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 17:17:04,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 17:17:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 17:17:04,892 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-02-04 17:17:04,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:17:04,892 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 17:17:04,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:17:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 17:17:04,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 17:17:04,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:17:04 BoogieIcfgContainer [2018-02-04 17:17:04,896 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:17:04,896 INFO L168 Benchmark]: Toolchain (without parser) took 2588.81 ms. Allocated memory was 402.7 MB in the beginning and 627.0 MB in the end (delta: 224.4 MB). Free memory was 360.4 MB in the beginning and 528.2 MB in the end (delta: -167.8 MB). Peak memory consumption was 56.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:17:04,897 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 402.7 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:17:04,897 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.50 ms. Allocated memory is still 402.7 MB. Free memory was 359.1 MB in the beginning and 348.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:17:04,898 INFO L168 Benchmark]: Boogie Preprocessor took 28.77 ms. Allocated memory is still 402.7 MB. Free memory was 348.6 MB in the beginning and 347.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:17:04,898 INFO L168 Benchmark]: RCFGBuilder took 217.12 ms. Allocated memory is still 402.7 MB. Free memory was 347.2 MB in the beginning and 327.4 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-04 17:17:04,898 INFO L168 Benchmark]: TraceAbstraction took 2182.65 ms. Allocated memory was 402.7 MB in the beginning and 627.0 MB in the end (delta: 224.4 MB). Free memory was 327.4 MB in the beginning and 528.2 MB in the end (delta: -200.8 MB). Peak memory consumption was 23.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:17:04,899 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 402.7 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 157.50 ms. Allocated memory is still 402.7 MB. Free memory was 359.1 MB in the beginning and 348.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.77 ms. Allocated memory is still 402.7 MB. Free memory was 348.6 MB in the beginning and 347.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 217.12 ms. Allocated memory is still 402.7 MB. Free memory was 347.2 MB in the beginning and 327.4 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2182.65 ms. Allocated memory was 402.7 MB in the beginning and 627.0 MB in the end (delta: 224.4 MB). Free memory was 327.4 MB in the beginning and 528.2 MB in the end (delta: -200.8 MB). Peak memory consumption was 23.6 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: 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, 2.1s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 180 SDtfs, 457 SDslu, 643 SDs, 0 SdLazy, 550 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred 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.8s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 157 ConstructedInterpolants, 29 QuantifiedInterpolants, 24340 SizeOfPredicates, 10 NumberOfNonLiveVariables, 286 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 10/14 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_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-17-04-905.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_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-17-04-905.csv Received shutdown request...