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_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:50:36,072 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:50:36,074 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:50:36,087 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:50:36,087 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:50:36,088 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:50:36,089 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:50:36,091 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:50:36,093 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:50:36,094 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:50:36,095 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:50:36,095 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:50:36,096 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:50:36,097 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:50:36,098 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:50:36,099 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:50:36,101 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:50:36,103 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:50:36,104 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:50:36,105 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:50:36,106 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:50:36,107 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:50:36,107 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:50:36,108 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:50:36,108 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:50:36,109 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:50:36,110 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:50:36,110 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:50:36,110 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:50:36,110 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:50:36,111 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:50:36,111 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_Array.epf [2018-02-02 09:50:36,121 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:50:36,122 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:50:36,123 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:50:36,123 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:50:36,123 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:50:36,123 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:50:36,123 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:50:36,124 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:50:36,124 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:50:36,124 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:50:36,124 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:50:36,124 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:50:36,124 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:50:36,124 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:50:36,125 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:50:36,125 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:50:36,125 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:50:36,125 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:50:36,125 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:50:36,125 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:50:36,125 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:50:36,126 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:50:36,126 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 09:50:36,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:50:36,168 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:50:36,173 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:50:36,174 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:50:36,175 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:50:36,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:50:36,307 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:50:36,308 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:50:36,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:50:36,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:50:36,315 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:50:36,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:50:36" (1/1) ... [2018-02-02 09:50:36,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2119df36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:36, skipping insertion in model container [2018-02-02 09:50:36,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:50:36" (1/1) ... [2018-02-02 09:50:36,332 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:50:36,361 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:50:36,452 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:50:36,465 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:50:36,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:36 WrapperNode [2018-02-02 09:50:36,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:50:36,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:50:36,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:50:36,471 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:50:36,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:36" (1/1) ... [2018-02-02 09:50:36,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:36" (1/1) ... [2018-02-02 09:50:36,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:36" (1/1) ... [2018-02-02 09:50:36,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:36" (1/1) ... [2018-02-02 09:50:36,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:36" (1/1) ... [2018-02-02 09:50:36,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:36" (1/1) ... [2018-02-02 09:50:36,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:36" (1/1) ... [2018-02-02 09:50:36,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:50:36,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:50:36,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:50:36,500 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:50:36,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:36" (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 09:50:36,540 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:50:36,540 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:50:36,540 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-02-02 09:50:36,540 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:50:36,540 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:50:36,541 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:50:36,541 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:50:36,541 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:50:36,541 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:50:36,541 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:50:36,541 INFO L128 BoogieDeclarations]: Found specification of procedure cstrspn [2018-02-02 09:50:36,541 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:50:36,541 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:50:36,541 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:50:36,710 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:50:36,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:50:36 BoogieIcfgContainer [2018-02-02 09:50:36,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:50:36,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:50:36,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:50:36,713 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:50:36,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:50:36" (1/3) ... [2018-02-02 09:50:36,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6756faae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:50:36, skipping insertion in model container [2018-02-02 09:50:36,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:36" (2/3) ... [2018-02-02 09:50:36,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6756faae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:50:36, skipping insertion in model container [2018-02-02 09:50:36,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:50:36" (3/3) ... [2018-02-02 09:50:36,716 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:50:36,723 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:50:36,729 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 09:50:36,761 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:50:36,762 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:50:36,762 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 09:50:36,762 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 09:50:36,762 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:50:36,762 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:50:36,762 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:50:36,763 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:50:36,763 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:50:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-02-02 09:50:36,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:50:36,784 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:36,785 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:36,785 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-02 09:50:36,788 INFO L82 PathProgramCache]: Analyzing trace with hash -2014510132, now seen corresponding path program 1 times [2018-02-02 09:50:36,823 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:36,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:36,981 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 09:50:36,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:36,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:50:36,985 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:36,986 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 09:50:36,986 INFO L182 omatonBuilderFactory]: Interpolants [48#true, 49#false, 50#(= (select |#valid| |main_#t~malloc6.base|) 1), 51#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-02 09:50:36,987 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 09:50:36,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:50:37,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:50:37,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:50:37,003 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2018-02-02 09:50:37,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:37,121 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-02 09:50:37,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:50:37,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 09:50:37,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:37,129 INFO L225 Difference]: With dead ends: 44 [2018-02-02 09:50:37,129 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 09:50:37,130 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 09:50:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 09:50:37,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-02 09:50:37,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 09:50:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-02 09:50:37,161 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2018-02-02 09:50:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:37,161 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-02 09:50:37,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:50:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-02 09:50:37,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:50:37,162 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:37,162 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:37,162 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-02 09:50:37,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2014510131, now seen corresponding path program 1 times [2018-02-02 09:50:37,163 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:37,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:37,256 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 09:50:37,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:37,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:50:37,257 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:37,257 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 09:50:37,257 INFO L182 omatonBuilderFactory]: Interpolants [144#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 139#true, 140#false, 141#(<= 1 main_~length1~0), 142#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (<= 1 main_~length1~0) (= (select |#valid| |main_#t~malloc6.base|) 1)), 143#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0))] [2018-02-02 09:50:37,257 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 09:50:37,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:50:37,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:50:37,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:50:37,259 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2018-02-02 09:50:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:37,338 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-02 09:50:37,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:50:37,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-02 09:50:37,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:37,339 INFO L225 Difference]: With dead ends: 40 [2018-02-02 09:50:37,339 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 09:50:37,340 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:50:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 09:50:37,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-02 09:50:37,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 09:50:37,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-02 09:50:37,344 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2018-02-02 09:50:37,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:37,344 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-02 09:50:37,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:50:37,344 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-02 09:50:37,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:50:37,345 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:37,345 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:37,345 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-02 09:50:37,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1974695343, now seen corresponding path program 1 times [2018-02-02 09:50:37,346 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:37,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:37,379 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 09:50:37,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:37,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:50:37,380 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:37,380 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 09:50:37,381 INFO L182 omatonBuilderFactory]: Interpolants [227#true, 228#false, 229#(= 1 (select |#valid| |main_#t~malloc7.base|)), 230#(= 1 (select |#valid| main_~nondetString2~0.base))] [2018-02-02 09:50:37,381 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 09:50:37,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:50:37,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:50:37,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:50:37,381 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2018-02-02 09:50:37,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:37,419 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-02-02 09:50:37,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:50:37,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 09:50:37,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:37,420 INFO L225 Difference]: With dead ends: 39 [2018-02-02 09:50:37,420 INFO L226 Difference]: Without dead ends: 39 [2018-02-02 09:50:37,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 09:50:37,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-02 09:50:37,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-02 09:50:37,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-02 09:50:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-02 09:50:37,425 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 14 [2018-02-02 09:50:37,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:37,425 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-02 09:50:37,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:50:37,425 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-02 09:50:37,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:50:37,425 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:37,426 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:37,426 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-02 09:50:37,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1974695344, now seen corresponding path program 1 times [2018-02-02 09:50:37,427 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:37,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:37,488 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 09:50:37,488 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:37,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:50:37,488 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:37,488 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 09:50:37,489 INFO L182 omatonBuilderFactory]: Interpolants [311#true, 312#false, 313#(<= 1 main_~length2~0), 314#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 315#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))] [2018-02-02 09:50:37,489 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 09:50:37,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:50:37,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:50:37,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:50:37,490 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-02-02 09:50:37,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:37,524 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-02-02 09:50:37,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:50:37,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 09:50:37,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:37,525 INFO L225 Difference]: With dead ends: 38 [2018-02-02 09:50:37,525 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 09:50:37,525 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:50:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 09:50:37,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-02 09:50:37,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 09:50:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-02 09:50:37,527 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-02-02 09:50:37,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:37,527 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-02 09:50:37,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:50:37,527 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-02 09:50:37,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 09:50:37,528 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:37,528 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:37,528 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-02 09:50:37,528 INFO L82 PathProgramCache]: Analyzing trace with hash -559562515, now seen corresponding path program 1 times [2018-02-02 09:50:37,529 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:37,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:37,574 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 09:50:37,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:37,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:50:37,574 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:37,574 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 09:50:37,575 INFO L182 omatonBuilderFactory]: Interpolants [394#true, 395#false, 396#(= 1 (select |#valid| main_~nondetString1~0.base)), 397#(= 1 (select |#valid| |cstrspn_#in~s1.base|)), 398#(= 1 (select |#valid| cstrspn_~p~0.base)), 399#(= 1 (select |#valid| |cstrspn_#t~post0.base|))] [2018-02-02 09:50:37,575 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 09:50:37,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:50:37,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:50:37,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:50:37,575 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-02-02 09:50:37,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:37,614 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-02-02 09:50:37,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:50:37,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 09:50:37,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:37,614 INFO L225 Difference]: With dead ends: 37 [2018-02-02 09:50:37,614 INFO L226 Difference]: Without dead ends: 37 [2018-02-02 09:50:37,615 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:50:37,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-02 09:50:37,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-02 09:50:37,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 09:50:37,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-02-02 09:50:37,617 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 18 [2018-02-02 09:50:37,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:37,617 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-02-02 09:50:37,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:50:37,617 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-02-02 09:50:37,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 09:50:37,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:37,617 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:37,617 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-02 09:50:37,617 INFO L82 PathProgramCache]: Analyzing trace with hash -559562514, now seen corresponding path program 1 times [2018-02-02 09:50:37,618 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:37,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:37,699 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 09:50:37,699 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:37,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:50:37,699 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:37,699 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 09:50:37,700 INFO L182 omatonBuilderFactory]: Interpolants [480#(<= 1 main_~length1~0), 481#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~length1~0)), 482#(and (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 483#(and (<= (+ main_~nondetString1~0.offset 1) (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 484#(and (<= 1 (select |#length| |cstrspn_#in~s1.base|)) (= 0 |cstrspn_#in~s1.offset|)), 485#(and (= 0 cstrspn_~p~0.offset) (<= 1 (select |#length| cstrspn_~p~0.base))), 486#(and (= |cstrspn_#t~post0.offset| 0) (<= 1 (select |#length| |cstrspn_#t~post0.base|))), 478#true, 479#false] [2018-02-02 09:50:37,700 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 09:50:37,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:50:37,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:50:37,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:50:37,700 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-02-02 09:50:37,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:37,782 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-02 09:50:37,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:50:37,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-02-02 09:50:37,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:37,783 INFO L225 Difference]: With dead ends: 40 [2018-02-02 09:50:37,783 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 09:50:37,783 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:50:37,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 09:50:37,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-02-02 09:50:37,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-02 09:50:37,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-02 09:50:37,786 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2018-02-02 09:50:37,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:37,787 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-02 09:50:37,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:50:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-02 09:50:37,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 09:50:37,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:37,788 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 09:50:37,788 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-02 09:50:37,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1158796544, now seen corresponding path program 1 times [2018-02-02 09:50:37,789 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:37,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:37,825 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 09:50:37,825 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:37,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:50:37,825 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:37,825 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 09:50:37,825 INFO L182 omatonBuilderFactory]: Interpolants [576#true, 577#false, 578#(= 1 (select |#valid| main_~nondetString2~0.base)), 579#(= 1 (select |#valid| |cstrspn_#in~s2.base|)), 580#(= 1 (select |#valid| cstrspn_~s2.base)), 581#(= 1 (select |#valid| cstrspn_~spanp~0.base)), 582#(= 1 (select |#valid| |cstrspn_#t~post2.base|))] [2018-02-02 09:50:37,826 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 09:50:37,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:50:37,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:50:37,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:50:37,826 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 7 states. [2018-02-02 09:50:37,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:37,882 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-02-02 09:50:37,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:50:37,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-02 09:50:37,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:37,882 INFO L225 Difference]: With dead ends: 39 [2018-02-02 09:50:37,882 INFO L226 Difference]: Without dead ends: 39 [2018-02-02 09:50:37,883 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:50:37,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-02 09:50:37,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-02-02 09:50:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 09:50:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-02 09:50:37,884 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 21 [2018-02-02 09:50:37,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:37,884 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-02 09:50:37,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:50:37,885 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-02 09:50:37,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 09:50:37,885 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:37,885 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 09:50:37,885 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-02 09:50:37,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1158796543, now seen corresponding path program 1 times [2018-02-02 09:50:37,886 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:37,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:37,975 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 09:50:37,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:37,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 09:50:37,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:37,981 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 09:50:37,981 INFO L182 omatonBuilderFactory]: Interpolants [672#(and (<= 1 (select |#length| |cstrspn_#in~s2.base|)) (= 0 |cstrspn_#in~s2.offset|)), 673#(and (= 0 cstrspn_~s2.offset) (<= 1 (select |#length| cstrspn_~s2.base))), 674#(and (= 0 cstrspn_~spanp~0.offset) (<= 1 (select |#length| cstrspn_~spanp~0.base))), 675#(and (= |cstrspn_#t~post2.offset| 0) (<= 1 (select |#length| |cstrspn_#t~post2.base|))), 666#true, 667#false, 668#(<= 1 main_~length2~0), 669#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 670#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 671#(and (= 0 main_~nondetString2~0.offset) (<= 1 (select |#length| main_~nondetString2~0.base)))] [2018-02-02 09:50:37,981 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 09:50:37,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:50:37,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:50:37,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:50:37,982 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 10 states. [2018-02-02 09:50:38,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:38,067 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-02-02 09:50:38,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:50:38,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-02-02 09:50:38,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:38,068 INFO L225 Difference]: With dead ends: 42 [2018-02-02 09:50:38,068 INFO L226 Difference]: Without dead ends: 42 [2018-02-02 09:50:38,068 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:50:38,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-02 09:50:38,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-02-02 09:50:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 09:50:38,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-02 09:50:38,070 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 21 [2018-02-02 09:50:38,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:38,070 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-02 09:50:38,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:50:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-02 09:50:38,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:50:38,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:38,070 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:38,070 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-02 09:50:38,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1264210553, now seen corresponding path program 1 times [2018-02-02 09:50:38,071 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:38,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:38,224 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 09:50:38,224 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:38,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 09:50:38,224 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:38,224 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 09:50:38,224 INFO L182 omatonBuilderFactory]: Interpolants [768#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 769#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= (select |#valid| |main_#t~malloc6.base|) 1)), 770#(and (= (select |#valid| main_~nondetString1~0.base) 1) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 771#(and (not (= main_~nondetString1~0.base |main_#t~malloc7.base|)) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 772#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 773#(and (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) main_~nondetString1~0.offset)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 774#(= 0 (select (select |#memory_int| |cstrspn_#in~s1.base|) |cstrspn_#in~s1.offset|)), 775#(= 0 (select (select |#memory_int| cstrspn_~p~0.base) cstrspn_~p~0.offset)), 776#(= 0 (select (select |#memory_int| |cstrspn_#t~post0.base|) |cstrspn_#t~post0.offset|)), 777#(= 0 |cstrspn_#t~mem1|), 778#(= 0 cstrspn_~c~0), 779#(not (= cstrspn_~c~0 cstrspn_~sc~0)), 766#true, 767#false] [2018-02-02 09:50:38,224 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 09:50:38,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:50:38,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:50:38,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:50:38,225 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 14 states. [2018-02-02 09:50:38,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:38,495 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-02-02 09:50:38,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:50:38,495 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-02-02 09:50:38,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:38,496 INFO L225 Difference]: With dead ends: 72 [2018-02-02 09:50:38,496 INFO L226 Difference]: Without dead ends: 72 [2018-02-02 09:50:38,497 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:50:38,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-02 09:50:38,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2018-02-02 09:50:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 09:50:38,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-02-02 09:50:38,500 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 26 [2018-02-02 09:50:38,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:38,501 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-02-02 09:50:38,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:50:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-02-02 09:50:38,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:50:38,502 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:38,502 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:38,502 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-02 09:50:38,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1264212731, now seen corresponding path program 1 times [2018-02-02 09:50:38,503 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:38,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:38,653 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 09:50:38,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:38,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 09:50:38,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:38,653 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 09:50:38,654 INFO L182 omatonBuilderFactory]: Interpolants [936#true, 937#false, 938#(<= 1 main_~length2~0), 939#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0)), 940#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0)), 941#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset)) (<= 2 (select |#length| main_~nondetString2~0.base)))), 942#(and (or (<= 2 (select |#length| |cstrspn_#in~s2.base|)) (= 0 (select (select |#memory_int| |cstrspn_#in~s2.base|) |cstrspn_#in~s2.offset|))) (= 0 |cstrspn_#in~s2.offset|)), 943#(and (= 0 cstrspn_~s2.offset) (or (<= 2 (select |#length| cstrspn_~s2.base)) (= 0 (select (select |#memory_int| cstrspn_~s2.base) cstrspn_~s2.offset)))), 944#(and (or (= 0 (select (select |#memory_int| cstrspn_~spanp~0.base) cstrspn_~spanp~0.offset)) (<= 2 (select |#length| cstrspn_~spanp~0.base))) (= 0 cstrspn_~spanp~0.offset)), 945#(and (= |cstrspn_#t~post2.offset| 0) (= |cstrspn_#t~post2.base| cstrspn_~spanp~0.base) (or (= 0 (select (select |#memory_int| |cstrspn_#t~post2.base|) |cstrspn_#t~post2.offset|)) (and (<= (+ cstrspn_~spanp~0.offset 1) (+ (select |#length| |cstrspn_#t~post2.base|) |cstrspn_#t~post2.offset|)) (<= (+ |cstrspn_#t~post2.offset| 1) cstrspn_~spanp~0.offset)))), 946#(or (and (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base)) (<= 1 cstrspn_~spanp~0.offset)) (= 0 |cstrspn_#t~mem3|)), 947#(or (and (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base)) (<= 1 cstrspn_~spanp~0.offset)) (= 0 cstrspn_~sc~0)), 948#(and (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base)) (<= 1 cstrspn_~spanp~0.offset)), 949#(and (<= 1 |cstrspn_#t~post2.offset|) (<= (+ |cstrspn_#t~post2.offset| 1) (select |#length| |cstrspn_#t~post2.base|)))] [2018-02-02 09:50:38,654 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 09:50:38,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:50:38,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:50:38,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:50:38,654 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 14 states. [2018-02-02 09:50:38,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:38,905 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2018-02-02 09:50:38,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:50:38,905 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-02-02 09:50:38,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:38,907 INFO L225 Difference]: With dead ends: 80 [2018-02-02 09:50:38,907 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 09:50:38,908 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:50:38,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 09:50:38,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2018-02-02 09:50:38,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 09:50:38,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-02-02 09:50:38,912 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 26 [2018-02-02 09:50:38,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:38,913 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-02-02 09:50:38,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:50:38,913 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-02-02 09:50:38,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:50:38,914 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:38,914 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:38,914 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-02 09:50:38,914 INFO L82 PathProgramCache]: Analyzing trace with hash 446562103, now seen corresponding path program 1 times [2018-02-02 09:50:38,915 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:38,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:39,146 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 09:50:39,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:39,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:50:39,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:39,147 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 09:50:39,147 INFO L182 omatonBuilderFactory]: Interpolants [1124#true, 1125#false, 1126#(<= 1 main_~length1~0), 1127#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~length1~0) (= (select |#valid| |main_#t~malloc6.base|) 1)), 1128#(and (= 0 main_~nondetString1~0.offset) (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (= (select |#valid| main_~nondetString1~0.base) 1)) (<= 1 main_~length1~0)), 1129#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (not (= main_~nondetString1~0.base |main_#t~malloc7.base|))) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1130#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1131#(and (= 0 main_~nondetString1~0.offset) (or (and (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) main_~nondetString1~0.offset)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 2 (select |#length| main_~nondetString1~0.base)))), 1132#(and (or (= 0 (select (select |#memory_int| |cstrspn_#in~s1.base|) |cstrspn_#in~s1.offset|)) (<= 2 (select |#length| |cstrspn_#in~s1.base|))) (= 0 |cstrspn_#in~s1.offset|)), 1133#(and (= 0 cstrspn_~p~0.offset) (or (<= 2 (select |#length| cstrspn_~p~0.base)) (= 0 (select (select |#memory_int| cstrspn_~p~0.base) cstrspn_~p~0.offset)))), 1134#(and (<= (+ |cstrspn_#t~post0.offset| 1) cstrspn_~p~0.offset) (or (and (= |cstrspn_#t~post0.base| cstrspn_~p~0.base) (<= (+ cstrspn_~p~0.offset 1) (+ |cstrspn_#t~post0.offset| (select |#length| |cstrspn_#t~post0.base|)))) (= 0 (select (select |#memory_int| |cstrspn_#t~post0.base|) |cstrspn_#t~post0.offset|))) (= |cstrspn_#t~post0.offset| 0)), 1135#(and (<= 1 cstrspn_~p~0.offset) (or (= 0 |cstrspn_#t~mem1|) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base)))), 1136#(and (<= 1 cstrspn_~p~0.offset) (or (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base)) (= 0 cstrspn_~c~0))), 1137#(and (<= 1 cstrspn_~p~0.offset) (or (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base)) (not (= cstrspn_~c~0 cstrspn_~sc~0)))), 1138#(and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))), 1139#(and (<= (+ |cstrspn_#t~post0.offset| 1) (select |#length| |cstrspn_#t~post0.base|)) (<= 1 |cstrspn_#t~post0.offset|))] [2018-02-02 09:50:39,148 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 09:50:39,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:50:39,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:50:39,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:50:39,149 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 16 states. [2018-02-02 09:50:39,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:39,585 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-02-02 09:50:39,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 09:50:39,587 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-02-02 09:50:39,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:39,588 INFO L225 Difference]: With dead ends: 92 [2018-02-02 09:50:39,588 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 09:50:39,589 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2018-02-02 09:50:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 09:50:39,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2018-02-02 09:50:39,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 09:50:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2018-02-02 09:50:39,594 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 26 [2018-02-02 09:50:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:39,594 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2018-02-02 09:50:39,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:50:39,595 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2018-02-02 09:50:39,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 09:50:39,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:39,596 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:39,596 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-02 09:50:39,596 INFO L82 PathProgramCache]: Analyzing trace with hash -53536959, now seen corresponding path program 2 times [2018-02-02 09:50:39,597 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:39,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:39,810 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:39,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 09:50:39,810 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:39,811 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 09:50:39,811 INFO L182 omatonBuilderFactory]: Interpolants [1345#true, 1346#false, 1347#(and (= 0 |main_#t~malloc7.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 1348#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 1349#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) 1)) (<= (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base)) 1) (<= 3 (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base))))), 1350#(and (or (<= 3 (select |#length| |cstrspn_#in~s2.base|)) (= 0 (select (select |#memory_int| |cstrspn_#in~s2.base|) 1)) (<= (select |#length| |cstrspn_#in~s2.base|) 1)) (= 0 |cstrspn_#in~s2.offset|)), 1351#(and (= 0 cstrspn_~s2.offset) (or (<= 3 (select |#length| cstrspn_~s2.base)) (= 0 (select (select |#memory_int| cstrspn_~s2.base) 1)) (<= (select |#length| cstrspn_~s2.base) 1))), 1352#(and (= 0 cstrspn_~spanp~0.offset) (or (<= (select |#length| cstrspn_~spanp~0.base) 1) (= 0 (select (select |#memory_int| cstrspn_~spanp~0.base) 1)) (<= 3 (select |#length| cstrspn_~spanp~0.base)))), 1353#(and (= |cstrspn_#t~post2.offset| 0) (= |cstrspn_#t~post2.base| cstrspn_~spanp~0.base) (or (<= (+ cstrspn_~spanp~0.offset 2) (+ (select |#length| |cstrspn_#t~post2.base|) |cstrspn_#t~post2.offset|)) (<= (+ (select |#length| |cstrspn_#t~post2.base|) |cstrspn_#t~post2.offset|) cstrspn_~spanp~0.offset) (and (= 0 (select (select |#memory_int| cstrspn_~spanp~0.base) 1)) (<= cstrspn_~spanp~0.offset (+ |cstrspn_#t~post2.offset| 1)))) (<= (+ |cstrspn_#t~post2.offset| 1) cstrspn_~spanp~0.offset)), 1354#(and (or (<= (+ cstrspn_~spanp~0.offset 2) (select |#length| cstrspn_~spanp~0.base)) (<= (select |#length| cstrspn_~spanp~0.base) cstrspn_~spanp~0.offset) (and (<= cstrspn_~spanp~0.offset 1) (= 0 (select (select |#memory_int| cstrspn_~spanp~0.base) 1)))) (<= 1 cstrspn_~spanp~0.offset)), 1355#(and (or (<= (select |#length| |cstrspn_#t~post2.base|) |cstrspn_#t~post2.offset|) (and (= 1 |cstrspn_#t~post2.offset|) (= 0 (select (select |#memory_int| |cstrspn_#t~post2.base|) |cstrspn_#t~post2.offset|))) (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base))) (<= 2 cstrspn_~spanp~0.offset)), 1356#(and (or (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base)) (= 0 |cstrspn_#t~mem3|)) (<= 2 cstrspn_~spanp~0.offset)), 1357#(and (<= 2 cstrspn_~spanp~0.offset) (or (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base)) (= 0 cstrspn_~sc~0))), 1358#(and (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base)) (<= 2 cstrspn_~spanp~0.offset)), 1359#(and (<= 2 |cstrspn_#t~post2.offset|) (<= (+ |cstrspn_#t~post2.offset| 1) (select |#length| |cstrspn_#t~post2.base|)))] [2018-02-02 09:50:39,811 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:39,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:50:39,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:50:39,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:50:39,811 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand 15 states. [2018-02-02 09:50:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:40,176 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2018-02-02 09:50:40,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:50:40,176 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 31 [2018-02-02 09:50:40,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:40,177 INFO L225 Difference]: With dead ends: 132 [2018-02-02 09:50:40,177 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 09:50:40,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:50:40,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 09:50:40,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 102. [2018-02-02 09:50:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-02 09:50:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2018-02-02 09:50:40,183 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 31 [2018-02-02 09:50:40,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:40,183 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2018-02-02 09:50:40,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:50:40,184 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2018-02-02 09:50:40,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:50:40,184 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:40,185 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:40,185 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-02 09:50:40,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1129910615, now seen corresponding path program 1 times [2018-02-02 09:50:40,185 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:40,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:40,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 09:50:40,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:40,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:50:40,287 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:40,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 09:50:40,287 INFO L182 omatonBuilderFactory]: Interpolants [1620#true, 1621#false, 1622#(= |#valid| |old(#valid)|), 1623#(and (= (store |#valid| |main_#t~malloc6.base| 0) |old(#valid)|) (= (select |#valid| |main_#t~malloc6.base|) 1)), 1624#(and (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.base |main_#t~malloc6.base|) (= (store |#valid| |main_#t~malloc6.base| 0) |old(#valid)|)), 1625#(and (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|)) (= (store (store |#valid| |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|)) |main_#t~malloc7.base| 0) |old(#valid)|)), 1626#(= (store |#valid| |main_#t~malloc7.base| 0) |old(#valid)|)] [2018-02-02 09:50:40,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 09:50:40,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:50:40,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:50:40,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:50:40,288 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand 7 states. [2018-02-02 09:50:40,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:40,351 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2018-02-02 09:50:40,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:50:40,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-02-02 09:50:40,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:40,351 INFO L225 Difference]: With dead ends: 101 [2018-02-02 09:50:40,352 INFO L226 Difference]: Without dead ends: 89 [2018-02-02 09:50:40,352 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:50:40,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-02 09:50:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-02-02 09:50:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 09:50:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2018-02-02 09:50:40,355 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 32 [2018-02-02 09:50:40,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:40,355 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2018-02-02 09:50:40,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:50:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-02-02 09:50:40,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 09:50:40,356 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:40,357 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:40,357 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-02 09:50:40,357 INFO L82 PathProgramCache]: Analyzing trace with hash -373803070, now seen corresponding path program 2 times [2018-02-02 09:50:40,357 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:40,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:40,621 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:40,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:40,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 09:50:40,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:40,622 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 09:50:40,622 INFO L182 omatonBuilderFactory]: Interpolants [1824#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 1825#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base |main_#t~malloc7.base|)) (= main_~nondetString1~0.offset 0)), 1826#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 1827#(and (or (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) 1)) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 1828#(and (or (<= (select |#length| |cstrspn_#in~s1.base|) 1) (<= 3 (select |#length| |cstrspn_#in~s1.base|)) (= 0 (select (select |#memory_int| |cstrspn_#in~s1.base|) 1))) (= 0 |cstrspn_#in~s1.offset|)), 1829#(and (= 0 cstrspn_~p~0.offset) (or (<= (select |#length| cstrspn_~p~0.base) 1) (<= 3 (select |#length| cstrspn_~p~0.base)) (= 0 (select (select |#memory_int| cstrspn_~p~0.base) 1)))), 1830#(and (or (and (= |cstrspn_#t~post0.base| cstrspn_~p~0.base) (<= (+ |cstrspn_#t~post0.offset| (select |#length| |cstrspn_#t~post0.base|)) cstrspn_~p~0.offset)) (and (<= cstrspn_~p~0.offset (+ |cstrspn_#t~post0.offset| 1)) (<= (+ |cstrspn_#t~post0.offset| 1) cstrspn_~p~0.offset) (= 0 (select (select |#memory_int| |cstrspn_#t~post0.base|) 1)) (= |cstrspn_#t~post0.base| cstrspn_~p~0.base)) (and (<= (+ cstrspn_~p~0.offset 2) (+ |cstrspn_#t~post0.offset| (select |#length| |cstrspn_#t~post0.base|))) (<= (+ |cstrspn_#t~post0.offset| 1) cstrspn_~p~0.offset) (= |cstrspn_#t~post0.base| cstrspn_~p~0.base))) (= |cstrspn_#t~post0.offset| 0)), 1831#(or (<= (select |#length| cstrspn_~p~0.base) cstrspn_~p~0.offset) (and (<= 1 cstrspn_~p~0.offset) (<= cstrspn_~p~0.offset 1) (= 0 (select (select |#memory_int| cstrspn_~p~0.base) 1))) (and (<= (+ cstrspn_~p~0.offset 2) (select |#length| cstrspn_~p~0.base)) (<= 1 cstrspn_~p~0.offset))), 1832#(or (and (= 1 |cstrspn_#t~post0.offset|) (= 0 (select (select |#memory_int| |cstrspn_#t~post0.base|) |cstrspn_#t~post0.offset|))) (<= (select |#length| |cstrspn_#t~post0.base|) |cstrspn_#t~post0.offset|) (and (<= 2 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base)))), 1833#(or (and (<= 2 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))) (= 0 |cstrspn_#t~mem1|)), 1834#(or (and (<= 2 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))) (= 0 cstrspn_~c~0)), 1835#(or (and (<= 2 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))) (not (= cstrspn_~c~0 cstrspn_~sc~0))), 1836#(and (<= 2 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))), 1837#(and (<= 2 |cstrspn_#t~post0.offset|) (<= (+ |cstrspn_#t~post0.offset| 1) (select |#length| |cstrspn_#t~post0.base|))), 1821#true, 1822#false, 1823#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (= (select |#valid| |main_#t~malloc6.base|) 1))] [2018-02-02 09:50:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:40,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:50:40,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:50:40,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:50:40,623 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 17 states. [2018-02-02 09:50:41,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:41,100 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-02 09:50:41,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 09:50:41,100 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-02-02 09:50:41,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:41,101 INFO L225 Difference]: With dead ends: 112 [2018-02-02 09:50:41,101 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 09:50:41,102 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:50:41,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 09:50:41,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-02-02 09:50:41,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 09:50:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2018-02-02 09:50:41,105 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 34 [2018-02-02 09:50:41,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:41,105 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2018-02-02 09:50:41,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:50:41,106 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2018-02-02 09:50:41,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 09:50:41,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:41,106 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:41,107 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-02 09:50:41,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1516443323, now seen corresponding path program 3 times [2018-02-02 09:50:41,107 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:41,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:50:41,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:41,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 09:50:41,305 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:41,305 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 09:50:41,305 INFO L182 omatonBuilderFactory]: Interpolants [2089#true, 2090#false, 2091#(and (= 0 |main_#t~malloc7.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 2092#(and (= main_~nondetString2~0.offset 0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 2093#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) (+ (select |#length| main_~nondetString2~0.base) (+ main_~nondetString2~0.offset (- 1)))))), 2094#(= 0 (select (select |#memory_int| |cstrspn_#in~s2.base|) (+ (select |#length| |cstrspn_#in~s2.base|) (- 1)))), 2095#(= 0 (select (select |#memory_int| cstrspn_~s2.base) (+ (select |#length| cstrspn_~s2.base) (- 1)))), 2096#(= 0 (select (select |#memory_int| cstrspn_~spanp~0.base) (+ (select |#length| cstrspn_~spanp~0.base) (- 1)))), 2097#(and (= |cstrspn_#t~post2.base| cstrspn_~spanp~0.base) (= 0 (select (select |#memory_int| cstrspn_~spanp~0.base) (+ (select |#length| |cstrspn_#t~post2.base|) (- 1))))), 2098#(or (= 0 (select (select |#memory_int| |cstrspn_#t~post2.base|) |cstrspn_#t~post2.offset|)) (and (or (<= (select |#length| |cstrspn_#t~post2.base|) |cstrspn_#t~post2.offset|) (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base))) (<= (+ |cstrspn_#t~post2.offset| 1) cstrspn_~spanp~0.offset))), 2099#(or (and (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base)) (<= 1 cstrspn_~spanp~0.offset)) (= 0 |cstrspn_#t~mem3|)), 2100#(or (and (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base)) (<= 1 cstrspn_~spanp~0.offset)) (= 0 cstrspn_~sc~0)), 2101#(and (<= (+ cstrspn_~spanp~0.offset 1) (select |#length| cstrspn_~spanp~0.base)) (<= 1 cstrspn_~spanp~0.offset)), 2102#(and (<= 1 |cstrspn_#t~post2.offset|) (<= (+ |cstrspn_#t~post2.offset| 1) (select |#length| |cstrspn_#t~post2.base|)))] [2018-02-02 09:50:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:50:41,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:50:41,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:50:41,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:50:41,306 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand 14 states. [2018-02-02 09:50:41,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:41,631 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2018-02-02 09:50:41,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:50:41,661 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-02-02 09:50:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:41,662 INFO L225 Difference]: With dead ends: 108 [2018-02-02 09:50:41,662 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 09:50:41,662 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:50:41,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 09:50:41,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 43. [2018-02-02 09:50:41,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 09:50:41,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-02 09:50:41,664 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 36 [2018-02-02 09:50:41,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:41,664 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-02 09:50:41,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:50:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-02 09:50:41,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 09:50:41,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:41,665 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:41,665 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-02 09:50:41,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2017637709, now seen corresponding path program 3 times [2018-02-02 09:50:41,666 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:41,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:50:41,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:41,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 09:50:41,964 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:41,964 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 09:50:41,964 INFO L182 omatonBuilderFactory]: Interpolants [2276#true, 2277#false, 2278#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (= (select |#valid| |main_#t~malloc6.base|) 1)), 2279#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 2280#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base |main_#t~malloc7.base|)) (= main_~nondetString1~0.offset 0)), 2281#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 2282#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) (+ (select |#length| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset (- 1))))) (= main_~nondetString1~0.offset 0)), 2283#(= 0 (select (select |#memory_int| |cstrspn_#in~s1.base|) (+ (select |#length| |cstrspn_#in~s1.base|) (- 1)))), 2284#(= 0 (select (select |#memory_int| cstrspn_~p~0.base) (+ (select |#length| cstrspn_~p~0.base) (- 1)))), 2285#(and (= 0 (select (select |#memory_int| |cstrspn_#t~post0.base|) (+ (select |#length| |cstrspn_#t~post0.base|) (- 1)))) (= |cstrspn_#t~post0.base| cstrspn_~p~0.base)), 2286#(and (= cstrspn_~s2.base cstrspn_~spanp~0.base) (= cstrspn_~s2.offset cstrspn_~spanp~0.offset) (= 0 (select (select |#memory_int| cstrspn_~p~0.base) (+ (select |#length| cstrspn_~p~0.base) (- 1))))), 2287#(and (= |cstrspn_#t~post2.base| cstrspn_~s2.base) (= 0 (select (select |#memory_int| cstrspn_~p~0.base) (+ (select |#length| cstrspn_~p~0.base) (- 1)))) (= |cstrspn_#t~post2.offset| cstrspn_~s2.offset)), 2288#(and (= |cstrspn_#t~mem3| (select (select |#memory_int| cstrspn_~s2.base) cstrspn_~s2.offset)) (= 0 (select (select |#memory_int| cstrspn_~p~0.base) (+ (select |#length| cstrspn_~p~0.base) (- 1))))), 2289#(and (= cstrspn_~sc~0 (select (select |#memory_int| cstrspn_~s2.base) cstrspn_~s2.offset)) (= 0 (select (select |#memory_int| cstrspn_~p~0.base) (+ (select |#length| cstrspn_~p~0.base) (- 1))))), 2290#(not (= (select (select |#memory_int| cstrspn_~p~0.base) (+ (select |#length| cstrspn_~p~0.base) (- 1))) (select (select |#memory_int| cstrspn_~s2.base) cstrspn_~s2.offset))), 2291#(or (<= (select |#length| |cstrspn_#t~post0.base|) |cstrspn_#t~post0.offset|) (and (<= (+ |cstrspn_#t~post0.offset| 1) cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))) (not (= (select (select |#memory_int| |cstrspn_#t~post0.base|) |cstrspn_#t~post0.offset|) (select (select |#memory_int| cstrspn_~s2.base) cstrspn_~s2.offset)))), 2292#(or (and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))) (not (= |cstrspn_#t~mem1| (select (select |#memory_int| cstrspn_~s2.base) cstrspn_~s2.offset)))), 2293#(or (not (= cstrspn_~c~0 (select (select |#memory_int| cstrspn_~spanp~0.base) cstrspn_~spanp~0.offset))) (and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base)))), 2294#(or (not (= cstrspn_~c~0 (select (select |#memory_int| |cstrspn_#t~post2.base|) |cstrspn_#t~post2.offset|))) (and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base)))), 2295#(or (and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))) (not (= cstrspn_~c~0 |cstrspn_#t~mem3|))), 2296#(or (and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))) (not (= cstrspn_~c~0 cstrspn_~sc~0))), 2297#(and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))), 2298#(and (<= (+ |cstrspn_#t~post0.offset| 1) (select |#length| |cstrspn_#t~post0.base|)) (<= 1 |cstrspn_#t~post0.offset|))] [2018-02-02 09:50:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:50:41,965 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 09:50:41,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 09:50:41,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2018-02-02 09:50:41,965 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 23 states. [2018-02-02 09:50:42,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:42,759 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-02-02 09:50:42,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 09:50:42,759 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2018-02-02 09:50:42,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:42,760 INFO L225 Difference]: With dead ends: 81 [2018-02-02 09:50:42,760 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 09:50:42,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=344, Invalid=2106, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 09:50:42,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 09:50:42,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 48. [2018-02-02 09:50:42,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 09:50:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-02-02 09:50:42,762 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 42 [2018-02-02 09:50:42,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:42,762 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-02-02 09:50:42,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 09:50:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-02-02 09:50:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 09:50:42,762 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:42,762 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:42,763 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-02-02 09:50:42,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1167544427, now seen corresponding path program 1 times [2018-02-02 09:50:42,763 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:42,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 09:50:42,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:42,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:50:42,988 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:42,988 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 09:50:42,989 INFO L182 omatonBuilderFactory]: Interpolants [2496#(and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))), 2497#(and (<= (+ |cstrspn_#t~post0.offset| 1) (select |#length| |cstrspn_#t~post0.base|)) (<= 1 |cstrspn_#t~post0.offset|)), 2482#true, 2483#false, 2484#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (= (select |#valid| |main_#t~malloc6.base|) 1)), 2485#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 2486#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base |main_#t~malloc7.base|)) (= main_~nondetString1~0.offset 0)), 2487#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 2488#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) (+ (select |#length| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset (- 1))))) (= main_~nondetString1~0.offset 0)), 2489#(= 0 (select (select |#memory_int| |cstrspn_#in~s1.base|) (+ (select |#length| |cstrspn_#in~s1.base|) (- 1)))), 2490#(= 0 (select (select |#memory_int| cstrspn_~p~0.base) (+ (select |#length| cstrspn_~p~0.base) (- 1)))), 2491#(and (= 0 (select (select |#memory_int| |cstrspn_#t~post0.base|) (+ (select |#length| |cstrspn_#t~post0.base|) (- 1)))) (= |cstrspn_#t~post0.base| cstrspn_~p~0.base)), 2492#(or (and (<= (+ |cstrspn_#t~post0.offset| 1) cstrspn_~p~0.offset) (or (<= (select |#length| |cstrspn_#t~post0.base|) |cstrspn_#t~post0.offset|) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base)))) (= 0 (select (select |#memory_int| |cstrspn_#t~post0.base|) |cstrspn_#t~post0.offset|))), 2493#(or (and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))) (= 0 |cstrspn_#t~mem1|)), 2494#(or (and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))) (= 0 cstrspn_~c~0)), 2495#(or (and (<= 1 cstrspn_~p~0.offset) (<= (+ cstrspn_~p~0.offset 1) (select |#length| cstrspn_~p~0.base))) (not (= cstrspn_~c~0 cstrspn_~sc~0)))] [2018-02-02 09:50:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 09:50:42,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:50:42,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:50:42,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:50:42,989 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 16 states. [2018-02-02 09:50:43,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:43,358 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-02-02 09:50:43,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:50:43,358 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2018-02-02 09:50:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:43,358 INFO L225 Difference]: With dead ends: 53 [2018-02-02 09:50:43,358 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 09:50:43,358 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:50:43,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 09:50:43,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 09:50:43,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 09:50:43,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 09:50:43,359 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2018-02-02 09:50:43,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:43,359 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 09:50:43,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:50:43,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 09:50:43,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 09:50:43,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:50:43 BoogieIcfgContainer [2018-02-02 09:50:43,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:50:43,363 INFO L168 Benchmark]: Toolchain (without parser) took 7055.44 ms. Allocated memory was 402.1 MB in the beginning and 753.4 MB in the end (delta: 351.3 MB). Free memory was 358.6 MB in the beginning and 684.1 MB in the end (delta: -325.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 5.3 GB. [2018-02-02 09:50:43,363 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 402.1 MB. Free memory is still 363.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:50:43,364 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.64 ms. Allocated memory is still 402.1 MB. Free memory was 358.6 MB in the beginning and 348.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:50:43,364 INFO L168 Benchmark]: Boogie Preprocessor took 28.51 ms. Allocated memory is still 402.1 MB. Free memory was 348.0 MB in the beginning and 345.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:50:43,364 INFO L168 Benchmark]: RCFGBuilder took 210.69 ms. Allocated memory is still 402.1 MB. Free memory was 345.4 MB in the beginning and 328.2 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:50:43,364 INFO L168 Benchmark]: TraceAbstraction took 6651.23 ms. Allocated memory was 402.1 MB in the beginning and 753.4 MB in the end (delta: 351.3 MB). Free memory was 325.5 MB in the beginning and 684.1 MB in the end (delta: -358.6 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:50:43,365 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.16 ms. Allocated memory is still 402.1 MB. Free memory is still 363.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.64 ms. Allocated memory is still 402.1 MB. Free memory was 358.6 MB in the beginning and 348.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.51 ms. Allocated memory is still 402.1 MB. Free memory was 348.0 MB in the beginning and 345.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 210.69 ms. Allocated memory is still 402.1 MB. Free memory was 345.4 MB in the beginning and 328.2 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6651.23 ms. Allocated memory was 402.1 MB in the beginning and 753.4 MB in the end (delta: 351.3 MB). Free memory was 325.5 MB in the beginning and 684.1 MB in the end (delta: -358.6 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 9 error locations. SAFE Result, 6.6s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 482 SDtfs, 821 SDslu, 2189 SDs, 0 SdLazy, 2544 SolverSat, 188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 27/123 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 129 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 432 NumberOfCodeBlocks, 432 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 415 ConstructedInterpolants, 0 QuantifiedInterpolants, 121415 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 27/123 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-50-43-370.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-50-43-370.csv Received shutdown request...