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/cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:51:21,806 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:51:21,807 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:51:21,819 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:51:21,820 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:51:21,820 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:51:21,821 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:51:21,823 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:51:21,824 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:51:21,825 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:51:21,826 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:51:21,826 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:51:21,827 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:51:21,828 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:51:21,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:51:21,830 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:51:21,832 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:51:21,833 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:51:21,834 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:51:21,835 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:51:21,837 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:51:21,837 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:51:21,837 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:51:21,838 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:51:21,839 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:51:21,840 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:51:21,840 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:51:21,840 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:51:21,840 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:51:21,841 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:51:21,841 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:51:21,841 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-02 19:51:21,850 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:51:21,850 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:51:21,851 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:51:21,851 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:51:21,851 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:51:21,851 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:51:21,851 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:51:21,852 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:51:21,852 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:51:21,852 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:51:21,852 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:51:21,852 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:51:21,852 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:51:21,852 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:51:21,852 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:51:21,852 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:51:21,852 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:51:21,853 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:51:21,853 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:51:21,853 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:51:21,853 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:51:21,853 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:51:21,853 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 19:51:21,880 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:51:21,893 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:51:21,895 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:51:21,896 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:51:21,896 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:51:21,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-02-02 19:51:22,015 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:51:22,016 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:51:22,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:51:22,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:51:22,022 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:51:22,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:51:22" (1/1) ... [2018-02-02 19:51:22,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ddca916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:51:22, skipping insertion in model container [2018-02-02 19:51:22,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:51:22" (1/1) ... [2018-02-02 19:51:22,035 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:51:22,062 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:51:22,150 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:51:22,164 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:51:22,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:51:22 WrapperNode [2018-02-02 19:51:22,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:51:22,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:51:22,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:51:22,171 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:51:22,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:51:22" (1/1) ... [2018-02-02 19:51:22,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:51:22" (1/1) ... [2018-02-02 19:51:22,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:51:22" (1/1) ... [2018-02-02 19:51:22,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:51:22" (1/1) ... [2018-02-02 19:51:22,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:51:22" (1/1) ... [2018-02-02 19:51:22,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:51:22" (1/1) ... [2018-02-02 19:51:22,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:51:22" (1/1) ... [2018-02-02 19:51:22,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:51:22,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:51:22,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:51:22,202 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:51:22,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:51:22" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:51:22,249 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:51:22,249 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:51:22,249 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-02-02 19:51:22,249 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:51:22,249 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 19:51:22,249 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 19:51:22,250 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:51:22,250 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:51:22,250 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:51:22,250 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 19:51:22,250 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-02-02 19:51:22,250 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:51:22,250 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:51:22,250 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:51:22,416 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:51:22,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:51:22 BoogieIcfgContainer [2018-02-02 19:51:22,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:51:22,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:51:22,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:51:22,419 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:51:22,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:51:22" (1/3) ... [2018-02-02 19:51:22,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1d6e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:51:22, skipping insertion in model container [2018-02-02 19:51:22,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:51:22" (2/3) ... [2018-02-02 19:51:22,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1d6e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:51:22, skipping insertion in model container [2018-02-02 19:51:22,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:51:22" (3/3) ... [2018-02-02 19:51:22,421 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-02-02 19:51:22,426 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:51:22,431 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-02 19:51:22,460 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:51:22,461 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:51:22,461 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 19:51:22,461 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 19:51:22,461 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:51:22,461 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:51:22,461 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:51:22,461 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:51:22,462 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:51:22,470 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-02-02 19:51:22,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 19:51:22,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:51:22,479 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:51:22,479 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:51:22,484 INFO L82 PathProgramCache]: Analyzing trace with hash 286131230, now seen corresponding path program 1 times [2018-02-02 19:51:22,517 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:51:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:51:22,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:51:22,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:22,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:51:22,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:51:22,685 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:51:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:22,686 INFO L182 omatonBuilderFactory]: Interpolants [59#true, 60#false, 61#(= 1 (select |#valid| |main_#t~malloc11.base|)), 62#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-02 19:51:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:22,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:51:22,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:51:22,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:51:22,696 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2018-02-02 19:51:22,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:51:22,837 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-02-02 19:51:22,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:51:22,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 19:51:22,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:51:22,845 INFO L225 Difference]: With dead ends: 55 [2018-02-02 19:51:22,846 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 19:51:22,847 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:51:22,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 19:51:22,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-02 19:51:22,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 19:51:22,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-02-02 19:51:22,868 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 13 [2018-02-02 19:51:22,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:51:22,869 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-02-02 19:51:22,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:51:22,869 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-02-02 19:51:22,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 19:51:22,869 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:51:22,869 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:51:22,869 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:51:22,870 INFO L82 PathProgramCache]: Analyzing trace with hash 286131231, now seen corresponding path program 1 times [2018-02-02 19:51:22,870 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:51:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:51:22,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:51:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:22,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:51:22,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:51:22,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:51:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:22,962 INFO L182 omatonBuilderFactory]: Interpolants [176#(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)), 177#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 172#true, 173#false, 174#(<= 1 main_~length1~0), 175#(and (= main_~length1~0 (select |#length| |main_#t~malloc11.base|)) (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length1~0))] [2018-02-02 19:51:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:22,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:51:22,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:51:22,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:51:22,963 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-02-02 19:51:23,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:51:23,054 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-02-02 19:51:23,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:51:23,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-02 19:51:23,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:51:23,056 INFO L225 Difference]: With dead ends: 51 [2018-02-02 19:51:23,056 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 19:51:23,057 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:51:23,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 19:51:23,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 19:51:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 19:51:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-02-02 19:51:23,061 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 13 [2018-02-02 19:51:23,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:51:23,062 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-02-02 19:51:23,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:51:23,062 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-02-02 19:51:23,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 19:51:23,062 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:51:23,062 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:51:23,063 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:51:23,063 INFO L82 PathProgramCache]: Analyzing trace with hash 280133580, now seen corresponding path program 1 times [2018-02-02 19:51:23,064 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:51:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:51:23,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:51:23,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,100 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:51:23,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:51:23,101 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:51:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,101 INFO L182 omatonBuilderFactory]: Interpolants [282#true, 283#false, 284#(= 1 (select |#valid| |main_#t~malloc12.base|)), 285#(= 1 (select |#valid| main_~nondetString2~0.base))] [2018-02-02 19:51:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:51:23,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:51:23,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:51:23,102 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 4 states. [2018-02-02 19:51:23,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:51:23,153 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-02 19:51:23,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:51:23,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 19:51:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:51:23,154 INFO L225 Difference]: With dead ends: 50 [2018-02-02 19:51:23,154 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 19:51:23,155 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:51:23,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 19:51:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 19:51:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 19:51:23,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-02 19:51:23,159 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 14 [2018-02-02 19:51:23,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:51:23,159 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-02 19:51:23,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:51:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-02 19:51:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 19:51:23,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:51:23,160 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:51:23,160 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:51:23,161 INFO L82 PathProgramCache]: Analyzing trace with hash 280133581, now seen corresponding path program 1 times [2018-02-02 19:51:23,161 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:51:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:51:23,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:51:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,221 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:51:23,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:51:23,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:51:23,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,221 INFO L182 omatonBuilderFactory]: Interpolants [388#true, 389#false, 390#(<= 1 main_~length2~0), 391#(and (= 0 |main_#t~malloc12.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc12.base|))), 392#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))] [2018-02-02 19:51:23,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:51:23,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:51:23,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:51:23,222 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-02-02 19:51:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:51:23,252 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-02 19:51:23,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:51:23,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 19:51:23,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:51:23,253 INFO L225 Difference]: With dead ends: 49 [2018-02-02 19:51:23,253 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 19:51:23,253 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:51:23,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 19:51:23,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-02 19:51:23,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 19:51:23,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-02-02 19:51:23,257 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 14 [2018-02-02 19:51:23,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:51:23,257 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-02-02 19:51:23,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:51:23,257 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-02-02 19:51:23,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 19:51:23,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:51:23,258 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:51:23,258 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:51:23,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1890531033, now seen corresponding path program 1 times [2018-02-02 19:51:23,259 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:51:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:51:23,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:51:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,296 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:51:23,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:51:23,296 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:51:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,296 INFO L182 omatonBuilderFactory]: Interpolants [496#(= 1 (select |#valid| |cstrcmp_#in~s1.base|)), 497#(= 1 (select |#valid| cstrcmp_~s1.base)), 493#true, 494#false, 495#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-02 19:51:23,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:51:23,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:51:23,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:51:23,297 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2018-02-02 19:51:23,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:51:23,349 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-02-02 19:51:23,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:51:23,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 19:51:23,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:51:23,350 INFO L225 Difference]: With dead ends: 46 [2018-02-02 19:51:23,351 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 19:51:23,351 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-02 19:51:23,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 19:51:23,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-02 19:51:23,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 19:51:23,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-02-02 19:51:23,354 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 18 [2018-02-02 19:51:23,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:51:23,354 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-02-02 19:51:23,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:51:23,354 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-02-02 19:51:23,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 19:51:23,355 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:51:23,355 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:51:23,355 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:51:23,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1890531034, now seen corresponding path program 1 times [2018-02-02 19:51:23,356 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:51:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:51:23,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:51:23,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:51:23,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:51:23,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:51:23,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,442 INFO L182 omatonBuilderFactory]: Interpolants [592#true, 593#false, 594#(<= 1 main_~length1~0), 595#(and (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length1~0)), 596#(and (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 597#(and (<= (+ main_~nondetString1~0.offset 1) (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 598#(and (<= 1 (select |#length| |cstrcmp_#in~s1.base|)) (= 0 |cstrcmp_#in~s1.offset|)), 599#(and (<= 1 (select |#length| cstrcmp_~s1.base)) (= cstrcmp_~s1.offset 0))] [2018-02-02 19:51:23,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:51:23,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:51:23,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:51:23,443 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 8 states. [2018-02-02 19:51:23,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:51:23,527 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-02-02 19:51:23,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:51:23,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-02 19:51:23,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:51:23,530 INFO L225 Difference]: With dead ends: 66 [2018-02-02 19:51:23,530 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 19:51:23,530 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-02 19:51:23,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 19:51:23,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2018-02-02 19:51:23,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 19:51:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-02-02 19:51:23,534 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 18 [2018-02-02 19:51:23,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:51:23,534 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-02-02 19:51:23,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:51:23,535 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-02-02 19:51:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 19:51:23,535 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:51:23,535 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:51:23,535 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:51:23,535 INFO L82 PathProgramCache]: Analyzing trace with hash -2045951649, now seen corresponding path program 1 times [2018-02-02 19:51:23,536 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:51:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:51:23,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:51:23,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,569 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:51:23,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:51:23,569 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:51:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,569 INFO L182 omatonBuilderFactory]: Interpolants [729#true, 730#false, 731#(= 1 (select |#valid| main_~nondetString2~0.base)), 732#(= 1 (select |#valid| |cstrcmp_#in~s2.base|)), 733#(= 1 (select |#valid| cstrcmp_~s2.base))] [2018-02-02 19:51:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:51:23,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:51:23,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:51:23,570 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 5 states. [2018-02-02 19:51:23,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:51:23,599 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-02-02 19:51:23,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:51:23,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-02 19:51:23,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:51:23,600 INFO L225 Difference]: With dead ends: 53 [2018-02-02 19:51:23,600 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 19:51:23,601 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-02 19:51:23,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 19:51:23,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-02 19:51:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 19:51:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-02-02 19:51:23,603 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 22 [2018-02-02 19:51:23,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:51:23,603 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-02-02 19:51:23,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:51:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-02-02 19:51:23,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 19:51:23,604 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:51:23,604 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:51:23,604 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:51:23,604 INFO L82 PathProgramCache]: Analyzing trace with hash -2045951648, now seen corresponding path program 1 times [2018-02-02 19:51:23,605 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:51:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:51:23,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:51:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,694 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:51:23,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:51:23,694 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:51:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,695 INFO L182 omatonBuilderFactory]: Interpolants [848#(and (<= 1 (select |#length| |cstrcmp_#in~s2.base|)) (= 0 |cstrcmp_#in~s2.offset|)), 849#(and (= cstrcmp_~s2.offset 0) (<= 1 (select |#length| cstrcmp_~s2.base))), 842#true, 843#false, 844#(<= 1 main_~length2~0), 845#(and (= 0 |main_#t~malloc12.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc12.base|))), 846#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 847#(and (= 0 main_~nondetString2~0.offset) (<= 1 (select |#length| main_~nondetString2~0.base)))] [2018-02-02 19:51:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:51:23,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:51:23,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:51:23,696 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2018-02-02 19:51:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:51:23,773 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-02-02 19:51:23,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:51:23,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-02 19:51:23,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:51:23,774 INFO L225 Difference]: With dead ends: 60 [2018-02-02 19:51:23,774 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 19:51:23,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:51:23,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 19:51:23,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-02-02 19:51:23,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 19:51:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-02-02 19:51:23,778 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 22 [2018-02-02 19:51:23,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:51:23,778 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-02-02 19:51:23,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:51:23,778 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-02-02 19:51:23,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 19:51:23,779 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:51:23,779 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] [2018-02-02 19:51:23,779 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:51:23,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1000289501, now seen corresponding path program 1 times [2018-02-02 19:51:23,780 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:51:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:51:23,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:51:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,799 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:51:23,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:51:23,799 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:51:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,799 INFO L182 omatonBuilderFactory]: Interpolants [969#true, 970#false, 971#(not |cstrcmp_#t~short3|)] [2018-02-02 19:51:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 19:51:23,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 19:51:23,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:51:23,800 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 3 states. [2018-02-02 19:51:23,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:51:23,804 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-02-02 19:51:23,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 19:51:23,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-02-02 19:51:23,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:51:23,805 INFO L225 Difference]: With dead ends: 57 [2018-02-02 19:51:23,805 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 19:51:23,805 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-02 19:51:23,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 19:51:23,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-02 19:51:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 19:51:23,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-02-02 19:51:23,807 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 23 [2018-02-02 19:51:23,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:51:23,807 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-02-02 19:51:23,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 19:51:23,807 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-02-02 19:51:23,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 19:51:23,807 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:51:23,807 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:51:23,807 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:51:23,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1354456010, now seen corresponding path program 1 times [2018-02-02 19:51:23,808 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:51:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:51:23,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:51:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,985 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:51:23,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 19:51:23,985 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:51:23,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,986 INFO L182 omatonBuilderFactory]: Interpolants [1088#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 1089#(and (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length1~0) (<= main_~length1~0 1)), 1090#(and (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 1091#(and (not (= main_~nondetString1~0.base |main_#t~malloc12.base|)) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 1092#(and (<= 1 main_~length1~0) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 1093#(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)), 1094#(= 0 (select (select |#memory_int| |cstrcmp_#in~s1.base|) |cstrcmp_#in~s1.offset|)), 1095#(= 0 (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset)), 1096#(and (= |cstrcmp_#t~mem0| (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset)) (= 0 (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset))), 1097#(not |cstrcmp_#t~short3|), 1086#true, 1087#false] [2018-02-02 19:51:23,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:23,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:51:23,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:51:23,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:51:23,987 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 12 states. [2018-02-02 19:51:24,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:51:24,191 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-02-02 19:51:24,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:51:24,191 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-02-02 19:51:24,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:51:24,192 INFO L225 Difference]: With dead ends: 86 [2018-02-02 19:51:24,192 INFO L226 Difference]: Without dead ends: 86 [2018-02-02 19:51:24,192 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:51:24,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-02 19:51:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2018-02-02 19:51:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-02 19:51:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-02-02 19:51:24,197 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 26 [2018-02-02 19:51:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:51:24,197 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-02-02 19:51:24,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:51:24,197 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-02-02 19:51:24,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 19:51:24,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:51:24,198 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:51:24,198 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:51:24,198 INFO L82 PathProgramCache]: Analyzing trace with hash 536807560, now seen corresponding path program 1 times [2018-02-02 19:51:24,199 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:51:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:51:24,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:51:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:24,381 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:51:24,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 19:51:24,381 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:51:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:24,381 INFO L182 omatonBuilderFactory]: Interpolants [1281#true, 1282#false, 1283#(<= 1 main_~length1~0), 1284#(and (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length1~0)), 1285#(and (= 0 main_~nondetString1~0.offset) (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (= (select |#valid| main_~nondetString1~0.base) 1)) (<= 1 main_~length1~0)), 1286#(and (or (not (= main_~nondetString1~0.base |main_#t~malloc12.base|)) (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1))) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1287#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1288#(and (= 0 main_~nondetString1~0.offset) (or (and (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) main_~nondetString1~0.offset)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 2 (select |#length| main_~nondetString1~0.base)))), 1289#(and (= 0 |cstrcmp_#in~s1.offset|) (or (<= 2 (select |#length| |cstrcmp_#in~s1.base|)) (= 0 (select (select |#memory_int| |cstrcmp_#in~s1.base|) |cstrcmp_#in~s1.offset|)))), 1290#(and (or (<= 2 (select |#length| cstrcmp_~s1.base)) (= 0 (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset))) (= cstrcmp_~s1.offset 0)), 1291#(and (or (<= 2 (select |#length| cstrcmp_~s1.base)) (and (= |cstrcmp_#t~mem0| (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset)) (= 0 (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset)))) (= cstrcmp_~s1.offset 0)), 1292#(and (= cstrcmp_~s1.offset 0) (or (not |cstrcmp_#t~short3|) (<= 2 (select |#length| cstrcmp_~s1.base)))), 1293#(and (<= 2 (select |#length| cstrcmp_~s1.base)) (= cstrcmp_~s1.offset 0)), 1294#(and (<= (+ cstrcmp_~s1.offset 1) (select |#length| cstrcmp_~s1.base)) (<= 1 cstrcmp_~s1.offset))] [2018-02-02 19:51:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:24,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 19:51:24,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 19:51:24,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:51:24,382 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 14 states. [2018-02-02 19:51:24,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:51:24,688 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2018-02-02 19:51:24,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:51:24,688 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-02-02 19:51:24,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:51:24,689 INFO L225 Difference]: With dead ends: 111 [2018-02-02 19:51:24,689 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 19:51:24,689 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2018-02-02 19:51:24,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 19:51:24,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 89. [2018-02-02 19:51:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 19:51:24,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2018-02-02 19:51:24,693 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 26 [2018-02-02 19:51:24,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:51:24,694 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2018-02-02 19:51:24,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 19:51:24,694 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-02-02 19:51:24,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 19:51:24,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:51:24,695 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 19:51:24,695 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:51:24,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2136962034, now seen corresponding path program 1 times [2018-02-02 19:51:24,696 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:51:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:51:24,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:51:24,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:24,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:51:24,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 19:51:24,840 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:51:24,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:24,841 INFO L182 omatonBuilderFactory]: Interpolants [1517#true, 1518#false, 1519#(and (<= main_~length2~0 1) (<= 1 main_~length2~0)), 1520#(and (<= main_~length2~0 1) (= 0 |main_#t~malloc12.offset|) (<= 1 main_~length2~0)), 1521#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (<= (+ main_~nondetString2~0.offset main_~length2~0) 1)), 1522#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset))), 1523#(= 0 (select (select |#memory_int| |cstrcmp_#in~s2.base|) |cstrcmp_#in~s2.offset|)), 1524#(= 0 (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset)), 1525#(and (= |cstrcmp_#t~mem0| (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset)) (= 0 (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset))), 1526#(or (not |cstrcmp_#t~short3|) (not (= (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset) (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset)))), 1527#(not (= (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset) (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset))), 1528#(not (= (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset) |cstrcmp_#t~mem1|)), 1529#(and (= |cstrcmp_#t~mem2| (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset)) (not (= (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset) |cstrcmp_#t~mem1|))), 1530#(not |cstrcmp_#t~short3|)] [2018-02-02 19:51:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:24,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 19:51:24,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 19:51:24,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:51:24,842 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 14 states. [2018-02-02 19:51:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:51:25,077 INFO L93 Difference]: Finished difference Result 150 states and 164 transitions. [2018-02-02 19:51:25,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 19:51:25,077 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-02-02 19:51:25,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:51:25,078 INFO L225 Difference]: With dead ends: 150 [2018-02-02 19:51:25,078 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 19:51:25,079 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2018-02-02 19:51:25,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 19:51:25,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 113. [2018-02-02 19:51:25,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 19:51:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-02-02 19:51:25,087 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 30 [2018-02-02 19:51:25,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:51:25,087 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-02-02 19:51:25,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 19:51:25,088 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-02-02 19:51:25,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 19:51:25,088 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:51:25,089 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 19:51:25,089 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:51:25,089 INFO L82 PathProgramCache]: Analyzing trace with hash 352566928, now seen corresponding path program 1 times [2018-02-02 19:51:25,090 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:51:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:51:25,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:51:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:25,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:51:25,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 19:51:25,274 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:51:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:25,274 INFO L182 omatonBuilderFactory]: Interpolants [1824#(and (= 0 |cstrcmp_#in~s2.offset|) (or (<= 2 (select |#length| |cstrcmp_#in~s2.base|)) (= 0 (select (select |#memory_int| |cstrcmp_#in~s2.base|) |cstrcmp_#in~s2.offset|)))), 1825#(and (= cstrcmp_~s2.offset 0) (or (<= 2 (select |#length| cstrcmp_~s2.base)) (= 0 (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset)))), 1826#(and (= cstrcmp_~s2.offset 0) (or (and (= |cstrcmp_#t~mem0| (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset)) (= 0 (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset))) (<= 2 (select |#length| cstrcmp_~s2.base)))), 1827#(and (= cstrcmp_~s2.offset 0) (or (not |cstrcmp_#t~short3|) (<= 2 (select |#length| cstrcmp_~s2.base)) (not (= (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset) (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset))))), 1828#(and (= cstrcmp_~s2.offset 0) (or (<= 2 (select |#length| cstrcmp_~s2.base)) (not (= (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset) (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset))))), 1829#(and (= cstrcmp_~s2.offset 0) (or (<= 2 (select |#length| cstrcmp_~s2.base)) (not (= (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset) |cstrcmp_#t~mem1|)))), 1830#(and (= cstrcmp_~s2.offset 0) (or (and (= |cstrcmp_#t~mem2| (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset)) (not (= (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset) |cstrcmp_#t~mem1|))) (<= 2 (select |#length| cstrcmp_~s2.base)))), 1831#(and (= cstrcmp_~s2.offset 0) (or (not |cstrcmp_#t~short3|) (<= 2 (select |#length| cstrcmp_~s2.base)))), 1832#(and (<= (+ cstrcmp_~s2.offset 1) (select |#length| cstrcmp_~s2.base)) (<= 1 cstrcmp_~s2.offset)), 1818#true, 1819#false, 1820#(<= 1 main_~length2~0), 1821#(and (= 0 |main_#t~malloc12.offset|) (<= 1 main_~length2~0)), 1822#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0)), 1823#(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))))] [2018-02-02 19:51:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:25,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:51:25,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:51:25,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:51:25,275 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 15 states. [2018-02-02 19:51:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:51:25,583 INFO L93 Difference]: Finished difference Result 142 states and 158 transitions. [2018-02-02 19:51:25,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 19:51:25,584 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2018-02-02 19:51:25,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:51:25,584 INFO L225 Difference]: With dead ends: 142 [2018-02-02 19:51:25,584 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 19:51:25,585 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2018-02-02 19:51:25,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 19:51:25,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 111. [2018-02-02 19:51:25,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 19:51:25,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2018-02-02 19:51:25,588 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 30 [2018-02-02 19:51:25,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:51:25,589 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2018-02-02 19:51:25,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:51:25,589 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2018-02-02 19:51:25,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 19:51:25,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:51:25,589 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:51:25,589 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:51:25,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1490010362, now seen corresponding path program 1 times [2018-02-02 19:51:25,590 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:51:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:51:25,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:51:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:25,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:51:25,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 19:51:25,937 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:51:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:25,937 INFO L182 omatonBuilderFactory]: Interpolants [2112#true, 2113#false, 2114#(and (= main_~length1~0 (select |#length| |main_#t~malloc11.base|)) (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc11.offset|)), 2115#(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))), 2116#(and (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (or (not (= main_~nondetString1~0.base |main_#t~malloc12.base|)) (not (= (+ main_~nondetString1~0.offset main_~length1~0) 2)))), 2117#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 2118#(and (or (and (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1)) (= 0 main_~nondetString1~0.offset)), 2119#(and (= 0 |cstrcmp_#in~s1.offset|) (or (<= 3 (select |#length| |cstrcmp_#in~s1.base|)) (= 0 (select (select |#memory_int| |cstrcmp_#in~s1.base|) 1)) (<= (select |#length| |cstrcmp_#in~s1.base|) 1))), 2120#(and (= cstrcmp_~s1.offset 0) (or (= 0 (select (select |#memory_int| cstrcmp_~s1.base) 1)) (<= (select |#length| cstrcmp_~s1.base) 1) (<= 3 (select |#length| cstrcmp_~s1.base)))), 2121#(or (and (or (<= (select |#length| cstrcmp_~s1.base) cstrcmp_~s1.offset) (<= (+ cstrcmp_~s1.offset 2) (select |#length| cstrcmp_~s1.base))) (<= 1 cstrcmp_~s1.offset)) (and (= 1 cstrcmp_~s1.offset) (= 0 (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset)))), 2122#(or (and (= 1 cstrcmp_~s1.offset) (= |cstrcmp_#t~mem0| (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset)) (= 0 (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset))) (and (<= 1 cstrcmp_~s1.offset) (<= (+ cstrcmp_~s1.offset 2) (select |#length| cstrcmp_~s1.base)))), 2123#(or (and (= 1 cstrcmp_~s1.offset) (not |cstrcmp_#t~short3|)) (and (<= 1 cstrcmp_~s1.offset) (<= (+ cstrcmp_~s1.offset 2) (select |#length| cstrcmp_~s1.base)))), 2124#(and (<= 1 cstrcmp_~s1.offset) (<= (+ cstrcmp_~s1.offset 2) (select |#length| cstrcmp_~s1.base))), 2125#(and (<= (+ cstrcmp_~s1.offset 1) (select |#length| cstrcmp_~s1.base)) (<= 2 cstrcmp_~s1.offset))] [2018-02-02 19:51:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:25,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 19:51:25,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 19:51:25,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:51:25,938 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 14 states. [2018-02-02 19:51:26,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:51:26,398 INFO L93 Difference]: Finished difference Result 152 states and 170 transitions. [2018-02-02 19:51:26,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:51:26,398 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-02-02 19:51:26,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:51:26,399 INFO L225 Difference]: With dead ends: 152 [2018-02-02 19:51:26,399 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 19:51:26,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2018-02-02 19:51:26,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 19:51:26,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 121. [2018-02-02 19:51:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 19:51:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2018-02-02 19:51:26,402 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 34 [2018-02-02 19:51:26,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:51:26,402 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2018-02-02 19:51:26,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 19:51:26,402 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2018-02-02 19:51:26,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 19:51:26,403 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:51:26,403 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:51:26,403 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:51:26,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1917317293, now seen corresponding path program 1 times [2018-02-02 19:51:26,403 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:51:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:51:26,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:51:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:26,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:51:26,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:51:26,468 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:51:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:26,468 INFO L182 omatonBuilderFactory]: Interpolants [2423#true, 2424#false, 2425#(= |#valid| |old(#valid)|), 2426#(and (= |old(#valid)| (store |#valid| |main_#t~malloc11.base| 0)) (= (select |#valid| |main_#t~malloc11.base|) 1)), 2427#(and (not (= |main_#t~malloc11.base| |main_#t~malloc12.base|)) (= (store (store |#valid| |main_#t~malloc12.base| 0) |main_#t~malloc11.base| (select (store |#valid| |main_#t~malloc11.base| 0) |main_#t~malloc11.base|)) |old(#valid)|)), 2428#(= |old(#valid)| (store |#valid| |main_#t~malloc12.base| (select (store |#valid| |main_#t~malloc12.base| 0) |main_#t~malloc12.base|)))] [2018-02-02 19:51:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:26,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:51:26,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:51:26,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:51:26,469 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand 6 states. [2018-02-02 19:51:26,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:51:26,558 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2018-02-02 19:51:26,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:51:26,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 19:51:26,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:51:26,559 INFO L225 Difference]: With dead ends: 120 [2018-02-02 19:51:26,559 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 19:51:26,559 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:51:26,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 19:51:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-02 19:51:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 19:51:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-02-02 19:51:26,560 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 35 [2018-02-02 19:51:26,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:51:26,561 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-02-02 19:51:26,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:51:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-02-02 19:51:26,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 19:51:26,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:51:26,564 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:51:26,564 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:51:26,564 INFO L82 PathProgramCache]: Analyzing trace with hash -124011648, now seen corresponding path program 2 times [2018-02-02 19:51:26,565 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:51:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:51:26,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:51:26,868 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:26,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:51:26,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 19:51:26,868 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:51:26,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:26,868 INFO L182 omatonBuilderFactory]: Interpolants [2624#(or (and (<= (+ cstrcmp_~s2.offset 2) (select |#length| cstrcmp_~s2.base)) (<= 1 cstrcmp_~s2.offset)) (and (= 1 cstrcmp_~s2.offset) (= |cstrcmp_#t~mem2| (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset)) (not (= (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset) |cstrcmp_#t~mem1|)))), 2625#(or (and (<= (+ cstrcmp_~s2.offset 2) (select |#length| cstrcmp_~s2.base)) (<= 1 cstrcmp_~s2.offset)) (and (= 1 cstrcmp_~s2.offset) (not |cstrcmp_#t~short3|))), 2626#(and (<= (+ cstrcmp_~s2.offset 1) (select |#length| cstrcmp_~s2.base)) (<= 2 cstrcmp_~s2.offset)), 2612#true, 2613#false, 2614#(and (= 0 |main_#t~malloc12.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc12.base|))), 2615#(and (= 0 main_~nondetString2~0.offset) (or (= (+ main_~nondetString2~0.offset main_~length2~0) 2) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))), 2616#(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))))), 2617#(and (or (<= (select |#length| |cstrcmp_#in~s2.base|) 1) (<= 3 (select |#length| |cstrcmp_#in~s2.base|)) (= 0 (select (select |#memory_int| |cstrcmp_#in~s2.base|) 1))) (= 0 |cstrcmp_#in~s2.offset|)), 2618#(and (= cstrcmp_~s2.offset 0) (or (<= (select |#length| cstrcmp_~s2.base) 1) (<= 3 (select |#length| cstrcmp_~s2.base)) (= 0 (select (select |#memory_int| cstrcmp_~s2.base) 1)))), 2619#(or (and (= 1 cstrcmp_~s2.offset) (= 0 (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset))) (and (<= 1 cstrcmp_~s2.offset) (or (<= (+ cstrcmp_~s2.offset 2) (select |#length| cstrcmp_~s2.base)) (<= (select |#length| cstrcmp_~s2.base) cstrcmp_~s2.offset)))), 2620#(or (and (<= 1 cstrcmp_~s2.offset) (or (<= (+ cstrcmp_~s2.offset 2) (select |#length| cstrcmp_~s2.base)) (<= (select |#length| cstrcmp_~s2.base) cstrcmp_~s2.offset))) (and (= 1 cstrcmp_~s2.offset) (= |cstrcmp_#t~mem0| (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset)) (= 0 (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset)))), 2621#(or (and (<= 1 cstrcmp_~s2.offset) (or (<= (+ cstrcmp_~s2.offset 2) (select |#length| cstrcmp_~s2.base)) (<= (select |#length| cstrcmp_~s2.base) cstrcmp_~s2.offset))) (and (= 1 cstrcmp_~s2.offset) (or (not |cstrcmp_#t~short3|) (not (= (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset) (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset)))))), 2622#(or (and (<= 1 cstrcmp_~s2.offset) (or (<= (+ cstrcmp_~s2.offset 2) (select |#length| cstrcmp_~s2.base)) (<= (select |#length| cstrcmp_~s2.base) cstrcmp_~s2.offset))) (and (= 1 cstrcmp_~s2.offset) (not (= (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset) (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset))))), 2623#(or (and (<= 1 cstrcmp_~s2.offset) (or (<= (+ cstrcmp_~s2.offset 2) (select |#length| cstrcmp_~s2.base)) (<= (select |#length| cstrcmp_~s2.base) cstrcmp_~s2.offset))) (and (= 1 cstrcmp_~s2.offset) (not (= (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset) |cstrcmp_#t~mem1|))))] [2018-02-02 19:51:26,869 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:26,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:51:26,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:51:26,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:51:26,869 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 15 states. [2018-02-02 19:51:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:51:27,336 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-02-02 19:51:27,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:51:27,336 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-02-02 19:51:27,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:51:27,336 INFO L225 Difference]: With dead ends: 61 [2018-02-02 19:51:27,336 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 19:51:27,337 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-02-02 19:51:27,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 19:51:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-02 19:51:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 19:51:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-02-02 19:51:27,338 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 38 [2018-02-02 19:51:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:51:27,338 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-02-02 19:51:27,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:51:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-02-02 19:51:27,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 19:51:27,339 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:51:27,339 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:51:27,339 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:51:27,339 INFO L82 PathProgramCache]: Analyzing trace with hash -2059418134, now seen corresponding path program 2 times [2018-02-02 19:51:27,340 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:51:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:51:27,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:51:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 19:51:27,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:51:27,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 19:51:27,502 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:51:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:27,502 INFO L182 omatonBuilderFactory]: Interpolants [2767#true, 2768#false, 2769#(and (= main_~length1~0 (select |#length| |main_#t~malloc11.base|)) (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc11.offset|)), 2770#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 2771#(and (not (= main_~nondetString1~0.base |main_#t~malloc12.base|)) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 2772#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 2773#(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)), 2774#(= 0 (select (select |#memory_int| |cstrcmp_#in~s1.base|) (+ (select |#length| |cstrcmp_#in~s1.base|) (- 1)))), 2775#(= 0 (select (select |#memory_int| cstrcmp_~s1.base) (+ (select |#length| cstrcmp_~s1.base) (- 1)))), 2776#(or (= 0 (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset)) (<= (select |#length| cstrcmp_~s1.base) cstrcmp_~s1.offset) (<= (+ cstrcmp_~s1.offset 2) (select |#length| cstrcmp_~s1.base))), 2777#(or (and (<= 0 cstrcmp_~s1.offset) (<= (+ cstrcmp_~s1.offset 2) (select |#length| cstrcmp_~s1.base))) (and (= |cstrcmp_#t~mem0| (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset)) (= 0 (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset)))), 2778#(or (and (<= 0 cstrcmp_~s1.offset) (<= (+ cstrcmp_~s1.offset 2) (select |#length| cstrcmp_~s1.base))) (not |cstrcmp_#t~short3|)), 2779#(and (<= 0 cstrcmp_~s1.offset) (<= (+ cstrcmp_~s1.offset 2) (select |#length| cstrcmp_~s1.base))), 2780#(and (<= (+ cstrcmp_~s1.offset 1) (select |#length| cstrcmp_~s1.base)) (<= 1 cstrcmp_~s1.offset))] [2018-02-02 19:51:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 19:51:27,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 19:51:27,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 19:51:27,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:51:27,503 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 14 states. [2018-02-02 19:51:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:51:27,777 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-02-02 19:51:27,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:51:27,777 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-02-02 19:51:27,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:51:27,777 INFO L225 Difference]: With dead ends: 58 [2018-02-02 19:51:27,778 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 19:51:27,778 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2018-02-02 19:51:27,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 19:51:27,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-02-02 19:51:27,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 19:51:27,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-02-02 19:51:27,779 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 42 [2018-02-02 19:51:27,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:51:27,779 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-02-02 19:51:27,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 19:51:27,779 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-02-02 19:51:27,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 19:51:27,779 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:51:27,779 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:51:27,780 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:51:27,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1298151312, now seen corresponding path program 3 times [2018-02-02 19:51:27,780 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:51:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:51:27,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:51:27,933 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 19:51:27,933 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:51:27,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 19:51:27,934 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:51:27,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:51:27,934 INFO L182 omatonBuilderFactory]: Interpolants [2917#true, 2918#false, 2919#(and (= 0 |main_#t~malloc12.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc12.base|))), 2920#(and (= main_~nondetString2~0.offset 0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 2921#(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)))))), 2922#(= 0 (select (select |#memory_int| |cstrcmp_#in~s2.base|) (+ (select |#length| |cstrcmp_#in~s2.base|) (- 1)))), 2923#(= 0 (select (select |#memory_int| cstrcmp_~s2.base) (+ (select |#length| cstrcmp_~s2.base) (- 1)))), 2924#(or (<= (+ cstrcmp_~s2.offset 2) (select |#length| cstrcmp_~s2.base)) (= 0 (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset)) (<= (select |#length| cstrcmp_~s2.base) cstrcmp_~s2.offset)), 2925#(or (<= (+ cstrcmp_~s2.offset 2) (select |#length| cstrcmp_~s2.base)) (and (= |cstrcmp_#t~mem0| (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset)) (= 0 (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset))) (<= (select |#length| cstrcmp_~s2.base) cstrcmp_~s2.offset)), 2926#(or (not |cstrcmp_#t~short3|) (<= (+ cstrcmp_~s2.offset 2) (select |#length| cstrcmp_~s2.base)) (not (= (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset) (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset))) (<= (select |#length| cstrcmp_~s2.base) cstrcmp_~s2.offset)), 2927#(or (<= (+ cstrcmp_~s2.offset 2) (select |#length| cstrcmp_~s2.base)) (not (= (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset) (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset))) (<= (select |#length| cstrcmp_~s2.base) cstrcmp_~s2.offset)), 2928#(or (<= (+ cstrcmp_~s2.offset 2) (select |#length| cstrcmp_~s2.base)) (not (= (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset) |cstrcmp_#t~mem1|)) (<= (select |#length| cstrcmp_~s2.base) cstrcmp_~s2.offset)), 2929#(or (and (= |cstrcmp_#t~mem2| (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset)) (not (= (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset) |cstrcmp_#t~mem1|))) (and (<= 0 cstrcmp_~s2.offset) (<= (+ cstrcmp_~s2.offset 2) (select |#length| cstrcmp_~s2.base)))), 2930#(or (not |cstrcmp_#t~short3|) (and (<= 0 cstrcmp_~s2.offset) (<= (+ cstrcmp_~s2.offset 2) (select |#length| cstrcmp_~s2.base)))), 2931#(and (<= (+ cstrcmp_~s2.offset 1) (select |#length| cstrcmp_~s2.base)) (<= 1 cstrcmp_~s2.offset))] [2018-02-02 19:51:27,934 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 19:51:27,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:51:27,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:51:27,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:51:27,935 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 15 states. [2018-02-02 19:51:28,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:51:28,496 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-02-02 19:51:28,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 19:51:28,496 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-02-02 19:51:28,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:51:28,496 INFO L225 Difference]: With dead ends: 55 [2018-02-02 19:51:28,496 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 19:51:28,496 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=795, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 19:51:28,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 19:51:28,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 19:51:28,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 19:51:28,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 19:51:28,497 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-02-02 19:51:28,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:51:28,497 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 19:51:28,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:51:28,497 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 19:51:28,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 19:51:28,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:51:28 BoogieIcfgContainer [2018-02-02 19:51:28,500 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:51:28,501 INFO L168 Benchmark]: Toolchain (without parser) took 6485.30 ms. Allocated memory was 399.5 MB in the beginning and 748.2 MB in the end (delta: 348.7 MB). Free memory was 356.2 MB in the beginning and 532.4 MB in the end (delta: -176.2 MB). Peak memory consumption was 172.5 MB. Max. memory is 5.3 GB. [2018-02-02 19:51:28,502 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 399.5 MB. Free memory is still 361.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:51:28,502 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.33 ms. Allocated memory is still 399.5 MB. Free memory was 356.2 MB in the beginning and 345.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 19:51:28,502 INFO L168 Benchmark]: Boogie Preprocessor took 31.35 ms. Allocated memory is still 399.5 MB. Free memory was 345.6 MB in the beginning and 343.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 19:51:28,502 INFO L168 Benchmark]: RCFGBuilder took 214.62 ms. Allocated memory is still 399.5 MB. Free memory was 343.0 MB in the beginning and 323.2 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. [2018-02-02 19:51:28,502 INFO L168 Benchmark]: TraceAbstraction took 6083.51 ms. Allocated memory was 399.5 MB in the beginning and 748.2 MB in the end (delta: 348.7 MB). Free memory was 323.2 MB in the beginning and 532.4 MB in the end (delta: -209.2 MB). Peak memory consumption was 139.5 MB. Max. memory is 5.3 GB. [2018-02-02 19:51:28,503 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.10 ms. Allocated memory is still 399.5 MB. Free memory is still 361.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.33 ms. Allocated memory is still 399.5 MB. Free memory was 356.2 MB in the beginning and 345.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 31.35 ms. Allocated memory is still 399.5 MB. Free memory was 345.6 MB in the beginning and 343.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 214.62 ms. Allocated memory is still 399.5 MB. Free memory was 343.0 MB in the beginning and 323.2 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6083.51 ms. Allocated memory was 399.5 MB in the beginning and 748.2 MB in the end (delta: 348.7 MB). Free memory was 323.2 MB in the beginning and 532.4 MB in the end (delta: -209.2 MB). Peak memory consumption was 139.5 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: 551]: 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, 56 locations, 15 error locations. SAFE Result, 6.0s OverallTime, 18 OverallIterations, 4 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 682 SDtfs, 1188 SDslu, 2320 SDs, 0 SdLazy, 2407 SolverSat, 200 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 26/122 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, 148 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 446 ConstructedInterpolants, 0 QuantifiedInterpolants, 120910 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 26/122 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/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_19-51-28-507.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_19-51-28-507.csv Received shutdown request...