java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 01:45:56,215 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:45:56,217 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:45:56,229 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:45:56,230 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:45:56,230 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:45:56,231 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:45:56,233 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:45:56,234 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:45:56,235 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:45:56,236 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:45:56,236 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:45:56,237 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:45:56,237 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:45:56,238 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:45:56,240 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:45:56,242 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:45:56,243 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:45:56,244 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:45:56,245 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:45:56,247 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:45:56,247 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:45:56,247 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:45:56,248 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:45:56,249 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:45:56,250 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:45:56,250 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:45:56,251 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:45:56,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:45:56,251 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:45:56,251 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:45:56,251 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 01:45:56,260 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:45:56,261 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:45:56,262 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:45:56,262 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:45:56,262 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:45:56,262 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:45:56,262 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:45:56,262 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:45:56,262 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:45:56,262 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:45:56,262 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:45:56,263 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:45:56,263 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:45:56,263 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:45:56,263 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:45:56,263 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:45:56,263 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:45:56,263 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:45:56,263 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:45:56,263 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:45:56,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:45:56,264 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:45:56,264 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 01:45:56,290 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:45:56,298 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:45:56,300 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:45:56,301 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:45:56,302 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:45:56,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:45:56,445 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:45:56,446 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:45:56,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:45:56,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:45:56,450 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:45:56,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:45:56" (1/1) ... [2018-02-04 01:45:56,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4abb2661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:56, skipping insertion in model container [2018-02-04 01:45:56,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:45:56" (1/1) ... [2018-02-04 01:45:56,462 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:45:56,489 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:45:56,576 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:45:56,590 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:45:56,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:56 WrapperNode [2018-02-04 01:45:56,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:45:56,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:45:56,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:45:56,595 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:45:56,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:56" (1/1) ... [2018-02-04 01:45:56,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:56" (1/1) ... [2018-02-04 01:45:56,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:56" (1/1) ... [2018-02-04 01:45:56,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:56" (1/1) ... [2018-02-04 01:45:56,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:56" (1/1) ... [2018-02-04 01:45:56,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:56" (1/1) ... [2018-02-04 01:45:56,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:56" (1/1) ... [2018-02-04 01:45:56,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:45:56,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:45:56,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:45:56,617 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:45:56,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:56" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:45:56,655 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:45:56,655 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:45:56,655 INFO L136 BoogieDeclarations]: Found implementation of procedure cstpcpy [2018-02-04 01:45:56,655 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:45:56,655 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:45:56,655 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:45:56,655 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:45:56,655 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:45:56,656 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:45:56,656 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:45:56,656 INFO L128 BoogieDeclarations]: Found specification of procedure cstpcpy [2018-02-04 01:45:56,656 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:45:56,656 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:45:56,656 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:45:56,803 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:45:56,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:45:56 BoogieIcfgContainer [2018-02-04 01:45:56,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:45:56,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:45:56,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:45:56,807 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:45:56,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:45:56" (1/3) ... [2018-02-04 01:45:56,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cfe08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:45:56, skipping insertion in model container [2018-02-04 01:45:56,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:56" (2/3) ... [2018-02-04 01:45:56,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cfe08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:45:56, skipping insertion in model container [2018-02-04 01:45:56,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:45:56" (3/3) ... [2018-02-04 01:45:56,809 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:45:56,816 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:45:56,820 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-02-04 01:45:56,850 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:45:56,851 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:45:56,851 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 01:45:56,851 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 01:45:56,851 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:45:56,851 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:45:56,851 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:45:56,851 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:45:56,852 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:45:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-02-04 01:45:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 01:45:56,871 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:56,872 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:56,872 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 01:45:56,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1122979584, now seen corresponding path program 1 times [2018-02-04 01:45:56,909 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:56,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:56,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:56,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:56,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 01:45:56,983 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:56,984 INFO L182 omatonBuilderFactory]: Interpolants [43#true, 44#false, 45#(= |#valid| |old(#valid)|)] [2018-02-04 01:45:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:56,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 01:45:56,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 01:45:56,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 01:45:56,994 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-02-04 01:45:57,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:57,064 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-04 01:45:57,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 01:45:57,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-02-04 01:45:57,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:57,071 INFO L225 Difference]: With dead ends: 41 [2018-02-04 01:45:57,072 INFO L226 Difference]: Without dead ends: 37 [2018-02-04 01:45:57,073 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 01:45:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-04 01:45:57,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-04 01:45:57,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 01:45:57,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-04 01:45:57,174 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-02-04 01:45:57,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:57,174 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-04 01:45:57,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 01:45:57,174 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-04 01:45:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 01:45:57,175 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:57,175 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:57,175 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 01:45:57,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1918226348, now seen corresponding path program 1 times [2018-02-04 01:45:57,176 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:57,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:57,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:57,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:45:57,226 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:57,226 INFO L182 omatonBuilderFactory]: Interpolants [124#true, 125#false, 126#(= 1 (select |#valid| |main_#t~malloc7.base|)), 127#(= 1 (select |#valid| main_~nondetString~0.base))] [2018-02-04 01:45:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:57,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:45:57,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:45:57,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:45:57,229 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-02-04 01:45:57,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:57,262 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-04 01:45:57,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:45:57,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 01:45:57,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:57,263 INFO L225 Difference]: With dead ends: 36 [2018-02-04 01:45:57,263 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 01:45:57,264 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:45:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 01:45:57,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 01:45:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 01:45:57,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 01:45:57,268 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-02-04 01:45:57,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:57,268 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 01:45:57,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:45:57,268 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 01:45:57,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 01:45:57,268 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:57,268 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:57,268 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 01:45:57,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1918226347, now seen corresponding path program 1 times [2018-02-04 01:45:57,269 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:57,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:57,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:57,358 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:57,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:45:57,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:57,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:57,359 INFO L182 omatonBuilderFactory]: Interpolants [202#true, 203#false, 204#(<= 1 main_~length2~0), 205#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 206#(and (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString~0.base)) (= main_~nondetString~0.offset 0))] [2018-02-04 01:45:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:57,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:45:57,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:45:57,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:45:57,360 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-02-04 01:45:57,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:57,414 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-04 01:45:57,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:45:57,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 01:45:57,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:57,415 INFO L225 Difference]: With dead ends: 35 [2018-02-04 01:45:57,415 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 01:45:57,415 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:45:57,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 01:45:57,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-04 01:45:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 01:45:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-04 01:45:57,417 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-02-04 01:45:57,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:57,417 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-04 01:45:57,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:45:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-04 01:45:57,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 01:45:57,418 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:57,418 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:57,418 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 01:45:57,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1371633306, now seen corresponding path program 1 times [2018-02-04 01:45:57,418 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:57,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:57,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:57,461 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:57,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:45:57,462 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:57,462 INFO L182 omatonBuilderFactory]: Interpolants [279#true, 280#false, 281#(= 1 (select |#valid| main_~nondetString~0.base)), 282#(= 1 (select |#valid| |cstpcpy_#in~from.base|)), 283#(= 1 (select |#valid| cstpcpy_~from.base))] [2018-02-04 01:45:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:57,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:45:57,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:45:57,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:45:57,463 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-02-04 01:45:57,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:57,519 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-02-04 01:45:57,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:45:57,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 01:45:57,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:57,522 INFO L225 Difference]: With dead ends: 34 [2018-02-04 01:45:57,522 INFO L226 Difference]: Without dead ends: 34 [2018-02-04 01:45:57,522 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:45:57,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-02-04 01:45:57,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-02-04 01:45:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 01:45:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-02-04 01:45:57,526 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-02-04 01:45:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:57,526 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-02-04 01:45:57,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:45:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-02-04 01:45:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 01:45:57,527 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:57,527 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:57,527 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 01:45:57,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1371633307, now seen corresponding path program 1 times [2018-02-04 01:45:57,528 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:57,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:57,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:57,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:45:57,621 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:57,621 INFO L182 omatonBuilderFactory]: Interpolants [354#true, 355#false, 356#(<= 1 main_~length2~0), 357#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 358#(and (<= 1 main_~length2~0) (= 0 main_~nondetString~0.offset) (= main_~length2~0 (select |#length| main_~nondetString~0.base))), 359#(and (<= 1 (select |#length| main_~nondetString~0.base)) (= 0 main_~nondetString~0.offset)), 360#(and (= 0 |cstpcpy_#in~from.offset|) (<= 1 (select |#length| |cstpcpy_#in~from.base|))), 361#(and (<= 1 (select |#length| cstpcpy_~from.base)) (= cstpcpy_~from.offset 0))] [2018-02-04 01:45:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:57,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:45:57,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:45:57,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:45:57,622 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-02-04 01:45:57,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:57,701 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-04 01:45:57,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:45:57,702 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-04 01:45:57,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:57,704 INFO L225 Difference]: With dead ends: 44 [2018-02-04 01:45:57,704 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 01:45:57,704 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-04 01:45:57,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 01:45:57,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-02-04 01:45:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 01:45:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 01:45:57,706 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 18 [2018-02-04 01:45:57,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:57,706 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 01:45:57,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:45:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 01:45:57,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 01:45:57,707 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:57,707 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:57,707 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 01:45:57,707 INFO L82 PathProgramCache]: Analyzing trace with hash -429040459, now seen corresponding path program 1 times [2018-02-04 01:45:57,708 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:57,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:57,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:57,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:45:57,805 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:57,805 INFO L182 omatonBuilderFactory]: Interpolants [448#(= 1 (select |#valid| |main_#t~malloc6.base|)), 449#(= 1 (select |#valid| main_~nondetArea~0.base)), 450#(or (= |main_#t~malloc7.base| main_~nondetArea~0.base) (= 1 (select |#valid| main_~nondetArea~0.base))), 451#(or (= main_~nondetString~0.base main_~nondetArea~0.base) (= 1 (select |#valid| main_~nondetArea~0.base))), 452#(= 1 (select |#valid| |cstpcpy_#in~to.base|)), 453#(= 1 (select |#valid| cstpcpy_~to.base)), 446#true, 447#false] [2018-02-04 01:45:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:57,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:45:57,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:45:57,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:45:57,809 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 8 states. [2018-02-04 01:45:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:57,882 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-04 01:45:57,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:45:57,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-04 01:45:57,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:57,883 INFO L225 Difference]: With dead ends: 35 [2018-02-04 01:45:57,883 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 01:45:57,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:45:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 01:45:57,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-04 01:45:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 01:45:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-04 01:45:57,888 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 19 [2018-02-04 01:45:57,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:57,888 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-04 01:45:57,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:45:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-04 01:45:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 01:45:57,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:57,891 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:57,891 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 01:45:57,892 INFO L82 PathProgramCache]: Analyzing trace with hash -429040458, now seen corresponding path program 1 times [2018-02-04 01:45:57,892 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:57,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:57,993 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:57,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:45:57,994 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:57,997 INFO L182 omatonBuilderFactory]: Interpolants [528#true, 529#false, 530#(<= 1 main_~length1~0), 531#(and (= 0 |main_#t~malloc6.offset|) (<= 1 (select |#length| |main_#t~malloc6.base|)) (= (select |#valid| |main_#t~malloc6.base|) 1)), 532#(and (<= 1 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset)), 533#(and (<= 1 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 534#(and (= 0 |cstpcpy_#in~to.offset|) (<= 1 (select |#length| |cstpcpy_#in~to.base|))), 535#(and (= cstpcpy_~to.offset 0) (<= 1 (select |#length| cstpcpy_~to.base)))] [2018-02-04 01:45:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:57,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:45:57,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:45:57,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:45:57,997 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 8 states. [2018-02-04 01:45:58,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:58,098 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-04 01:45:58,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:45:58,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-04 01:45:58,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:58,099 INFO L225 Difference]: With dead ends: 41 [2018-02-04 01:45:58,099 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 01:45:58,099 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:45:58,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 01:45:58,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-02-04 01:45:58,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 01:45:58,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 01:45:58,101 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 19 [2018-02-04 01:45:58,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:58,101 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 01:45:58,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:45:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 01:45:58,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:45:58,102 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:58,102 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-04 01:45:58,102 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 01:45:58,102 INFO L82 PathProgramCache]: Analyzing trace with hash 39867865, now seen corresponding path program 1 times [2018-02-04 01:45:58,102 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:58,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:58,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:58,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:58,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 01:45:58,236 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:58,236 INFO L182 omatonBuilderFactory]: Interpolants [624#(and (<= 1 main_~length2~0) (<= main_~length1~0 1)), 625#(and (<= main_~length2~0 1) (<= 1 main_~length2~0)), 626#(and (= 0 |main_#t~malloc7.offset|) (<= main_~length2~0 1) (<= 1 main_~length2~0)), 627#(and (<= 1 main_~length2~0) (= main_~nondetString~0.offset 0) (<= (+ main_~nondetString~0.offset main_~length2~0) 1)), 628#(and (= main_~nondetString~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString~0.base) main_~nondetString~0.offset))), 629#(= 0 (select (select |#memory_int| |cstpcpy_#in~from.base|) |cstpcpy_#in~from.offset|)), 630#(= 0 (select (select |#memory_int| cstpcpy_~from.base) cstpcpy_~from.offset)), 631#(= |cstpcpy_#t~mem3| 0), 621#true, 622#false, 623#(<= main_~length1~0 1)] [2018-02-04 01:45:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:58,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 01:45:58,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 01:45:58,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:45:58,238 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 11 states. [2018-02-04 01:45:58,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:58,426 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-02-04 01:45:58,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 01:45:58,427 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-04 01:45:58,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:58,427 INFO L225 Difference]: With dead ends: 74 [2018-02-04 01:45:58,427 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 01:45:58,428 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-02-04 01:45:58,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 01:45:58,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2018-02-04 01:45:58,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 01:45:58,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-02-04 01:45:58,434 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 23 [2018-02-04 01:45:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:58,434 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-02-04 01:45:58,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 01:45:58,434 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-02-04 01:45:58,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:45:58,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:58,435 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-04 01:45:58,435 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 01:45:58,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1548480037, now seen corresponding path program 1 times [2018-02-04 01:45:58,436 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:58,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:58,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:45:58,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 01:45:58,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:58,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:58,579 INFO L182 omatonBuilderFactory]: Interpolants [784#(and (= 0 |cstpcpy_#in~from.offset|) (or (<= 2 (select |#length| |cstpcpy_#in~from.base|)) (= 0 (select (select |#memory_int| |cstpcpy_#in~from.base|) |cstpcpy_#in~from.offset|)))), 785#(and (or (<= 2 (select |#length| cstpcpy_~from.base)) (= 0 (select (select |#memory_int| cstpcpy_~from.base) cstpcpy_~from.offset))) (= cstpcpy_~from.offset 0)), 786#(and (or (<= 2 (select |#length| cstpcpy_~from.base)) (= |cstpcpy_#t~mem3| 0)) (= cstpcpy_~from.offset 0)), 787#(and (<= 2 (select |#length| cstpcpy_~from.base)) (= cstpcpy_~from.offset 0)), 788#(and (<= 1 cstpcpy_~from.offset) (<= (+ cstpcpy_~from.offset 1) (select |#length| cstpcpy_~from.base))), 778#true, 779#false, 780#(<= 1 main_~length2~0), 781#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0)), 782#(and (<= 1 main_~length2~0) (= main_~nondetString~0.offset 0)), 783#(and (or (<= 2 (select |#length| main_~nondetString~0.base)) (= 0 (select (select |#memory_int| main_~nondetString~0.base) main_~nondetString~0.offset))) (= 0 main_~nondetString~0.offset))] [2018-02-04 01:45:58,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:58,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 01:45:58,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 01:45:58,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:45:58,580 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 11 states. [2018-02-04 01:45:58,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:58,707 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-02-04 01:45:58,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 01:45:58,707 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-04 01:45:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:58,708 INFO L225 Difference]: With dead ends: 66 [2018-02-04 01:45:58,708 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 01:45:58,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:45:58,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 01:45:58,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-02-04 01:45:58,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 01:45:58,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-02-04 01:45:58,711 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 23 [2018-02-04 01:45:58,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:58,711 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-02-04 01:45:58,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 01:45:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-02-04 01:45:58,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 01:45:58,712 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:58,712 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:58,712 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 01:45:58,712 INFO L82 PathProgramCache]: Analyzing trace with hash -758240906, now seen corresponding path program 1 times [2018-02-04 01:45:58,712 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:58,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:58,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:58,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:45:58,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 01:45:58,859 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:58,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:58,859 INFO L182 omatonBuilderFactory]: Interpolants [928#(and (<= (select |#length| main_~nondetString~0.base) (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetString~0.offset) (= 0 main_~nondetArea~0.offset)), 929#(and (= 0 |cstpcpy_#in~from.offset|) (= 0 |cstpcpy_#in~to.offset|) (<= (select |#length| |cstpcpy_#in~from.base|) (select |#length| |cstpcpy_#in~to.base|))), 930#(and (<= (select |#length| cstpcpy_~from.base) (select |#length| cstpcpy_~to.base)) (= cstpcpy_~to.offset 0) (= cstpcpy_~from.offset 0)), 931#(and (<= (+ (select |#length| cstpcpy_~from.base) cstpcpy_~to.offset) (+ (select |#length| cstpcpy_~to.base) cstpcpy_~from.offset)) (<= 1 cstpcpy_~to.offset)), 932#(and (<= 1 cstpcpy_~to.offset) (<= (+ cstpcpy_~to.offset 1) (select |#length| cstpcpy_~to.base))), 921#true, 922#false, 923#(<= main_~length2~0 main_~length1~0), 924#(and (= 0 |main_#t~malloc6.offset|) (<= main_~length2~0 (select |#length| |main_#t~malloc6.base|)) (= (select |#valid| |main_#t~malloc6.base|) 1)), 925#(and (<= main_~length2~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset)), 926#(and (= 0 |main_#t~malloc7.offset|) (<= main_~length2~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 927#(and (<= main_~length2~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetString~0.offset) (= main_~length2~0 (select |#length| main_~nondetString~0.base)) (= 0 main_~nondetArea~0.offset))] [2018-02-04 01:45:58,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:58,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 01:45:58,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 01:45:58,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:45:58,859 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 12 states. [2018-02-04 01:45:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:59,046 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-02-04 01:45:59,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 01:45:59,046 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-02-04 01:45:59,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:59,047 INFO L225 Difference]: With dead ends: 58 [2018-02-04 01:45:59,047 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 01:45:59,047 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2018-02-04 01:45:59,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 01:45:59,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2018-02-04 01:45:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 01:45:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-02-04 01:45:59,050 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 24 [2018-02-04 01:45:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:59,050 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-02-04 01:45:59,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 01:45:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-02-04 01:45:59,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:45:59,051 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:59,051 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:59,051 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 01:45:59,051 INFO L82 PathProgramCache]: Analyzing trace with hash 67945113, now seen corresponding path program 2 times [2018-02-04 01:45:59,051 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:59,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:59,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:45:59,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 01:45:59,371 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:59,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:59,371 INFO L182 omatonBuilderFactory]: Interpolants [1064#true, 1065#false, 1066#(= (select |#valid| |main_#t~malloc6.base|) 1), 1067#(= (select |#valid| main_~nondetArea~0.base) 1), 1068#(and (= 0 |main_#t~malloc7.offset|) (not (= main_~nondetArea~0.base |main_#t~malloc7.base|)) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 1069#(and (or (= (+ main_~nondetString~0.offset main_~length2~0) 2) (= main_~length2~0 (select |#length| main_~nondetString~0.base))) (or (not (= main_~nondetArea~0.base main_~nondetString~0.base)) (not (= (+ main_~nondetString~0.offset main_~length2~0) 2))) (= 0 main_~nondetString~0.offset)), 1070#(and (or (<= (+ main_~nondetString~0.offset (select |#length| main_~nondetString~0.base)) 1) (and (not (= main_~nondetArea~0.base main_~nondetString~0.base)) (= 0 (select (select |#memory_int| main_~nondetString~0.base) 1))) (<= 3 (+ main_~nondetString~0.offset (select |#length| main_~nondetString~0.base)))) (= 0 main_~nondetString~0.offset)), 1071#(and (= 0 |cstpcpy_#in~from.offset|) (or (<= 3 (select |#length| |cstpcpy_#in~from.base|)) (and (not (= |cstpcpy_#in~to.base| |cstpcpy_#in~from.base|)) (= 0 (select (select |#memory_int| |cstpcpy_#in~from.base|) 1))) (<= (select |#length| |cstpcpy_#in~from.base|) 1))), 1072#(and (or (<= (select |#length| cstpcpy_~from.base) 1) (and (= 0 (select (select |#memory_int| cstpcpy_~from.base) 1)) (not (= cstpcpy_~from.base cstpcpy_~to.base))) (<= 3 (select |#length| cstpcpy_~from.base))) (= cstpcpy_~from.offset 0)), 1073#(and (<= 1 cstpcpy_~from.offset) (or (<= (select |#length| cstpcpy_~from.base) cstpcpy_~from.offset) (and (= 1 cstpcpy_~from.offset) (= 0 (select (select |#memory_int| cstpcpy_~from.base) cstpcpy_~from.offset))) (<= (+ cstpcpy_~from.offset 2) (select |#length| cstpcpy_~from.base)))), 1074#(and (<= 1 cstpcpy_~from.offset) (or (and (= 1 cstpcpy_~from.offset) (= |cstpcpy_#t~mem3| 0)) (<= (+ cstpcpy_~from.offset 2) (select |#length| cstpcpy_~from.base)))), 1075#(and (<= 1 cstpcpy_~from.offset) (<= (+ cstpcpy_~from.offset 2) (select |#length| cstpcpy_~from.base))), 1076#(and (<= (+ cstpcpy_~from.offset 1) (select |#length| cstpcpy_~from.base)) (<= 2 cstpcpy_~from.offset))] [2018-02-04 01:45:59,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:59,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 01:45:59,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 01:45:59,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:45:59,372 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 13 states. [2018-02-04 01:45:59,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:59,622 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-02-04 01:45:59,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:45:59,622 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-02-04 01:45:59,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:59,623 INFO L225 Difference]: With dead ends: 72 [2018-02-04 01:45:59,623 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 01:45:59,624 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2018-02-04 01:45:59,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 01:45:59,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2018-02-04 01:45:59,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 01:45:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-04 01:45:59,627 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 28 [2018-02-04 01:45:59,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:59,627 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-04 01:45:59,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 01:45:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-04 01:45:59,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 01:45:59,627 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:59,627 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] [2018-02-04 01:45:59,627 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 01:45:59,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1163981862, now seen corresponding path program 1 times [2018-02-04 01:45:59,628 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:59,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:59,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:59,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:45:59,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:59,691 INFO L182 omatonBuilderFactory]: Interpolants [1223#true, 1224#false, 1225#(= |#valid| |old(#valid)|), 1226#(and (= (store |#valid| |main_#t~malloc6.base| 0) |old(#valid)|) (= (select |#valid| |main_#t~malloc6.base|) 1)), 1227#(and (= |old(#valid)| (store (store |#valid| |main_#t~malloc7.base| 0) |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|))) (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|))), 1228#(= (store |#valid| |main_#t~malloc7.base| 0) |old(#valid)|)] [2018-02-04 01:45:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:59,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:45:59,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:45:59,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:45:59,691 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 6 states. [2018-02-04 01:45:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:59,743 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-02-04 01:45:59,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:45:59,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-02-04 01:45:59,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:59,743 INFO L225 Difference]: With dead ends: 59 [2018-02-04 01:45:59,743 INFO L226 Difference]: Without dead ends: 34 [2018-02-04 01:45:59,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:45:59,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-02-04 01:45:59,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-02-04 01:45:59,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 01:45:59,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-02-04 01:45:59,745 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 29 [2018-02-04 01:45:59,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:59,745 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-02-04 01:45:59,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:45:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-02-04 01:45:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 01:45:59,746 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:59,746 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:59,746 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-02-04 01:45:59,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1277503333, now seen corresponding path program 3 times [2018-02-04 01:45:59,746 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:59,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:59,906 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 01:45:59,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:45:59,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 01:45:59,906 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:59,907 INFO L182 omatonBuilderFactory]: Interpolants [1326#true, 1327#false, 1328#(= (select |#valid| |main_#t~malloc6.base|) 1), 1329#(= (select |#valid| main_~nondetArea~0.base) 1), 1330#(and (= 0 |main_#t~malloc7.offset|) (not (= main_~nondetArea~0.base |main_#t~malloc7.base|)) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 1331#(and (not (= main_~nondetArea~0.base main_~nondetString~0.base)) (= main_~length2~0 (select |#length| main_~nondetString~0.base)) (= main_~nondetString~0.offset 0)), 1332#(and (= 0 (select (select |#memory_int| main_~nondetString~0.base) (+ main_~nondetString~0.offset (+ (select |#length| main_~nondetString~0.base) (- 1))))) (not (= main_~nondetArea~0.base main_~nondetString~0.base)) (= main_~nondetString~0.offset 0)), 1333#(and (not (= |cstpcpy_#in~to.base| |cstpcpy_#in~from.base|)) (= 0 (select (select |#memory_int| |cstpcpy_#in~from.base|) (+ (select |#length| |cstpcpy_#in~from.base|) (- 1))))), 1334#(and (= 0 (select (select |#memory_int| cstpcpy_~from.base) (+ (select |#length| cstpcpy_~from.base) (- 1)))) (not (= cstpcpy_~to.base cstpcpy_~from.base))), 1335#(or (<= (select |#length| cstpcpy_~from.base) cstpcpy_~from.offset) (= 0 (select (select |#memory_int| cstpcpy_~from.base) cstpcpy_~from.offset)) (<= (+ cstpcpy_~from.offset 2) (select |#length| cstpcpy_~from.base))), 1336#(or (and (<= 0 cstpcpy_~from.offset) (<= (+ cstpcpy_~from.offset 2) (select |#length| cstpcpy_~from.base))) (= |cstpcpy_#t~mem3| 0)), 1337#(and (<= 0 cstpcpy_~from.offset) (<= (+ cstpcpy_~from.offset 2) (select |#length| cstpcpy_~from.base))), 1338#(and (<= 1 cstpcpy_~from.offset) (<= (+ cstpcpy_~from.offset 1) (select |#length| cstpcpy_~from.base)))] [2018-02-04 01:45:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 01:45:59,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 01:45:59,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 01:45:59,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:45:59,908 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 13 states. [2018-02-04 01:46:00,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:46:00,084 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-02-04 01:46:00,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 01:46:00,084 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-02-04 01:46:00,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:46:00,085 INFO L225 Difference]: With dead ends: 33 [2018-02-04 01:46:00,085 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 01:46:00,085 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2018-02-04 01:46:00,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 01:46:00,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 01:46:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 01:46:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 01:46:00,085 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-02-04 01:46:00,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:46:00,085 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 01:46:00,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 01:46:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 01:46:00,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 01:46:00,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:46:00 BoogieIcfgContainer [2018-02-04 01:46:00,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:46:00,089 INFO L168 Benchmark]: Toolchain (without parser) took 3643.65 ms. Allocated memory was 381.7 MB in the beginning and 623.4 MB in the end (delta: 241.7 MB). Free memory was 336.8 MB in the beginning and 383.1 MB in the end (delta: -46.3 MB). Peak memory consumption was 195.4 MB. Max. memory is 5.3 GB. [2018-02-04 01:46:00,090 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 381.7 MB. Free memory is still 342.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:46:00,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.30 ms. Allocated memory is still 381.7 MB. Free memory was 335.5 MB in the beginning and 326.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-04 01:46:00,090 INFO L168 Benchmark]: Boogie Preprocessor took 21.44 ms. Allocated memory is still 381.7 MB. Free memory was 326.2 MB in the beginning and 323.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:46:00,090 INFO L168 Benchmark]: RCFGBuilder took 187.40 ms. Allocated memory is still 381.7 MB. Free memory was 323.6 MB in the beginning and 306.4 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-04 01:46:00,090 INFO L168 Benchmark]: TraceAbstraction took 3284.29 ms. Allocated memory was 381.7 MB in the beginning and 623.4 MB in the end (delta: 241.7 MB). Free memory was 306.4 MB in the beginning and 383.1 MB in the end (delta: -76.7 MB). Peak memory consumption was 165.0 MB. Max. memory is 5.3 GB. [2018-02-04 01:46:00,091 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 381.7 MB. Free memory is still 342.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.30 ms. Allocated memory is still 381.7 MB. Free memory was 335.5 MB in the beginning and 326.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.44 ms. Allocated memory is still 381.7 MB. Free memory was 326.2 MB in the beginning and 323.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 187.40 ms. Allocated memory is still 381.7 MB. Free memory was 323.6 MB in the beginning and 306.4 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3284.29 ms. Allocated memory was 381.7 MB in the beginning and 623.4 MB in the end (delta: 241.7 MB). Free memory was 306.4 MB in the beginning and 383.1 MB in the end (delta: -76.7 MB). Peak memory consumption was 165.0 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: 545]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 7 error locations. SAFE Result, 3.2s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 348 SDtfs, 400 SDslu, 1224 SDs, 0 SdLazy, 1164 SolverSat, 132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 7/37 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, 13 MinimizatonAttempts, 60 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 42321 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 7/37 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-46-00-095.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-46-00-095.csv Received shutdown request...