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_preciseopt.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-25 02:44:08,457 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:44:08,459 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:44:08,474 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:44:08,475 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:44:08,476 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:44:08,477 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:44:08,479 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:44:08,481 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:44:08,482 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:44:08,483 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:44:08,483 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:44:08,484 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:44:08,486 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:44:08,487 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:44:08,489 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:44:08,491 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:44:08,493 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:44:08,494 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:44:08,496 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:44:08,499 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:44:08,499 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:44:08,499 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:44:08,501 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:44:08,502 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:44:08,503 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:44:08,503 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:44:08,504 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:44:08,504 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:44:08,504 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:44:08,505 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:44:08,505 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_preciseopt.epf [2018-01-25 02:44:08,518 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:44:08,518 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:44:08,519 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:44:08,519 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:44:08,519 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:44:08,520 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:44:08,520 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:44:08,520 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:44:08,520 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:44:08,521 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:44:08,521 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:44:08,521 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:44:08,521 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:44:08,522 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:44:08,522 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:44:08,522 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:44:08,522 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:44:08,522 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:44:08,523 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:44:08,523 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:44:08,523 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:44:08,523 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:44:08,523 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:44:08,524 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:44:08,524 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:44:08,524 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:44:08,524 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:44:08,524 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:44:08,525 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:44:08,525 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:44:08,525 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:44:08,525 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:44:08,525 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:44:08,526 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:44:08,526 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:44:08,527 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:44:08,529 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:44:08,583 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:44:08,597 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:44:08,601 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:44:08,612 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:44:08,613 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:44:08,614 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-25 02:44:08,817 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:44:08,823 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:44:08,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:44:08,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:44:08,830 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:44:08,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:44:08" (1/1) ... [2018-01-25 02:44:08,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bfe6cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:08, skipping insertion in model container [2018-01-25 02:44:08,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:44:08" (1/1) ... [2018-01-25 02:44:08,847 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:44:08,886 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:44:09,014 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:44:09,038 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:44:09,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:09 WrapperNode [2018-01-25 02:44:09,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:44:09,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:44:09,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:44:09,048 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:44:09,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:09" (1/1) ... [2018-01-25 02:44:09,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:09" (1/1) ... [2018-01-25 02:44:09,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:09" (1/1) ... [2018-01-25 02:44:09,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:09" (1/1) ... [2018-01-25 02:44:09,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:09" (1/1) ... [2018-01-25 02:44:09,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:09" (1/1) ... [2018-01-25 02:44:09,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:09" (1/1) ... [2018-01-25 02:44:09,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:44:09,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:44:09,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:44:09,089 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:44:09,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:09" (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-25 02:44:09,160 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:44:09,160 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:44:09,160 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2018-01-25 02:44:09,160 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:44:09,160 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:44:09,161 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:44:09,161 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:44:09,161 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:44:09,161 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:44:09,161 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:44:09,161 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlcpy [2018-01-25 02:44:09,162 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:44:09,162 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:44:09,162 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:44:09,458 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:44:09,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:44:09 BoogieIcfgContainer [2018-01-25 02:44:09,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:44:09,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:44:09,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:44:09,463 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:44:09,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:44:08" (1/3) ... [2018-01-25 02:44:09,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a31e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:44:09, skipping insertion in model container [2018-01-25 02:44:09,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:09" (2/3) ... [2018-01-25 02:44:09,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a31e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:44:09, skipping insertion in model container [2018-01-25 02:44:09,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:44:09" (3/3) ... [2018-01-25 02:44:09,467 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:44:09,474 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:44:09,480 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-25 02:44:09,529 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:44:09,529 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:44:09,530 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:44:09,530 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:44:09,530 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:44:09,530 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:44:09,530 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:44:09,531 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:44:09,532 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:44:09,554 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-25 02:44:09,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:44:09,561 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:09,562 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:44:09,563 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:44:09,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619982, now seen corresponding path program 1 times [2018-01-25 02:44:09,571 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:09,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:09,632 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:09,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:09,632 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:09,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:09,814 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-25 02:44:09,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:09,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:44:09,816 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:09,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:44:09,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:44:09,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:44:09,917 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-01-25 02:44:10,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:10,037 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-01-25 02:44:10,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:44:10,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 02:44:10,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:10,049 INFO L225 Difference]: With dead ends: 79 [2018-01-25 02:44:10,049 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 02:44:10,053 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-25 02:44:10,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 02:44:10,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 02:44:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 02:44:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-01-25 02:44:10,084 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 13 [2018-01-25 02:44:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:10,084 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-01-25 02:44:10,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:44:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-01-25 02:44:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:44:10,085 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:10,085 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:44:10,085 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:44:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619983, now seen corresponding path program 1 times [2018-01-25 02:44:10,085 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:10,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:10,086 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:10,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:10,087 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:10,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:10,267 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-25 02:44:10,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:10,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:44:10,267 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:10,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:44:10,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:44:10,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:44:10,269 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2018-01-25 02:44:10,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:10,493 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-01-25 02:44:10,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:44:10,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-25 02:44:10,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:10,495 INFO L225 Difference]: With dead ends: 51 [2018-01-25 02:44:10,495 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 02:44:10,496 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:44:10,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 02:44:10,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-25 02:44:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 02:44:10,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-01-25 02:44:10,505 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 13 [2018-01-25 02:44:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:10,506 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-01-25 02:44:10,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:44:10,506 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-01-25 02:44:10,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:44:10,506 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:10,507 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:44:10,507 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:44:10,507 INFO L82 PathProgramCache]: Analyzing trace with hash 390579246, now seen corresponding path program 1 times [2018-01-25 02:44:10,507 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:10,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:10,509 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:10,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:10,509 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:10,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:10,578 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-25 02:44:10,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:10,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:44:10,578 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:10,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:44:10,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:44:10,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:44:10,579 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-01-25 02:44:10,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:10,699 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-01-25 02:44:10,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:44:10,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 02:44:10,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:10,701 INFO L225 Difference]: With dead ends: 50 [2018-01-25 02:44:10,701 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 02:44:10,702 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-25 02:44:10,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 02:44:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 02:44:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 02:44:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-01-25 02:44:10,707 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 14 [2018-01-25 02:44:10,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:10,708 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-01-25 02:44:10,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:44:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-01-25 02:44:10,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:44:10,708 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:10,708 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:44:10,708 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:44:10,709 INFO L82 PathProgramCache]: Analyzing trace with hash 390579247, now seen corresponding path program 1 times [2018-01-25 02:44:10,709 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:10,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:10,710 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:10,710 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:10,710 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:10,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:44:10,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:10,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:44:10,801 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:10,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:44:10,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:44:10,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:44:10,802 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 5 states. [2018-01-25 02:44:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:10,834 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-01-25 02:44:10,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:44:10,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 02:44:10,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:10,836 INFO L225 Difference]: With dead ends: 49 [2018-01-25 02:44:10,836 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 02:44:10,836 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-25 02:44:10,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 02:44:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 02:44:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 02:44:10,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-01-25 02:44:10,843 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 14 [2018-01-25 02:44:10,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:10,844 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-01-25 02:44:10,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:44:10,844 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-01-25 02:44:10,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 02:44:10,845 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:10,845 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-25 02:44:10,845 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:44:10,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349366, now seen corresponding path program 1 times [2018-01-25 02:44:10,845 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:10,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:10,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:10,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:10,847 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:10,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:10,905 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-25 02:44:10,906 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:10,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:44:10,906 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:10,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:44:10,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:44:10,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:44:10,907 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 5 states. [2018-01-25 02:44:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:11,002 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-01-25 02:44:11,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:44:11,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 02:44:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:11,004 INFO L225 Difference]: With dead ends: 48 [2018-01-25 02:44:11,004 INFO L226 Difference]: Without dead ends: 47 [2018-01-25 02:44:11,004 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-25 02:44:11,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-25 02:44:11,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-25 02:44:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 02:44:11,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-01-25 02:44:11,011 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2018-01-25 02:44:11,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:11,011 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-01-25 02:44:11,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:44:11,011 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-01-25 02:44:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 02:44:11,012 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:11,012 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-25 02:44:11,012 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:44:11,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349365, now seen corresponding path program 1 times [2018-01-25 02:44:11,013 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:11,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:11,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:11,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:11,015 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:11,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:11,152 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-25 02:44:11,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:11,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:44:11,153 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:11,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:44:11,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:44:11,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:44:11,154 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 8 states. [2018-01-25 02:44:11,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:11,271 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-01-25 02:44:11,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:44:11,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-25 02:44:11,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:11,274 INFO L225 Difference]: With dead ends: 63 [2018-01-25 02:44:11,274 INFO L226 Difference]: Without dead ends: 62 [2018-01-25 02:44:11,275 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-25 02:44:11,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-25 02:44:11,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-01-25 02:44:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 02:44:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-01-25 02:44:11,282 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 20 [2018-01-25 02:44:11,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:11,283 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-01-25 02:44:11,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:44:11,283 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-01-25 02:44:11,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 02:44:11,284 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:11,284 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-25 02:44:11,284 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:44:11,284 INFO L82 PathProgramCache]: Analyzing trace with hash -698055293, now seen corresponding path program 1 times [2018-01-25 02:44:11,284 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:11,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:11,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:11,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:11,286 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:11,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:11,346 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-25 02:44:11,347 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:11,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:44:11,347 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:11,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:44:11,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:44:11,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:44:11,348 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-01-25 02:44:11,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:11,443 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-01-25 02:44:11,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:44:11,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-25 02:44:11,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:11,446 INFO L225 Difference]: With dead ends: 53 [2018-01-25 02:44:11,446 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 02:44:11,446 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-25 02:44:11,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 02:44:11,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-25 02:44:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 02:44:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-01-25 02:44:11,452 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 21 [2018-01-25 02:44:11,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:11,452 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-01-25 02:44:11,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:44:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-01-25 02:44:11,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 02:44:11,453 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:11,453 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-25 02:44:11,453 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:44:11,453 INFO L82 PathProgramCache]: Analyzing trace with hash -698055292, now seen corresponding path program 1 times [2018-01-25 02:44:11,453 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:11,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:11,454 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:11,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:11,454 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:11,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:11,598 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-25 02:44:11,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:11,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:44:11,628 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:11,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:44:11,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:44:11,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:44:11,629 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-01-25 02:44:11,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:11,802 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-01-25 02:44:11,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:44:11,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-25 02:44:11,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:11,803 INFO L225 Difference]: With dead ends: 63 [2018-01-25 02:44:11,803 INFO L226 Difference]: Without dead ends: 62 [2018-01-25 02:44:11,804 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:44:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-25 02:44:11,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-01-25 02:44:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 02:44:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-01-25 02:44:11,812 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 21 [2018-01-25 02:44:11,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:11,812 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-01-25 02:44:11,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:44:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-01-25 02:44:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 02:44:11,813 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:11,813 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-25 02:44:11,813 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:44:11,814 INFO L82 PathProgramCache]: Analyzing trace with hash -164877615, now seen corresponding path program 1 times [2018-01-25 02:44:11,814 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:11,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:11,815 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:11,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:11,815 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:11,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:11,916 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-25 02:44:11,916 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:11,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:44:11,917 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:11,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:44:11,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:44:11,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:44:11,918 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-01-25 02:44:11,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:11,996 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-01-25 02:44:11,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:44:11,997 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 02:44:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:11,997 INFO L225 Difference]: With dead ends: 53 [2018-01-25 02:44:11,997 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 02:44:11,998 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-25 02:44:11,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 02:44:12,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-25 02:44:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 02:44:12,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-01-25 02:44:12,003 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-01-25 02:44:12,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:12,003 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-01-25 02:44:12,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:44:12,003 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-01-25 02:44:12,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 02:44:12,004 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:12,004 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-25 02:44:12,004 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:44:12,004 INFO L82 PathProgramCache]: Analyzing trace with hash -164877614, now seen corresponding path program 1 times [2018-01-25 02:44:12,005 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:12,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:12,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:12,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:12,006 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:12,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:12,144 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-25 02:44:12,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:12,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:44:12,144 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:12,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:44:12,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:44:12,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:44:12,146 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-01-25 02:44:12,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:12,385 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-01-25 02:44:12,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 02:44:12,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-25 02:44:12,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:12,386 INFO L225 Difference]: With dead ends: 64 [2018-01-25 02:44:12,386 INFO L226 Difference]: Without dead ends: 63 [2018-01-25 02:44:12,387 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-25 02:44:12,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-25 02:44:12,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-01-25 02:44:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 02:44:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-01-25 02:44:12,392 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 22 [2018-01-25 02:44:12,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:12,393 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-01-25 02:44:12,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:44:12,393 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-01-25 02:44:12,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 02:44:12,394 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:12,394 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-25 02:44:12,394 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:44:12,394 INFO L82 PathProgramCache]: Analyzing trace with hash 634059438, now seen corresponding path program 1 times [2018-01-25 02:44:12,394 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:12,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:12,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:12,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:12,396 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:12,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:12,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:44:12,443 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:12,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:44:12,443 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:12,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:44:12,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:44:12,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:44:12,444 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-01-25 02:44:12,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:12,496 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-01-25 02:44:12,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:44:12,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 02:44:12,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:12,496 INFO L225 Difference]: With dead ends: 53 [2018-01-25 02:44:12,497 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 02:44:12,497 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-25 02:44:12,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 02:44:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-25 02:44:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 02:44:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-01-25 02:44:12,501 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-01-25 02:44:12,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:12,502 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-01-25 02:44:12,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:44:12,502 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-01-25 02:44:12,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 02:44:12,502 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:12,503 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-25 02:44:12,503 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:44:12,503 INFO L82 PathProgramCache]: Analyzing trace with hash 634059439, now seen corresponding path program 1 times [2018-01-25 02:44:12,503 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:12,504 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:12,504 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:12,504 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:12,504 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:12,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:12,725 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-25 02:44:12,725 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:12,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:44:12,725 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:12,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:44:12,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:44:12,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:44:12,726 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-01-25 02:44:12,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:12,902 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-01-25 02:44:12,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:44:12,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-25 02:44:12,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:12,904 INFO L225 Difference]: With dead ends: 60 [2018-01-25 02:44:12,904 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 02:44:12,904 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:44:12,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 02:44:12,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-01-25 02:44:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 02:44:12,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-01-25 02:44:12,909 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2018-01-25 02:44:12,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:12,909 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-01-25 02:44:12,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:44:12,910 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2018-01-25 02:44:12,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 02:44:12,911 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:12,911 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-25 02:44:12,911 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:44:12,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1535458206, now seen corresponding path program 1 times [2018-01-25 02:44:12,911 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:12,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:12,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:12,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:12,913 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:12,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:13,325 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-25 02:44:13,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:13,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 02:44:13,326 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:13,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 02:44:13,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 02:44:13,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-25 02:44:13,327 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 11 states. [2018-01-25 02:44:13,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:13,506 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2018-01-25 02:44:13,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 02:44:13,507 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-01-25 02:44:13,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:13,508 INFO L225 Difference]: With dead ends: 85 [2018-01-25 02:44:13,508 INFO L226 Difference]: Without dead ends: 84 [2018-01-25 02:44:13,508 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-25 02:44:13,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-25 02:44:13,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2018-01-25 02:44:13,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-25 02:44:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2018-01-25 02:44:13,513 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 26 [2018-01-25 02:44:13,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:13,514 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2018-01-25 02:44:13,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 02:44:13,514 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2018-01-25 02:44:13,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 02:44:13,515 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:13,515 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-25 02:44:13,515 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:44:13,515 INFO L82 PathProgramCache]: Analyzing trace with hash -44170330, now seen corresponding path program 1 times [2018-01-25 02:44:13,515 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:13,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:13,516 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:13,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:13,516 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:13,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:13,634 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-25 02:44:13,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:13,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:44:13,634 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:13,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:44:13,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:44:13,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:44:13,635 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand 6 states. [2018-01-25 02:44:13,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:13,733 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-01-25 02:44:13,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:44:13,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 02:44:13,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:13,734 INFO L225 Difference]: With dead ends: 80 [2018-01-25 02:44:13,734 INFO L226 Difference]: Without dead ends: 62 [2018-01-25 02:44:13,734 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:44:13,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-25 02:44:13,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-25 02:44:13,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-25 02:44:13,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2018-01-25 02:44:13,739 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 26 [2018-01-25 02:44:13,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:13,739 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-01-25 02:44:13,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:44:13,739 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2018-01-25 02:44:13,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 02:44:13,740 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:13,741 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-25 02:44:13,741 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:44:13,741 INFO L82 PathProgramCache]: Analyzing trace with hash 355579118, now seen corresponding path program 1 times [2018-01-25 02:44:13,741 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:13,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:13,742 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:13,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:13,742 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:13,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:14,152 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 14 DAG size of output 9 [2018-01-25 02:44:14,182 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-25 02:44:14,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:14,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 02:44:14,183 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:14,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 02:44:14,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 02:44:14,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:44:14,183 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 10 states. [2018-01-25 02:44:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:14,363 INFO L93 Difference]: Finished difference Result 138 states and 160 transitions. [2018-01-25 02:44:14,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 02:44:14,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-01-25 02:44:14,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:14,364 INFO L225 Difference]: With dead ends: 138 [2018-01-25 02:44:14,365 INFO L226 Difference]: Without dead ends: 105 [2018-01-25 02:44:14,365 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-01-25 02:44:14,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-25 02:44:14,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2018-01-25 02:44:14,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-25 02:44:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-01-25 02:44:14,375 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 27 [2018-01-25 02:44:14,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:14,375 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-01-25 02:44:14,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 02:44:14,375 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-01-25 02:44:14,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 02:44:14,377 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:14,377 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-25 02:44:14,377 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:44:14,377 INFO L82 PathProgramCache]: Analyzing trace with hash 505638783, now seen corresponding path program 1 times [2018-01-25 02:44:14,378 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:14,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:14,387 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:14,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:14,387 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:14,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:14,562 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-25 02:44:14,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:14,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:44:14,563 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:14,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:44:14,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:44:14,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:44:14,564 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 6 states. [2018-01-25 02:44:14,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:14,653 INFO L93 Difference]: Finished difference Result 128 states and 150 transitions. [2018-01-25 02:44:14,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:44:14,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-25 02:44:14,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:14,654 INFO L225 Difference]: With dead ends: 128 [2018-01-25 02:44:14,654 INFO L226 Difference]: Without dead ends: 94 [2018-01-25 02:44:14,655 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:44:14,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-25 02:44:14,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-01-25 02:44:14,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-25 02:44:14,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2018-01-25 02:44:14,664 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 27 [2018-01-25 02:44:14,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:14,664 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2018-01-25 02:44:14,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:44:14,665 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2018-01-25 02:44:14,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 02:44:14,666 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:14,666 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-25 02:44:14,666 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:44:14,667 INFO L82 PathProgramCache]: Analyzing trace with hash 778280944, now seen corresponding path program 1 times [2018-01-25 02:44:14,667 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:14,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:14,669 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:14,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:14,669 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:14,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:14,992 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-25 02:44:14,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:44:14,993 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:44:14,994 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-25 02:44:14,995 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-25 02:44:15,055 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:44:15,055 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 02:45:05,116 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 02:45:05,117 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 02:45:05,118 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:45:05,118 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:45:05,118 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-25 02:45:05,125 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:05,125 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:45:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:05,208 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:45:05,231 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 02:45:05,231 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 02:45:05,247 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 02:45:05,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:45:05 BoogieIcfgContainer [2018-01-25 02:45:05,248 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:45:05,248 INFO L168 Benchmark]: Toolchain (without parser) took 56431.28 ms. Allocated memory was 303.0 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 259.9 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 605.6 MB. Max. memory is 5.3 GB. [2018-01-25 02:45:05,252 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 303.0 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:45:05,252 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.45 ms. Allocated memory is still 303.0 MB. Free memory was 259.9 MB in the beginning and 249.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:45:05,253 INFO L168 Benchmark]: Boogie Preprocessor took 39.75 ms. Allocated memory is still 303.0 MB. Free memory was 249.9 MB in the beginning and 247.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:45:05,253 INFO L168 Benchmark]: RCFGBuilder took 371.17 ms. Allocated memory is still 303.0 MB. Free memory was 247.9 MB in the beginning and 227.0 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:45:05,255 INFO L168 Benchmark]: TraceAbstraction took 55787.27 ms. Allocated memory was 303.0 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 227.0 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 572.7 MB. Max. memory is 5.3 GB. [2018-01-25 02:45:05,257 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.20 ms. Allocated memory is still 303.0 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 223.45 ms. Allocated memory is still 303.0 MB. Free memory was 259.9 MB in the beginning and 249.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.75 ms. Allocated memory is still 303.0 MB. Free memory was 249.9 MB in the beginning and 247.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 371.17 ms. Allocated memory is still 303.0 MB. Free memory was 247.9 MB in the beginning and 227.0 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 55787.27 ms. Allocated memory was 303.0 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 227.0 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 572.7 MB. Max. memory is 5.3 GB. * 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 analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 13 error locations. TIMEOUT Result, 55.7s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 676 SDtfs, 933 SDslu, 1660 SDs, 0 SdLazy, 1020 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.1s 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, 50.1s 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.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 314 ConstructedInterpolants, 0 QuantifiedInterpolants, 29767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 10/10 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_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-45-05-266.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_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-45-05-266.csv Completed graceful shutdown