java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 01:48:02,604 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:48:02,605 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:48:02,615 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:48:02,615 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:48:02,616 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:48:02,616 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:48:02,617 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:48:02,619 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:48:02,620 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:48:02,620 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:48:02,621 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:48:02,621 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:48:02,622 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:48:02,623 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:48:02,625 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:48:02,626 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:48:02,628 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:48:02,628 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:48:02,629 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:48:02,631 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:48:02,631 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:48:02,631 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:48:02,632 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:48:02,632 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:48:02,633 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:48:02,633 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:48:02,634 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:48:02,634 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:48:02,634 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:48:02,635 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:48:02,635 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 01:48:02,645 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:48:02,645 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:48:02,646 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:48:02,647 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:48:02,647 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:48:02,647 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:48:02,647 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:48:02,647 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:48:02,647 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:48:02,648 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:48:02,648 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:48:02,648 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:48:02,648 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:48:02,648 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:48:02,648 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:48:02,649 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:48:02,649 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:48:02,649 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:48:02,649 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:48:02,649 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:48:02,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:48:02,650 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:48:02,650 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 01:48:02,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:48:02,682 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:48:02,684 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:48:02,685 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:48:02,685 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:48:02,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:48:02,797 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:48:02,798 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:48:02,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:48:02,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:48:02,804 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:48:02,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:48:02" (1/1) ... [2018-02-04 01:48:02,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@454f3215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:02, skipping insertion in model container [2018-02-04 01:48:02,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:48:02" (1/1) ... [2018-02-04 01:48:02,823 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:48:02,852 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:48:02,949 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:48:02,962 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:48:02,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:02 WrapperNode [2018-02-04 01:48:02,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:48:02,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:48:02,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:48:02,968 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:48:02,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:02" (1/1) ... [2018-02-04 01:48:02,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:02" (1/1) ... [2018-02-04 01:48:02,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:02" (1/1) ... [2018-02-04 01:48:02,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:02" (1/1) ... [2018-02-04 01:48:02,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:02" (1/1) ... [2018-02-04 01:48:02,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:02" (1/1) ... [2018-02-04 01:48:02,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:02" (1/1) ... [2018-02-04 01:48:02,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:48:02,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:48:02,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:48:02,996 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:48:02,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:02" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:48:03,031 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:48:03,032 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:48:03,032 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-02-04 01:48:03,032 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:48:03,032 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:48:03,032 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:48:03,032 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:48:03,032 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:48:03,033 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:48:03,033 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:48:03,033 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-02-04 01:48:03,033 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:48:03,033 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:48:03,033 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:48:03,189 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:48:03,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:48:03 BoogieIcfgContainer [2018-02-04 01:48:03,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:48:03,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:48:03,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:48:03,192 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:48:03,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:48:02" (1/3) ... [2018-02-04 01:48:03,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78055849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:48:03, skipping insertion in model container [2018-02-04 01:48:03,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:48:02" (2/3) ... [2018-02-04 01:48:03,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78055849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:48:03, skipping insertion in model container [2018-02-04 01:48:03,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:48:03" (3/3) ... [2018-02-04 01:48:03,194 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:48:03,200 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:48:03,204 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 01:48:03,235 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:48:03,236 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:48:03,236 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 01:48:03,236 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 01:48:03,236 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:48:03,236 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:48:03,236 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:48:03,236 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:48:03,237 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:48:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-02-04 01:48:03,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:48:03,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:03,258 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:48:03,258 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:48:03,262 INFO L82 PathProgramCache]: Analyzing trace with hash -839073384, now seen corresponding path program 1 times [2018-02-04 01:48:03,310 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:03,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:03,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:48:03,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:48:03,539 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:03,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:03,539 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-04 01:48:03,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:03,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:48:03,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:48:03,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:48:03,550 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2018-02-04 01:48:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:03,653 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-04 01:48:03,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:48:03,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 01:48:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:03,660 INFO L225 Difference]: With dead ends: 44 [2018-02-04 01:48:03,660 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 01:48:03,661 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:48:03,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 01:48:03,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 01:48:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 01:48:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-04 01:48:03,686 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2018-02-04 01:48:03,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:03,686 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-04 01:48:03,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:48:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-04 01:48:03,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:48:03,687 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:03,687 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:48:03,687 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:48:03,688 INFO L82 PathProgramCache]: Analyzing trace with hash -839073383, now seen corresponding path program 1 times [2018-02-04 01:48:03,689 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:03,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:03,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:48:03,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:48:03,775 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:03,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:03,776 INFO L182 omatonBuilderFactory]: Interpolants [144#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 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-04 01:48:03,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:03,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:48:03,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:48:03,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:48:03,777 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2018-02-04 01:48:03,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:03,827 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-04 01:48:03,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:48:03,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 01:48:03,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:03,828 INFO L225 Difference]: With dead ends: 40 [2018-02-04 01:48:03,828 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 01:48:03,829 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-04 01:48:03,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 01:48:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-04 01:48:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 01:48:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-04 01:48:03,831 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2018-02-04 01:48:03,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:03,831 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-04 01:48:03,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:48:03,832 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-04 01:48:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 01:48:03,832 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:03,832 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:48:03,832 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:48:03,832 INFO L82 PathProgramCache]: Analyzing trace with hash -241471094, now seen corresponding path program 1 times [2018-02-04 01:48:03,833 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:03,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:03,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:48:03,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:48:03,868 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:03,868 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-04 01:48:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:03,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:48:03,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:48:03,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:48:03,869 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2018-02-04 01:48:03,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:03,927 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-02-04 01:48:03,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:48:03,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 01:48:03,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:03,928 INFO L225 Difference]: With dead ends: 39 [2018-02-04 01:48:03,928 INFO L226 Difference]: Without dead ends: 39 [2018-02-04 01:48:03,928 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-04 01:48:03,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-04 01:48:03,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-04 01:48:03,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 01:48:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-04 01:48:03,932 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 14 [2018-02-04 01:48:03,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:03,933 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-04 01:48:03,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:48:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-04 01:48:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 01:48:03,933 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:03,933 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:48:03,934 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:48:03,934 INFO L82 PathProgramCache]: Analyzing trace with hash -241471093, now seen corresponding path program 1 times [2018-02-04 01:48:03,935 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:03,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:03,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:03,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:48:03,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:48:03,999 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:03,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:03,999 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-04 01:48:04,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:04,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:48:04,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:48:04,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:48:04,000 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-02-04 01:48:04,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:04,031 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-02-04 01:48:04,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:48:04,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 01:48:04,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:04,032 INFO L225 Difference]: With dead ends: 38 [2018-02-04 01:48:04,032 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 01:48:04,033 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-04 01:48:04,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 01:48:04,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-04 01:48:04,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 01:48:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-04 01:48:04,036 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-02-04 01:48:04,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:04,036 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-04 01:48:04,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:48:04,036 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-04 01:48:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 01:48:04,037 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:04,037 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:48:04,037 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:48:04,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1727701620, now seen corresponding path program 1 times [2018-02-04 01:48:04,038 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:04,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:04,077 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:48:04,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:48:04,077 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:04,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:04,078 INFO L182 omatonBuilderFactory]: Interpolants [394#true, 395#false, 396#(= 1 (select |#valid| main_~nondetString1~0.base)), 397#(= 1 (select |#valid| |cstrcspn_#in~s1.base|)), 398#(= 1 (select |#valid| cstrcspn_~p~0.base)), 399#(= 1 (select |#valid| |cstrcspn_#t~post0.base|))] [2018-02-04 01:48:04,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:04,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:48:04,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:48:04,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:48:04,078 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-02-04 01:48:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:04,120 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-02-04 01:48:04,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:48:04,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 01:48:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:04,121 INFO L225 Difference]: With dead ends: 37 [2018-02-04 01:48:04,121 INFO L226 Difference]: Without dead ends: 37 [2018-02-04 01:48:04,121 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-04 01:48:04,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-04 01:48:04,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-04 01:48:04,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 01:48:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-02-04 01:48:04,123 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 19 [2018-02-04 01:48:04,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:04,123 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-02-04 01:48:04,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:48:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-02-04 01:48:04,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 01:48:04,124 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:04,124 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:48:04,124 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:48:04,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1727701619, now seen corresponding path program 1 times [2018-02-04 01:48:04,125 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:04,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:04,221 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:48:04,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 01:48:04,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:04,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:04,222 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| |cstrcspn_#in~s1.base|)) (= 0 |cstrcspn_#in~s1.offset|)), 485#(and (= 0 cstrcspn_~p~0.offset) (<= 1 (select |#length| cstrcspn_~p~0.base))), 486#(and (= |cstrcspn_#t~post0.offset| 0) (<= 1 (select |#length| |cstrcspn_#t~post0.base|))), 478#true, 479#false] [2018-02-04 01:48:04,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:04,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:48:04,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:48:04,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:48:04,222 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-02-04 01:48:04,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:04,294 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-04 01:48:04,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:48:04,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 01:48:04,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:04,294 INFO L225 Difference]: With dead ends: 41 [2018-02-04 01:48:04,294 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 01:48:04,295 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-04 01:48:04,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 01:48:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-02-04 01:48:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 01:48:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-04 01:48:04,296 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 19 [2018-02-04 01:48:04,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:04,297 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-04 01:48:04,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:48:04,297 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-04 01:48:04,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 01:48:04,297 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:04,297 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] [2018-02-04 01:48:04,297 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:48:04,297 INFO L82 PathProgramCache]: Analyzing trace with hash 929099078, now seen corresponding path program 1 times [2018-02-04 01:48:04,298 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:04,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:04,341 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:48:04,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:48:04,342 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:04,342 INFO L182 omatonBuilderFactory]: Interpolants [578#true, 579#false, 580#(= 1 (select |#valid| main_~nondetString2~0.base)), 581#(= 1 (select |#valid| |cstrcspn_#in~s2.base|)), 582#(= 1 (select |#valid| cstrcspn_~s2.base)), 583#(= 1 (select |#valid| cstrcspn_~spanp~0.base)), 584#(= 1 (select |#valid| |cstrcspn_#t~post2.base|))] [2018-02-04 01:48:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:04,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:48:04,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:48:04,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:48:04,342 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 7 states. [2018-02-04 01:48:04,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:04,401 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-04 01:48:04,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:48:04,402 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-04 01:48:04,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:04,402 INFO L225 Difference]: With dead ends: 40 [2018-02-04 01:48:04,403 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 01:48:04,403 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-04 01:48:04,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 01:48:04,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-02-04 01:48:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 01:48:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-04 01:48:04,406 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 22 [2018-02-04 01:48:04,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:04,407 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-04 01:48:04,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:48:04,407 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-04 01:48:04,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 01:48:04,408 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:04,408 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] [2018-02-04 01:48:04,408 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:48:04,408 INFO L82 PathProgramCache]: Analyzing trace with hash 929099079, now seen corresponding path program 1 times [2018-02-04 01:48:04,409 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:04,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:04,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:04,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:48:04,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 01:48:04,519 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:04,519 INFO L182 omatonBuilderFactory]: Interpolants [672#(<= 1 main_~length2~0), 673#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 674#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 675#(and (= 0 main_~nondetString2~0.offset) (<= 1 (select |#length| main_~nondetString2~0.base))), 676#(and (= 0 |cstrcspn_#in~s2.offset|) (<= 1 (select |#length| |cstrcspn_#in~s2.base|))), 677#(and (<= 1 (select |#length| cstrcspn_~s2.base)) (= 0 cstrcspn_~s2.offset)), 678#(and (<= 1 (select |#length| cstrcspn_~spanp~0.base)) (= 0 cstrcspn_~spanp~0.offset)), 679#(and (<= 1 (select |#length| |cstrcspn_#t~post2.base|)) (= |cstrcspn_#t~post2.offset| 0)), 670#true, 671#false] [2018-02-04 01:48:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:04,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:48:04,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:48:04,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:48:04,520 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 10 states. [2018-02-04 01:48:04,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:04,600 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-02-04 01:48:04,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:48:04,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-04 01:48:04,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:04,600 INFO L225 Difference]: With dead ends: 43 [2018-02-04 01:48:04,600 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 01:48:04,601 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:48:04,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 01:48:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-02-04 01:48:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 01:48:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-04 01:48:04,603 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 22 [2018-02-04 01:48:04,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:04,603 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-04 01:48:04,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:48:04,604 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-04 01:48:04,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 01:48:04,604 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:04,604 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:48:04,604 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:48:04,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1211791035, now seen corresponding path program 1 times [2018-02-04 01:48:04,605 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:04,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:04,746 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-04 01:48:04,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:48:04,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 01:48:04,747 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:04,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:04,747 INFO L182 omatonBuilderFactory]: Interpolants [772#true, 773#false, 774#(and (<= main_~length2~0 1) (<= 1 main_~length2~0)), 775#(and (= 0 |main_#t~malloc7.offset|) (<= main_~length2~0 1) (<= 1 main_~length2~0)), 776#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (<= (+ main_~nondetString2~0.offset main_~length2~0) 1)), 777#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset))), 778#(= 0 (select (select |#memory_int| |cstrcspn_#in~s2.base|) |cstrcspn_#in~s2.offset|)), 779#(= 0 (select (select |#memory_int| cstrcspn_~s2.base) cstrcspn_~s2.offset)), 780#(= 0 (select (select |#memory_int| cstrcspn_~spanp~0.base) cstrcspn_~spanp~0.offset)), 781#(= 0 (select (select |#memory_int| |cstrcspn_#t~post2.base|) |cstrcspn_#t~post2.offset|)), 782#(= 0 |cstrcspn_#t~mem3|), 783#(= cstrcspn_~sc~0 0)] [2018-02-04 01:48:04,747 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-04 01:48:04,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 01:48:04,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 01:48:04,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:48:04,748 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 12 states. [2018-02-04 01:48:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:04,988 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-02-04 01:48:04,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 01:48:04,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-02-04 01:48:04,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:04,989 INFO L225 Difference]: With dead ends: 79 [2018-02-04 01:48:04,990 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 01:48:04,990 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2018-02-04 01:48:04,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 01:48:04,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2018-02-04 01:48:04,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 01:48:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-04 01:48:04,994 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 27 [2018-02-04 01:48:04,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:04,995 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-04 01:48:04,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 01:48:04,995 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-04 01:48:04,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 01:48:04,996 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:04,996 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:48:04,996 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:48:04,996 INFO L82 PathProgramCache]: Analyzing trace with hash 394142585, now seen corresponding path program 1 times [2018-02-04 01:48:04,997 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:05,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:05,159 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-04 01:48:05,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:48:05,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 01:48:05,159 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:05,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:05,159 INFO L182 omatonBuilderFactory]: Interpolants [960#(and (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base)) (<= 1 cstrcspn_~spanp~0.offset)), 961#(and (<= (+ |cstrcspn_#t~post2.offset| 1) (select |#length| |cstrcspn_#t~post2.base|)) (<= 1 |cstrcspn_#t~post2.offset|)), 948#true, 949#false, 950#(<= 1 main_~length2~0), 951#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 952#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (or (= (+ main_~nondetString2~0.offset main_~length2~0) 1) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))), 953#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset)) (<= 2 (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base))))), 954#(and (or (<= 2 (select |#length| |cstrcspn_#in~s2.base|)) (= 0 (select (select |#memory_int| |cstrcspn_#in~s2.base|) |cstrcspn_#in~s2.offset|))) (= 0 |cstrcspn_#in~s2.offset|)), 955#(and (or (<= 2 (select |#length| cstrcspn_~s2.base)) (= 0 (select (select |#memory_int| cstrcspn_~s2.base) cstrcspn_~s2.offset))) (= 0 cstrcspn_~s2.offset)), 956#(and (or (<= 2 (select |#length| cstrcspn_~spanp~0.base)) (= 0 (select (select |#memory_int| cstrcspn_~spanp~0.base) cstrcspn_~spanp~0.offset))) (= 0 cstrcspn_~spanp~0.offset)), 957#(and (<= (+ |cstrcspn_#t~post2.offset| 1) cstrcspn_~spanp~0.offset) (= |cstrcspn_#t~post2.offset| 0) (or (<= (+ cstrcspn_~spanp~0.offset 1) (+ (select |#length| cstrcspn_~spanp~0.base) |cstrcspn_#t~post2.offset|)) (= 0 (select (select |#memory_int| |cstrcspn_#t~post2.base|) |cstrcspn_#t~post2.offset|)))), 958#(and (or (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base)) (= 0 |cstrcspn_#t~mem3|)) (<= 1 cstrcspn_~spanp~0.offset)), 959#(and (or (= cstrcspn_~sc~0 0) (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base))) (<= 1 cstrcspn_~spanp~0.offset))] [2018-02-04 01:48:05,159 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-04 01:48:05,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 01:48:05,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 01:48:05,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:48:05,160 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 14 states. [2018-02-04 01:48:05,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:05,487 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-02-04 01:48:05,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:48:05,488 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-02-04 01:48:05,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:05,490 INFO L225 Difference]: With dead ends: 78 [2018-02-04 01:48:05,490 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 01:48:05,490 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2018-02-04 01:48:05,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 01:48:05,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2018-02-04 01:48:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 01:48:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-02-04 01:48:05,495 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 27 [2018-02-04 01:48:05,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:05,495 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-02-04 01:48:05,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 01:48:05,495 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-02-04 01:48:05,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:48:05,496 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:05,496 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:48:05,497 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:48:05,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1089255981, now seen corresponding path program 1 times [2018-02-04 01:48:05,497 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:05,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:05,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:05,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:48:05,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 01:48:05,823 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:05,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:05,823 INFO L182 omatonBuilderFactory]: Interpolants [1130#true, 1131#false, 1132#(<= 1 main_~length1~0), 1133#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~length1~0) (= (select |#valid| |main_#t~malloc6.base|) 1)), 1134#(and (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1135#(and (not (= main_~nondetString1~0.base |main_#t~malloc7.base|)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1136#(and (<= 1 main_~length1~0) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 1137#(and (= 0 main_~nondetString1~0.offset) (or (= (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) 0) (<= 2 (select |#length| main_~nondetString1~0.base))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 1138#(and (= 0 |cstrcspn_#in~s1.offset|) (or (<= 2 (select |#length| |cstrcspn_#in~s1.base|)) (= (select (select |#memory_int| |cstrcspn_#in~s1.base|) |cstrcspn_#in~s1.offset|) 0))), 1139#(and (= 0 cstrcspn_~p~0.offset) (or (= (select (select |#memory_int| cstrcspn_~p~0.base) cstrcspn_~p~0.offset) 0) (<= 2 (select |#length| cstrcspn_~p~0.base)))), 1140#(and (or (= (select (select |#memory_int| |cstrcspn_#t~post0.base|) |cstrcspn_#t~post0.offset|) 0) (and (<= (+ cstrcspn_~p~0.offset 1) (+ |cstrcspn_#t~post0.offset| (select |#length| |cstrcspn_#t~post0.base|))) (= |cstrcspn_#t~post0.base| cstrcspn_~p~0.base) (<= (+ |cstrcspn_#t~post0.offset| 1) cstrcspn_~p~0.offset))) (= |cstrcspn_#t~post0.offset| 0)), 1141#(or (= |cstrcspn_#t~mem1| 0) (and (<= 1 cstrcspn_~p~0.offset) (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)))), 1142#(or (= cstrcspn_~c~0 0) (and (<= 1 cstrcspn_~p~0.offset) (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)))), 1143#(or (not (= cstrcspn_~sc~0 0)) (and (<= 1 cstrcspn_~p~0.offset) (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)))), 1144#(and (<= 1 cstrcspn_~p~0.offset) (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base))), 1145#(and (<= (+ |cstrcspn_#t~post0.offset| 1) (select |#length| |cstrcspn_#t~post0.base|)) (<= 1 |cstrcspn_#t~post0.offset|))] [2018-02-04 01:48:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:05,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:48:05,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:48:05,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:48:05,824 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 16 states. [2018-02-04 01:48:06,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:06,123 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2018-02-04 01:48:06,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 01:48:06,123 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-02-04 01:48:06,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:06,124 INFO L225 Difference]: With dead ends: 100 [2018-02-04 01:48:06,124 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 01:48:06,124 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-02-04 01:48:06,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 01:48:06,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-02-04 01:48:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 01:48:06,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2018-02-04 01:48:06,128 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 28 [2018-02-04 01:48:06,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:06,128 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2018-02-04 01:48:06,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:48:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2018-02-04 01:48:06,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 01:48:06,129 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:06,129 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-04 01:48:06,129 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:48:06,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1759144044, now seen corresponding path program 1 times [2018-02-04 01:48:06,130 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:06,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:06,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:06,208 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:48:06,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:48:06,208 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:06,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:06,208 INFO L182 omatonBuilderFactory]: Interpolants [1367#true, 1368#false, 1369#(= |#valid| |old(#valid)|), 1370#(and (= (store |#valid| |main_#t~malloc6.base| 0) |old(#valid)|) (= (select |#valid| |main_#t~malloc6.base|) 1)), 1371#(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)|)), 1372#(= |old(#valid)| (store |#valid| |main_#t~malloc7.base| (select (store |#valid| |main_#t~malloc7.base| 0) |main_#t~malloc7.base|)))] [2018-02-04 01:48:06,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:06,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:48:06,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:48:06,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:48:06,209 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 6 states. [2018-02-04 01:48:06,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:06,282 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-02-04 01:48:06,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:48:06,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-04 01:48:06,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:06,283 INFO L225 Difference]: With dead ends: 92 [2018-02-04 01:48:06,283 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 01:48:06,283 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:48:06,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 01:48:06,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-04 01:48:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 01:48:06,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-02-04 01:48:06,287 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 32 [2018-02-04 01:48:06,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:06,287 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-02-04 01:48:06,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:48:06,287 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-02-04 01:48:06,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 01:48:06,288 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:06,288 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, 1] [2018-02-04 01:48:06,288 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:48:06,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1832996809, now seen corresponding path program 2 times [2018-02-04 01:48:06,289 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:06,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:06,523 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-04 01:48:06,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:48:06,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 01:48:06,523 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:06,523 INFO L182 omatonBuilderFactory]: Interpolants [1551#true, 1552#false, 1553#(and (= 0 |main_#t~malloc7.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 1554#(and (= 0 main_~nondetString2~0.offset) (or (= (+ main_~nondetString2~0.offset main_~length2~0) 2) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))), 1555#(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))))), 1556#(and (or (<= (select |#length| |cstrcspn_#in~s2.base|) 1) (= 0 (select (select |#memory_int| |cstrcspn_#in~s2.base|) 1)) (<= 3 (select |#length| |cstrcspn_#in~s2.base|))) (= 0 |cstrcspn_#in~s2.offset|)), 1557#(and (or (<= (select |#length| cstrcspn_~s2.base) 1) (= 0 (select (select |#memory_int| cstrcspn_~s2.base) 1)) (<= 3 (select |#length| cstrcspn_~s2.base))) (= 0 cstrcspn_~s2.offset)), 1558#(and (or (= 0 (select (select |#memory_int| cstrcspn_~spanp~0.base) 1)) (<= (select |#length| cstrcspn_~spanp~0.base) 1) (<= 3 (select |#length| cstrcspn_~spanp~0.base))) (= 0 cstrcspn_~spanp~0.offset)), 1559#(and (or (and (or (<= (+ (select |#length| cstrcspn_~spanp~0.base) |cstrcspn_#t~post2.offset|) cstrcspn_~spanp~0.offset) (<= (+ cstrcspn_~spanp~0.offset 2) (+ (select |#length| cstrcspn_~spanp~0.base) |cstrcspn_#t~post2.offset|))) (<= (+ |cstrcspn_#t~post2.offset| 1) cstrcspn_~spanp~0.offset)) (and (= 0 (select (select |#memory_int| cstrcspn_~spanp~0.base) 1)) (<= (+ |cstrcspn_#t~post2.offset| 1) cstrcspn_~spanp~0.offset) (<= cstrcspn_~spanp~0.offset (+ |cstrcspn_#t~post2.offset| 1)))) (= |cstrcspn_#t~post2.offset| 0)), 1560#(or (and (or (<= (select |#length| cstrcspn_~spanp~0.base) cstrcspn_~spanp~0.offset) (<= (+ cstrcspn_~spanp~0.offset 2) (select |#length| cstrcspn_~spanp~0.base))) (<= 1 cstrcspn_~spanp~0.offset)) (and (= 0 (select (select |#memory_int| cstrcspn_~spanp~0.base) 1)) (<= cstrcspn_~spanp~0.offset 1) (<= 1 cstrcspn_~spanp~0.offset))), 1561#(or (and (= 1 |cstrcspn_#t~post2.offset|) (= 0 (select (select |#memory_int| |cstrcspn_#t~post2.base|) |cstrcspn_#t~post2.offset|))) (and (<= 2 cstrcspn_~spanp~0.offset) (or (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base)) (<= (select |#length| |cstrcspn_#t~post2.base|) |cstrcspn_#t~post2.offset|)))), 1562#(or (and (<= 2 cstrcspn_~spanp~0.offset) (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base))) (= 0 |cstrcspn_#t~mem3|)), 1563#(or (= cstrcspn_~sc~0 0) (and (<= 2 cstrcspn_~spanp~0.offset) (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base)))), 1564#(and (<= 2 cstrcspn_~spanp~0.offset) (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base))), 1565#(and (<= (+ |cstrcspn_#t~post2.offset| 1) (select |#length| |cstrcspn_#t~post2.base|)) (<= 2 |cstrcspn_#t~post2.offset|))] [2018-02-04 01:48:06,523 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-04 01:48:06,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 01:48:06,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 01:48:06,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:48:06,524 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 15 states. [2018-02-04 01:48:06,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:06,929 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-02-04 01:48:06,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 01:48:06,929 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-02-04 01:48:06,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:06,930 INFO L225 Difference]: With dead ends: 104 [2018-02-04 01:48:06,930 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 01:48:06,930 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2018-02-04 01:48:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 01:48:06,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2018-02-04 01:48:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 01:48:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2018-02-04 01:48:06,933 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 32 [2018-02-04 01:48:06,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:06,934 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-02-04 01:48:06,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 01:48:06,934 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-02-04 01:48:06,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 01:48:06,935 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:06,935 INFO L351 BasicCegarLoop]: trace histogram [3, 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-04 01:48:06,935 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:48:06,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1916750925, now seen corresponding path program 2 times [2018-02-04 01:48:06,936 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:06,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:07,199 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:07,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:48:07,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 01:48:07,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:07,200 INFO L182 omatonBuilderFactory]: Interpolants [1792#(and (= 0 main_~nondetString1~0.offset) (not (= main_~nondetString1~0.base |main_#t~malloc7.base|)) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 1793#(and (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 1794#(and (or (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1) (= (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) 0)) (= 0 main_~nondetString1~0.offset) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 1795#(and (or (<= 3 (select |#length| |cstrcspn_#in~s1.base|)) (= (select (select |#memory_int| |cstrcspn_#in~s1.base|) 1) 0) (<= (select |#length| |cstrcspn_#in~s1.base|) 1)) (= 0 |cstrcspn_#in~s1.offset|)), 1796#(and (= 0 cstrcspn_~p~0.offset) (or (= (select (select |#memory_int| cstrcspn_~p~0.base) 1) 0) (<= 3 (select |#length| cstrcspn_~p~0.base)) (<= (select |#length| cstrcspn_~p~0.base) 1))), 1797#(and (= |cstrcspn_#t~post0.offset| 0) (or (and (or (<= (+ |cstrcspn_#t~post0.offset| (select |#length| |cstrcspn_#t~post0.base|)) cstrcspn_~p~0.offset) (<= (+ cstrcspn_~p~0.offset 2) (+ |cstrcspn_#t~post0.offset| (select |#length| |cstrcspn_#t~post0.base|)))) (= |cstrcspn_#t~post0.base| cstrcspn_~p~0.base) (<= (+ |cstrcspn_#t~post0.offset| 1) cstrcspn_~p~0.offset)) (and (= (select (select |#memory_int| |cstrcspn_#t~post0.base|) 1) 0) (= |cstrcspn_#t~post0.base| cstrcspn_~p~0.base) (<= cstrcspn_~p~0.offset (+ |cstrcspn_#t~post0.offset| 1)) (<= (+ |cstrcspn_#t~post0.offset| 1) cstrcspn_~p~0.offset)))), 1798#(or (and (<= 1 cstrcspn_~p~0.offset) (or (<= (+ cstrcspn_~p~0.offset 2) (select |#length| cstrcspn_~p~0.base)) (<= (select |#length| cstrcspn_~p~0.base) cstrcspn_~p~0.offset))) (and (<= 1 cstrcspn_~p~0.offset) (= (select (select |#memory_int| cstrcspn_~p~0.base) 1) 0) (<= cstrcspn_~p~0.offset 1))), 1799#(or (and (= (select (select |#memory_int| |cstrcspn_#t~post0.base|) |cstrcspn_#t~post0.offset|) 0) (= 1 |cstrcspn_#t~post0.offset|)) (and (<= 2 cstrcspn_~p~0.offset) (or (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)) (<= (select |#length| |cstrcspn_#t~post0.base|) |cstrcspn_#t~post0.offset|)))), 1800#(or (= |cstrcspn_#t~mem1| 0) (and (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)) (<= 2 cstrcspn_~p~0.offset))), 1801#(or (= cstrcspn_~c~0 0) (and (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)) (<= 2 cstrcspn_~p~0.offset))), 1802#(or (not (= cstrcspn_~sc~0 0)) (and (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)) (<= 2 cstrcspn_~p~0.offset))), 1803#(and (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)) (<= 2 cstrcspn_~p~0.offset)), 1804#(and (<= (+ |cstrcspn_#t~post0.offset| 1) (select |#length| |cstrcspn_#t~post0.base|)) (<= 2 |cstrcspn_#t~post0.offset|)), 1788#true, 1789#false, 1790#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (= (select |#valid| |main_#t~malloc6.base|) 1)), 1791#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2)))] [2018-02-04 01:48:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:07,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 01:48:07,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 01:48:07,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-04 01:48:07,201 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 17 states. [2018-02-04 01:48:07,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:07,654 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-02-04 01:48:07,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 01:48:07,654 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-02-04 01:48:07,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:07,655 INFO L225 Difference]: With dead ends: 126 [2018-02-04 01:48:07,655 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 01:48:07,656 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2018-02-04 01:48:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 01:48:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2018-02-04 01:48:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 01:48:07,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-02-04 01:48:07,660 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 37 [2018-02-04 01:48:07,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:07,660 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-02-04 01:48:07,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 01:48:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-02-04 01:48:07,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 01:48:07,661 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:07,661 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, 1] [2018-02-04 01:48:07,661 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:48:07,661 INFO L82 PathProgramCache]: Analyzing trace with hash -685943431, now seen corresponding path program 3 times [2018-02-04 01:48:07,662 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:07,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 01:48:07,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:48:07,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 01:48:07,801 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:07,801 INFO L182 omatonBuilderFactory]: Interpolants [2083#true, 2084#false, 2085#(and (= 0 |main_#t~malloc7.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 2086#(and (= main_~nondetString2~0.offset 0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 2087#(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)))))), 2088#(= 0 (select (select |#memory_int| |cstrcspn_#in~s2.base|) (+ (select |#length| |cstrcspn_#in~s2.base|) (- 1)))), 2089#(= 0 (select (select |#memory_int| cstrcspn_~s2.base) (+ (select |#length| cstrcspn_~s2.base) (- 1)))), 2090#(= 0 (select (select |#memory_int| cstrcspn_~spanp~0.base) (+ (select |#length| cstrcspn_~spanp~0.base) (- 1)))), 2091#(or (and (<= (+ |cstrcspn_#t~post2.offset| 1) cstrcspn_~spanp~0.offset) (or (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base)) (<= (select |#length| |cstrcspn_#t~post2.base|) |cstrcspn_#t~post2.offset|))) (= 0 (select (select |#memory_int| |cstrcspn_#t~post2.base|) |cstrcspn_#t~post2.offset|))), 2092#(or (and (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base)) (<= 1 cstrcspn_~spanp~0.offset)) (= 0 |cstrcspn_#t~mem3|)), 2093#(or (= cstrcspn_~sc~0 0) (and (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base)) (<= 1 cstrcspn_~spanp~0.offset))), 2094#(and (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base)) (<= 1 cstrcspn_~spanp~0.offset)), 2095#(and (<= (+ |cstrcspn_#t~post2.offset| 1) (select |#length| |cstrcspn_#t~post2.base|)) (<= 1 |cstrcspn_#t~post2.offset|))] [2018-02-04 01:48:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 01:48:07,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 01:48:07,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 01:48:07,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:48:07,802 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 13 states. [2018-02-04 01:48:08,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:08,136 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-02-04 01:48:08,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:48:08,137 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-02-04 01:48:08,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:08,137 INFO L225 Difference]: With dead ends: 121 [2018-02-04 01:48:08,137 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 01:48:08,137 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-02-04 01:48:08,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 01:48:08,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 85. [2018-02-04 01:48:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 01:48:08,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-02-04 01:48:08,140 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 37 [2018-02-04 01:48:08,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:08,141 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-02-04 01:48:08,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 01:48:08,141 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-02-04 01:48:08,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 01:48:08,142 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:48:08,142 INFO L351 BasicCegarLoop]: trace histogram [4, 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-04 01:48:08,142 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:48:08,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1271271661, now seen corresponding path program 3 times [2018-02-04 01:48:08,143 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:48:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:48:08,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:48:08,325 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 01:48:08,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:48:08,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 01:48:08,326 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:48:08,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:48:08,326 INFO L182 omatonBuilderFactory]: Interpolants [2336#(and (<= (+ |cstrcspn_#t~post0.offset| 1) cstrcspn_~p~0.offset) (or (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)) (= (select (select |#memory_int| |cstrcspn_#t~post0.base|) |cstrcspn_#t~post0.offset|) 0) (<= (select |#length| |cstrcspn_#t~post0.base|) |cstrcspn_#t~post0.offset|))), 2337#(and (<= 1 cstrcspn_~p~0.offset) (or (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)) (= |cstrcspn_#t~mem1| 0))), 2338#(and (<= 1 cstrcspn_~p~0.offset) (or (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)) (= cstrcspn_~c~0 0))), 2339#(and (<= 1 cstrcspn_~p~0.offset) (or (not (= cstrcspn_~sc~0 0)) (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)))), 2340#(and (<= 1 cstrcspn_~p~0.offset) (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base))), 2341#(and (<= (+ |cstrcspn_#t~post0.offset| 1) (select |#length| |cstrcspn_#t~post0.base|)) (<= 1 |cstrcspn_#t~post0.offset|)), 2326#true, 2327#false, 2328#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (= (select |#valid| |main_#t~malloc6.base|) 1)), 2329#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 2330#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base |main_#t~malloc7.base|)) (= main_~nondetString1~0.offset 0)), 2331#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 2332#(and (= (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)))) 0) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 2333#(= (select (select |#memory_int| |cstrcspn_#in~s1.base|) (+ (select |#length| |cstrcspn_#in~s1.base|) (- 1))) 0), 2334#(= (select (select |#memory_int| cstrcspn_~p~0.base) (+ (select |#length| cstrcspn_~p~0.base) (- 1))) 0), 2335#(and (= (select (select |#memory_int| |cstrcspn_#t~post0.base|) (+ (select |#length| |cstrcspn_#t~post0.base|) (- 1))) 0) (= |cstrcspn_#t~post0.base| cstrcspn_~p~0.base))] [2018-02-04 01:48:08,326 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 01:48:08,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:48:08,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:48:08,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:48:08,327 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 16 states. [2018-02-04 01:48:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:48:08,593 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-02-04 01:48:08,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:48:08,594 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-04 01:48:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:48:08,594 INFO L225 Difference]: With dead ends: 93 [2018-02-04 01:48:08,594 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 01:48:08,594 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-04 01:48:08,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 01:48:08,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 01:48:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 01:48:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 01:48:08,595 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-02-04 01:48:08,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:48:08,595 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 01:48:08,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:48:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 01:48:08,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 01:48:08,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:48:08 BoogieIcfgContainer [2018-02-04 01:48:08,598 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:48:08,599 INFO L168 Benchmark]: Toolchain (without parser) took 5801.64 ms. Allocated memory was 403.2 MB in the beginning and 739.8 MB in the end (delta: 336.6 MB). Free memory was 361.4 MB in the beginning and 690.4 MB in the end (delta: -329.0 MB). Peak memory consumption was 7.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:48:08,600 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:48:08,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.09 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 349.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:48:08,600 INFO L168 Benchmark]: Boogie Preprocessor took 27.90 ms. Allocated memory is still 403.2 MB. Free memory was 349.4 MB in the beginning and 348.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 01:48:08,601 INFO L168 Benchmark]: RCFGBuilder took 193.50 ms. Allocated memory is still 403.2 MB. Free memory was 348.1 MB in the beginning and 330.1 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-02-04 01:48:08,601 INFO L168 Benchmark]: TraceAbstraction took 5408.19 ms. Allocated memory was 403.2 MB in the beginning and 739.8 MB in the end (delta: 336.6 MB). Free memory was 328.7 MB in the beginning and 690.5 MB in the end (delta: -361.8 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:48:08,602 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.09 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 169.09 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 349.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.90 ms. Allocated memory is still 403.2 MB. Free memory was 349.4 MB in the beginning and 348.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 193.50 ms. Allocated memory is still 403.2 MB. Free memory was 348.1 MB in the beginning and 330.1 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5408.19 ms. Allocated memory was 403.2 MB in the beginning and 739.8 MB in the end (delta: 336.6 MB). Free memory was 328.7 MB in the beginning and 690.5 MB in the end (delta: -361.8 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: 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: 554]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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, 5.3s OverallTime, 16 OverallIterations, 4 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 459 SDtfs, 715 SDslu, 2001 SDs, 0 SdLazy, 2053 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 21/88 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, 16 MinimizatonAttempts, 89 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 386 ConstructedInterpolants, 0 QuantifiedInterpolants, 108162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 21/88 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_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-48-08-608.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-48-08-608.csv Received shutdown request...