java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:36:07,882 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:36:07,884 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:36:07,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:36:07,894 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:36:07,895 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:36:07,896 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:36:07,898 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:36:07,899 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:36:07,900 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:36:07,901 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:36:07,901 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:36:07,902 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:36:07,903 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:36:07,903 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:36:07,905 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:36:07,907 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:36:07,908 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:36:07,909 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:36:07,910 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:36:07,912 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:36:07,912 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:36:07,912 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:36:07,913 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:36:07,914 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:36:07,915 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:36:07,915 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:36:07,916 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:36:07,916 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:36:07,916 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:36:07,917 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:36:07,917 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:36:07,927 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:36:07,927 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:36:07,928 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:36:07,928 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:36:07,928 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:36:07,928 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:36:07,928 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:36:07,928 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:36:07,928 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:36:07,928 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:36:07,928 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:36:07,928 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:36:07,929 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:36:07,929 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:36:07,929 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:36:07,929 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:36:07,929 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:36:07,929 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:36:07,929 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:36:07,929 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:36:07,929 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:36:07,929 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:36:07,929 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:36:07,929 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:36:07,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:36:07,961 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:36:07,964 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:36:07,965 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:36:07,965 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:36:07,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i [2018-02-02 10:36:08,091 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:36:08,092 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:36:08,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:36:08,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:36:08,098 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:36:08,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:36:08" (1/1) ... [2018-02-02 10:36:08,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f38ce8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:08, skipping insertion in model container [2018-02-02 10:36:08,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:36:08" (1/1) ... [2018-02-02 10:36:08,114 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:36:08,142 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:36:08,234 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:36:08,251 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:36:08,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:08 WrapperNode [2018-02-02 10:36:08,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:36:08,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:36:08,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:36:08,258 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:36:08,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:08" (1/1) ... [2018-02-02 10:36:08,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:08" (1/1) ... [2018-02-02 10:36:08,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:08" (1/1) ... [2018-02-02 10:36:08,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:08" (1/1) ... [2018-02-02 10:36:08,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:08" (1/1) ... [2018-02-02 10:36:08,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:08" (1/1) ... [2018-02-02 10:36:08,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:08" (1/1) ... [2018-02-02 10:36:08,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:36:08,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:36:08,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:36:08,281 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:36:08,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:08" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:36:08,321 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:36:08,321 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:36:08,321 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-02-02 10:36:08,321 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:36:08,321 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:36:08,321 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:36:08,322 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:36:08,322 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:36:08,322 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:36:08,322 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:36:08,322 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-02-02 10:36:08,322 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:36:08,322 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:36:08,322 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:36:08,483 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:36:08,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:36:08 BoogieIcfgContainer [2018-02-02 10:36:08,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:36:08,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:36:08,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:36:08,486 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:36:08,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:36:08" (1/3) ... [2018-02-02 10:36:08,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74cf1b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:36:08, skipping insertion in model container [2018-02-02 10:36:08,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:08" (2/3) ... [2018-02-02 10:36:08,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74cf1b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:36:08, skipping insertion in model container [2018-02-02 10:36:08,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:36:08" (3/3) ... [2018-02-02 10:36:08,489 INFO L107 eAbstractionObserver]: Analyzing ICFG array03-alloca_true-valid-memsafety_true-termination.i [2018-02-02 10:36:08,495 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:36:08,500 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-02 10:36:08,530 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:36:08,531 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:36:08,531 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:36:08,531 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:36:08,531 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:36:08,531 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:36:08,531 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:36:08,531 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:36:08,531 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:36:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-02-02 10:36:08,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:36:08,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:08,548 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:08,548 INFO L371 AbstractCegarLoop]: === Iteration 1 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:08,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1616393893, now seen corresponding path program 1 times [2018-02-02 10:36:08,587 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:08,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:08,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:08,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:08,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:36:08,708 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:08,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:08,709 INFO L182 omatonBuilderFactory]: Interpolants [54#true, 55#false, 56#(= 1 (select |#valid| |main_#t~malloc9.base|)), 57#(= 1 (select |#valid| main_~numbers~0.base)), 58#(= 1 (select |#valid| |test_fun_#in~a.base|)), 59#(= 1 (select |#valid| test_fun_~a.base))] [2018-02-02 10:36:08,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:08,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:36:08,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:36:08,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:36:08,720 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 6 states. [2018-02-02 10:36:08,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:08,846 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-02-02 10:36:08,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:36:08,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-02-02 10:36:08,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:08,900 INFO L225 Difference]: With dead ends: 44 [2018-02-02 10:36:08,900 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 10:36:08,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:36:08,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 10:36:08,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-02 10:36:08,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 10:36:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-02 10:36:08,928 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2018-02-02 10:36:08,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:08,928 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-02 10:36:08,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:36:08,928 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-02 10:36:08,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:36:08,929 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:08,929 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:08,929 INFO L371 AbstractCegarLoop]: === Iteration 2 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:08,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1616393894, now seen corresponding path program 1 times [2018-02-02 10:36:08,931 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:08,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:09,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:09,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:36:09,043 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:09,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:09,044 INFO L182 omatonBuilderFactory]: Interpolants [149#true, 150#false, 151#(<= 1 main_~array_size~0), 152#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|) (<= 1 main_~array_size~0)), 153#(and (= 0 main_~numbers~0.offset) (= (* 4 main_~array_size~0) (select |#length| main_~numbers~0.base)) (<= 1 main_~array_size~0)), 154#(and (<= 4 (select |#length| |test_fun_#in~a.base|)) (= 0 |test_fun_#in~a.offset|)), 155#(and (<= 4 (select |#length| test_fun_~a.base)) (= test_fun_~i~0 0) (= test_fun_~a.offset 0))] [2018-02-02 10:36:09,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:09,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:36:09,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:36:09,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:36:09,047 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2018-02-02 10:36:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:09,167 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-02-02 10:36:09,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:36:09,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-02 10:36:09,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:09,171 INFO L225 Difference]: With dead ends: 60 [2018-02-02 10:36:09,171 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 10:36:09,172 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:36:09,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 10:36:09,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-02-02 10:36:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 10:36:09,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2018-02-02 10:36:09,178 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 14 [2018-02-02 10:36:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:09,178 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-02-02 10:36:09,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:36:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-02-02 10:36:09,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:36:09,179 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:09,179 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:09,179 INFO L371 AbstractCegarLoop]: === Iteration 3 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:09,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1978668179, now seen corresponding path program 1 times [2018-02-02 10:36:09,180 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:09,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:09,222 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:09,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:36:09,222 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:09,223 INFO L182 omatonBuilderFactory]: Interpolants [277#true, 278#false, 279#(<= 1 main_~array_size~0), 280#(and (= test_fun_~i~0 0) (<= |test_fun_#in~N| test_fun_~N)), 281#(<= |test_fun_#in~N| 0)] [2018-02-02 10:36:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:09,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:36:09,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:36:09,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:36:09,224 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 5 states. [2018-02-02 10:36:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:09,333 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-02-02 10:36:09,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:36:09,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:36:09,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:09,334 INFO L225 Difference]: With dead ends: 60 [2018-02-02 10:36:09,334 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 10:36:09,334 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:36:09,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 10:36:09,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-02-02 10:36:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 10:36:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-02-02 10:36:09,337 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 18 [2018-02-02 10:36:09,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:09,338 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-02-02 10:36:09,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:36:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-02-02 10:36:09,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:36:09,338 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:09,338 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:09,338 INFO L371 AbstractCegarLoop]: === Iteration 4 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:09,339 INFO L82 PathProgramCache]: Analyzing trace with hash 35069262, now seen corresponding path program 1 times [2018-02-02 10:36:09,339 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:09,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:09,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:36:09,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:36:09,441 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:09,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:09,441 INFO L182 omatonBuilderFactory]: Interpolants [401#true, 402#false, 403#(<= main_~array_size~0 1), 404#(and (= 0 |main_#t~malloc9.offset|) (<= main_~array_size~0 1)), 405#(and (<= main_~array_size~0 1) (= 0 main_~numbers~0.offset)), 406#(and (<= |test_fun_#in~N| 1) (= 0 |test_fun_#in~a.offset|)), 407#(and (= test_fun_~a.offset 0) (<= test_fun_~N 1)), 408#(and (<= (* 4 test_fun_~N) (+ (* 4 test_fun_~i~0) test_fun_~a.offset 4)) (= test_fun_~a.offset 0)), 409#(and (= test_fun_~a.offset 0) (<= (* 4 test_fun_~N) (+ (* 4 test_fun_~i~0) test_fun_~a.offset)))] [2018-02-02 10:36:09,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:09,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:36:09,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:36:09,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:36:09,442 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 9 states. [2018-02-02 10:36:09,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:09,546 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-02-02 10:36:09,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:36:09,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-02 10:36:09,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:09,548 INFO L225 Difference]: With dead ends: 86 [2018-02-02 10:36:09,548 INFO L226 Difference]: Without dead ends: 86 [2018-02-02 10:36:09,548 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:36:09,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-02 10:36:09,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2018-02-02 10:36:09,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 10:36:09,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-02-02 10:36:09,558 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 23 [2018-02-02 10:36:09,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:09,558 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-02-02 10:36:09,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:36:09,559 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-02-02 10:36:09,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:36:09,559 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:09,559 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:09,559 INFO L371 AbstractCegarLoop]: === Iteration 5 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:09,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1553278640, now seen corresponding path program 1 times [2018-02-02 10:36:09,560 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:09,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:09,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:09,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:36:09,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:36:09,668 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:09,668 INFO L182 omatonBuilderFactory]: Interpolants [592#(and (= test_fun_~a.offset 0) (<= (+ (* 4 test_fun_~i~0) 4) (select |#length| test_fun_~a.base)) (<= 4 (+ (* 4 test_fun_~i~0) test_fun_~a.offset))), 584#true, 585#false, 586#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|)), 587#(and (= 0 main_~numbers~0.offset) (= (* 4 main_~array_size~0) (select |#length| main_~numbers~0.base))), 588#(and (<= (* 4 |test_fun_#in~N|) (select |#length| |test_fun_#in~a.base|)) (= 0 |test_fun_#in~a.offset|)), 589#(and (= test_fun_~a.offset 0) (<= (* 4 test_fun_~N) (select |#length| test_fun_~a.base))), 590#(and (= test_fun_~a.offset 0) (<= (* 4 test_fun_~N) (select |#length| test_fun_~a.base)) (<= 0 (+ (* 4 test_fun_~i~0) test_fun_~a.offset))), 591#(and (= test_fun_~a.offset 0) (<= (* 4 test_fun_~N) (select |#length| test_fun_~a.base)) (<= 4 (+ (* 4 test_fun_~i~0) test_fun_~a.offset)))] [2018-02-02 10:36:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:09,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:36:09,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:36:09,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:36:09,669 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 9 states. [2018-02-02 10:36:09,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:09,818 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-02-02 10:36:09,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:36:09,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-02 10:36:09,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:09,819 INFO L225 Difference]: With dead ends: 76 [2018-02-02 10:36:09,820 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 10:36:09,820 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:36:09,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 10:36:09,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2018-02-02 10:36:09,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 10:36:09,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-02-02 10:36:09,827 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 23 [2018-02-02 10:36:09,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:09,828 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-02-02 10:36:09,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:36:09,828 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-02-02 10:36:09,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:36:09,829 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:09,829 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:09,829 INFO L371 AbstractCegarLoop]: === Iteration 6 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:09,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1156880581, now seen corresponding path program 1 times [2018-02-02 10:36:09,830 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:09,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:09,847 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:36:09,853 INFO L168 Benchmark]: Toolchain (without parser) took 1762.08 ms. Allocated memory was 402.1 MB in the beginning and 608.7 MB in the end (delta: 206.6 MB). Free memory was 357.3 MB in the beginning and 444.7 MB in the end (delta: -87.4 MB). Peak memory consumption was 119.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:09,854 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 402.1 MB. Free memory is still 362.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:36:09,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.32 ms. Allocated memory is still 402.1 MB. Free memory was 356.0 MB in the beginning and 345.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:09,855 INFO L168 Benchmark]: Boogie Preprocessor took 22.47 ms. Allocated memory is still 402.1 MB. Free memory was 345.4 MB in the beginning and 344.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:09,855 INFO L168 Benchmark]: RCFGBuilder took 202.61 ms. Allocated memory is still 402.1 MB. Free memory was 344.1 MB in the beginning and 324.2 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:09,855 INFO L168 Benchmark]: TraceAbstraction took 1368.89 ms. Allocated memory was 402.1 MB in the beginning and 608.7 MB in the end (delta: 206.6 MB). Free memory was 324.2 MB in the beginning and 444.7 MB in the end (delta: -120.5 MB). Peak memory consumption was 86.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:09,856 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.17 ms. Allocated memory is still 402.1 MB. Free memory is still 362.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 165.32 ms. Allocated memory is still 402.1 MB. Free memory was 356.0 MB in the beginning and 345.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.47 ms. Allocated memory is still 402.1 MB. Free memory was 345.4 MB in the beginning and 344.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 202.61 ms. Allocated memory is still 402.1 MB. Free memory was 344.1 MB in the beginning and 324.2 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1368.89 ms. Allocated memory was 402.1 MB in the beginning and 608.7 MB in the end (delta: 206.6 MB). Free memory was 324.2 MB in the beginning and 444.7 MB in the end (delta: -120.5 MB). Peak memory consumption was 86.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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-02_10-36-09-861.csv Received shutdown request...