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_cstrcpy-alloca_true-valid-memsafety_true-termination.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-ccafca9-m
[2018-02-04 01:47:57,550 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-04 01:47:57,551 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-04 01:47:57,563 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-04 01:47:57,563 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-04 01:47:57,564 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-04 01:47:57,565 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-04 01:47:57,567 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-04 01:47:57,568 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-04 01:47:57,569 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-04 01:47:57,569 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-04 01:47:57,570 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-04 01:47:57,571 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-04 01:47:57,572 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-04 01:47:57,572 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-04 01:47:57,574 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-04 01:47:57,576 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-04 01:47:57,577 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-04 01:47:57,578 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-04 01:47:57,579 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-04 01:47:57,581 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-04 01:47:57,581 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-04 01:47:57,582 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-04 01:47:57,582 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-04 01:47:57,583 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-04 01:47:57,584 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-04 01:47:57,584 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-04 01:47:57,585 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-04 01:47:57,585 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-04 01:47:57,585 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-04 01:47:57,585 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-04 01:47:57,586 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:47:57,595 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-04 01:47:57,595 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-04 01:47:57,596 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-04 01:47:57,596 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-04 01:47:57,596 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-04 01:47:57,597 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-04 01:47:57,597 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-04 01:47:57,597 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-04 01:47:57,597 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-04 01:47:57,597 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-04 01:47:57,597 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-04 01:47:57,597 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-04 01:47:57,597 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-04 01:47:57,597 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-04 01:47:57,597 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-04 01:47:57,597 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-04 01:47:57,598 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-04 01:47:57,598 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-04 01:47:57,598 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-04 01:47:57,598 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-04 01:47:57,598 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-04 01:47:57,598 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-04 01:47:57,598 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation
[2018-02-04 01:47:57,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-04 01:47:57,634 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-04 01:47:57,636 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-04 01:47:57,637 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-04 01:47:57,638 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-04 01:47:57,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i
[2018-02-04 01:47:57,750 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-04 01:47:57,751 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-04 01:47:57,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-04 01:47:57,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-04 01:47:57,756 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-04 01:47:57,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:47:57" (1/1) ...
[2018-02-04 01:47:57,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a67664e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:57, skipping insertion in model container
[2018-02-04 01:47:57,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:47:57" (1/1) ...
[2018-02-04 01:47:57,770 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-04 01:47:57,797 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-04 01:47:57,887 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-04 01:47:57,900 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-04 01:47:57,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:57 WrapperNode
[2018-02-04 01:47:57,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-04 01:47:57,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-04 01:47:57,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-04 01:47:57,907 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-04 01:47:57,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:57" (1/1) ...
[2018-02-04 01:47:57,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:57" (1/1) ...
[2018-02-04 01:47:57,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:57" (1/1) ...
[2018-02-04 01:47:57,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:57" (1/1) ...
[2018-02-04 01:47:57,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:57" (1/1) ...
[2018-02-04 01:47:57,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:57" (1/1) ...
[2018-02-04 01:47:57,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:57" (1/1) ...
[2018-02-04 01:47:57,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-04 01:47:57,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-04 01:47:57,930 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-04 01:47:57,931 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-04 01:47:57,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:57" (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:47:57,965 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-04 01:47:57,965 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-04 01:47:57,966 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy
[2018-02-04 01:47:57,966 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-04 01:47:57,966 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-02-04 01:47:57,966 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-02-04 01:47:57,966 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-04 01:47:57,966 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-04 01:47:57,966 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-04 01:47:57,966 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-02-04 01:47:57,966 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy
[2018-02-04 01:47:57,966 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-04 01:47:57,966 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-04 01:47:57,967 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-04 01:47:58,088 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-04 01:47:58,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:47:58 BoogieIcfgContainer
[2018-02-04 01:47:58,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-04 01:47:58,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-04 01:47:58,089 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-04 01:47:58,091 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-04 01:47:58,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:47:57" (1/3) ...
[2018-02-04 01:47:58,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef57709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:47:58, skipping insertion in model container
[2018-02-04 01:47:58,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:57" (2/3) ...
[2018-02-04 01:47:58,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef57709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:47:58, skipping insertion in model container
[2018-02-04 01:47:58,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:47:58" (3/3) ...
[2018-02-04 01:47:58,093 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i
[2018-02-04 01:47:58,098 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION
[2018-02-04 01:47:58,102 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations.
[2018-02-04 01:47:58,131 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-04 01:47:58,131 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-04 01:47:58,131 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation
[2018-02-04 01:47:58,131 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL
[2018-02-04 01:47:58,131 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-04 01:47:58,131 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-04 01:47:58,132 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-04 01:47:58,132 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-04 01:47:58,132 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-04 01:47:58,139 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states.
[2018-02-04 01:47:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2018-02-04 01:47:58,148 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:47:58,149 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:47:58,149 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:47:58,153 INFO L82 PathProgramCache]: Analyzing trace with hash -341828685, now seen corresponding path program 1 times
[2018-02-04 01:47:58,201 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:47:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:47:58,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:47:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:47:58,300 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:47:58,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-04 01:47:58,301 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:47:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:47:58,302 INFO L182 omatonBuilderFactory]: Interpolants [43#true, 44#false, 45#(<= 1 main_~length1~0), 46#(<= main_~length2~0 main_~length1~0)]
[2018-02-04 01:47:58,302 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:47:58,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-04 01:47:58,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-04 01:47:58,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-04 01:47:58,316 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states.
[2018-02-04 01:47:58,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:47:58,378 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions.
[2018-02-04 01:47:58,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-04 01:47:58,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2018-02-04 01:47:58,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:47:58,435 INFO L225 Difference]: With dead ends: 44
[2018-02-04 01:47:58,435 INFO L226 Difference]: Without dead ends: 40
[2018-02-04 01:47:58,437 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:47:58,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states.
[2018-02-04 01:47:58,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38.
[2018-02-04 01:47:58,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states.
[2018-02-04 01:47:58,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions.
[2018-02-04 01:47:58,462 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10
[2018-02-04 01:47:58,462 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:47:58,462 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions.
[2018-02-04 01:47:58,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-04 01:47:58,462 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions.
[2018-02-04 01:47:58,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2018-02-04 01:47:58,462 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:47:58,462 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:47:58,463 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:47:58,463 INFO L82 PathProgramCache]: Analyzing trace with hash -341826763, now seen corresponding path program 1 times
[2018-02-04 01:47:58,464 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:47:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:47:58,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:47:58,490 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:47:58,490 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:47:58,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-04 01:47:58,490 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:47:58,491 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:47:58,491 INFO L182 omatonBuilderFactory]: Interpolants [131#true, 132#false, 133#(= |#valid| |old(#valid)|)]
[2018-02-04 01:47:58,491 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:47:58,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-04 01:47:58,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-04 01:47:58,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-04 01:47:58,493 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states.
[2018-02-04 01:47:58,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:47:58,511 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions.
[2018-02-04 01:47:58,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-04 01:47:58,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10
[2018-02-04 01:47:58,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:47:58,512 INFO L225 Difference]: With dead ends: 39
[2018-02-04 01:47:58,512 INFO L226 Difference]: Without dead ends: 38
[2018-02-04 01:47:58,512 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:47:58,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states.
[2018-02-04 01:47:58,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37.
[2018-02-04 01:47:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2018-02-04 01:47:58,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions.
[2018-02-04 01:47:58,515 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10
[2018-02-04 01:47:58,515 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:47:58,515 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions.
[2018-02-04 01:47:58,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-04 01:47:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions.
[2018-02-04 01:47:58,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-02-04 01:47:58,516 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:47:58,516 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:47:58,516 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:47:58,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659641, now seen corresponding path program 1 times
[2018-02-04 01:47:58,517 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:47:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:47:58,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:47:58,570 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:47:58,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:47:58,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-04 01:47:58,570 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:47:58,571 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:47:58,571 INFO L182 omatonBuilderFactory]: Interpolants [210#true, 211#false, 212#(= 1 (select |#valid| |main_#t~malloc7.base|)), 213#(= 1 (select |#valid| main_~nondetString~0.base))]
[2018-02-04 01:47:58,571 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:47:58,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-04 01:47:58,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-04 01:47:58,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-04 01:47:58,572 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states.
[2018-02-04 01:47:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:47:58,617 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions.
[2018-02-04 01:47:58,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-04 01:47:58,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2018-02-04 01:47:58,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:47:58,618 INFO L225 Difference]: With dead ends: 36
[2018-02-04 01:47:58,619 INFO L226 Difference]: Without dead ends: 36
[2018-02-04 01:47:58,619 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:47:58,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2018-02-04 01:47:58,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36.
[2018-02-04 01:47:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states.
[2018-02-04 01:47:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions.
[2018-02-04 01:47:58,622 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14
[2018-02-04 01:47:58,622 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:47:58,622 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions.
[2018-02-04 01:47:58,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-04 01:47:58,622 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions.
[2018-02-04 01:47:58,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-02-04 01:47:58,623 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:47:58,623 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:47:58,623 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:47:58,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659640, now seen corresponding path program 1 times
[2018-02-04 01:47:58,624 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:47:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:47:58,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:47:58,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:47:58,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:47:58,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-04 01:47:58,704 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:47:58,704 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:47:58,704 INFO L182 omatonBuilderFactory]: Interpolants [288#true, 289#false, 290#(<= 1 main_~length2~0), 291#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 292#(and (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString~0.base)) (= main_~nondetString~0.offset 0))]
[2018-02-04 01:47:58,704 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:47:58,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-04 01:47:58,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-04 01:47:58,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-04 01:47:58,705 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states.
[2018-02-04 01:47:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:47:58,740 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions.
[2018-02-04 01:47:58,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-04 01:47:58,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2018-02-04 01:47:58,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:47:58,741 INFO L225 Difference]: With dead ends: 35
[2018-02-04 01:47:58,741 INFO L226 Difference]: Without dead ends: 35
[2018-02-04 01:47:58,741 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:47:58,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2018-02-04 01:47:58,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35.
[2018-02-04 01:47:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2018-02-04 01:47:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions.
[2018-02-04 01:47:58,743 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14
[2018-02-04 01:47:58,744 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:47:58,744 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions.
[2018-02-04 01:47:58,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-04 01:47:58,744 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions.
[2018-02-04 01:47:58,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-02-04 01:47:58,744 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:47:58,744 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:47:58,745 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:47:58,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1121108344, now seen corresponding path program 1 times
[2018-02-04 01:47:58,746 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:47:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:47:58,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:47:58,780 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:47:58,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:47:58,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-04 01:47:58,780 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:47:58,781 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:47:58,781 INFO L182 omatonBuilderFactory]: Interpolants [368#(= 1 (select |#valid| |cstrcpy_#in~from.base|)), 369#(= 1 (select |#valid| cstrcpy_~from.base)), 365#true, 366#false, 367#(= 1 (select |#valid| main_~nondetString~0.base))]
[2018-02-04 01:47:58,781 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:47:58,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-04 01:47:58,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-04 01:47:58,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-04 01:47:58,782 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states.
[2018-02-04 01:47:58,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:47:58,813 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions.
[2018-02-04 01:47:58,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-04 01:47:58,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2018-02-04 01:47:58,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:47:58,813 INFO L225 Difference]: With dead ends: 34
[2018-02-04 01:47:58,813 INFO L226 Difference]: Without dead ends: 34
[2018-02-04 01:47:58,814 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:47:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2018-02-04 01:47:58,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34.
[2018-02-04 01:47:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states.
[2018-02-04 01:47:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions.
[2018-02-04 01:47:58,816 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18
[2018-02-04 01:47:58,816 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:47:58,816 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions.
[2018-02-04 01:47:58,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-04 01:47:58,816 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions.
[2018-02-04 01:47:58,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-02-04 01:47:58,816 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:47:58,816 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:47:58,817 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:47:58,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1121108343, now seen corresponding path program 1 times
[2018-02-04 01:47:58,817 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:47:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:47:58,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:47:58,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:47:58,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:47:58,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-02-04 01:47:58,889 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:47:58,890 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:47:58,890 INFO L182 omatonBuilderFactory]: Interpolants [440#true, 441#false, 442#(<= 1 main_~length2~0), 443#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 444#(and (<= 1 main_~length2~0) (= 0 main_~nondetString~0.offset) (= main_~length2~0 (select |#length| main_~nondetString~0.base))), 445#(and (<= 1 (select |#length| main_~nondetString~0.base)) (= 0 main_~nondetString~0.offset)), 446#(and (<= 1 (select |#length| |cstrcpy_#in~from.base|)) (= 0 |cstrcpy_#in~from.offset|)), 447#(and (= cstrcpy_~from.offset 0) (<= 1 (select |#length| cstrcpy_~from.base)))]
[2018-02-04 01:47:58,890 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:47:58,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-04 01:47:58,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-04 01:47:58,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2018-02-04 01:47:58,890 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states.
[2018-02-04 01:47:58,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:47:58,957 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions.
[2018-02-04 01:47:58,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-04 01:47:58,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18
[2018-02-04 01:47:58,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:47:58,959 INFO L225 Difference]: With dead ends: 44
[2018-02-04 01:47:58,959 INFO L226 Difference]: Without dead ends: 44
[2018-02-04 01:47:58,959 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:47:58,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states.
[2018-02-04 01:47:58,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36.
[2018-02-04 01:47:58,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states.
[2018-02-04 01:47:58,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions.
[2018-02-04 01:47:58,961 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 18
[2018-02-04 01:47:58,961 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:47:58,961 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions.
[2018-02-04 01:47:58,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-04 01:47:58,961 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions.
[2018-02-04 01:47:58,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-02-04 01:47:58,962 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:47:58,962 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:47:58,962 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:47:58,962 INFO L82 PathProgramCache]: Analyzing trace with hash -394620318, now seen corresponding path program 1 times
[2018-02-04 01:47:58,963 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:47:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:47:58,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:47:59,044 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:47:59,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:47:59,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-02-04 01:47:59,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:47:59,045 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:47:59,045 INFO L182 omatonBuilderFactory]: Interpolants [532#true, 533#false, 534#(= 1 (select |#valid| |main_#t~malloc6.base|)), 535#(= 1 (select |#valid| main_~nondetArea~0.base)), 536#(or (= |main_#t~malloc7.base| main_~nondetArea~0.base) (= 1 (select |#valid| main_~nondetArea~0.base))), 537#(or (= main_~nondetString~0.base main_~nondetArea~0.base) (= 1 (select |#valid| main_~nondetArea~0.base))), 538#(= 1 (select |#valid| |cstrcpy_#in~to.base|)), 539#(= (select |#valid| cstrcpy_~to.base) 1)]
[2018-02-04 01:47:59,045 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:47:59,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-04 01:47:59,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-04 01:47:59,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2018-02-04 01:47:59,046 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 8 states.
[2018-02-04 01:47:59,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:47:59,095 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions.
[2018-02-04 01:47:59,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-04 01:47:59,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19
[2018-02-04 01:47:59,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:47:59,096 INFO L225 Difference]: With dead ends: 35
[2018-02-04 01:47:59,096 INFO L226 Difference]: Without dead ends: 35
[2018-02-04 01:47:59,096 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2018-02-04 01:47:59,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2018-02-04 01:47:59,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35.
[2018-02-04 01:47:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2018-02-04 01:47:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions.
[2018-02-04 01:47:59,099 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 19
[2018-02-04 01:47:59,100 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:47:59,100 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions.
[2018-02-04 01:47:59,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-04 01:47:59,100 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions.
[2018-02-04 01:47:59,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-02-04 01:47:59,100 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:47:59,101 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:47:59,101 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:47:59,101 INFO L82 PathProgramCache]: Analyzing trace with hash -394620317, now seen corresponding path program 1 times
[2018-02-04 01:47:59,102 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:47:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:47:59,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:47:59,171 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:47:59,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:47:59,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-02-04 01:47:59,172 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:47:59,172 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:47:59,172 INFO L182 omatonBuilderFactory]: Interpolants [614#true, 615#false, 616#(<= 1 main_~length1~0), 617#(and (= 0 |main_#t~malloc6.offset|) (<= 1 (select |#length| |main_#t~malloc6.base|)) (= (select |#valid| |main_#t~malloc6.base|) 1)), 618#(and (<= 1 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset)), 619#(and (<= 1 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 620#(and (<= 1 (select |#length| |cstrcpy_#in~to.base|)) (= 0 |cstrcpy_#in~to.offset|)), 621#(and (= cstrcpy_~to.offset 0) (<= 1 (select |#length| cstrcpy_~to.base)))]
[2018-02-04 01:47:59,172 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:47:59,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-04 01:47:59,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-04 01:47:59,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2018-02-04 01:47:59,173 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 8 states.
[2018-02-04 01:47:59,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:47:59,252 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions.
[2018-02-04 01:47:59,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-04 01:47:59,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19
[2018-02-04 01:47:59,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:47:59,253 INFO L225 Difference]: With dead ends: 41
[2018-02-04 01:47:59,253 INFO L226 Difference]: Without dead ends: 41
[2018-02-04 01:47:59,253 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:47:59,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2018-02-04 01:47:59,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36.
[2018-02-04 01:47:59,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states.
[2018-02-04 01:47:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions.
[2018-02-04 01:47:59,255 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 19
[2018-02-04 01:47:59,255 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:47:59,255 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions.
[2018-02-04 01:47:59,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-04 01:47:59,255 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions.
[2018-02-04 01:47:59,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-02-04 01:47:59,256 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:47:59,256 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:47:59,256 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:47:59,256 INFO L82 PathProgramCache]: Analyzing trace with hash 708807622, now seen corresponding path program 1 times
[2018-02-04 01:47:59,257 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:47:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:47:59,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:47:59,377 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:47:59,377 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:47:59,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2018-02-04 01:47:59,378 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:47:59,378 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:47:59,378 INFO L182 omatonBuilderFactory]: Interpolants [707#true, 708#false, 709#(and (<= main_~length2~0 1) (<= 1 main_~length2~0)), 710#(and (= 0 |main_#t~malloc7.offset|) (<= main_~length2~0 1) (<= 1 main_~length2~0)), 711#(and (<= 1 main_~length2~0) (= main_~nondetString~0.offset 0) (<= (+ main_~nondetString~0.offset main_~length2~0) 1)), 712#(and (= main_~nondetString~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString~0.base) main_~nondetString~0.offset))), 713#(= 0 (select (select |#memory_int| |cstrcpy_#in~from.base|) |cstrcpy_#in~from.offset|)), 714#(= 0 (select (select |#memory_int| cstrcpy_~from.base) cstrcpy_~from.offset)), 715#(and (= 0 (select (select |#memory_int| cstrcpy_~from.base) cstrcpy_~from.offset)) (= |cstrcpy_#t~mem3| (select (select |#memory_int| cstrcpy_~from.base) cstrcpy_~from.offset))), 716#(= 0 |cstrcpy_#t~mem3|)]
[2018-02-04 01:47:59,378 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:47:59,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-02-04 01:47:59,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-02-04 01:47:59,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2018-02-04 01:47:59,378 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states.
[2018-02-04 01:47:59,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:47:59,452 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions.
[2018-02-04 01:47:59,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-02-04 01:47:59,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23
[2018-02-04 01:47:59,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:47:59,452 INFO L225 Difference]: With dead ends: 58
[2018-02-04 01:47:59,452 INFO L226 Difference]: Without dead ends: 58
[2018-02-04 01:47:59,453 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210
[2018-02-04 01:47:59,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states.
[2018-02-04 01:47:59,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51.
[2018-02-04 01:47:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states.
[2018-02-04 01:47:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions.
[2018-02-04 01:47:59,455 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 23
[2018-02-04 01:47:59,455 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:47:59,455 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions.
[2018-02-04 01:47:59,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-02-04 01:47:59,455 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions.
[2018-02-04 01:47:59,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-02-04 01:47:59,456 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:47:59,456 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:47:59,456 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:47:59,456 INFO L82 PathProgramCache]: Analyzing trace with hash -312260732, now seen corresponding path program 1 times
[2018-02-04 01:47:59,457 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:47:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:47:59,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:47:59,614 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:47:59,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-04 01:47:59,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-02-04 01:47:59,614 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:47:59,615 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:47:59,615 INFO L182 omatonBuilderFactory]: Interpolants [836#true, 837#false, 838#(<= 1 main_~length2~0), 839#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0)), 840#(and (<= 1 main_~length2~0) (= main_~nondetString~0.offset 0)), 841#(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)), 842#(and (= 0 |cstrcpy_#in~from.offset|) (or (<= 2 (select |#length| |cstrcpy_#in~from.base|)) (= 0 (select (select |#memory_int| |cstrcpy_#in~from.base|) |cstrcpy_#in~from.offset|)))), 843#(and (= cstrcpy_~from.offset 0) (or (= 0 (select (select |#memory_int| cstrcpy_~from.base) cstrcpy_~from.offset)) (<= 2 (select |#length| cstrcpy_~from.base)))), 844#(and (= cstrcpy_~from.offset 0) (or (and (= 0 (select (select |#memory_int| cstrcpy_~from.base) cstrcpy_~from.offset)) (= |cstrcpy_#t~mem3| (select (select |#memory_int| cstrcpy_~from.base) cstrcpy_~from.offset))) (<= 2 (select |#length| cstrcpy_~from.base)))), 845#(and (or (<= 2 (select |#length| cstrcpy_~from.base)) (= 0 |cstrcpy_#t~mem3|)) (= cstrcpy_~from.offset 0)), 846#(and (= cstrcpy_~from.offset 0) (<= 2 (select |#length| cstrcpy_~from.base))), 847#(and (<= 1 cstrcpy_~from.offset) (<= (+ cstrcpy_~from.offset 1) (select |#length| cstrcpy_~from.base)))]
[2018-02-04 01:47:59,615 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:47:59,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-02-04 01:47:59,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-02-04 01:47:59,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2018-02-04 01:47:59,616 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 12 states.
[2018-02-04 01:47:59,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:47:59,759 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions.
[2018-02-04 01:47:59,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-02-04 01:47:59,759 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23
[2018-02-04 01:47:59,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:47:59,760 INFO L225 Difference]: With dead ends: 65
[2018-02-04 01:47:59,760 INFO L226 Difference]: Without dead ends: 65
[2018-02-04 01:47:59,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240
[2018-02-04 01:47:59,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states.
[2018-02-04 01:47:59,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55.
[2018-02-04 01:47:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states.
[2018-02-04 01:47:59,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions.
[2018-02-04 01:47:59,764 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 23
[2018-02-04 01:47:59,764 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:47:59,764 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions.
[2018-02-04 01:47:59,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-02-04 01:47:59,764 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions.
[2018-02-04 01:47:59,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2018-02-04 01:47:59,765 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:47:59,765 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:47:59,765 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:47:59,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1090148152, now seen corresponding path program 1 times
[2018-02-04 01:47:59,766 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:47:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:47:59,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:47:59,919 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:47:59,919 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-04 01:47:59,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-02-04 01:47:59,920 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:47:59,920 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:47:59,920 INFO L182 omatonBuilderFactory]: Interpolants [976#true, 977#false, 978#(<= main_~length2~0 main_~length1~0), 979#(and (= 0 |main_#t~malloc6.offset|) (<= main_~length2~0 (select |#length| |main_#t~malloc6.base|)) (= (select |#valid| |main_#t~malloc6.base|) 1)), 980#(and (<= main_~length2~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset)), 981#(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|))), 982#(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)), 983#(and (<= (select |#length| main_~nondetString~0.base) (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetString~0.offset) (= 0 main_~nondetArea~0.offset)), 984#(and (<= (select |#length| |cstrcpy_#in~from.base|) (select |#length| |cstrcpy_#in~to.base|)) (= 0 |cstrcpy_#in~from.offset|) (= 0 |cstrcpy_#in~to.offset|)), 985#(and (= cstrcpy_~to.offset 0) (= cstrcpy_~from.offset 0) (<= (select |#length| cstrcpy_~from.base) (select |#length| cstrcpy_~to.base))), 986#(and (<= (+ cstrcpy_~to.offset (select |#length| cstrcpy_~from.base)) (+ (select |#length| cstrcpy_~to.base) cstrcpy_~from.offset)) (<= 1 cstrcpy_~to.offset)), 987#(and (<= (+ cstrcpy_~to.offset 1) (select |#length| cstrcpy_~to.base)) (<= 1 cstrcpy_~to.offset))]
[2018-02-04 01:47:59,920 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:47:59,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-02-04 01:47:59,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-02-04 01:47:59,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132
[2018-02-04 01:47:59,921 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 12 states.
[2018-02-04 01:48:00,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:48:00,117 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions.
[2018-02-04 01:48:00,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-02-04 01:48:00,117 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24
[2018-02-04 01:48:00,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:48:00,118 INFO L225 Difference]: With dead ends: 57
[2018-02-04 01:48:00,118 INFO L226 Difference]: Without dead ends: 57
[2018-02-04 01:48:00,118 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:48:00,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2018-02-04 01:48:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54.
[2018-02-04 01:48:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states.
[2018-02-04 01:48:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions.
[2018-02-04 01:48:00,121 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 24
[2018-02-04 01:48:00,121 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:48:00,121 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions.
[2018-02-04 01:48:00,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-02-04 01:48:00,122 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions.
[2018-02-04 01:48:00,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2018-02-04 01:48:00,122 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:48:00,122 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:48:00,123 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:48:00,123 INFO L82 PathProgramCache]: Analyzing trace with hash -18946133, now seen corresponding path program 2 times
[2018-02-04 01:48:00,124 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:48:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:48:00,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:48:00,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:48:00,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-04 01:48:00,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13
[2018-02-04 01:48:00,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:48:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:48:00,360 INFO L182 omatonBuilderFactory]: Interpolants [1120#(= (select |#valid| main_~nondetArea~0.base) 1), 1121#(and (= 0 |main_#t~malloc7.offset|) (not (= main_~nondetArea~0.base |main_#t~malloc7.base|)) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 1122#(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)), 1123#(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)), 1124#(and (= 0 |cstrcpy_#in~from.offset|) (or (and (not (= |cstrcpy_#in~to.base| |cstrcpy_#in~from.base|)) (= 0 (select (select |#memory_int| |cstrcpy_#in~from.base|) 1))) (<= 3 (select |#length| |cstrcpy_#in~from.base|)) (<= (select |#length| |cstrcpy_#in~from.base|) 1))), 1125#(and (= cstrcpy_~from.offset 0) (or (and (not (= cstrcpy_~from.base cstrcpy_~to.base)) (= 0 (select (select |#memory_int| cstrcpy_~from.base) 1))) (<= (select |#length| cstrcpy_~from.base) 1) (<= 3 (select |#length| cstrcpy_~from.base)))), 1126#(or (and (= 1 cstrcpy_~from.offset) (= 0 (select (select |#memory_int| cstrcpy_~from.base) cstrcpy_~from.offset))) (and (<= 1 cstrcpy_~from.offset) (or (<= (+ cstrcpy_~from.offset 2) (select |#length| cstrcpy_~from.base)) (<= (select |#length| cstrcpy_~from.base) cstrcpy_~from.offset)))), 1127#(or (and (= 1 cstrcpy_~from.offset) (= 0 (select (select |#memory_int| cstrcpy_~from.base) cstrcpy_~from.offset)) (= |cstrcpy_#t~mem3| (select (select |#memory_int| cstrcpy_~from.base) cstrcpy_~from.offset))) (and (<= 1 cstrcpy_~from.offset) (<= (+ cstrcpy_~from.offset 2) (select |#length| cstrcpy_~from.base)))), 1128#(or (and (<= 1 cstrcpy_~from.offset) (<= (+ cstrcpy_~from.offset 2) (select |#length| cstrcpy_~from.base))) (and (= 1 cstrcpy_~from.offset) (= 0 |cstrcpy_#t~mem3|))), 1129#(and (<= 1 cstrcpy_~from.offset) (<= (+ cstrcpy_~from.offset 2) (select |#length| cstrcpy_~from.base))), 1130#(and (<= 2 cstrcpy_~from.offset) (<= (+ cstrcpy_~from.offset 1) (select |#length| cstrcpy_~from.base))), 1117#true, 1118#false, 1119#(= (select |#valid| |main_#t~malloc6.base|) 1)]
[2018-02-04 01:48:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:48:00,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-02-04 01:48:00,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-02-04 01:48:00,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182
[2018-02-04 01:48:00,361 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 14 states.
[2018-02-04 01:48:00,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:48:00,605 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions.
[2018-02-04 01:48:00,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-02-04 01:48:00,605 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28
[2018-02-04 01:48:00,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:48:00,606 INFO L225 Difference]: With dead ends: 71
[2018-02-04 01:48:00,606 INFO L226 Difference]: Without dead ends: 71
[2018-02-04 01:48:00,607 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380
[2018-02-04 01:48:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states.
[2018-02-04 01:48:00,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59.
[2018-02-04 01:48:00,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states.
[2018-02-04 01:48:00,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions.
[2018-02-04 01:48:00,612 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 28
[2018-02-04 01:48:00,612 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:48:00,612 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions.
[2018-02-04 01:48:00,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-02-04 01:48:00,612 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions.
[2018-02-04 01:48:00,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-02-04 01:48:00,613 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:48:00,613 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:48:00,614 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:48:00,614 INFO L82 PathProgramCache]: Analyzing trace with hash 993932632, now seen corresponding path program 1 times
[2018-02-04 01:48:00,615 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:48:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:48:00,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:48:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:48:00,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:48:00,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-04 01:48:00,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:48:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:48:00,681 INFO L182 omatonBuilderFactory]: Interpolants [1273#true, 1274#false, 1275#(= |#valid| |old(#valid)|), 1276#(and (= (store |#valid| |main_#t~malloc6.base| 0) |old(#valid)|) (= (select |#valid| |main_#t~malloc6.base|) 1)), 1277#(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|))), 1278#(= (store |#valid| |main_#t~malloc7.base| 0) |old(#valid)|)]
[2018-02-04 01:48:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:48:00,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-04 01:48:00,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-04 01:48:00,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-04 01:48:00,681 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 6 states.
[2018-02-04 01:48:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:48:00,730 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions.
[2018-02-04 01:48:00,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-04 01:48:00,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29
[2018-02-04 01:48:00,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:48:00,731 INFO L225 Difference]: With dead ends: 58
[2018-02-04 01:48:00,731 INFO L226 Difference]: Without dead ends: 34
[2018-02-04 01:48:00,731 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2018-02-04 01:48:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2018-02-04 01:48:00,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34.
[2018-02-04 01:48:00,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states.
[2018-02-04 01:48:00,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions.
[2018-02-04 01:48:00,733 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 29
[2018-02-04 01:48:00,733 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:48:00,733 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions.
[2018-02-04 01:48:00,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-04 01:48:00,733 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions.
[2018-02-04 01:48:00,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2018-02-04 01:48:00,733 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:48:00,733 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:48:00,733 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:48:00,734 INFO L82 PathProgramCache]: Analyzing trace with hash -332118044, now seen corresponding path program 3 times
[2018-02-04 01:48:00,734 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:48:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:48:00,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:48:00,931 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:48:00,932 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-04 01:48:00,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13
[2018-02-04 01:48:00,932 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:48:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:48:00,932 INFO L182 omatonBuilderFactory]: Interpolants [1376#false, 1377#(= (select |#valid| |main_#t~malloc6.base|) 1), 1378#(= (select |#valid| main_~nondetArea~0.base) 1), 1379#(and (= 0 |main_#t~malloc7.offset|) (not (= main_~nondetArea~0.base |main_#t~malloc7.base|)) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 1380#(and (not (= main_~nondetArea~0.base main_~nondetString~0.base)) (= main_~length2~0 (select |#length| main_~nondetString~0.base)) (= main_~nondetString~0.offset 0)), 1381#(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)), 1382#(and (not (= |cstrcpy_#in~to.base| |cstrcpy_#in~from.base|)) (= 0 (select (select |#memory_int| |cstrcpy_#in~from.base|) (+ (select |#length| |cstrcpy_#in~from.base|) (- 1))))), 1383#(and (not (= cstrcpy_~from.base cstrcpy_~to.base)) (= 0 (select (select |#memory_int| cstrcpy_~from.base) (+ (select |#length| cstrcpy_~from.base) (- 1))))), 1384#(or (<= (+ cstrcpy_~from.offset 2) (select |#length| cstrcpy_~from.base)) (= 0 (select (select |#memory_int| cstrcpy_~from.base) cstrcpy_~from.offset)) (<= (select |#length| cstrcpy_~from.base) cstrcpy_~from.offset)), 1385#(or (and (<= 0 cstrcpy_~from.offset) (<= (+ cstrcpy_~from.offset 2) (select |#length| cstrcpy_~from.base))) (and (= 0 (select (select |#memory_int| cstrcpy_~from.base) cstrcpy_~from.offset)) (= |cstrcpy_#t~mem3| (select (select |#memory_int| cstrcpy_~from.base) cstrcpy_~from.offset)))), 1386#(or (and (<= 0 cstrcpy_~from.offset) (<= (+ cstrcpy_~from.offset 2) (select |#length| cstrcpy_~from.base))) (= 0 |cstrcpy_#t~mem3|)), 1387#(and (<= 0 cstrcpy_~from.offset) (<= (+ cstrcpy_~from.offset 2) (select |#length| cstrcpy_~from.base))), 1388#(and (<= 1 cstrcpy_~from.offset) (<= (+ cstrcpy_~from.offset 1) (select |#length| cstrcpy_~from.base))), 1375#true]
[2018-02-04 01:48:00,932 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:48:00,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-02-04 01:48:00,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-02-04 01:48:00,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182
[2018-02-04 01:48:00,933 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 14 states.
[2018-02-04 01:48:01,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:48:01,159 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions.
[2018-02-04 01:48:01,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-02-04 01:48:01,159 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33
[2018-02-04 01:48:01,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:48:01,160 INFO L225 Difference]: With dead ends: 33
[2018-02-04 01:48:01,160 INFO L226 Difference]: Without dead ends: 0
[2018-02-04 01:48:01,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600
[2018-02-04 01:48:01,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2018-02-04 01:48:01,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2018-02-04 01:48:01,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2018-02-04 01:48:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2018-02-04 01:48:01,161 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33
[2018-02-04 01:48:01,161 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:48:01,161 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-02-04 01:48:01,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-02-04 01:48:01,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2018-02-04 01:48:01,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2018-02-04 01:48:01,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:48:01 BoogieIcfgContainer
[2018-02-04 01:48:01,165 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-02-04 01:48:01,166 INFO L168 Benchmark]: Toolchain (without parser) took 3415.01 ms. Allocated memory was 399.5 MB in the beginning and 679.0 MB in the end (delta: 279.4 MB). Free memory was 357.5 MB in the beginning and 604.8 MB in the end (delta: -247.3 MB). Peak memory consumption was 32.2 MB. Max. memory is 5.3 GB.
[2018-02-04 01:48:01,167 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 399.5 MB. Free memory is still 362.8 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-04 01:48:01,167 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.98 ms. Allocated memory is still 399.5 MB. Free memory was 356.2 MB in the beginning and 345.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB.
[2018-02-04 01:48:01,167 INFO L168 Benchmark]: Boogie Preprocessor took 23.09 ms. Allocated memory is still 399.5 MB. Free memory was 345.6 MB in the beginning and 344.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
[2018-02-04 01:48:01,168 INFO L168 Benchmark]: RCFGBuilder took 158.08 ms. Allocated memory is still 399.5 MB. Free memory was 344.3 MB in the beginning and 327.1 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:48:01,168 INFO L168 Benchmark]: TraceAbstraction took 3076.30 ms. Allocated memory was 399.5 MB in the beginning and 679.0 MB in the end (delta: 279.4 MB). Free memory was 325.7 MB in the beginning and 604.8 MB in the end (delta: -279.1 MB). Peak memory consumption was 380.4 kB. Max. memory is 5.3 GB.
[2018-02-04 01:48:01,169 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.10 ms. Allocated memory is still 399.5 MB. Free memory is still 362.8 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 154.98 ms. Allocated memory is still 399.5 MB. Free memory was 356.2 MB in the beginning and 345.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 23.09 ms. Allocated memory is still 399.5 MB. Free memory was 345.6 MB in the beginning and 344.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 158.08 ms. Allocated memory is still 399.5 MB. Free memory was 344.3 MB in the beginning and 327.1 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 3076.30 ms. Allocated memory was 399.5 MB in the beginning and 679.0 MB in the end (delta: 279.4 MB). Free memory was 325.7 MB in the beginning and 604.8 MB in the end (delta: -279.1 MB). Peak memory consumption was 380.4 kB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 547]: 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
- 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.0s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 387 SDtfs, 408 SDslu, 1277 SDs, 0 SdLazy, 1109 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=12, 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, 14 MinimizatonAttempts, 48 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 43657 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 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_cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-48-01-176.csv
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-48-01-176.csv
Received shutdown request...