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/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:36:34,271 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:36:34,272 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:36:34,284 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:36:34,284 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:36:34,285 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:36:34,286 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:36:34,287 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:36:34,289 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:36:34,290 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:36:34,290 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:36:34,291 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:36:34,291 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:36:34,292 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:36:34,293 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:36:34,295 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:36:34,296 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:36:34,298 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:36:34,299 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:36:34,300 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:36:34,301 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:36:34,301 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:36:34,302 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:36:34,302 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:36:34,303 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:36:34,304 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:36:34,304 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:36:34,304 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:36:34,304 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:36:34,304 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:36:34,305 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:36:34,305 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:34,313 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:36:34,314 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:36:34,315 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:36:34,315 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:36:34,315 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:36:34,315 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:36:34,315 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:36:34,315 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:36:34,316 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:36:34,316 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:36:34,316 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:36:34,316 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:36:34,316 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:36:34,316 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:36:34,316 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:36:34,317 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:36:34,317 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:36:34,317 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:36:34,317 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:36:34,317 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:36:34,317 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:36:34,318 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:36:34,318 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:36:34,318 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:36:34,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:36:34,355 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:36:34,358 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:36:34,359 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:36:34,359 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:36:34,360 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i [2018-02-02 10:36:34,472 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:36:34,473 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:36:34,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:36:34,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:36:34,478 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:36:34,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:36:34" (1/1) ... [2018-02-02 10:36:34,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37169f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:34, skipping insertion in model container [2018-02-02 10:36:34,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:36:34" (1/1) ... [2018-02-02 10:36:34,491 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:36:34,518 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:36:34,608 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:36:34,621 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:36:34,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:34 WrapperNode [2018-02-02 10:36:34,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:36:34,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:36:34,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:36:34,628 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:36:34,637 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:34" (1/1) ... [2018-02-02 10:36:34,637 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:34" (1/1) ... [2018-02-02 10:36:34,645 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:34" (1/1) ... [2018-02-02 10:36:34,645 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:34" (1/1) ... [2018-02-02 10:36:34,648 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:34" (1/1) ... [2018-02-02 10:36:34,651 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:34" (1/1) ... [2018-02-02 10:36:34,652 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:34" (1/1) ... [2018-02-02 10:36:34,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:36:34,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:36:34,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:36:34,654 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:36:34,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:34" (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:34,696 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:36:34,696 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:36:34,696 INFO L136 BoogieDeclarations]: Found implementation of procedure cbzero [2018-02-02 10:36:34,696 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:36:34,696 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:36:34,696 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:36:34,697 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:36:34,697 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:36:34,697 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:36:34,697 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:36:34,697 INFO L128 BoogieDeclarations]: Found specification of procedure cbzero [2018-02-02 10:36:34,697 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:36:34,697 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:36:34,697 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:36:34,804 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:36:34,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:36:34 BoogieIcfgContainer [2018-02-02 10:36:34,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:36:34,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:36:34,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:36:34,806 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:36:34,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:36:34" (1/3) ... [2018-02-02 10:36:34,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cb7fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:36:34, skipping insertion in model container [2018-02-02 10:36:34,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:34" (2/3) ... [2018-02-02 10:36:34,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cb7fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:36:34, skipping insertion in model container [2018-02-02 10:36:34,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:36:34" (3/3) ... [2018-02-02 10:36:34,809 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i [2018-02-02 10:36:34,814 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:36:34,819 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-02 10:36:34,859 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:36:34,859 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:36:34,860 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:36:34,860 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:36:34,860 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:36:34,860 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:36:34,860 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:36:34,860 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:36:34,861 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:36:34,872 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-02-02 10:36:34,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 10:36:34,881 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:34,881 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:34,882 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:34,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1815231445, now seen corresponding path program 1 times [2018-02-02 10:36:34,932 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:34,968 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:35,023 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:35,025 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:35,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:36:35,026 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:35,027 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:35,027 INFO L182 omatonBuilderFactory]: Interpolants [32#true, 33#false, 34#(<= 1 main_~length~0), 35#(<= main_~n~0 main_~length~0)] [2018-02-02 10:36:35,027 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:35,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:36:35,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:36:35,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:36:35,038 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-02-02 10:36:35,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:35,094 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-02-02 10:36:35,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:36:35,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-02 10:36:35,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:35,101 INFO L225 Difference]: With dead ends: 33 [2018-02-02 10:36:35,101 INFO L226 Difference]: Without dead ends: 29 [2018-02-02 10:36:35,102 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:36:35,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-02 10:36:35,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-02-02 10:36:35,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-02 10:36:35,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-02-02 10:36:35,165 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2018-02-02 10:36:35,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:35,165 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-02-02 10:36:35,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:36:35,165 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-02-02 10:36:35,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 10:36:35,166 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:35,166 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:35,166 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:35,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1815233367, now seen corresponding path program 1 times [2018-02-02 10:36:35,167 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:35,175 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:35,192 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:35,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:35,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:36:35,193 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:35,193 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:35,193 INFO L182 omatonBuilderFactory]: Interpolants [98#true, 99#false, 100#(= |#valid| |old(#valid)|)] [2018-02-02 10:36:35,193 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:35,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:36:35,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:36:35,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:36:35,195 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 3 states. [2018-02-02 10:36:35,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:35,212 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-02-02 10:36:35,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:36:35,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-02-02 10:36:35,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:35,213 INFO L225 Difference]: With dead ends: 28 [2018-02-02 10:36:35,213 INFO L226 Difference]: Without dead ends: 27 [2018-02-02 10:36:35,213 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:36:35,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-02-02 10:36:35,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-02-02 10:36:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-02 10:36:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-02-02 10:36:35,215 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2018-02-02 10:36:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:35,216 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-02-02 10:36:35,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:36:35,216 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-02-02 10:36:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:36:35,216 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:35,216 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:35,216 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:35,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1377281886, now seen corresponding path program 1 times [2018-02-02 10:36:35,217 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:35,229 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:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:35,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:35,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:36:35,287 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:35,287 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:35,288 INFO L182 omatonBuilderFactory]: Interpolants [160#(= 1 (select |#valid| cbzero_~p~0.base)), 161#(= 1 (select |#valid| |cbzero_#t~post1.base|)), 155#true, 156#false, 157#(= 1 (select |#valid| |main_#t~malloc5.base|)), 158#(= 1 (select |#valid| main_~nondetArea~0.base)), 159#(= 1 (select |#valid| |cbzero_#in~b.base|))] [2018-02-02 10:36:35,288 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:35,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:36:35,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:36:35,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:36:35,289 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2018-02-02 10:36:35,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:35,388 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-02-02 10:36:35,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:36:35,389 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-02-02 10:36:35,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:35,390 INFO L225 Difference]: With dead ends: 25 [2018-02-02 10:36:35,390 INFO L226 Difference]: Without dead ends: 25 [2018-02-02 10:36:35,391 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:36:35,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-02 10:36:35,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-02 10:36:35,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-02 10:36:35,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-02-02 10:36:35,394 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-02-02 10:36:35,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:35,394 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-02-02 10:36:35,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:36:35,395 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-02-02 10:36:35,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:36:35,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:35,395 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:35,395 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:35,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1377281887, now seen corresponding path program 1 times [2018-02-02 10:36:35,397 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:35,417 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:35,525 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:35,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:35,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:36:35,526 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:35,526 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:35,527 INFO L182 omatonBuilderFactory]: Interpolants [224#(and (= 0 cbzero_~p~0.offset) (<= 1 (select |#length| cbzero_~p~0.base))), 225#(and (<= 1 (select |#length| |cbzero_#t~post1.base|)) (= |cbzero_#t~post1.offset| 0)), 218#true, 219#false, 220#(<= 1 main_~length~0), 221#(and (= 0 |main_#t~malloc5.offset|) (<= 1 (select |#length| |main_#t~malloc5.base|))), 222#(and (<= 1 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 223#(and (<= 1 (select |#length| |cbzero_#in~b.base|)) (= 0 |cbzero_#in~b.offset|))] [2018-02-02 10:36:35,527 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:35,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:36:35,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:36:35,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:36:35,528 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2018-02-02 10:36:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:35,651 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-02-02 10:36:35,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:36:35,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-02-02 10:36:35,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:35,655 INFO L225 Difference]: With dead ends: 31 [2018-02-02 10:36:35,655 INFO L226 Difference]: Without dead ends: 31 [2018-02-02 10:36:35,655 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:36:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-02 10:36:35,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-02-02 10:36:35,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-02 10:36:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-02-02 10:36:35,659 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2018-02-02 10:36:35,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:35,659 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-02-02 10:36:35,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:36:35,660 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-02-02 10:36:35,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:36:35,660 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:35,660 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:35,660 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:35,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1525480681, now seen corresponding path program 1 times [2018-02-02 10:36:35,661 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:35,678 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:35,763 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:35,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:36:35,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:36:35,764 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:35,764 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:35,764 INFO L182 omatonBuilderFactory]: Interpolants [295#true, 296#false, 297#(and (<= 1 main_~n~0) (<= main_~n~0 1)), 298#(and (<= |cbzero_#in~length| 1) (<= 1 |cbzero_#in~length|)), 299#(and (<= cbzero_~length 1) (<= 1 cbzero_~length)), 300#(and (<= cbzero_~length 0) (<= 0 cbzero_~length)), 301#(and (<= |cbzero_#t~post0| (* 4294967296 (div |cbzero_#t~post0| 4294967296))) (< 0 (+ (div |cbzero_#t~post0| 4294967296) 1)))] [2018-02-02 10:36:35,765 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:35,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:36:35,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:36:35,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:36:35,765 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 7 states. [2018-02-02 10:36:35,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:35,819 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-02-02 10:36:35,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:36:35,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-02-02 10:36:35,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:35,821 INFO L225 Difference]: With dead ends: 48 [2018-02-02 10:36:35,821 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 10:36:35,821 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:36:35,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 10:36:35,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2018-02-02 10:36:35,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 10:36:35,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-02 10:36:35,824 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2018-02-02 10:36:35,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:35,825 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-02 10:36:35,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:36:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-02 10:36:35,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:36:35,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:35,826 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:35,826 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:35,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2112286695, now seen corresponding path program 1 times [2018-02-02 10:36:35,827 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:35,840 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:35,939 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:35,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:36:35,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:36:35,940 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:35,940 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:35,940 INFO L182 omatonBuilderFactory]: Interpolants [400#(and (<= main_~length~0 1) (<= 1 main_~n~0)), 401#(and (<= 1 main_~n~0) (<= main_~n~0 1)), 402#(and (<= |cbzero_#in~length| 1) (<= 1 |cbzero_#in~length|)), 403#(and (<= cbzero_~length 1) (<= 1 cbzero_~length)), 404#(and (<= cbzero_~length 0) (<= 0 cbzero_~length)), 405#(and (<= |cbzero_#t~post0| (* 4294967296 (div |cbzero_#t~post0| 4294967296))) (< 0 (+ (div |cbzero_#t~post0| 4294967296) 1))), 397#true, 398#false, 399#(<= main_~length~0 1)] [2018-02-02 10:36:35,940 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:35,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:36:35,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:36:35,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:36:35,941 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 9 states. [2018-02-02 10:36:36,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:36,046 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-02-02 10:36:36,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:36:36,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-02 10:36:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:36,051 INFO L225 Difference]: With dead ends: 73 [2018-02-02 10:36:36,051 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 10:36:36,051 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:36:36,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 10:36:36,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 42. [2018-02-02 10:36:36,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 10:36:36,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-02-02 10:36:36,060 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-02-02 10:36:36,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:36,060 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-02-02 10:36:36,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:36:36,060 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-02-02 10:36:36,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:36:36,061 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:36,061 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:36,061 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:36,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1171563351, now seen corresponding path program 1 times [2018-02-02 10:36:36,062 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:36,073 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:36,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:36,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:36:36,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:36:36,275 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:36,275 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:36,275 INFO L182 omatonBuilderFactory]: Interpolants [529#true, 530#false, 531#(<= 1 main_~n~0), 532#(and (<= main_~n~0 main_~length~0) (<= 1 main_~n~0)), 533#(and (= 0 |main_#t~malloc5.offset|) (<= main_~n~0 (select |#length| |main_#t~malloc5.base|)) (<= 1 main_~n~0)), 534#(and (<= 1 main_~n~0) (= 0 main_~nondetArea~0.offset) (<= main_~n~0 (select |#length| main_~nondetArea~0.base))), 535#(and (<= |cbzero_#in~length| (select |#length| |cbzero_#in~b.base|)) (= 0 |cbzero_#in~b.offset|) (<= 1 |cbzero_#in~length|)), 536#(and (= 0 cbzero_~p~0.offset) (<= cbzero_~length (select |#length| cbzero_~p~0.base)) (<= 1 cbzero_~length)), 537#(and (= 0 cbzero_~p~0.offset) (<= 0 cbzero_~length) (<= (+ cbzero_~length 1) (select |#length| cbzero_~p~0.base))), 538#(and (<= (+ cbzero_~length cbzero_~p~0.offset) (+ |cbzero_#t~post1.offset| (select |#length| cbzero_~p~0.base))) (<= (+ |cbzero_#t~post1.offset| 1) cbzero_~p~0.offset) (= |cbzero_#t~post1.offset| 0) (<= 0 cbzero_~length)), 539#(and (<= 1 cbzero_~p~0.offset) (<= (+ cbzero_~length cbzero_~p~0.offset) (select |#length| cbzero_~p~0.base)) (<= 0 cbzero_~length)), 540#(and (<= 1 cbzero_~p~0.offset) (< 0 (+ (div |cbzero_#t~post0| 4294967296) 1)) (or (<= (+ cbzero_~p~0.offset |cbzero_#t~post0|) (select |#length| cbzero_~p~0.base)) (<= |cbzero_#t~post0| (* 4294967296 (div |cbzero_#t~post0| 4294967296))))), 541#(and (<= 1 |cbzero_#t~post1.offset|) (<= (+ |cbzero_#t~post1.offset| 1) (select |#length| |cbzero_#t~post1.base|)))] [2018-02-02 10:36:36,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:36,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:36:36,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:36:36,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:36:36,276 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 13 states. [2018-02-02 10:36:36,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:36,477 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-02-02 10:36:36,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:36:36,478 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-02-02 10:36:36,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:36,478 INFO L225 Difference]: With dead ends: 51 [2018-02-02 10:36:36,478 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 10:36:36,479 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:36:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 10:36:36,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-02-02 10:36:36,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 10:36:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-02-02 10:36:36,483 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 20 [2018-02-02 10:36:36,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:36,483 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-02-02 10:36:36,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:36:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-02-02 10:36:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:36:36,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:36,484 INFO L351 BasicCegarLoop]: trace histogram [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:36,484 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:36,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1556914830, now seen corresponding path program 1 times [2018-02-02 10:36:36,485 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:36,492 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:36,556 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:36,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:36,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:36:36,557 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:36,557 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:36,558 INFO L182 omatonBuilderFactory]: Interpolants [657#true, 658#false, 659#(and (<= 1 main_~n~0) (<= main_~n~0 1)), 660#(and (<= |cbzero_#in~length| cbzero_~length) (<= cbzero_~length |cbzero_#in~length|)), 661#(and (or (< 0 (div |cbzero_#t~post0| 4294967296)) (<= |cbzero_#in~length| |cbzero_#t~post0|)) (or (<= |cbzero_#t~post0| |cbzero_#in~length|) (<= (div |cbzero_#t~post0| 4294967296) 0))), 662#(or (<= 4294967296 |cbzero_#in~length|) (<= |cbzero_#in~length| 0))] [2018-02-02 10:36:36,558 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:36,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:36:36,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:36:36,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:36:36,559 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 6 states. [2018-02-02 10:36:36,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:36,586 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-02-02 10:36:36,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:36:36,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-02 10:36:36,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:36,588 INFO L225 Difference]: With dead ends: 59 [2018-02-02 10:36:36,588 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 10:36:36,588 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:36:36,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 10:36:36,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2018-02-02 10:36:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 10:36:36,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-02-02 10:36:36,595 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 21 [2018-02-02 10:36:36,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:36,595 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-02-02 10:36:36,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:36:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-02-02 10:36:36,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:36:36,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:36,597 INFO L351 BasicCegarLoop]: trace histogram [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:36,597 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:36,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1726935216, now seen corresponding path program 1 times [2018-02-02 10:36:36,598 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:36,607 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:36,612 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:36,615 INFO L168 Benchmark]: Toolchain (without parser) took 2142.51 ms. Allocated memory was 401.6 MB in the beginning and 625.0 MB in the end (delta: 223.3 MB). Free memory was 359.8 MB in the beginning and 536.1 MB in the end (delta: -176.3 MB). Peak memory consumption was 47.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:36,617 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:36:36,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.35 ms. Allocated memory is still 401.6 MB. Free memory was 358.5 MB in the beginning and 349.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:36,617 INFO L168 Benchmark]: Boogie Preprocessor took 26.07 ms. Allocated memory is still 401.6 MB. Free memory was 349.2 MB in the beginning and 346.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:36,617 INFO L168 Benchmark]: RCFGBuilder took 150.06 ms. Allocated memory is still 401.6 MB. Free memory was 346.6 MB in the beginning and 332.3 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:36,618 INFO L168 Benchmark]: TraceAbstraction took 1810.28 ms. Allocated memory was 401.6 MB in the beginning and 625.0 MB in the end (delta: 223.3 MB). Free memory was 332.3 MB in the beginning and 536.1 MB in the end (delta: -203.8 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:36,619 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.12 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.35 ms. Allocated memory is still 401.6 MB. Free memory was 358.5 MB in the beginning and 349.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.07 ms. Allocated memory is still 401.6 MB. Free memory was 349.2 MB in the beginning and 346.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 150.06 ms. Allocated memory is still 401.6 MB. Free memory was 346.6 MB in the beginning and 332.3 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1810.28 ms. Allocated memory was 401.6 MB in the beginning and 625.0 MB in the end (delta: 223.3 MB). Free memory was 332.3 MB in the beginning and 536.1 MB in the end (delta: -203.8 MB). Peak memory consumption was 19.6 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/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-36-36-626.csv Received shutdown request...