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_cmemrchr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:36:37,992 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:36:37,993 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:36:38,006 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:36:38,006 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:36:38,007 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:36:38,008 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:36:38,009 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:36:38,010 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:36:38,011 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:36:38,012 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:36:38,012 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:36:38,013 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:36:38,014 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:36:38,014 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:36:38,016 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:36:38,018 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:36:38,019 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:36:38,020 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:36:38,021 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:36:38,023 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:36:38,023 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:36:38,023 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:36:38,024 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:36:38,025 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:36:38,025 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:36:38,026 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:36:38,026 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:36:38,026 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:36:38,027 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:36:38,027 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:36:38,027 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:38,036 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:36:38,036 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:36:38,037 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:36:38,037 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:36:38,037 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:36:38,037 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:36:38,037 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:36:38,037 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:36:38,038 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:36:38,038 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:36:38,038 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:36:38,038 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:36:38,038 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:36:38,038 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:36:38,038 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:36:38,038 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:36:38,038 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:36:38,038 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:36:38,038 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:36:38,039 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:36:38,039 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:36:38,039 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:36:38,039 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:36:38,039 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:36:38,066 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:36:38,074 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:36:38,076 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:36:38,077 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:36:38,077 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:36:38,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cmemrchr-alloca_true-valid-memsafety_true-termination.i [2018-02-02 10:36:38,190 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:36:38,191 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:36:38,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:36:38,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:36:38,195 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:36:38,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:36:38" (1/1) ... [2018-02-02 10:36:38,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab297d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:38, skipping insertion in model container [2018-02-02 10:36:38,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:36:38" (1/1) ... [2018-02-02 10:36:38,208 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:36:38,236 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:36:38,321 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:36:38,332 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:36:38,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:38 WrapperNode [2018-02-02 10:36:38,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:36:38,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:36:38,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:36:38,338 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:36:38,351 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:38" (1/1) ... [2018-02-02 10:36:38,351 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:38" (1/1) ... [2018-02-02 10:36:38,360 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:38" (1/1) ... [2018-02-02 10:36:38,360 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:38" (1/1) ... [2018-02-02 10:36:38,362 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:38" (1/1) ... [2018-02-02 10:36:38,365 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:38" (1/1) ... [2018-02-02 10:36:38,366 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:38" (1/1) ... [2018-02-02 10:36:38,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:36:38,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:36:38,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:36:38,367 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:36:38,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:38" (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:38,405 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:36:38,405 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:36:38,405 INFO L136 BoogieDeclarations]: Found implementation of procedure cmemrchr [2018-02-02 10:36:38,405 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:36:38,405 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:36:38,405 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:36:38,405 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:36:38,405 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:36:38,405 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:36:38,406 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:36:38,406 INFO L128 BoogieDeclarations]: Found specification of procedure cmemrchr [2018-02-02 10:36:38,406 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:36:38,406 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:36:38,406 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:36:38,538 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:36:38,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:36:38 BoogieIcfgContainer [2018-02-02 10:36:38,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:36:38,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:36:38,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:36:38,541 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:36:38,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:36:38" (1/3) ... [2018-02-02 10:36:38,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721de6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:36:38, skipping insertion in model container [2018-02-02 10:36:38,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:38" (2/3) ... [2018-02-02 10:36:38,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721de6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:36:38, skipping insertion in model container [2018-02-02 10:36:38,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:36:38" (3/3) ... [2018-02-02 10:36:38,545 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cmemrchr-alloca_true-valid-memsafety_true-termination.i [2018-02-02 10:36:38,552 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:36:38,556 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-02 10:36:38,587 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:36:38,588 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:36:38,588 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:36:38,588 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:36:38,588 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:36:38,588 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:36:38,588 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:36:38,588 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:36:38,589 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:36:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-02-02 10:36:38,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:36:38,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:38,606 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:38,606 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:38,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1869622704, now seen corresponding path program 1 times [2018-02-02 10:36:38,661 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:38,702 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:38,791 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:38,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:38,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:36:38,794 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:38,795 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:38,795 INFO L182 omatonBuilderFactory]: Interpolants [34#true, 35#false, 36#(= 1 (select |#valid| |main_#t~malloc6.base|)), 37#(= 1 (select |#valid| main_~nondetArea~0.base)), 38#(= 1 (select |#valid| |cmemrchr_#in~s.base|)), 39#(= 1 (select |#valid| cmemrchr_~s.base)), 40#(= 1 (select |#valid| cmemrchr_~cp~0.base)), 41#(= 1 (select |#valid| |cmemrchr_#t~pre1.base|))] [2018-02-02 10:36:38,795 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:38,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:36:38,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:36:38,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:36:38,810 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 8 states. [2018-02-02 10:36:38,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:38,974 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-02-02 10:36:38,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:36:39,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-02-02 10:36:39,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:39,037 INFO L225 Difference]: With dead ends: 33 [2018-02-02 10:36:39,038 INFO L226 Difference]: Without dead ends: 30 [2018-02-02 10:36:39,039 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:36:39,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-02 10:36:39,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-02-02 10:36:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-02 10:36:39,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-02-02 10:36:39,063 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2018-02-02 10:36:39,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:39,063 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-02-02 10:36:39,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:36:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-02-02 10:36:39,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:36:39,064 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:39,064 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:39,064 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:39,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1869622705, now seen corresponding path program 1 times [2018-02-02 10:36:39,065 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:39,085 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:39,252 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:39,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:39,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:36:39,252 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:39,252 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:39,253 INFO L182 omatonBuilderFactory]: Interpolants [112#(and (<= 1 main_~n~0) (<= main_~n~0 1)), 113#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~n~0) (<= main_~n~0 1) (= main_~n~0 (select |#length| |main_#t~malloc6.base|))), 114#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (<= 1 main_~n~0) (<= main_~n~0 1) (= 0 main_~nondetArea~0.offset)), 115#(and (<= 1 |cmemrchr_#in~n|) (= 0 |cmemrchr_#in~s.offset|) (<= |cmemrchr_#in~n| 1) (<= |cmemrchr_#in~n| (select |#length| |cmemrchr_#in~s.base|))), 116#(and (< 0 (+ (div cmemrchr_~n 4294967296) 1)) (<= cmemrchr_~n 1) (= cmemrchr_~s.offset 0) (<= cmemrchr_~n (select |#length| cmemrchr_~s.base))), 117#(and (<= 1 cmemrchr_~cp~0.offset) (<= cmemrchr_~cp~0.offset (select |#length| cmemrchr_~cp~0.base))), 118#(and (<= (+ |cmemrchr_#t~pre1.offset| 1) (select |#length| |cmemrchr_#t~pre1.base|)) (<= 0 |cmemrchr_#t~pre1.offset|)), 110#true, 111#false] [2018-02-02 10:36:39,253 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:39,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:36:39,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:36:39,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:36:39,255 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 9 states. [2018-02-02 10:36:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:39,401 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-02-02 10:36:39,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:36:39,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-02-02 10:36:39,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:39,404 INFO L225 Difference]: With dead ends: 53 [2018-02-02 10:36:39,404 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 10:36:39,405 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:36:39,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 10:36:39,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2018-02-02 10:36:39,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 10:36:39,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-02-02 10:36:39,413 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 15 [2018-02-02 10:36:39,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:39,413 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-02-02 10:36:39,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:36:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-02-02 10:36:39,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:36:39,414 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:39,414 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:39,414 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:39,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1060276079, now seen corresponding path program 1 times [2018-02-02 10:36:39,417 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:39,432 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:39,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:39,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:39,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:36:39,558 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:39,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:39,558 INFO L182 omatonBuilderFactory]: Interpolants [224#true, 225#false, 226#(<= main_~n~0 2147483647), 227#(and (<= main_~n~0 2147483647) (<= 1 main_~n~0)), 228#(and (<= main_~n~0 2147483647) (= 0 |main_#t~malloc6.offset|) (<= 1 main_~n~0) (= main_~n~0 (select |#length| |main_#t~malloc6.base|))), 229#(and (<= main_~n~0 2147483647) (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (<= 1 main_~n~0) (= 0 main_~nondetArea~0.offset)), 230#(and (<= 1 |cmemrchr_#in~n|) (= 0 |cmemrchr_#in~s.offset|) (<= |cmemrchr_#in~n| (select |#length| |cmemrchr_#in~s.base|)) (<= |cmemrchr_#in~n| 2147483647)), 231#(and (< 0 (+ (div cmemrchr_~n 4294967296) 1)) (<= cmemrchr_~n 2147483647) (= cmemrchr_~s.offset 0) (<= cmemrchr_~n (select |#length| cmemrchr_~s.base))), 232#(and (<= 1 cmemrchr_~cp~0.offset) (<= cmemrchr_~cp~0.offset (select |#length| cmemrchr_~cp~0.base))), 233#(and (<= (+ |cmemrchr_#t~pre1.offset| 1) (select |#length| |cmemrchr_#t~pre1.base|)) (<= 0 |cmemrchr_#t~pre1.offset|))] [2018-02-02 10:36:39,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:39,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:36:39,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:36:39,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:36:39,559 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 10 states. [2018-02-02 10:36:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:39,723 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-02-02 10:36:39,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:36:39,723 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-02-02 10:36:39,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:39,725 INFO L225 Difference]: With dead ends: 54 [2018-02-02 10:36:39,725 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 10:36:39,725 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:36:39,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 10:36:39,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 29. [2018-02-02 10:36:39,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-02 10:36:39,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-02-02 10:36:39,729 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2018-02-02 10:36:39,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:39,729 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-02-02 10:36:39,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:36:39,729 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-02-02 10:36:39,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:36:39,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:39,730 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:39,730 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:39,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1406269975, now seen corresponding path program 1 times [2018-02-02 10:36:39,731 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:39,749 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:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:39,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:39,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:36:39,938 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:39,939 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:39,939 INFO L182 omatonBuilderFactory]: Interpolants [336#(and (<= cmemrchr_~n (+ (* 4294967296 (div cmemrchr_~n 4294967296)) 1)) (< (* 4294967296 (div cmemrchr_~n 4294967296)) cmemrchr_~n)), 337#(<= |cmemrchr_#t~pre0| (* 4294967296 (div |cmemrchr_#t~pre0| 4294967296))), 327#true, 328#false, 329#(<= main_~n~0 1), 330#(and (= 0 |main_#t~malloc6.offset|) (<= main_~n~0 1) (= main_~n~0 (select |#length| |main_#t~malloc6.base|))), 331#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (<= main_~n~0 1) (= 0 main_~nondetArea~0.offset)), 332#(and (= 0 |cmemrchr_#in~s.offset|) (<= (select |#length| |cmemrchr_#in~s.base|) 1)), 333#(and (<= (select |#length| cmemrchr_~s.base) 1) (= cmemrchr_~s.offset 0)), 334#(and (or (<= (+ cmemrchr_~cp~0.offset 1) 0) (<= (+ cmemrchr_~n (select |#length| cmemrchr_~cp~0.base)) (+ cmemrchr_~cp~0.offset (* 4294967296 (div cmemrchr_~n 4294967296)) 1))) (< (* 4294967296 (div cmemrchr_~n 4294967296)) cmemrchr_~n)), 335#(and (or (<= (+ |cmemrchr_#t~pre1.offset| 2) 0) (and (<= (+ cmemrchr_~n (select |#length| cmemrchr_~cp~0.base)) (+ |cmemrchr_#t~pre1.offset| (* 4294967296 (div cmemrchr_~n 4294967296)) 2)) (= |cmemrchr_#t~pre1.base| cmemrchr_~cp~0.base))) (< (* 4294967296 (div cmemrchr_~n 4294967296)) cmemrchr_~n))] [2018-02-02 10:36:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:39,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:36:39,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:36:39,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:36:39,940 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 11 states. [2018-02-02 10:36:40,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:40,090 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-02 10:36:40,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:36:40,090 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-02-02 10:36:40,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:40,092 INFO L225 Difference]: With dead ends: 49 [2018-02-02 10:36:40,092 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 10:36:40,092 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:36:40,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 10:36:40,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-02-02 10:36:40,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 10:36:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-02-02 10:36:40,095 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 20 [2018-02-02 10:36:40,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:40,095 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-02-02 10:36:40,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:36:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-02-02 10:36:40,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:36:40,096 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:40,096 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] [2018-02-02 10:36:40,096 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:40,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2125153178, now seen corresponding path program 1 times [2018-02-02 10:36:40,097 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:40,103 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:40,143 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:40,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:40,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:36:40,144 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:40,144 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:40,144 INFO L182 omatonBuilderFactory]: Interpolants [443#true, 444#false, 445#(and (<= 1 main_~n~0) (<= main_~n~0 1)), 446#(= cmemrchr_~n |cmemrchr_#in~n|), 447#(or (<= |cmemrchr_#in~n| 0) (<= 4294967296 |cmemrchr_#in~n|))] [2018-02-02 10:36:40,144 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:40,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:36:40,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:36:40,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:36:40,145 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2018-02-02 10:36:40,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:40,171 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-02-02 10:36:40,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:36:40,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 10:36:40,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:40,172 INFO L225 Difference]: With dead ends: 59 [2018-02-02 10:36:40,172 INFO L226 Difference]: Without dead ends: 56 [2018-02-02 10:36:40,172 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:40,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-02 10:36:40,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2018-02-02 10:36:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 10:36:40,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-02-02 10:36:40,177 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-02-02 10:36:40,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:40,177 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-02-02 10:36:40,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:36:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-02-02 10:36:40,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:36:40,178 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:40,178 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:40,178 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:40,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1993075989, now seen corresponding path program 1 times [2018-02-02 10:36:40,179 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:40,191 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:40,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:40,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:36:40,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:36:40,321 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:40,321 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:40,322 INFO L182 omatonBuilderFactory]: Interpolants [560#(and (<= (+ cmemrchr_~cp~0.offset 1) (select |#length| cmemrchr_~cp~0.base)) (or (<= |cmemrchr_#t~pre0| (* 4294967296 (div |cmemrchr_#t~pre0| 4294967296))) (<= |cmemrchr_#t~pre0| (+ cmemrchr_~cp~0.offset (* 4294967296 (div |cmemrchr_#t~pre0| 4294967296)))))), 561#(and (<= 1 cmemrchr_~cp~0.offset) (<= (+ cmemrchr_~cp~0.offset 1) (select |#length| cmemrchr_~cp~0.base))), 562#(and (<= (+ |cmemrchr_#t~pre1.offset| 2) (select |#length| |cmemrchr_#t~pre1.base|)) (<= 0 |cmemrchr_#t~pre1.offset|)), 551#true, 552#false, 553#(= 0 |main_#t~malloc6.offset|), 554#(= 0 main_~nondetArea~0.offset), 555#(= 0 |cmemrchr_#in~s.offset|), 556#(= cmemrchr_~s.offset 0), 557#(or (and (<= cmemrchr_~n (+ cmemrchr_~cp~0.offset (* 4294967296 (div cmemrchr_~n 4294967296)))) (< (* 4294967296 (div cmemrchr_~n 4294967296)) cmemrchr_~n)) (<= (+ cmemrchr_~cp~0.offset 1) 0)), 558#(or (<= (+ |cmemrchr_#t~pre1.offset| 2) 0) (and (<= cmemrchr_~n (+ cmemrchr_~cp~0.offset (* 4294967296 (div cmemrchr_~n 4294967296)) 1)) (<= cmemrchr_~cp~0.offset |cmemrchr_#t~pre1.offset|) (= |cmemrchr_#t~pre1.base| cmemrchr_~cp~0.base) (< (* 4294967296 (div cmemrchr_~n 4294967296)) cmemrchr_~n))), 559#(and (<= cmemrchr_~n (+ cmemrchr_~cp~0.offset (* 4294967296 (div cmemrchr_~n 4294967296)) 1)) (<= (+ cmemrchr_~cp~0.offset 1) (select |#length| cmemrchr_~cp~0.base)) (< (* 4294967296 (div cmemrchr_~n 4294967296)) cmemrchr_~n))] [2018-02-02 10:36:40,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:40,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:36:40,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:36:40,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:36:40,323 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 12 states. [2018-02-02 10:36:40,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:40,531 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-02-02 10:36:40,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:36:40,532 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-02-02 10:36:40,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:40,532 INFO L225 Difference]: With dead ends: 52 [2018-02-02 10:36:40,533 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 10:36:40,533 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:36:40,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 10:36:40,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2018-02-02 10:36:40,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 10:36:40,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-02-02 10:36:40,537 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2018-02-02 10:36:40,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:40,537 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-02-02 10:36:40,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:36:40,537 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-02-02 10:36:40,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:36:40,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:40,538 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] [2018-02-02 10:36:40,538 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cmemrchrErr0RequiresViolation, cmemrchrErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:36:40,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1538347164, now seen corresponding path program 1 times [2018-02-02 10:36:40,539 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:40,548 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:40,552 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:40,555 INFO L168 Benchmark]: Toolchain (without parser) took 2365.13 ms. Allocated memory was 393.7 MB in the beginning and 609.2 MB in the end (delta: 215.5 MB). Free memory was 351.9 MB in the beginning and 461.6 MB in the end (delta: -109.7 MB). Peak memory consumption was 105.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:40,557 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 393.7 MB. Free memory is still 357.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:36:40,557 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.18 ms. Allocated memory is still 393.7 MB. Free memory was 350.6 MB in the beginning and 341.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:40,558 INFO L168 Benchmark]: Boogie Preprocessor took 29.18 ms. Allocated memory is still 393.7 MB. Free memory was 340.0 MB in the beginning and 338.7 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:40,558 INFO L168 Benchmark]: RCFGBuilder took 172.05 ms. Allocated memory is still 393.7 MB. Free memory was 338.7 MB in the beginning and 323.4 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:40,558 INFO L168 Benchmark]: TraceAbstraction took 2015.30 ms. Allocated memory was 393.7 MB in the beginning and 609.2 MB in the end (delta: 215.5 MB). Free memory was 322.0 MB in the beginning and 461.6 MB in the end (delta: -139.6 MB). Peak memory consumption was 75.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:40,560 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.14 ms. Allocated memory is still 393.7 MB. Free memory is still 357.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 146.18 ms. Allocated memory is still 393.7 MB. Free memory was 350.6 MB in the beginning and 341.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.18 ms. Allocated memory is still 393.7 MB. Free memory was 340.0 MB in the beginning and 338.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 172.05 ms. Allocated memory is still 393.7 MB. Free memory was 338.7 MB in the beginning and 323.4 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2015.30 ms. Allocated memory was 393.7 MB in the beginning and 609.2 MB in the end (delta: 215.5 MB). Free memory was 322.0 MB in the beginning and 461.6 MB in the end (delta: -139.6 MB). Peak memory consumption was 75.9 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_cmemrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-36-40-566.csv Received shutdown request...