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/cstrcspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 14:58:37,989 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 14:58:37,990 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 14:58:37,999 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 14:58:38,000 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 14:58:38,000 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 14:58:38,001 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 14:58:38,002 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 14:58:38,003 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 14:58:38,004 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 14:58:38,005 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 14:58:38,005 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 14:58:38,006 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 14:58:38,007 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 14:58:38,007 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 14:58:38,009 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 14:58:38,011 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 14:58:38,012 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 14:58:38,013 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 14:58:38,014 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 14:58:38,016 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 14:58:38,016 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 14:58:38,016 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 14:58:38,017 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 14:58:38,018 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 14:58:38,019 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 14:58:38,019 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 14:58:38,019 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 14:58:38,020 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 14:58:38,020 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 14:58:38,020 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 14:58:38,021 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 14:58:38,030 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 14:58:38,030 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 14:58:38,031 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 14:58:38,031 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 14:58:38,031 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 14:58:38,031 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 14:58:38,032 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 14:58:38,032 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 14:58:38,032 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 14:58:38,032 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 14:58:38,032 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 14:58:38,032 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 14:58:38,032 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 14:58:38,033 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 14:58:38,033 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 14:58:38,033 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 14:58:38,033 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 14:58:38,033 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 14:58:38,033 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 14:58:38,033 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:58:38,034 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 14:58:38,034 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 14:58:38,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 14:58:38,071 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 14:58:38,075 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 14:58:38,076 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 14:58:38,077 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 14:58:38,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-02-04 14:58:38,203 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 14:58:38,204 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 14:58:38,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 14:58:38,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 14:58:38,211 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 14:58:38,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:58:38" (1/1) ... [2018-02-04 14:58:38,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a67664e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:38, skipping insertion in model container [2018-02-04 14:58:38,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:58:38" (1/1) ... [2018-02-04 14:58:38,229 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:58:38,258 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:58:38,342 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:58:38,355 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:58:38,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:38 WrapperNode [2018-02-04 14:58:38,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 14:58:38,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 14:58:38,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 14:58:38,360 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 14:58:38,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:38" (1/1) ... [2018-02-04 14:58:38,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:38" (1/1) ... [2018-02-04 14:58:38,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:38" (1/1) ... [2018-02-04 14:58:38,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:38" (1/1) ... [2018-02-04 14:58:38,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:38" (1/1) ... [2018-02-04 14:58:38,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:38" (1/1) ... [2018-02-04 14:58:38,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:38" (1/1) ... [2018-02-04 14:58:38,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 14:58:38,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 14:58:38,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 14:58:38,386 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 14:58:38,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:38" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:58:38,425 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 14:58:38,425 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 14:58:38,425 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-02-04 14:58:38,425 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 14:58:38,425 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 14:58:38,425 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 14:58:38,425 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 14:58:38,425 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 14:58:38,425 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 14:58:38,425 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 14:58:38,426 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-02-04 14:58:38,426 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 14:58:38,426 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 14:58:38,426 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 14:58:38,637 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 14:58:38,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:58:38 BoogieIcfgContainer [2018-02-04 14:58:38,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 14:58:38,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 14:58:38,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 14:58:38,641 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 14:58:38,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:58:38" (1/3) ... [2018-02-04 14:58:38,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4748e1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:58:38, skipping insertion in model container [2018-02-04 14:58:38,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:38" (2/3) ... [2018-02-04 14:58:38,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4748e1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:58:38, skipping insertion in model container [2018-02-04 14:58:38,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:58:38" (3/3) ... [2018-02-04 14:58:38,644 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-02-04 14:58:38,649 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 14:58:38,654 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 14:58:38,687 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 14:58:38,687 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 14:58:38,687 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 14:58:38,687 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 14:58:38,687 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 14:58:38,687 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 14:58:38,688 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 14:58:38,688 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 14:58:38,688 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 14:58:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-02-04 14:58:38,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 14:58:38,704 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:38,705 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:38,705 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:58:38,710 INFO L82 PathProgramCache]: Analyzing trace with hash -21044599, now seen corresponding path program 1 times [2018-02-04 14:58:38,743 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:38,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:38,889 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 14:58:38,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:38,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:58:38,893 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:38,893 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 14:58:38,893 INFO L182 omatonBuilderFactory]: Interpolants [64#(= 1 (select |#valid| main_~nondetString1~0.base)), 61#true, 62#false, 63#(= 1 (select |#valid| |main_#t~malloc10.base|))] [2018-02-04 14:58:38,894 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 14:58:38,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:58:38,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:58:38,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:58:38,907 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-02-04 14:58:39,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:39,045 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-02-04 14:58:39,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:58:39,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 14:58:39,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:39,052 INFO L225 Difference]: With dead ends: 57 [2018-02-04 14:58:39,053 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 14:58:39,054 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:58:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 14:58:39,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 14:58:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 14:58:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-04 14:58:39,080 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-02-04 14:58:39,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:39,081 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-04 14:58:39,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:58:39,081 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-04 14:58:39,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 14:58:39,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:39,082 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:39,082 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:58:39,082 INFO L82 PathProgramCache]: Analyzing trace with hash -21044598, now seen corresponding path program 1 times [2018-02-04 14:58:39,083 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:39,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:39,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:39,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:58:39,192 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:39,193 INFO L182 omatonBuilderFactory]: Interpolants [178#true, 179#false, 180#(<= 1 main_~length1~0), 181#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length1~0) (= main_~length1~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 182#(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)), 183#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0))] [2018-02-04 14:58:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:39,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:58:39,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:58:39,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:58:39,196 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-02-04 14:58:39,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:39,248 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-02-04 14:58:39,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:58:39,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 14:58:39,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:39,250 INFO L225 Difference]: With dead ends: 53 [2018-02-04 14:58:39,250 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 14:58:39,250 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 14:58:39,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 14:58:39,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 14:58:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 14:58:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-02-04 14:58:39,255 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-02-04 14:58:39,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:39,255 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-02-04 14:58:39,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:58:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-02-04 14:58:39,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 14:58:39,255 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:39,256 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:39,256 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:58:39,256 INFO L82 PathProgramCache]: Analyzing trace with hash -652382516, now seen corresponding path program 1 times [2018-02-04 14:58:39,256 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:39,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:39,300 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 14:58:39,300 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:39,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:58:39,300 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:39,300 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 14:58:39,300 INFO L182 omatonBuilderFactory]: Interpolants [292#true, 293#false, 294#(= 1 (select |#valid| |main_#t~malloc11.base|)), 295#(= 1 (select |#valid| main_~nondetString2~0.base))] [2018-02-04 14:58:39,301 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 14:58:39,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:58:39,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:58:39,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:58:39,301 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-02-04 14:58:39,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:39,369 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-02-04 14:58:39,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:58:39,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 14:58:39,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:39,371 INFO L225 Difference]: With dead ends: 52 [2018-02-04 14:58:39,371 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 14:58:39,371 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 14:58:39,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 14:58:39,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 14:58:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 14:58:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-04 14:58:39,375 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-02-04 14:58:39,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:39,375 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-04 14:58:39,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:58:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-04 14:58:39,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 14:58:39,376 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:39,376 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:39,376 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:58:39,377 INFO L82 PathProgramCache]: Analyzing trace with hash -652382515, now seen corresponding path program 1 times [2018-02-04 14:58:39,377 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:39,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:39,451 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 14:58:39,451 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:39,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:58:39,451 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:39,451 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 14:58:39,451 INFO L182 omatonBuilderFactory]: Interpolants [402#true, 403#false, 404#(<= 1 main_~length2~0), 405#(and (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 406#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))] [2018-02-04 14:58:39,452 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 14:58:39,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:58:39,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:58:39,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:58:39,452 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-02-04 14:58:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:39,479 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-02-04 14:58:39,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:58:39,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 14:58:39,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:39,480 INFO L225 Difference]: With dead ends: 51 [2018-02-04 14:58:39,480 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 14:58:39,480 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 14:58:39,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 14:58:39,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 14:58:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 14:58:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-04 14:58:39,483 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-02-04 14:58:39,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:39,483 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-04 14:58:39,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:58:39,484 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-04 14:58:39,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 14:58:39,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:39,484 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:39,484 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:58:39,484 INFO L82 PathProgramCache]: Analyzing trace with hash 470787565, now seen corresponding path program 1 times [2018-02-04 14:58:39,485 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:39,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:39,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:39,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:58:39,526 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:39,526 INFO L182 omatonBuilderFactory]: Interpolants [512#false, 513#(= 1 (select |#valid| main_~nondetString1~0.base)), 514#(= 1 (select |#valid| |cstrcspn_#in~s1.base|)), 515#(= 1 (select |#valid| cstrcspn_~sc1~0.base)), 511#true] [2018-02-04 14:58:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:39,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:58:39,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:58:39,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:58:39,527 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-02-04 14:58:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:39,572 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-04 14:58:39,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:58:39,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 14:58:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:39,573 INFO L225 Difference]: With dead ends: 49 [2018-02-04 14:58:39,573 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 14:58:39,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:58:39,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 14:58:39,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 14:58:39,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 14:58:39,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-04 14:58:39,577 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-02-04 14:58:39,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:39,578 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-04 14:58:39,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:58:39,578 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-04 14:58:39,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 14:58:39,578 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:39,578 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:39,578 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:58:39,579 INFO L82 PathProgramCache]: Analyzing trace with hash 470787566, now seen corresponding path program 1 times [2018-02-04 14:58:39,579 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:39,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:39,659 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 14:58:39,659 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:39,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:58:39,660 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:39,660 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 14:58:39,660 INFO L182 omatonBuilderFactory]: Interpolants [616#true, 617#false, 618#(<= 1 main_~length1~0), 619#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length1~0)), 620#(and (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 621#(and (<= (+ main_~nondetString1~0.offset 1) (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 622#(and (<= 1 (select |#length| |cstrcspn_#in~s1.base|)) (= 0 |cstrcspn_#in~s1.offset|)), 623#(and (= cstrcspn_~sc1~0.offset 0) (<= 1 (select |#length| cstrcspn_~sc1~0.base)))] [2018-02-04 14:58:39,660 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 14:58:39,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:58:39,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:58:39,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:58:39,661 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-02-04 14:58:39,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:39,781 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-02-04 14:58:39,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:58:39,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-04 14:58:39,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:39,784 INFO L225 Difference]: With dead ends: 73 [2018-02-04 14:58:39,784 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 14:58:39,785 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:58:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 14:58:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-02-04 14:58:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 14:58:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-02-04 14:58:39,787 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2018-02-04 14:58:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:39,787 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-02-04 14:58:39,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:58:39,787 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-02-04 14:58:39,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 14:58:39,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:39,788 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:39,788 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:58:39,788 INFO L82 PathProgramCache]: Analyzing trace with hash 947097224, now seen corresponding path program 1 times [2018-02-04 14:58:39,789 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:39,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:39,821 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 14:58:39,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:39,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:58:39,822 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:39,822 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 14:58:39,822 INFO L182 omatonBuilderFactory]: Interpolants [758#true, 759#false, 760#(= 1 (select |#valid| main_~nondetString2~0.base)), 761#(= 1 (select |#valid| |cstrcspn_#in~s2.base|)), 762#(= 1 (select |#valid| cstrcspn_~s2.base)), 763#(= 1 (select |#valid| cstrcspn_~s~0.base))] [2018-02-04 14:58:39,822 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 14:58:39,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:58:39,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:58:39,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:58:39,823 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-02-04 14:58:39,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:39,887 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-02-04 14:58:39,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:58:39,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 14:58:39,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:39,889 INFO L225 Difference]: With dead ends: 53 [2018-02-04 14:58:39,889 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 14:58:39,889 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 14:58:39,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 14:58:39,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-02-04 14:58:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 14:58:39,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-04 14:58:39,892 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-02-04 14:58:39,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:39,892 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-04 14:58:39,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:58:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-04 14:58:39,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 14:58:39,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:39,893 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] [2018-02-04 14:58:39,893 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:58:39,893 INFO L82 PathProgramCache]: Analyzing trace with hash 947097225, now seen corresponding path program 1 times [2018-02-04 14:58:39,894 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:39,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:39,965 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 14:58:39,965 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:39,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 14:58:39,965 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:39,966 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 14:58:39,966 INFO L182 omatonBuilderFactory]: Interpolants [871#true, 872#false, 873#(<= 1 main_~length2~0), 874#(and (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 875#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 876#(and (= 0 main_~nondetString2~0.offset) (<= 1 (select |#length| main_~nondetString2~0.base))), 877#(and (= 0 |cstrcspn_#in~s2.offset|) (<= 1 (select |#length| |cstrcspn_#in~s2.base|))), 878#(and (<= 1 (select |#length| cstrcspn_~s2.base)) (= 0 cstrcspn_~s2.offset)), 879#(and (<= 1 (select |#length| cstrcspn_~s~0.base)) (= cstrcspn_~s~0.offset 0))] [2018-02-04 14:58:39,966 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 14:58:39,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:58:39,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:58:39,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:58:39,967 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-02-04 14:58:40,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:40,068 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-02-04 14:58:40,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:58:40,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-04 14:58:40,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:40,069 INFO L225 Difference]: With dead ends: 67 [2018-02-04 14:58:40,070 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 14:58:40,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:58:40,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 14:58:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-02-04 14:58:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 14:58:40,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-02-04 14:58:40,073 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2018-02-04 14:58:40,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:40,074 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-02-04 14:58:40,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:58:40,074 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-02-04 14:58:40,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 14:58:40,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:40,075 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] [2018-02-04 14:58:40,075 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:58:40,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1236428998, now seen corresponding path program 1 times [2018-02-04 14:58:40,076 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:40,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:40,174 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 14:58:40,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:40,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:58:40,174 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:40,175 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 14:58:40,175 INFO L182 omatonBuilderFactory]: Interpolants [1011#true, 1012#false, 1013#(= |#valid| |old(#valid)|), 1014#(and (= |old(#valid)| (store |#valid| |main_#t~malloc10.base| 0)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 1015#(and (= main_~nondetString1~0.base |main_#t~malloc10.base|) (= (select |#valid| main_~nondetString1~0.base) 1) (= |old(#valid)| (store |#valid| |main_#t~malloc10.base| 0))), 1016#(and (not (= |main_#t~malloc10.base| |main_#t~malloc11.base|)) (= |old(#valid)| (store (store |#valid| |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0))), 1017#(= |old(#valid)| (store |#valid| |main_#t~malloc11.base| 0))] [2018-02-04 14:58:40,175 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 14:58:40,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 14:58:40,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 14:58:40,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:58:40,176 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 7 states. [2018-02-04 14:58:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:40,277 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-02-04 14:58:40,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:58:40,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-02-04 14:58:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:40,278 INFO L225 Difference]: With dead ends: 57 [2018-02-04 14:58:40,279 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 14:58:40,279 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:58:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 14:58:40,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 14:58:40,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 14:58:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-02-04 14:58:40,281 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2018-02-04 14:58:40,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:40,282 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-02-04 14:58:40,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 14:58:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-02-04 14:58:40,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 14:58:40,282 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:40,283 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, 1] [2018-02-04 14:58:40,283 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:58:40,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1333847614, now seen corresponding path program 1 times [2018-02-04 14:58:40,284 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:40,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:40,309 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 14:58:40,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:40,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:58:40,309 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:40,310 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 14:58:40,310 INFO L182 omatonBuilderFactory]: Interpolants [1127#true, 1128#false, 1129#(not |cstrcspn_#t~short5|)] [2018-02-04 14:58:40,310 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 14:58:40,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 14:58:40,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 14:58:40,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:58:40,311 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2018-02-04 14:58:40,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:40,317 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-02-04 14:58:40,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 14:58:40,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-02-04 14:58:40,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:40,317 INFO L225 Difference]: With dead ends: 50 [2018-02-04 14:58:40,318 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 14:58:40,318 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:58:40,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 14:58:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 14:58:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 14:58:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-04 14:58:40,321 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-02-04 14:58:40,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:40,321 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-04 14:58:40,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 14:58:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-04 14:58:40,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 14:58:40,321 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:40,322 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, 1, 1, 1] [2018-02-04 14:58:40,322 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:58:40,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1745742785, now seen corresponding path program 1 times [2018-02-04 14:58:40,323 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:40,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:40,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:58:40,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:40,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 14:58:40,522 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:40,522 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 14:58:40,522 INFO L182 omatonBuilderFactory]: Interpolants [1232#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 1233#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= (select |#valid| |main_#t~malloc10.base|) 1)), 1234#(and (= (select |#valid| main_~nondetString1~0.base) 1) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1235#(and (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1236#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1237#(and (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) main_~nondetString1~0.offset)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 1238#(= 0 (select (select |#memory_int| |cstrcspn_#in~s1.base|) |cstrcspn_#in~s1.offset|)), 1239#(= 0 (select (select |#memory_int| cstrcspn_~sc1~0.base) cstrcspn_~sc1~0.offset)), 1240#(and (= |cstrcspn_#t~mem1| (select (select |#memory_int| cstrcspn_~sc1~0.base) cstrcspn_~sc1~0.offset)) (= 0 (select (select |#memory_int| cstrcspn_~sc1~0.base) cstrcspn_~sc1~0.offset))), 1230#true, 1231#false] [2018-02-04 14:58:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:58:40,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 14:58:40,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 14:58:40,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 14:58:40,523 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2018-02-04 14:58:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:40,684 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-02-04 14:58:40,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 14:58:40,685 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-02-04 14:58:40,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:40,685 INFO L225 Difference]: With dead ends: 62 [2018-02-04 14:58:40,685 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 14:58:40,685 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-02-04 14:58:40,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 14:58:40,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 14:58:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 14:58:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-02-04 14:58:40,687 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 30 [2018-02-04 14:58:40,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:40,687 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-02-04 14:58:40,687 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 14:58:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-02-04 14:58:40,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 14:58:40,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:40,688 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, 1, 1, 1] [2018-02-04 14:58:40,688 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:58:40,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1611729279, now seen corresponding path program 1 times [2018-02-04 14:58:40,688 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:40,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:40,777 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 14:58:40,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:40,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 14:58:40,777 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:40,777 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 14:58:40,777 INFO L182 omatonBuilderFactory]: Interpolants [1365#true, 1366#false, 1367#(and (<= main_~length2~0 1) (<= 1 main_~length2~0)), 1368#(and (<= main_~length2~0 1) (<= 1 main_~length2~0) (= 0 |main_#t~malloc11.offset|)), 1369#(and (= main_~nondetString2~0.offset 0) (= 1 (+ main_~nondetString2~0.offset main_~length2~0))), 1370#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset))), 1371#(= 0 (select (select |#memory_int| |cstrcspn_#in~s2.base|) |cstrcspn_#in~s2.offset|)), 1372#(= 0 (select (select |#memory_int| cstrcspn_~s2.base) cstrcspn_~s2.offset)), 1373#(= 0 (select (select |#memory_int| cstrcspn_~s~0.base) cstrcspn_~s~0.offset)), 1374#(and (= |cstrcspn_#t~mem3| (select (select |#memory_int| cstrcspn_~s~0.base) cstrcspn_~s~0.offset)) (= 0 (select (select |#memory_int| cstrcspn_~s~0.base) cstrcspn_~s~0.offset))), 1375#(not |cstrcspn_#t~short5|)] [2018-02-04 14:58:40,777 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 14:58:40,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 14:58:40,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 14:58:40,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 14:58:40,778 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 11 states. [2018-02-04 14:58:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:40,879 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-02-04 14:58:40,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 14:58:40,880 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-02-04 14:58:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:40,880 INFO L225 Difference]: With dead ends: 77 [2018-02-04 14:58:40,880 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 14:58:40,880 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-02-04 14:58:40,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 14:58:40,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-02-04 14:58:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 14:58:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-02-04 14:58:40,883 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 30 [2018-02-04 14:58:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:40,883 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-02-04 14:58:40,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 14:58:40,884 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-02-04 14:58:40,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 14:58:40,884 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:40,884 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, 1, 1, 1] [2018-02-04 14:58:40,885 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:58:40,885 INFO L82 PathProgramCache]: Analyzing trace with hash -193709055, now seen corresponding path program 1 times [2018-02-04 14:58:40,885 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:40,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:41,045 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 14:58:41,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:58:41,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 14:58:41,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:41,046 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 14:58:41,046 INFO L182 omatonBuilderFactory]: Interpolants [1540#true, 1541#false, 1542#(<= 1 main_~length2~0), 1543#(and (<= 1 main_~length2~0) (= 0 |main_#t~malloc11.offset|)), 1544#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0)), 1545#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset)) (<= 2 (select |#length| main_~nondetString2~0.base)))), 1546#(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|)), 1547#(and (or (<= 2 (select |#length| cstrcspn_~s2.base)) (= 0 (select (select |#memory_int| cstrcspn_~s2.base) cstrcspn_~s2.offset))) (= 0 cstrcspn_~s2.offset)), 1548#(and (or (<= 2 (select |#length| cstrcspn_~s~0.base)) (= 0 (select (select |#memory_int| cstrcspn_~s~0.base) cstrcspn_~s~0.offset))) (= cstrcspn_~s~0.offset 0)), 1549#(and (= cstrcspn_~s~0.offset 0) (or (<= 2 (select |#length| cstrcspn_~s~0.base)) (and (= |cstrcspn_#t~mem3| (select (select |#memory_int| cstrcspn_~s~0.base) cstrcspn_~s~0.offset)) (= 0 (select (select |#memory_int| cstrcspn_~s~0.base) cstrcspn_~s~0.offset))))), 1550#(and (= cstrcspn_~s~0.offset 0) (or (<= 2 (select |#length| cstrcspn_~s~0.base)) (not |cstrcspn_#t~short5|))), 1551#(and (<= 2 (select |#length| cstrcspn_~s~0.base)) (= cstrcspn_~s~0.offset 0)), 1552#(and (<= 1 cstrcspn_~s~0.offset) (<= (+ cstrcspn_~s~0.offset 1) (select |#length| cstrcspn_~s~0.base)))] [2018-02-04 14:58:41,046 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 14:58:41,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 14:58:41,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 14:58:41,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:58:41,047 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 13 states. [2018-02-04 14:58:41,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:41,237 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2018-02-04 14:58:41,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 14:58:41,237 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-02-04 14:58:41,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:41,238 INFO L225 Difference]: With dead ends: 103 [2018-02-04 14:58:41,238 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 14:58:41,238 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-02-04 14:58:41,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 14:58:41,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2018-02-04 14:58:41,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 14:58:41,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-02-04 14:58:41,243 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 30 [2018-02-04 14:58:41,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:41,243 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-02-04 14:58:41,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 14:58:41,244 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-02-04 14:58:41,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 14:58:41,244 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:41,245 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, 1, 1, 1, 1] [2018-02-04 14:58:41,245 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:58:41,245 INFO L82 PathProgramCache]: Analyzing trace with hash -276872451, now seen corresponding path program 1 times [2018-02-04 14:58:41,246 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:41,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:41,439 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 14:58:41,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:58:41,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 14:58:41,439 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:41,440 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 14:58:41,440 INFO L182 omatonBuilderFactory]: Interpolants [1760#(and (<= 1 main_~length1~0) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 1761#(and (= 0 main_~nondetString1~0.offset) (or (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) main_~nondetString1~0.offset)) (<= 2 (select |#length| main_~nondetString1~0.base))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 1762#(and (= 0 |cstrcspn_#in~s1.offset|) (or (<= 2 (select |#length| |cstrcspn_#in~s1.base|)) (= 0 (select (select |#memory_int| |cstrcspn_#in~s1.base|) |cstrcspn_#in~s1.offset|)))), 1763#(and (= cstrcspn_~sc1~0.offset 0) (or (= 0 (select (select |#memory_int| cstrcspn_~sc1~0.base) cstrcspn_~sc1~0.offset)) (<= 2 (select |#length| cstrcspn_~sc1~0.base)))), 1764#(and (= cstrcspn_~sc1~0.offset 0) (or (and (= |cstrcspn_#t~mem1| (select (select |#memory_int| cstrcspn_~sc1~0.base) cstrcspn_~sc1~0.offset)) (= 0 (select (select |#memory_int| cstrcspn_~sc1~0.base) cstrcspn_~sc1~0.offset))) (<= 2 (select |#length| cstrcspn_~sc1~0.base)))), 1765#(and (= cstrcspn_~sc1~0.offset 0) (<= 2 (select |#length| cstrcspn_~sc1~0.base))), 1766#(and (<= (+ cstrcspn_~sc1~0.offset 1) (select |#length| cstrcspn_~sc1~0.base)) (<= 1 cstrcspn_~sc1~0.offset)), 1754#true, 1755#false, 1756#(<= 1 main_~length1~0), 1757#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length1~0) (= (select |#valid| |main_#t~malloc10.base|) 1)), 1758#(and (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1759#(and (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0))] [2018-02-04 14:58:41,440 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 14:58:41,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 14:58:41,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 14:58:41,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:58:41,441 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 13 states. [2018-02-04 14:58:41,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:41,624 INFO L93 Difference]: Finished difference Result 170 states and 191 transitions. [2018-02-04 14:58:41,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 14:58:41,624 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-02-04 14:58:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:41,625 INFO L225 Difference]: With dead ends: 170 [2018-02-04 14:58:41,625 INFO L226 Difference]: Without dead ends: 170 [2018-02-04 14:58:41,625 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-02-04 14:58:41,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-04 14:58:41,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 127. [2018-02-04 14:58:41,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 14:58:41,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2018-02-04 14:58:41,628 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 31 [2018-02-04 14:58:41,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:41,629 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2018-02-04 14:58:41,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 14:58:41,629 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2018-02-04 14:58:41,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 14:58:41,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:41,630 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 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, 1] [2018-02-04 14:58:41,630 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:58:41,630 INFO L82 PathProgramCache]: Analyzing trace with hash 149792585, now seen corresponding path program 2 times [2018-02-04 14:58:41,631 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:41,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:41,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:58:41,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 14:58:41,864 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:41,864 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 14:58:41,864 INFO L182 omatonBuilderFactory]: Interpolants [2080#true, 2081#false, 2082#(and (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 2083#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 2084#(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))))), 2085#(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|)), 2086#(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)), 2087#(and (= cstrcspn_~s~0.offset 0) (or (= 0 (select (select |#memory_int| cstrcspn_~s~0.base) 1)) (<= (select |#length| cstrcspn_~s~0.base) 1) (<= 3 (select |#length| cstrcspn_~s~0.base)))), 2088#(and (or (<= (+ cstrcspn_~s~0.offset 2) (select |#length| cstrcspn_~s~0.base)) (<= (select |#length| cstrcspn_~s~0.base) cstrcspn_~s~0.offset) (= 0 (select (select |#memory_int| cstrcspn_~s~0.base) cstrcspn_~s~0.offset))) (= 1 cstrcspn_~s~0.offset)), 2089#(and (or (<= (+ cstrcspn_~s~0.offset 2) (select |#length| cstrcspn_~s~0.base)) (and (= |cstrcspn_#t~mem3| (select (select |#memory_int| cstrcspn_~s~0.base) cstrcspn_~s~0.offset)) (= 0 (select (select |#memory_int| cstrcspn_~s~0.base) cstrcspn_~s~0.offset)))) (= 1 cstrcspn_~s~0.offset)), 2090#(or (and (<= (+ cstrcspn_~s~0.offset 2) (select |#length| cstrcspn_~s~0.base)) (= 1 cstrcspn_~s~0.offset)) (not |cstrcspn_#t~short5|)), 2091#(and (<= (+ cstrcspn_~s~0.offset 2) (select |#length| cstrcspn_~s~0.base)) (= 1 cstrcspn_~s~0.offset)), 2092#(and (<= 2 cstrcspn_~s~0.offset) (<= (+ cstrcspn_~s~0.offset 1) (select |#length| cstrcspn_~s~0.base)))] [2018-02-04 14:58:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:41,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 14:58:41,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 14:58:41,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:58:41,865 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand 13 states. [2018-02-04 14:58:42,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:42,329 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2018-02-04 14:58:42,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 14:58:42,329 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-02-04 14:58:42,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:42,330 INFO L225 Difference]: With dead ends: 195 [2018-02-04 14:58:42,330 INFO L226 Difference]: Without dead ends: 195 [2018-02-04 14:58:42,330 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2018-02-04 14:58:42,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-04 14:58:42,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 141. [2018-02-04 14:58:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-04 14:58:42,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2018-02-04 14:58:42,334 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 37 [2018-02-04 14:58:42,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:42,335 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2018-02-04 14:58:42,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 14:58:42,335 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2018-02-04 14:58:42,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 14:58:42,336 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:42,336 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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 14:58:42,336 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:58:42,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1598751668, now seen corresponding path program 2 times [2018-02-04 14:58:42,337 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:42,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:42,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:58:42,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 14:58:42,703 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:42,703 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 14:58:42,703 INFO L182 omatonBuilderFactory]: Interpolants [2464#(and (<= (+ cstrcspn_~sc1~0.offset 2) (select |#length| cstrcspn_~sc1~0.base)) (<= 1 cstrcspn_~sc1~0.offset)), 2465#(and (<= 2 cstrcspn_~sc1~0.offset) (<= (+ cstrcspn_~sc1~0.offset 1) (select |#length| cstrcspn_~sc1~0.base))), 2453#true, 2454#false, 2455#(and (= 0 |main_#t~malloc10.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 2456#(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))), 2457#(and (= 0 main_~nondetString1~0.offset) (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 2458#(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))), 2459#(and (or (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) 1)) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1)) (= 0 main_~nondetString1~0.offset) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 2460#(and (= 0 |cstrcspn_#in~s1.offset|) (or (= 0 (select (select |#memory_int| |cstrcspn_#in~s1.base|) 1)) (<= 3 (select |#length| |cstrcspn_#in~s1.base|)) (<= (select |#length| |cstrcspn_#in~s1.base|) 1))), 2461#(and (= cstrcspn_~sc1~0.offset 0) (or (<= (select |#length| cstrcspn_~sc1~0.base) 1) (= 0 (select (select |#memory_int| cstrcspn_~sc1~0.base) 1)) (<= 3 (select |#length| cstrcspn_~sc1~0.base)))), 2462#(and (<= 1 cstrcspn_~sc1~0.offset) (or (and (= 1 cstrcspn_~sc1~0.offset) (= 0 (select (select |#memory_int| cstrcspn_~sc1~0.base) cstrcspn_~sc1~0.offset))) (<= (select |#length| cstrcspn_~sc1~0.base) cstrcspn_~sc1~0.offset) (<= (+ cstrcspn_~sc1~0.offset 2) (select |#length| cstrcspn_~sc1~0.base)))), 2463#(and (or (<= (+ cstrcspn_~sc1~0.offset 2) (select |#length| cstrcspn_~sc1~0.base)) (and (= |cstrcspn_#t~mem1| (select (select |#memory_int| cstrcspn_~sc1~0.base) cstrcspn_~sc1~0.offset)) (= 1 cstrcspn_~sc1~0.offset) (= 0 (select (select |#memory_int| cstrcspn_~sc1~0.base) cstrcspn_~sc1~0.offset)))) (<= 1 cstrcspn_~sc1~0.offset))] [2018-02-04 14:58:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:42,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 14:58:42,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 14:58:42,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:58:42,704 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 13 states. [2018-02-04 14:58:43,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:43,027 INFO L93 Difference]: Finished difference Result 246 states and 281 transitions. [2018-02-04 14:58:43,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 14:58:43,028 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-02-04 14:58:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:43,028 INFO L225 Difference]: With dead ends: 246 [2018-02-04 14:58:43,028 INFO L226 Difference]: Without dead ends: 246 [2018-02-04 14:58:43,029 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-02-04 14:58:43,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-04 14:58:43,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 193. [2018-02-04 14:58:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 14:58:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2018-02-04 14:58:43,033 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 44 [2018-02-04 14:58:43,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:43,034 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2018-02-04 14:58:43,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 14:58:43,034 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2018-02-04 14:58:43,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 14:58:43,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:43,035 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 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, 1] [2018-02-04 14:58:43,035 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:58:43,035 INFO L82 PathProgramCache]: Analyzing trace with hash -9798911, now seen corresponding path program 3 times [2018-02-04 14:58:43,036 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:43,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 14:58:43,168 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:58:43,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 14:58:43,168 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:43,168 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 14:58:43,169 INFO L182 omatonBuilderFactory]: Interpolants [2923#true, 2924#false, 2925#(and (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 2926#(and (= main_~nondetString2~0.offset 0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 2927#(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)))))), 2928#(= 0 (select (select |#memory_int| |cstrcspn_#in~s2.base|) (+ (select |#length| |cstrcspn_#in~s2.base|) (- 1)))), 2929#(= 0 (select (select |#memory_int| cstrcspn_~s2.base) (+ (select |#length| cstrcspn_~s2.base) (- 1)))), 2930#(= 0 (select (select |#memory_int| cstrcspn_~s~0.base) (+ (select |#length| cstrcspn_~s~0.base) (- 1)))), 2931#(or (<= (+ cstrcspn_~s~0.offset 2) (select |#length| cstrcspn_~s~0.base)) (<= (select |#length| cstrcspn_~s~0.base) cstrcspn_~s~0.offset) (= 0 (select (select |#memory_int| cstrcspn_~s~0.base) cstrcspn_~s~0.offset))), 2932#(or (and (<= 0 cstrcspn_~s~0.offset) (<= (+ cstrcspn_~s~0.offset 2) (select |#length| cstrcspn_~s~0.base))) (and (= |cstrcspn_#t~mem3| (select (select |#memory_int| cstrcspn_~s~0.base) cstrcspn_~s~0.offset)) (= 0 (select (select |#memory_int| cstrcspn_~s~0.base) cstrcspn_~s~0.offset)))), 2933#(or (and (<= 0 cstrcspn_~s~0.offset) (<= (+ cstrcspn_~s~0.offset 2) (select |#length| cstrcspn_~s~0.base))) (not |cstrcspn_#t~short5|)), 2934#(and (<= 0 cstrcspn_~s~0.offset) (<= (+ cstrcspn_~s~0.offset 2) (select |#length| cstrcspn_~s~0.base))), 2935#(and (<= 1 cstrcspn_~s~0.offset) (<= (+ cstrcspn_~s~0.offset 1) (select |#length| cstrcspn_~s~0.base)))] [2018-02-04 14:58:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 14:58:43,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 14:58:43,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 14:58:43,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:58:43,169 INFO L87 Difference]: Start difference. First operand 193 states and 226 transitions. Second operand 13 states. [2018-02-04 14:58:43,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:43,444 INFO L93 Difference]: Finished difference Result 253 states and 280 transitions. [2018-02-04 14:58:43,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 14:58:43,445 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-02-04 14:58:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:43,445 INFO L225 Difference]: With dead ends: 253 [2018-02-04 14:58:43,445 INFO L226 Difference]: Without dead ends: 253 [2018-02-04 14:58:43,446 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-02-04 14:58:43,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-04 14:58:43,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 121. [2018-02-04 14:58:43,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 14:58:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2018-02-04 14:58:43,449 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 44 [2018-02-04 14:58:43,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:43,449 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2018-02-04 14:58:43,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 14:58:43,450 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2018-02-04 14:58:43,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 14:58:43,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:43,451 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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 14:58:43,451 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:58:43,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1204099933, now seen corresponding path program 3 times [2018-02-04 14:58:43,451 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:43,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:43,661 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 14:58:43,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:58:43,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 14:58:43,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:43,661 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 14:58:43,661 INFO L182 omatonBuilderFactory]: Interpolants [3332#true, 3333#false, 3334#(and (= 0 |main_#t~malloc10.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 3335#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 3336#(and (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 3337#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 3338#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) (+ (select |#length| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset (- 1))))) (= main_~nondetString1~0.offset 0)), 3339#(= 0 (select (select |#memory_int| |cstrcspn_#in~s1.base|) (+ (select |#length| |cstrcspn_#in~s1.base|) (- 1)))), 3340#(= 0 (select (select |#memory_int| cstrcspn_~sc1~0.base) (+ (select |#length| cstrcspn_~sc1~0.base) (- 1)))), 3341#(or (<= (select |#length| cstrcspn_~sc1~0.base) cstrcspn_~sc1~0.offset) (<= (+ cstrcspn_~sc1~0.offset 2) (select |#length| cstrcspn_~sc1~0.base)) (= 0 (select (select |#memory_int| cstrcspn_~sc1~0.base) cstrcspn_~sc1~0.offset))), 3342#(and (or (<= (+ cstrcspn_~sc1~0.offset 2) (select |#length| cstrcspn_~sc1~0.base)) (and (= |cstrcspn_#t~mem1| (select (select |#memory_int| cstrcspn_~sc1~0.base) cstrcspn_~sc1~0.offset)) (= 0 (select (select |#memory_int| cstrcspn_~sc1~0.base) cstrcspn_~sc1~0.offset)))) (<= 0 cstrcspn_~sc1~0.offset)), 3343#(and (<= (+ cstrcspn_~sc1~0.offset 2) (select |#length| cstrcspn_~sc1~0.base)) (<= 0 cstrcspn_~sc1~0.offset)), 3344#(and (<= (+ cstrcspn_~sc1~0.offset 1) (select |#length| cstrcspn_~sc1~0.base)) (<= 1 cstrcspn_~sc1~0.offset))] [2018-02-04 14:58:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 14:58:43,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 14:58:43,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 14:58:43,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:58:43,662 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand 13 states. [2018-02-04 14:58:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:43,893 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-02-04 14:58:43,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 14:58:43,893 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-02-04 14:58:43,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:43,893 INFO L225 Difference]: With dead ends: 119 [2018-02-04 14:58:43,893 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 14:58:43,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-02-04 14:58:43,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 14:58:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 14:58:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 14:58:43,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 14:58:43,894 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-02-04 14:58:43,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:43,894 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 14:58:43,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 14:58:43,894 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 14:58:43,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 14:58:43,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:58:43 BoogieIcfgContainer [2018-02-04 14:58:43,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 14:58:43,898 INFO L168 Benchmark]: Toolchain (without parser) took 5695.00 ms. Allocated memory was 401.6 MB in the beginning and 715.7 MB in the end (delta: 314.0 MB). Free memory was 359.6 MB in the beginning and 532.6 MB in the end (delta: -173.0 MB). Peak memory consumption was 141.1 MB. Max. memory is 5.3 GB. [2018-02-04 14:58:43,899 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 14:58:43,899 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.36 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 347.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 14:58:43,900 INFO L168 Benchmark]: Boogie Preprocessor took 26.17 ms. Allocated memory is still 401.6 MB. Free memory was 347.6 MB in the beginning and 346.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:58:43,900 INFO L168 Benchmark]: RCFGBuilder took 251.68 ms. Allocated memory is still 401.6 MB. Free memory was 346.3 MB in the beginning and 325.1 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-02-04 14:58:43,900 INFO L168 Benchmark]: TraceAbstraction took 5259.71 ms. Allocated memory was 401.6 MB in the beginning and 715.7 MB in the end (delta: 314.0 MB). Free memory was 325.1 MB in the beginning and 532.6 MB in the end (delta: -207.4 MB). Peak memory consumption was 106.6 MB. Max. memory is 5.3 GB. [2018-02-04 14:58:43,901 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.15 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.36 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 347.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.17 ms. Allocated memory is still 401.6 MB. Free memory was 347.6 MB in the beginning and 346.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 251.68 ms. Allocated memory is still 401.6 MB. Free memory was 346.3 MB in the beginning and 325.1 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5259.71 ms. Allocated memory was 401.6 MB in the beginning and 715.7 MB in the end (delta: 314.0 MB). Free memory was 325.1 MB in the beginning and 532.6 MB in the end (delta: -207.4 MB). Peak memory consumption was 106.6 MB. 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: 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: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 15 error locations. SAFE Result, 5.2s OverallTime, 18 OverallIterations, 4 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 705 SDtfs, 1299 SDslu, 2132 SDs, 0 SdLazy, 2230 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 26/110 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, 18 MinimizatonAttempts, 337 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 495 NumberOfCodeBlocks, 495 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 477 ConstructedInterpolants, 0 QuantifiedInterpolants, 139730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 26/110 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/cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_14-58-43-907.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_14-58-43-907.csv Received shutdown request...