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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 19:55:30,482 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 19:55:30,484 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 19:55:30,500 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 19:55:30,500 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 19:55:30,501 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 19:55:30,502 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 19:55:30,504 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 19:55:30,506 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 19:55:30,507 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 19:55:30,508 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 19:55:30,509 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 19:55:30,510 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 19:55:30,511 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 19:55:30,512 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 19:55:30,515 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 19:55:30,517 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 19:55:30,520 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 19:55:30,521 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 19:55:30,523 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 19:55:30,525 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 19:55:30,525 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 19:55:30,526 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 19:55:30,527 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 19:55:30,528 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 19:55:30,529 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 19:55:30,529 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 19:55:30,530 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 19:55:30,530 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 19:55:30,530 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 19:55:30,531 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 19:55:30,532 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf [2018-01-24 19:55:30,541 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 19:55:30,542 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 19:55:30,543 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 19:55:30,543 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 19:55:30,543 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 19:55:30,543 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 19:55:30,543 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 19:55:30,543 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 19:55:30,543 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 19:55:30,544 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 19:55:30,544 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 19:55:30,544 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 19:55:30,544 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 19:55:30,544 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 19:55:30,545 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 19:55:30,545 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 19:55:30,545 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 19:55:30,545 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 19:55:30,545 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 19:55:30,545 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 19:55:30,545 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 19:55:30,546 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 19:55:30,546 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 19:55:30,546 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 19:55:30,546 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 19:55:30,546 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 19:55:30,547 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 19:55:30,547 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 19:55:30,547 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 19:55:30,547 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 19:55:30,547 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 19:55:30,547 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 19:55:30,547 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 19:55:30,547 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 19:55:30,548 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 19:55:30,548 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 19:55:30,548 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 19:55:30,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 19:55:30,596 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 19:55:30,600 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 19:55:30,601 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 19:55:30,601 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 19:55:30,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:55:30,768 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 19:55:30,773 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 19:55:30,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 19:55:30,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 19:55:30,779 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 19:55:30,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:55:30" (1/1) ... [2018-01-24 19:55:30,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eb333df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:55:30, skipping insertion in model container [2018-01-24 19:55:30,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:55:30" (1/1) ... [2018-01-24 19:55:30,796 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:55:30,833 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:55:30,952 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:55:30,976 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:55:30,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:55:30 WrapperNode [2018-01-24 19:55:30,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 19:55:30,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 19:55:30,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 19:55:30,985 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 19:55:30,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:55:30" (1/1) ... [2018-01-24 19:55:30,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:55:30" (1/1) ... [2018-01-24 19:55:31,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:55:30" (1/1) ... [2018-01-24 19:55:31,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:55:30" (1/1) ... [2018-01-24 19:55:31,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:55:30" (1/1) ... [2018-01-24 19:55:31,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:55:30" (1/1) ... [2018-01-24 19:55:31,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:55:30" (1/1) ... [2018-01-24 19:55:31,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 19:55:31,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 19:55:31,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 19:55:31,019 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 19:55:31,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:55:30" (1/1) ... No working directory specified, using /storage/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-01-24 19:55:31,076 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 19:55:31,077 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 19:55:31,077 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2018-01-24 19:55:31,077 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 19:55:31,077 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 19:55:31,077 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 19:55:31,078 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 19:55:31,078 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 19:55:31,078 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 19:55:31,078 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 19:55:31,078 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlcpy [2018-01-24 19:55:31,078 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 19:55:31,078 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 19:55:31,078 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 19:55:31,295 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 19:55:31,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:55:31 BoogieIcfgContainer [2018-01-24 19:55:31,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 19:55:31,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 19:55:31,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 19:55:31,298 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 19:55:31,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 07:55:30" (1/3) ... [2018-01-24 19:55:31,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151ced0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:55:31, skipping insertion in model container [2018-01-24 19:55:31,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:55:30" (2/3) ... [2018-01-24 19:55:31,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151ced0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:55:31, skipping insertion in model container [2018-01-24 19:55:31,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:55:31" (3/3) ... [2018-01-24 19:55:31,301 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:55:31,307 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 19:55:31,313 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-24 19:55:31,363 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 19:55:31,364 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 19:55:31,364 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 19:55:31,364 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 19:55:31,364 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 19:55:31,364 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 19:55:31,364 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 19:55:31,365 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 19:55:31,365 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 19:55:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-24 19:55:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 19:55:31,393 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:55:31,394 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:55:31,394 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:55:31,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619982, now seen corresponding path program 1 times [2018-01-24 19:55:31,402 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:55:31,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:31,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:55:31,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:31,448 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:55:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:55:31,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:55:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:55:31,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:55:31,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:55:31,619 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:55:31,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:55:31,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:55:31,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:55:31,640 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-01-24 19:55:31,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:55:31,835 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-01-24 19:55:31,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:55:31,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 19:55:31,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:55:31,850 INFO L225 Difference]: With dead ends: 79 [2018-01-24 19:55:31,850 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 19:55:31,853 INFO L525 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-01-24 19:55:31,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 19:55:31,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 19:55:31,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 19:55:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-01-24 19:55:31,886 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 13 [2018-01-24 19:55:31,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:55:31,886 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-01-24 19:55:31,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:55:31,887 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-01-24 19:55:31,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 19:55:31,887 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:55:31,887 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:55:31,887 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:55:31,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619983, now seen corresponding path program 1 times [2018-01-24 19:55:31,888 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:55:31,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:31,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:55:31,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:31,889 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:55:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:55:31,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:55:32,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:55:32,034 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:55:32,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:55:32,035 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:55:32,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:55:32,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:55:32,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:55:32,037 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2018-01-24 19:55:32,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:55:32,149 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-01-24 19:55:32,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:55:32,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 19:55:32,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:55:32,151 INFO L225 Difference]: With dead ends: 51 [2018-01-24 19:55:32,151 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 19:55:32,153 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 19:55:32,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 19:55:32,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 19:55:32,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 19:55:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-01-24 19:55:32,161 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 13 [2018-01-24 19:55:32,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:55:32,161 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-01-24 19:55:32,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:55:32,161 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-01-24 19:55:32,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 19:55:32,162 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:55:32,162 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:55:32,162 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:55:32,162 INFO L82 PathProgramCache]: Analyzing trace with hash 390579246, now seen corresponding path program 1 times [2018-01-24 19:55:32,163 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:55:32,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:32,164 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:55:32,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:32,164 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:55:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:55:32,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:55:32,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:55:32,225 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:55:32,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:55:32,226 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:55:32,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:55:32,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:55:32,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:55:32,227 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-01-24 19:55:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:55:32,358 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-01-24 19:55:32,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:55:32,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 19:55:32,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:55:32,360 INFO L225 Difference]: With dead ends: 50 [2018-01-24 19:55:32,360 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 19:55:32,360 INFO L525 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-01-24 19:55:32,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 19:55:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 19:55:32,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 19:55:32,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-01-24 19:55:32,368 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 14 [2018-01-24 19:55:32,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:55:32,368 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-01-24 19:55:32,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:55:32,369 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-01-24 19:55:32,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 19:55:32,369 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:55:32,370 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:55:32,370 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:55:32,370 INFO L82 PathProgramCache]: Analyzing trace with hash 390579247, now seen corresponding path program 1 times [2018-01-24 19:55:32,370 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:55:32,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:32,371 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:55:32,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:32,372 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:55:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:55:32,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:55:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:55:32,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:55:32,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:55:32,467 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:55:32,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:55:32,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:55:32,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:55:32,468 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 5 states. [2018-01-24 19:55:32,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:55:32,502 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-01-24 19:55:32,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:55:32,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 19:55:32,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:55:32,503 INFO L225 Difference]: With dead ends: 49 [2018-01-24 19:55:32,504 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 19:55:32,504 INFO L525 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-01-24 19:55:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 19:55:32,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 19:55:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 19:55:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-01-24 19:55:32,511 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 14 [2018-01-24 19:55:32,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:55:32,511 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-01-24 19:55:32,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:55:32,511 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-01-24 19:55:32,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 19:55:32,512 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:55:32,512 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:55:32,512 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:55:32,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349366, now seen corresponding path program 1 times [2018-01-24 19:55:32,512 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:55:32,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:32,513 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:55:32,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:32,513 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:55:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:55:32,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:55:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:55:32,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:55:32,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:55:32,567 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:55:32,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:55:32,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:55:32,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:55:32,568 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 5 states. [2018-01-24 19:55:32,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:55:32,656 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-01-24 19:55:32,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 19:55:32,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 19:55:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:55:32,658 INFO L225 Difference]: With dead ends: 48 [2018-01-24 19:55:32,658 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 19:55:32,658 INFO L525 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-01-24 19:55:32,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 19:55:32,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 19:55:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 19:55:32,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-01-24 19:55:32,665 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2018-01-24 19:55:32,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:55:32,665 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-01-24 19:55:32,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:55:32,666 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-01-24 19:55:32,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 19:55:32,667 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:55:32,667 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:55:32,667 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:55:32,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349365, now seen corresponding path program 1 times [2018-01-24 19:55:32,667 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:55:32,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:32,669 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:55:32,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:32,669 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:55:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:55:32,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:55:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:55:32,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:55:32,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 19:55:32,796 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:55:32,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 19:55:32,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 19:55:32,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:55:32,797 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 8 states. [2018-01-24 19:55:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:55:32,939 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-01-24 19:55:32,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 19:55:32,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-24 19:55:32,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:55:32,942 INFO L225 Difference]: With dead ends: 63 [2018-01-24 19:55:32,943 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 19:55:32,943 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-24 19:55:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 19:55:32,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-01-24 19:55:32,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 19:55:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-01-24 19:55:32,950 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 20 [2018-01-24 19:55:32,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:55:32,951 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-01-24 19:55:32,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 19:55:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-01-24 19:55:32,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 19:55:32,952 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:55:32,952 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:55:32,952 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:55:32,952 INFO L82 PathProgramCache]: Analyzing trace with hash -698055293, now seen corresponding path program 1 times [2018-01-24 19:55:32,953 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:55:32,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:32,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:55:32,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:32,954 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:55:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:55:32,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:55:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:55:33,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:55:33,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:55:33,024 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:55:33,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:55:33,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:55:33,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:55:33,026 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-01-24 19:55:33,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:55:33,161 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-01-24 19:55:33,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:55:33,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-24 19:55:33,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:55:33,164 INFO L225 Difference]: With dead ends: 53 [2018-01-24 19:55:33,164 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 19:55:33,164 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:55:33,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 19:55:33,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 19:55:33,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 19:55:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-01-24 19:55:33,171 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 21 [2018-01-24 19:55:33,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:55:33,172 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-01-24 19:55:33,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:55:33,172 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-01-24 19:55:33,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 19:55:33,173 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:55:33,173 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:55:33,173 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:55:33,173 INFO L82 PathProgramCache]: Analyzing trace with hash -698055292, now seen corresponding path program 1 times [2018-01-24 19:55:33,174 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:55:33,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:33,175 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:55:33,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:33,175 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:55:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:55:33,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:55:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:55:33,291 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:55:33,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 19:55:33,291 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:55:33,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 19:55:33,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 19:55:33,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 19:55:33,292 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-01-24 19:55:33,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:55:33,428 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-01-24 19:55:33,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 19:55:33,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-24 19:55:33,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:55:33,429 INFO L225 Difference]: With dead ends: 63 [2018-01-24 19:55:33,429 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 19:55:33,429 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 19:55:33,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 19:55:33,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-01-24 19:55:33,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 19:55:33,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-01-24 19:55:33,434 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 21 [2018-01-24 19:55:33,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:55:33,435 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-01-24 19:55:33,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 19:55:33,435 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-01-24 19:55:33,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 19:55:33,435 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:55:33,435 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:55:33,436 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:55:33,436 INFO L82 PathProgramCache]: Analyzing trace with hash -164877615, now seen corresponding path program 1 times [2018-01-24 19:55:33,436 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:55:33,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:33,437 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:55:33,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:33,437 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:55:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:55:33,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:55:33,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:55:33,552 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:55:33,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:55:33,553 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:55:33,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:55:33,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:55:33,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:55:33,554 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-01-24 19:55:33,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:55:33,778 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-01-24 19:55:33,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:55:33,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 19:55:33,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:55:33,779 INFO L225 Difference]: With dead ends: 53 [2018-01-24 19:55:33,779 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 19:55:33,779 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:55:33,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 19:55:33,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 19:55:33,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 19:55:33,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-01-24 19:55:33,785 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-01-24 19:55:33,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:55:33,785 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-01-24 19:55:33,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:55:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-01-24 19:55:33,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 19:55:33,786 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:55:33,787 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:55:33,787 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:55:33,787 INFO L82 PathProgramCache]: Analyzing trace with hash -164877614, now seen corresponding path program 1 times [2018-01-24 19:55:33,787 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:55:33,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:33,788 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:55:33,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:33,788 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:55:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:55:33,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:55:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:55:34,002 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:55:34,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 19:55:34,003 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:55:34,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 19:55:34,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 19:55:34,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 19:55:34,003 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-01-24 19:55:34,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:55:34,154 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-01-24 19:55:34,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 19:55:34,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 19:55:34,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:55:34,156 INFO L225 Difference]: With dead ends: 64 [2018-01-24 19:55:34,156 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 19:55:34,156 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-24 19:55:34,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 19:55:34,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-01-24 19:55:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 19:55:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-01-24 19:55:34,162 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 22 [2018-01-24 19:55:34,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:55:34,162 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-01-24 19:55:34,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 19:55:34,163 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-01-24 19:55:34,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 19:55:34,163 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:55:34,164 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:55:34,164 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:55:34,164 INFO L82 PathProgramCache]: Analyzing trace with hash 634059438, now seen corresponding path program 1 times [2018-01-24 19:55:34,164 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:55:34,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:34,165 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:55:34,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:34,165 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:55:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:55:34,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:55:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:55:34,207 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:55:34,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:55:34,208 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:55:34,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:55:34,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:55:34,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:55:34,208 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-01-24 19:55:34,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:55:34,255 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-01-24 19:55:34,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:55:34,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 19:55:34,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:55:34,256 INFO L225 Difference]: With dead ends: 53 [2018-01-24 19:55:34,256 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 19:55:34,256 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:55:34,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 19:55:34,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 19:55:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 19:55:34,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-01-24 19:55:34,260 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-01-24 19:55:34,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:55:34,260 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-01-24 19:55:34,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:55:34,261 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-01-24 19:55:34,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 19:55:34,261 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:55:34,261 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:55:34,261 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:55:34,262 INFO L82 PathProgramCache]: Analyzing trace with hash 634059439, now seen corresponding path program 1 times [2018-01-24 19:55:34,262 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:55:34,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:34,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:55:34,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:34,263 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:55:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:55:34,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:55:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:55:34,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:55:34,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 19:55:34,366 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:55:34,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 19:55:34,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 19:55:34,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 19:55:34,367 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-01-24 19:55:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:55:34,498 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-01-24 19:55:34,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 19:55:34,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 19:55:34,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:55:34,499 INFO L225 Difference]: With dead ends: 60 [2018-01-24 19:55:34,499 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 19:55:34,500 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 19:55:34,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 19:55:34,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-01-24 19:55:34,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 19:55:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-01-24 19:55:34,505 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2018-01-24 19:55:34,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:55:34,505 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-01-24 19:55:34,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 19:55:34,505 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2018-01-24 19:55:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 19:55:34,506 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:55:34,506 INFO L322 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] [2018-01-24 19:55:34,506 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:55:34,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1535458206, now seen corresponding path program 1 times [2018-01-24 19:55:34,507 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:55:34,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:34,508 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:55:34,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:34,508 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:55:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:55:34,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:55:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:55:34,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:55:34,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 19:55:34,907 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:55:34,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 19:55:34,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 19:55:34,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-24 19:55:34,908 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 11 states. [2018-01-24 19:55:35,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:55:35,063 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2018-01-24 19:55:35,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 19:55:35,064 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-01-24 19:55:35,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:55:35,064 INFO L225 Difference]: With dead ends: 85 [2018-01-24 19:55:35,064 INFO L226 Difference]: Without dead ends: 84 [2018-01-24 19:55:35,065 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-01-24 19:55:35,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-24 19:55:35,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2018-01-24 19:55:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 19:55:35,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2018-01-24 19:55:35,070 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 26 [2018-01-24 19:55:35,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:55:35,070 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2018-01-24 19:55:35,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 19:55:35,070 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2018-01-24 19:55:35,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 19:55:35,071 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:55:35,072 INFO L322 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, 1, 1] [2018-01-24 19:55:35,072 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:55:35,072 INFO L82 PathProgramCache]: Analyzing trace with hash -44170330, now seen corresponding path program 1 times [2018-01-24 19:55:35,072 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:55:35,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:35,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:55:35,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:35,073 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:55:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:55:35,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:55:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 19:55:35,156 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:55:35,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 19:55:35,156 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:55:35,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:55:35,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:55:35,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:55:35,157 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand 6 states. [2018-01-24 19:55:35,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:55:35,181 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-01-24 19:55:35,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:55:35,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 19:55:35,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:55:35,182 INFO L225 Difference]: With dead ends: 80 [2018-01-24 19:55:35,183 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 19:55:35,183 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-24 19:55:35,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 19:55:35,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-24 19:55:35,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 19:55:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2018-01-24 19:55:35,188 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 26 [2018-01-24 19:55:35,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:55:35,189 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-01-24 19:55:35,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:55:35,189 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2018-01-24 19:55:35,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 19:55:35,190 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:55:35,190 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:55:35,190 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:55:35,191 INFO L82 PathProgramCache]: Analyzing trace with hash 355579118, now seen corresponding path program 1 times [2018-01-24 19:55:35,191 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:55:35,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:35,192 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:55:35,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:35,192 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:55:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:55:35,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:55:35,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:55:35,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:55:35,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 19:55:35,325 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:55:35,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 19:55:35,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 19:55:35,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 19:55:35,326 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 10 states. [2018-01-24 19:55:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:55:35,503 INFO L93 Difference]: Finished difference Result 138 states and 160 transitions. [2018-01-24 19:55:35,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 19:55:35,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-01-24 19:55:35,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:55:35,504 INFO L225 Difference]: With dead ends: 138 [2018-01-24 19:55:35,504 INFO L226 Difference]: Without dead ends: 105 [2018-01-24 19:55:35,505 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-01-24 19:55:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-24 19:55:35,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2018-01-24 19:55:35,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 19:55:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-01-24 19:55:35,512 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 27 [2018-01-24 19:55:35,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:55:35,512 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-01-24 19:55:35,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 19:55:35,512 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-01-24 19:55:35,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 19:55:35,513 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:55:35,513 INFO L322 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, 1, 1, 1] [2018-01-24 19:55:35,513 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:55:35,514 INFO L82 PathProgramCache]: Analyzing trace with hash 505638783, now seen corresponding path program 1 times [2018-01-24 19:55:35,514 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:55:35,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:35,515 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:55:35,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:35,515 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:55:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:55:35,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:55:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 19:55:35,614 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:55:35,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 19:55:35,614 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:55:35,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:55:35,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:55:35,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:55:35,615 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 6 states. [2018-01-24 19:55:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:55:35,669 INFO L93 Difference]: Finished difference Result 128 states and 150 transitions. [2018-01-24 19:55:35,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:55:35,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-24 19:55:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:55:35,671 INFO L225 Difference]: With dead ends: 128 [2018-01-24 19:55:35,671 INFO L226 Difference]: Without dead ends: 94 [2018-01-24 19:55:35,672 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-24 19:55:35,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-24 19:55:35,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-01-24 19:55:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 19:55:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2018-01-24 19:55:35,680 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 27 [2018-01-24 19:55:35,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:55:35,680 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2018-01-24 19:55:35,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:55:35,680 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2018-01-24 19:55:35,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 19:55:35,681 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:55:35,681 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:55:35,682 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:55:35,682 INFO L82 PathProgramCache]: Analyzing trace with hash 778280944, now seen corresponding path program 1 times [2018-01-24 19:55:35,682 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:55:35,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:35,683 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:55:35,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:55:35,683 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:55:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:55:35,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:55:35,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:55:35,845 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:55:35,845 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:55:35,846 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-24 19:55:35,848 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [9], [14], [15], [17], [18], [25], [65], [66], [70], [75], [81], [83], [84], [85], [86], [87], [90], [101], [102], [103], [105] [2018-01-24 19:55:35,890 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:55:35,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 19:56:25,698 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 19:56:25,699 INFO L268 AbstractInterpreter]: Visited 24 different actions 44 times. Merged at 7 different actions 20 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-01-24 19:56:25,727 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 19:56:25,727 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:56:25,727 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-24 19:56:25,737 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:56:25,737 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:56:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:56:25,788 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:56:25,822 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-01-24 19:56:25,824 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-01-24 19:56:25,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:56:25,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:56:25,834 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-01-24 19:56:25,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 19:56:26,016 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-01-24 19:56:26,025 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-01-24 19:56:26,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:56:26,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:56:26,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:56:26,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 19:56:26,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:56:26,120 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:56:26,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 12 [2018-01-24 19:56:26,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:56:26,375 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 13 treesize of output 11 [2018-01-24 19:56:26,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 19:56:26,385 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 19:56:26,388 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:56:26,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:56:26,394 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 19:56:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:56:26,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:56:26,452 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 19:56:26,458 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:56:26,458 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:56:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:56:26,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:56:26,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 6 treesize of output 5 [2018-01-24 19:56:26,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:56:26,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:56:26,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 19:56:26,559 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 16 treesize of output 13 [2018-01-24 19:56:26,570 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-01-24 19:56:26,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:56:26,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:56:26,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:56:26,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 19:56:26,704 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 19 treesize of output 15 [2018-01-24 19:56:26,731 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 15 treesize of output 12 [2018-01-24 19:56:26,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:56:26,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:56:26,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:56:26,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-24 19:56:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:56:26,813 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:56:26,928 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 13 treesize of output 11 [2018-01-24 19:56:26,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2018-01-24 19:56:26,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:56:26,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:56:26,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:56:26,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 19:56:27,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:56:27,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 19:56:27,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 11, 11] total 35 [2018-01-24 19:56:27,016 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 19:56:27,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 19:56:27,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 19:56:27,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1128, Unknown=0, NotChecked=0, Total=1260 [2018-01-24 19:56:27,017 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand 17 states. Received shutdown request... [2018-01-24 19:56:28,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 19:56:28,654 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 19:56:28,657 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 19:56:28,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 07:56:28 BoogieIcfgContainer [2018-01-24 19:56:28,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 19:56:28,659 INFO L168 Benchmark]: Toolchain (without parser) took 57890.26 ms. Allocated memory was 305.7 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 264.6 MB in the beginning and 1.1 GB in the end (delta: -794.5 MB). Peak memory consumption was 638.9 MB. Max. memory is 5.3 GB. [2018-01-24 19:56:28,659 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 305.7 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 19:56:28,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.34 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 254.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:56:28,659 INFO L168 Benchmark]: Boogie Preprocessor took 33.15 ms. Allocated memory is still 305.7 MB. Free memory was 254.5 MB in the beginning and 252.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:56:28,660 INFO L168 Benchmark]: RCFGBuilder took 277.06 ms. Allocated memory is still 305.7 MB. Free memory was 252.5 MB in the beginning and 231.6 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:56:28,660 INFO L168 Benchmark]: TraceAbstraction took 57361.93 ms. Allocated memory was 305.7 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 231.6 MB in the beginning and 1.1 GB in the end (delta: -827.5 MB). Peak memory consumption was 605.9 MB. Max. memory is 5.3 GB. [2018-01-24 19:56:28,661 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.17 ms. Allocated memory is still 305.7 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.34 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 254.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.15 ms. Allocated memory is still 305.7 MB. Free memory was 254.5 MB in the beginning and 252.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 277.06 ms. Allocated memory is still 305.7 MB. Free memory was 252.5 MB in the beginning and 231.6 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57361.93 ms. Allocated memory was 305.7 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 231.6 MB in the beginning and 1.1 GB in the end (delta: -827.5 MB). Peak memory consumption was 605.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 350 LocStat_NO_SUPPORTING_DISEQUALITIES : 47 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 17.853829 RENAME_VARIABLES(MILLISECONDS) : 0.860852 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 17.801463 PROJECTAWAY(MILLISECONDS) : 1036.421669 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.035200 DISJOIN(MILLISECONDS) : 1.303157 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.883856 ADD_EQUALITY(MILLISECONDS) : 0.020209 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009884 #CONJOIN_DISJUNCTIVE : 82 #RENAME_VARIABLES : 144 #UNFREEZE : 0 #CONJOIN : 143 #PROJECTAWAY : 106 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 25 #RENAME_VARIABLES_DISJUNCTIVE : 137 #ADD_EQUALITY : 71 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (94states) and interpolant automaton (currently 14 states, 17 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (94states) and interpolant automaton (currently 14 states, 17 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (94states) and interpolant automaton (currently 14 states, 17 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (94states) and interpolant automaton (currently 14 states, 17 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (94states) and interpolant automaton (currently 14 states, 17 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (94states) and interpolant automaton (currently 14 states, 17 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (94states) and interpolant automaton (currently 14 states, 17 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (94states) and interpolant automaton (currently 14 states, 17 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (94states) and interpolant automaton (currently 14 states, 17 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was constructing difference of abstraction (94states) and interpolant automaton (currently 14 states, 17 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (94states) and interpolant automaton (currently 14 states, 17 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was constructing difference of abstraction (94states) and interpolant automaton (currently 14 states, 17 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (94states) and interpolant automaton (currently 14 states, 17 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 13 error locations. TIMEOUT Result, 57.3s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 714 SDtfs, 1044 SDslu, 2012 SDs, 0 SdLazy, 1297 SolverSat, 127 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 49.8s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 65 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 444 ConstructedInterpolants, 13 QuantifiedInterpolants, 66063 SizeOfPredicates, 28 NumberOfNonLiveVariables, 318 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 10/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_19-56-28-669.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_19-56-28-669.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_19-56-28-669.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_19-56-28-669.csv Completed graceful shutdown