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_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:07:01,187 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:07:01,188 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:07:01,201 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:07:01,201 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:07:01,202 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:07:01,203 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:07:01,205 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:07:01,206 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:07:01,207 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:07:01,207 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:07:01,208 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:07:01,208 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:07:01,209 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:07:01,210 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:07:01,212 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:07:01,213 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:07:01,215 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:07:01,216 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:07:01,216 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:07:01,218 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:07:01,218 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:07:01,219 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:07:01,219 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:07:01,220 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:07:01,221 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:07:01,221 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:07:01,222 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:07:01,222 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:07:01,222 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:07:01,222 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:07:01,223 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:07:01,232 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:07:01,232 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:07:01,233 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:07:01,233 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:07:01,233 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:07:01,234 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:07:01,234 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:07:01,234 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:07:01,234 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:07:01,234 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:07:01,234 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:07:01,235 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:07:01,235 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:07:01,235 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:07:01,235 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:07:01,235 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:07:01,235 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:07:01,236 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:07:01,236 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:07:01,236 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:07:01,236 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:07:01,236 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:07:01,236 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:07:01,237 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:07:01,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:07:01,277 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:07:01,280 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:07:01,281 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:07:01,281 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:07:01,282 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 12:07:01,414 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:07:01,415 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:07:01,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:07:01,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:07:01,421 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:07:01,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:07:01" (1/1) ... [2018-02-04 12:07:01,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfe84f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:01, skipping insertion in model container [2018-02-04 12:07:01,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:07:01" (1/1) ... [2018-02-04 12:07:01,439 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:07:01,467 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:07:01,549 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:07:01,560 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:07:01,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:01 WrapperNode [2018-02-04 12:07:01,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:07:01,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:07:01,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:07:01,565 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:07:01,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:01" (1/1) ... [2018-02-04 12:07:01,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:01" (1/1) ... [2018-02-04 12:07:01,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:01" (1/1) ... [2018-02-04 12:07:01,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:01" (1/1) ... [2018-02-04 12:07:01,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:01" (1/1) ... [2018-02-04 12:07:01,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:01" (1/1) ... [2018-02-04 12:07:01,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:01" (1/1) ... [2018-02-04 12:07:01,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:07:01,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:07:01,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:07:01,585 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:07:01,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:01" (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 12:07:01,617 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:07:01,617 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:07:01,617 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-02-04 12:07:01,617 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:07:01,617 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:07:01,617 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:07:01,617 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:07:01,617 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:07:01,618 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:07:01,618 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:07:01,618 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-02-04 12:07:01,618 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:07:01,618 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:07:01,618 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:07:01,755 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:07:01,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:07:01 BoogieIcfgContainer [2018-02-04 12:07:01,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:07:01,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:07:01,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:07:01,757 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:07:01,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:07:01" (1/3) ... [2018-02-04 12:07:01,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cfe08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:07:01, skipping insertion in model container [2018-02-04 12:07:01,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:01" (2/3) ... [2018-02-04 12:07:01,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cfe08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:07:01, skipping insertion in model container [2018-02-04 12:07:01,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:07:01" (3/3) ... [2018-02-04 12:07:01,761 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:07:01,766 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:07:01,771 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-02-04 12:07:01,796 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:07:01,796 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:07:01,796 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:07:01,796 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:07:01,797 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:07:01,797 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:07:01,797 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:07:01,797 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:07:01,797 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:07:01,805 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-02-04 12:07:01,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 12:07:01,811 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:01,812 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:07:01,812 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:07:01,815 INFO L82 PathProgramCache]: Analyzing trace with hash -341828685, now seen corresponding path program 1 times [2018-02-04 12:07:01,816 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:01,816 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:01,850 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:01,850 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:01,850 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:01,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:01,944 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 12:07:01,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:01,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:07:01,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:07:01,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:07:01,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:07:01,956 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-02-04 12:07:02,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:02,072 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-04 12:07:02,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:07:02,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 12:07:02,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:02,082 INFO L225 Difference]: With dead ends: 44 [2018-02-04 12:07:02,082 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 12:07:02,084 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 12:07:02,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 12:07:02,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-02-04 12:07:02,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 12:07:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-04 12:07:02,160 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-02-04 12:07:02,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:02,160 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-04 12:07:02,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:07:02,160 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-04 12:07:02,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 12:07:02,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:02,160 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:07:02,160 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:07:02,161 INFO L82 PathProgramCache]: Analyzing trace with hash -341826763, now seen corresponding path program 1 times [2018-02-04 12:07:02,161 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:02,161 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:02,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:02,162 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:02,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:02,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:02,196 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 12:07:02,197 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:02,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:07:02,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:07:02,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:07:02,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:07:02,199 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-02-04 12:07:02,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:02,226 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-02-04 12:07:02,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:07:02,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-02-04 12:07:02,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:02,231 INFO L225 Difference]: With dead ends: 39 [2018-02-04 12:07:02,231 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 12:07:02,232 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 12:07:02,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 12:07:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-02-04 12:07:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 12:07:02,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-04 12:07:02,238 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-02-04 12:07:02,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:02,239 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-04 12:07:02,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:07:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-04 12:07:02,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:07:02,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:02,240 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:07:02,241 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:07:02,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659641, now seen corresponding path program 1 times [2018-02-04 12:07:02,241 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:02,241 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:02,243 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:02,243 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:02,243 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:02,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:02,288 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 12:07:02,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:02,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:07:02,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:07:02,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:07:02,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:07:02,289 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-02-04 12:07:02,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:02,316 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-04 12:07:02,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:07:02,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 12:07:02,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:02,317 INFO L225 Difference]: With dead ends: 36 [2018-02-04 12:07:02,317 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 12:07:02,318 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 12:07:02,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 12:07:02,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 12:07:02,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 12:07:02,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 12:07:02,320 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-02-04 12:07:02,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:02,320 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 12:07:02,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:07:02,320 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 12:07:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:07:02,320 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:02,320 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:07:02,321 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:07:02,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659640, now seen corresponding path program 1 times [2018-02-04 12:07:02,321 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:02,321 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:02,321 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:02,321 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:02,322 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:02,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:02,395 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 12:07:02,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:02,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:07:02,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:07:02,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:07:02,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:07:02,396 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-02-04 12:07:02,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:02,434 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-04 12:07:02,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:07:02,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 12:07:02,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:02,435 INFO L225 Difference]: With dead ends: 35 [2018-02-04 12:07:02,435 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 12:07:02,435 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 12:07:02,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 12:07:02,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-04 12:07:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 12:07:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-04 12:07:02,438 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-02-04 12:07:02,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:02,438 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-04 12:07:02,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:07:02,439 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-04 12:07:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 12:07:02,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:02,439 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 12:07:02,439 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:07:02,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1121108344, now seen corresponding path program 1 times [2018-02-04 12:07:02,440 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:02,440 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:02,440 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:02,441 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:02,441 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:02,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:02,472 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 12:07:02,472 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:02,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:07:02,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:07:02,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:07:02,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:07:02,473 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-02-04 12:07:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:02,501 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-02-04 12:07:02,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:07:02,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 12:07:02,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:02,502 INFO L225 Difference]: With dead ends: 34 [2018-02-04 12:07:02,502 INFO L226 Difference]: Without dead ends: 34 [2018-02-04 12:07:02,502 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 12:07:02,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-02-04 12:07:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-02-04 12:07:02,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 12:07:02,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-02-04 12:07:02,505 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-02-04 12:07:02,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:02,506 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-02-04 12:07:02,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:07:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-02-04 12:07:02,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 12:07:02,506 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:02,506 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 12:07:02,506 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:07:02,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1121108343, now seen corresponding path program 1 times [2018-02-04 12:07:02,507 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:02,507 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:02,507 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:02,507 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:02,507 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:02,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:02,588 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 12:07:02,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:02,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:07:02,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:07:02,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:07:02,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:07:02,589 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-02-04 12:07:02,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:02,654 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-04 12:07:02,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:07:02,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-04 12:07:02,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:02,657 INFO L225 Difference]: With dead ends: 44 [2018-02-04 12:07:02,657 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 12:07:02,657 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 12:07:02,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 12:07:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-02-04 12:07:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 12:07:02,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 12:07:02,661 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 18 [2018-02-04 12:07:02,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:02,661 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 12:07:02,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:07:02,661 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 12:07:02,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 12:07:02,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:02,662 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 12:07:02,662 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:07:02,662 INFO L82 PathProgramCache]: Analyzing trace with hash -394620318, now seen corresponding path program 1 times [2018-02-04 12:07:02,662 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:02,662 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:02,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:02,663 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:02,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:02,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:07:02,748 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:02,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:07:02,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:07:02,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:07:02,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:07:02,749 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 8 states. [2018-02-04 12:07:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:02,830 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-04 12:07:02,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:07:02,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-04 12:07:02,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:02,830 INFO L225 Difference]: With dead ends: 35 [2018-02-04 12:07:02,831 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 12:07:02,831 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 12:07:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 12:07:02,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-04 12:07:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 12:07:02,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-04 12:07:02,833 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 19 [2018-02-04 12:07:02,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:02,833 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-04 12:07:02,833 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:07:02,833 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-04 12:07:02,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 12:07:02,833 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:02,833 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 12:07:02,833 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:07:02,834 INFO L82 PathProgramCache]: Analyzing trace with hash -394620317, now seen corresponding path program 1 times [2018-02-04 12:07:02,834 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:02,834 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:02,834 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:02,834 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:02,834 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:02,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:07:02,908 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:02,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:07:02,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:07:02,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:07:02,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:07:02,908 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 8 states. [2018-02-04 12:07:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:03,009 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-04 12:07:03,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:07:03,009 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-04 12:07:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:03,010 INFO L225 Difference]: With dead ends: 41 [2018-02-04 12:07:03,010 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 12:07:03,011 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 12:07:03,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 12:07:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-02-04 12:07:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 12:07:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 12:07:03,013 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 19 [2018-02-04 12:07:03,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:03,014 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 12:07:03,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:07:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 12:07:03,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:07:03,014 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:03,015 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 12:07:03,015 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:07:03,015 INFO L82 PathProgramCache]: Analyzing trace with hash 708807622, now seen corresponding path program 1 times [2018-02-04 12:07:03,015 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:03,015 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:03,017 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:03,017 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:03,017 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:03,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:03,150 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 12:07:03,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:03,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 12:07:03,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:07:03,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:07:03,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:07:03,151 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-02-04 12:07:03,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:03,289 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-02-04 12:07:03,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:07:03,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-04 12:07:03,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:03,290 INFO L225 Difference]: With dead ends: 58 [2018-02-04 12:07:03,290 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 12:07:03,290 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 12:07:03,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 12:07:03,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-02-04 12:07:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 12:07:03,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-02-04 12:07:03,294 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 23 [2018-02-04 12:07:03,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:03,294 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-02-04 12:07:03,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:07:03,294 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-02-04 12:07:03,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:07:03,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:03,295 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 12:07:03,295 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:07:03,295 INFO L82 PathProgramCache]: Analyzing trace with hash -312260732, now seen corresponding path program 1 times [2018-02-04 12:07:03,296 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:03,296 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:03,296 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:03,297 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:03,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:03,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:03,453 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 12:07:03,453 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:07:03,453 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:07:03,458 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:03,479 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:07:03,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 12:07:03,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-04 12:07:03,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:03,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:03,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:07:03,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-04 12:07:03,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-02-04 12:07:03,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 12:07:03,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:07:03,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:07:03,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:07:03,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-02-04 12:07:03,716 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 12:07:03,733 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:07:03,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2018-02-04 12:07:03,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 12:07:03,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 12:07:03,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-02-04 12:07:03,734 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 17 states. [2018-02-04 12:07:04,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:04,005 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-02-04 12:07:04,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:07:04,006 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-02-04 12:07:04,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:04,006 INFO L225 Difference]: With dead ends: 65 [2018-02-04 12:07:04,006 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 12:07:04,007 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-02-04 12:07:04,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 12:07:04,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2018-02-04 12:07:04,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 12:07:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-02-04 12:07:04,013 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 23 [2018-02-04 12:07:04,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:04,013 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-02-04 12:07:04,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 12:07:04,013 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-02-04 12:07:04,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 12:07:04,014 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:04,014 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 12:07:04,014 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:07:04,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1090148152, now seen corresponding path program 1 times [2018-02-04 12:07:04,014 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:04,014 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:04,015 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:04,015 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:04,015 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:04,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:04,142 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 12:07:04,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:07:04,142 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:07:04,147 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:04,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:07:04,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:07:04,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:04,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:07:04,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:04,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:04,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 12:07:04,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:04,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:04,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:07:04,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:04,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 12:07:04,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:04,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:04,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 12:07:04,353 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 12:07:04,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:07:04,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-02-04 12:07:04,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 12:07:04,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 12:07:04,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-02-04 12:07:04,371 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 22 states. [2018-02-04 12:07:04,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:04,762 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-02-04 12:07:04,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 12:07:04,762 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-02-04 12:07:04,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:04,763 INFO L225 Difference]: With dead ends: 63 [2018-02-04 12:07:04,763 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 12:07:04,763 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 12:07:04,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 12:07:04,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-02-04 12:07:04,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 12:07:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-02-04 12:07:04,767 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 24 [2018-02-04 12:07:04,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:04,767 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-02-04 12:07:04,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 12:07:04,767 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-02-04 12:07:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:07:04,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:04,768 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 12:07:04,768 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:07:04,768 INFO L82 PathProgramCache]: Analyzing trace with hash -18946133, now seen corresponding path program 2 times [2018-02-04 12:07:04,768 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:04,768 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:04,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:04,769 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:04,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:04,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:05,021 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 12:07:05,021 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:07:05,021 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:07:05,031 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:07:05,047 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:07:05,047 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:07:05,049 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:07:05,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:07:05,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:05,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:05,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 12:07:05,054 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:05,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:05,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:07:05,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:05,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:07:05,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:05,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:05,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-04 12:07:05,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:07:05,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 12:07:05,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:05,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:05,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:05,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-04 12:07:05,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-02-04 12:07:05,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:07:05,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:05,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:05,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:07:05,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2018-02-04 12:07:05,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-04 12:07:05,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:07:05,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:07:05,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:07:05,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:07:05,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-02-04 12:07:05,243 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 12:07:05,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:07:05,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2018-02-04 12:07:05,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 12:07:05,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 12:07:05,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:07:05,261 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 21 states. [2018-02-04 12:07:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:05,734 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-02-04 12:07:05,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 12:07:05,735 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-02-04 12:07:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:05,735 INFO L225 Difference]: With dead ends: 62 [2018-02-04 12:07:05,735 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 12:07:05,736 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=1096, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 12:07:05,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 12:07:05,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2018-02-04 12:07:05,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 12:07:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-02-04 12:07:05,739 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 28 [2018-02-04 12:07:05,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:05,740 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-02-04 12:07:05,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 12:07:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-02-04 12:07:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 12:07:05,740 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:05,740 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 12:07:05,741 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:07:05,741 INFO L82 PathProgramCache]: Analyzing trace with hash 993932632, now seen corresponding path program 1 times [2018-02-04 12:07:05,741 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:05,741 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:05,742 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:05,742 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:07:05,742 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:05,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:05,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:07:05,802 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:05,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:07:05,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:07:05,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:07:05,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:07:05,803 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 6 states. [2018-02-04 12:07:05,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:05,874 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-02-04 12:07:05,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:07:05,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-02-04 12:07:05,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:05,875 INFO L225 Difference]: With dead ends: 45 [2018-02-04 12:07:05,875 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 12:07:05,875 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 12:07:05,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 12:07:05,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 12:07:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 12:07:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 12:07:05,876 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-02-04 12:07:05,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:05,876 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 12:07:05,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:07:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 12:07:05,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 12:07:05,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:07:05 BoogieIcfgContainer [2018-02-04 12:07:05,881 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:07:05,881 INFO L168 Benchmark]: Toolchain (without parser) took 4467.30 ms. Allocated memory was 403.2 MB in the beginning and 734.5 MB in the end (delta: 331.4 MB). Free memory was 361.4 MB in the beginning and 704.0 MB in the end (delta: -342.6 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:07:05,882 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:07:05,882 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.74 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 349.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:07:05,883 INFO L168 Benchmark]: Boogie Preprocessor took 19.84 ms. Allocated memory is still 403.2 MB. Free memory was 349.5 MB in the beginning and 348.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:07:05,883 INFO L168 Benchmark]: RCFGBuilder took 170.69 ms. Allocated memory is still 403.2 MB. Free memory was 348.2 MB in the beginning and 331.5 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. [2018-02-04 12:07:05,883 INFO L168 Benchmark]: TraceAbstraction took 4125.23 ms. Allocated memory was 403.2 MB in the beginning and 734.5 MB in the end (delta: 331.4 MB). Free memory was 330.2 MB in the beginning and 704.0 MB in the end (delta: -373.8 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:07:05,884 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.74 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 349.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 19.84 ms. Allocated memory is still 403.2 MB. Free memory was 349.5 MB in the beginning and 348.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 170.69 ms. Allocated memory is still 403.2 MB. Free memory was 348.2 MB in the beginning and 331.5 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4125.23 ms. Allocated memory was 403.2 MB in the beginning and 734.5 MB in the end (delta: 331.4 MB). Free memory was 330.2 MB in the beginning and 704.0 MB in the end (delta: -373.8 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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, 4.0s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 369 SDtfs, 494 SDslu, 1475 SDs, 0 SdLazy, 1234 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 58 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 308 ConstructedInterpolants, 13 QuantifiedInterpolants, 52692 SizeOfPredicates, 27 NumberOfNonLiveVariables, 357 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 2/30 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_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-07-05-890.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_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-07-05-890.csv Received shutdown request...