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_cstrncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:45:43,588 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:45:43,589 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:45:43,602 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:45:43,602 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:45:43,603 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:45:43,605 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:45:43,606 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:45:43,609 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:45:43,609 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:45:43,610 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:45:43,610 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:45:43,611 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:45:43,612 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:45:43,612 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:45:43,615 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:45:43,617 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:45:43,619 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:45:43,621 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:45:43,622 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:45:43,625 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:45:43,625 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:45:43,625 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:45:43,626 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:45:43,627 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:45:43,629 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:45:43,629 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:45:43,630 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:45:43,630 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:45:43,630 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:45:43,631 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:45:43,631 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:45:43,644 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:45:43,644 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:45:43,645 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:45:43,645 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:45:43,646 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:45:43,646 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:45:43,646 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:45:43,646 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:45:43,646 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:45:43,647 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:45:43,647 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:45:43,647 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:45:43,648 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:45:43,648 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:45:43,648 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:45:43,648 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:45:43,648 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:45:43,648 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:45:43,649 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:45:43,649 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:45:43,649 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:45:43,649 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:45:43,649 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:45:43,650 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:45:43,650 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:45:43,650 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:45:43,650 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:45:43,650 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:45:43,651 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:45:43,651 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:45:43,651 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:45:43,651 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:45:43,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:45:43,651 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:45:43,652 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:45:43,653 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:45:43,653 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:45:43,687 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:45:43,698 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:45:43,703 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:45:43,704 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:45:43,705 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:45:43,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:45:43,876 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:45:43,884 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:45:43,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:45:43,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:45:43,893 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:45:43,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:45:43" (1/1) ... [2018-01-25 02:45:43,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d63a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:43, skipping insertion in model container [2018-01-25 02:45:43,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:45:43" (1/1) ... [2018-01-25 02:45:43,918 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:45:43,966 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:45:44,144 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:45:44,171 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:45:44,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:44 WrapperNode [2018-01-25 02:45:44,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:45:44,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:45:44,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:45:44,189 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:45:44,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:44" (1/1) ... [2018-01-25 02:45:44,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:44" (1/1) ... [2018-01-25 02:45:44,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:44" (1/1) ... [2018-01-25 02:45:44,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:44" (1/1) ... [2018-01-25 02:45:44,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:44" (1/1) ... [2018-01-25 02:45:44,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:44" (1/1) ... [2018-01-25 02:45:44,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:44" (1/1) ... [2018-01-25 02:45:44,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:45:44,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:45:44,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:45:44,242 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:45:44,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:44" (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:45:44,300 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:45:44,300 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:45:44,300 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-01-25 02:45:44,301 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:45:44,301 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:45:44,301 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:45:44,301 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:45:44,301 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:45:44,301 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:45:44,302 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:45:44,302 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-01-25 02:45:44,316 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:45:44,316 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:45:44,316 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:45:44,573 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:45:44,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:45:44 BoogieIcfgContainer [2018-01-25 02:45:44,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:45:44,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:45:44,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:45:44,578 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:45:44,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:45:43" (1/3) ... [2018-01-25 02:45:44,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25434ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:45:44, skipping insertion in model container [2018-01-25 02:45:44,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:45:44" (2/3) ... [2018-01-25 02:45:44,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25434ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:45:44, skipping insertion in model container [2018-01-25 02:45:44,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:45:44" (3/3) ... [2018-01-25 02:45:44,583 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:45:44,591 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:45:44,599 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-25 02:45:44,647 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:45:44,647 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:45:44,648 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:45:44,648 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:45:44,648 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:45:44,648 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:45:44,648 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:45:44,648 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:45:44,649 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:45:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-01-25 02:45:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:45:44,680 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:44,681 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:44,681 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:45:44,687 INFO L82 PathProgramCache]: Analyzing trace with hash -428881312, now seen corresponding path program 1 times [2018-01-25 02:45:44,690 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:44,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:44,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:44,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:44,743 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:44,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:44,885 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:45:44,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:44,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:45:44,888 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:44,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:45:44,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:45:44,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:45:44,909 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 4 states. [2018-01-25 02:45:45,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:45,121 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-01-25 02:45:45,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:45:45,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 02:45:45,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:45,135 INFO L225 Difference]: With dead ends: 61 [2018-01-25 02:45:45,136 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 02:45:45,140 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:45:45,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 02:45:45,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-25 02:45:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-25 02:45:45,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-01-25 02:45:45,222 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 13 [2018-01-25 02:45:45,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:45,223 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-01-25 02:45:45,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:45:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-01-25 02:45:45,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:45:45,224 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:45,224 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:45,224 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:45:45,225 INFO L82 PathProgramCache]: Analyzing trace with hash -428881311, now seen corresponding path program 1 times [2018-01-25 02:45:45,225 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:45,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:45,227 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:45,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:45,227 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:45,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:45,345 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:45:45,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:45,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:45:45,346 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:45,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:45:45,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:45:45,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:45:45,349 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-01-25 02:45:45,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:45,396 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-01-25 02:45:45,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:45:45,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-25 02:45:45,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:45,398 INFO L225 Difference]: With dead ends: 44 [2018-01-25 02:45:45,398 INFO L226 Difference]: Without dead ends: 43 [2018-01-25 02:45:45,400 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:45:45,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-25 02:45:45,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-25 02:45:45,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 02:45:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-25 02:45:45,405 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 13 [2018-01-25 02:45:45,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:45,405 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-25 02:45:45,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:45:45,406 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-25 02:45:45,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 02:45:45,406 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:45,406 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:45,406 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:45:45,407 INFO L82 PathProgramCache]: Analyzing trace with hash 551620863, now seen corresponding path program 1 times [2018-01-25 02:45:45,407 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:45,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:45,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:45,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:45,408 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:45,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:45,505 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:45:45,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:45,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:45:45,506 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:45,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:45:45,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:45:45,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:45:45,507 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-01-25 02:45:45,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:45,868 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-01-25 02:45:45,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 02:45:45,868 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-25 02:45:45,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:45,871 INFO L225 Difference]: With dead ends: 46 [2018-01-25 02:45:45,871 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 02:45:45,871 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:45:45,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 02:45:45,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-01-25 02:45:45,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 02:45:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-01-25 02:45:45,880 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 18 [2018-01-25 02:45:45,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:45,880 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-01-25 02:45:45,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:45:45,880 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-01-25 02:45:45,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 02:45:45,881 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:45,881 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:45,881 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:45:45,882 INFO L82 PathProgramCache]: Analyzing trace with hash 551620864, now seen corresponding path program 1 times [2018-01-25 02:45:45,882 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:45,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:45,883 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:45,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:45,883 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:45,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:46,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:46,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:46,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 02:45:46,044 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:46,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 02:45:46,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 02:45:46,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:45:46,046 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 10 states. [2018-01-25 02:45:46,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:46,231 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-01-25 02:45:46,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 02:45:46,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-01-25 02:45:46,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:46,234 INFO L225 Difference]: With dead ends: 49 [2018-01-25 02:45:46,234 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 02:45:46,234 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-01-25 02:45:46,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 02:45:46,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-01-25 02:45:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-25 02:45:46,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-01-25 02:45:46,243 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 18 [2018-01-25 02:45:46,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:46,244 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-01-25 02:45:46,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 02:45:46,244 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-01-25 02:45:46,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 02:45:46,245 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:46,245 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:46,246 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:45:46,246 INFO L82 PathProgramCache]: Analyzing trace with hash -79622450, now seen corresponding path program 1 times [2018-01-25 02:45:46,246 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:46,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:46,247 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:46,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:46,247 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:46,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:46,376 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:45:46,376 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:46,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 02:45:46,376 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:46,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 02:45:46,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 02:45:46,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:45:46,378 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 10 states. [2018-01-25 02:45:46,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:46,533 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-01-25 02:45:46,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:45:46,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-01-25 02:45:46,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:46,535 INFO L225 Difference]: With dead ends: 47 [2018-01-25 02:45:46,535 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 02:45:46,535 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-25 02:45:46,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 02:45:46,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-01-25 02:45:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 02:45:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-25 02:45:46,540 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 19 [2018-01-25 02:45:46,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:46,541 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-25 02:45:46,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 02:45:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-25 02:45:46,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 02:45:46,542 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:46,542 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:46,542 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:45:46,542 INFO L82 PathProgramCache]: Analyzing trace with hash -79622449, now seen corresponding path program 1 times [2018-01-25 02:45:46,542 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:46,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:46,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:46,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:46,543 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:46,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:46,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:46,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 02:45:46,690 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:46,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 02:45:46,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 02:45:46,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:45:46,692 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 10 states. [2018-01-25 02:45:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:47,001 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-01-25 02:45:47,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 02:45:47,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-01-25 02:45:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:47,003 INFO L225 Difference]: With dead ends: 46 [2018-01-25 02:45:47,003 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 02:45:47,003 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-25 02:45:47,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 02:45:47,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-01-25 02:45:47,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-25 02:45:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-01-25 02:45:47,010 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 19 [2018-01-25 02:45:47,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:47,011 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-01-25 02:45:47,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 02:45:47,011 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-01-25 02:45:47,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:45:47,012 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:47,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, 1, 1, 1, 1] [2018-01-25 02:45:47,012 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:45:47,013 INFO L82 PathProgramCache]: Analyzing trace with hash 670305991, now seen corresponding path program 1 times [2018-01-25 02:45:47,013 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:47,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:47,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:47,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:47,014 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:47,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:47,134 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:45:47,134 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:47,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:45:47,135 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:47,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:45:47,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:45:47,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:45:47,135 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-01-25 02:45:47,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:47,202 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-01-25 02:45:47,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:45:47,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-25 02:45:47,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:47,204 INFO L225 Difference]: With dead ends: 47 [2018-01-25 02:45:47,204 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 02:45:47,204 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:45:47,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 02:45:47,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-01-25 02:45:47,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 02:45:47,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-25 02:45:47,211 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 24 [2018-01-25 02:45:47,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:47,212 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-25 02:45:47,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:45:47,212 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-25 02:45:47,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:45:47,213 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:47,213 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] [2018-01-25 02:45:47,213 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:45:47,214 INFO L82 PathProgramCache]: Analyzing trace with hash 670305992, now seen corresponding path program 1 times [2018-01-25 02:45:47,214 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:47,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:47,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:47,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:47,215 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:47,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:47,431 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:45:47,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:47,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:45:47,431 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:47,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:45:47,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:45:47,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:45:47,432 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-01-25 02:45:47,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:47,543 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-01-25 02:45:47,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 02:45:47,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-25 02:45:47,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:47,545 INFO L225 Difference]: With dead ends: 112 [2018-01-25 02:45:47,546 INFO L226 Difference]: Without dead ends: 96 [2018-01-25 02:45:47,546 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:45:47,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-25 02:45:47,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 72. [2018-01-25 02:45:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-25 02:45:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-01-25 02:45:47,560 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 24 [2018-01-25 02:45:47,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:47,560 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-01-25 02:45:47,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:45:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-01-25 02:45:47,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:45:47,562 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:47,562 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:47,562 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:45:47,562 INFO L82 PathProgramCache]: Analyzing trace with hash 689332191, now seen corresponding path program 1 times [2018-01-25 02:45:47,562 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:47,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:47,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:47,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:47,564 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:47,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:47,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:47,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:45:47,711 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:47,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:45:47,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:45:47,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:45:47,712 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 7 states. [2018-01-25 02:45:47,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:47,780 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2018-01-25 02:45:47,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 02:45:47,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-25 02:45:47,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:47,781 INFO L225 Difference]: With dead ends: 94 [2018-01-25 02:45:47,782 INFO L226 Difference]: Without dead ends: 70 [2018-01-25 02:45:47,782 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:45:47,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-25 02:45:47,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2018-01-25 02:45:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-25 02:45:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-01-25 02:45:47,792 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 24 [2018-01-25 02:45:47,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:47,793 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-01-25 02:45:47,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:45:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-01-25 02:45:47,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:45:47,794 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:47,794 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] [2018-01-25 02:45:47,794 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:45:47,795 INFO L82 PathProgramCache]: Analyzing trace with hash -918041910, now seen corresponding path program 1 times [2018-01-25 02:45:47,795 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:47,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:47,796 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:47,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:47,796 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:47,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:48,264 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:45:48,264 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:48,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 02:45:48,264 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:48,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 02:45:48,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 02:45:48,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-25 02:45:48,265 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 13 states. [2018-01-25 02:45:48,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:48,623 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-01-25 02:45:48,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 02:45:48,623 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-01-25 02:45:48,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:48,624 INFO L225 Difference]: With dead ends: 74 [2018-01-25 02:45:48,624 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 02:45:48,625 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-01-25 02:45:48,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 02:45:48,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-01-25 02:45:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-25 02:45:48,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2018-01-25 02:45:48,635 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 24 [2018-01-25 02:45:48,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:48,635 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-01-25 02:45:48,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 02:45:48,635 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-01-25 02:45:48,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:45:48,637 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:48,637 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:48,637 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:45:48,638 INFO L82 PathProgramCache]: Analyzing trace with hash -899015711, now seen corresponding path program 1 times [2018-01-25 02:45:48,638 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:48,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:48,639 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:48,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:48,639 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:48,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:49,083 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 17 DAG size of output 9 [2018-01-25 02:45:49,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:49,163 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:45:49,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 02:45:49,163 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:45:49,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 02:45:49,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 02:45:49,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-01-25 02:45:49,164 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 11 states. [2018-01-25 02:45:49,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:49,412 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2018-01-25 02:45:49,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 02:45:49,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-01-25 02:45:49,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:49,416 INFO L225 Difference]: With dead ends: 148 [2018-01-25 02:45:49,416 INFO L226 Difference]: Without dead ends: 119 [2018-01-25 02:45:49,418 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-01-25 02:45:49,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-25 02:45:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2018-01-25 02:45:49,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-25 02:45:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2018-01-25 02:45:49,443 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 24 [2018-01-25 02:45:49,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:49,446 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2018-01-25 02:45:49,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 02:45:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2018-01-25 02:45:49,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:45:49,448 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:49,448 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:49,448 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:45:49,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1401806879, now seen corresponding path program 1 times [2018-01-25 02:45:49,449 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:49,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:49,454 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:49,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:49,454 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:49,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:49,784 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:45:49,784 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:45:49,785 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-25 02:45:49,787 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [8], [10], [11], [36], [38], [43], [52], [53], [57], [62], [68], [70], [71], [72], [73], [74], [85], [86], [87], [89] [2018-01-25 02:45:49,834 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:45:49,834 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:46:15,869 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:46:15,871 INFO L268 AbstractInterpreter]: Visited 23 different actions 41 times. Merged at 7 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-01-25 02:46:15,889 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:46:15,889 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:46:15,889 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:46:15,900 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:15,900 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:46:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:15,961 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:46:16,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-25 02:46:16,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-25 02:46:16,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:46:16,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:16,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 02:46:16,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 02:46:16,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-25 02:46:16,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 02:46:16,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:46:16,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:46:16,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:46:16,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-25 02:46:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:46:16,529 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:46:16,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-25 02:46:16,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:46:16,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-01-25 02:46:16,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-01-25 02:46:16,951 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:46:16,952 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:16,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:16,957 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:39, output treesize:7 [2018-01-25 02:46:16,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:46:16,989 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:46:16,990 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:46:16,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:16,994 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:46:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:17,097 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:46:17,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:46:17,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:46:17,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:17,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 02:46:17,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 02:46:17,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 02:46:17,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:46:17,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:17,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:17,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 02:46:17,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-25 02:46:17,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 02:46:17,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:46:17,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:46:17,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:46:17,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-25 02:46:17,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:46:17,457 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:46:17,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 02:46:17,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 02:46:17,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:46:17,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:17,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:17,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-25 02:46:17,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:46:17,693 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:46:17,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10, 12, 12] total 42 [2018-01-25 02:46:17,693 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:46:17,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-25 02:46:17,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-25 02:46:17,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1647, Unknown=0, NotChecked=0, Total=1806 [2018-01-25 02:46:17,695 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 19 states. [2018-01-25 02:46:21,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:46:21,203 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2018-01-25 02:46:21,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 02:46:21,203 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-01-25 02:46:21,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:46:21,205 INFO L225 Difference]: With dead ends: 138 [2018-01-25 02:46:21,205 INFO L226 Difference]: Without dead ends: 137 [2018-01-25 02:46:21,206 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=269, Invalid=2487, Unknown=0, NotChecked=0, Total=2756 [2018-01-25 02:46:21,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-25 02:46:21,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2018-01-25 02:46:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-25 02:46:21,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2018-01-25 02:46:21,227 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 24 [2018-01-25 02:46:21,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:46:21,227 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2018-01-25 02:46:21,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-25 02:46:21,228 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2018-01-25 02:46:21,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 02:46:21,234 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:21,234 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] [2018-01-25 02:46:21,234 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:46:21,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1797191857, now seen corresponding path program 1 times [2018-01-25 02:46:21,235 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:21,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:21,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:21,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:21,236 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:21,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:21,437 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:46:21,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:46:21,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:46:21,448 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:46:21,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:46:21,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:46:21,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:46:21,449 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 6 states. [2018-01-25 02:46:21,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:46:21,719 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2018-01-25 02:46:21,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:46:21,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-25 02:46:21,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:46:21,720 INFO L225 Difference]: With dead ends: 115 [2018-01-25 02:46:21,720 INFO L226 Difference]: Without dead ends: 64 [2018-01-25 02:46:21,721 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:46:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-25 02:46:21,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-01-25 02:46:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 02:46:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-25 02:46:21,727 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 25 [2018-01-25 02:46:21,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:46:21,727 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-25 02:46:21,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:46:21,727 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-25 02:46:21,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 02:46:21,728 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:21,728 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] [2018-01-25 02:46:21,729 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:46:21,729 INFO L82 PathProgramCache]: Analyzing trace with hash 506340240, now seen corresponding path program 1 times [2018-01-25 02:46:21,729 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:21,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:21,730 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:21,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:21,730 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:21,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:22,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:46:22,193 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:46:22,193 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:46:22,193 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-25 02:46:22,193 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [8], [11], [13], [36], [38], [43], [52], [53], [57], [62], [68], [70], [71], [72], [73], [74], [85], [86], [87], [89] [2018-01-25 02:46:22,194 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:46:22,195 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 02:46:34,986 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 02:46:34,986 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 02:46:34,987 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:46:34,987 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:46:34,987 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:46:34,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:34,995 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:46:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:35,017 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:46:35,018 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 02:46:35,019 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 02:46:35,023 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 02:46:35,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:46:35 BoogieIcfgContainer [2018-01-25 02:46:35,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:46:35,024 INFO L168 Benchmark]: Toolchain (without parser) took 51147.34 ms. Allocated memory was 303.0 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 260.9 MB in the beginning and 1.1 GB in the end (delta: -845.6 MB). Peak memory consumption was 572.1 MB. Max. memory is 5.3 GB. [2018-01-25 02:46:35,025 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 303.0 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:46:35,025 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.32 ms. Allocated memory is still 303.0 MB. Free memory was 260.0 MB in the beginning and 249.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-25 02:46:35,025 INFO L168 Benchmark]: Boogie Preprocessor took 52.26 ms. Allocated memory is still 303.0 MB. Free memory was 249.8 MB in the beginning and 247.8 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:46:35,025 INFO L168 Benchmark]: RCFGBuilder took 333.01 ms. Allocated memory is still 303.0 MB. Free memory was 247.8 MB in the beginning and 229.5 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 5.3 GB. [2018-01-25 02:46:35,026 INFO L168 Benchmark]: TraceAbstraction took 50447.76 ms. Allocated memory was 303.0 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 229.5 MB in the beginning and 1.1 GB in the end (delta: -877.0 MB). Peak memory consumption was 540.7 MB. Max. memory is 5.3 GB. [2018-01-25 02:46:35,027 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 303.0 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 303.32 ms. Allocated memory is still 303.0 MB. Free memory was 260.0 MB in the beginning and 249.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 52.26 ms. Allocated memory is still 303.0 MB. Free memory was 249.8 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 333.01 ms. Allocated memory is still 303.0 MB. Free memory was 247.8 MB in the beginning and 229.5 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 50447.76 ms. Allocated memory was 303.0 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 229.5 MB in the beginning and 1.1 GB in the end (delta: -877.0 MB). Peak memory consumption was 540.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 284 LocStat_NO_SUPPORTING_DISEQUALITIES : 43 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 65 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 13.704336 RENAME_VARIABLES(MILLISECONDS) : 0.631279 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 13.633443 PROJECTAWAY(MILLISECONDS) : 576.532122 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.034229 DISJOIN(MILLISECONDS) : 1.248494 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.656699 ADD_EQUALITY(MILLISECONDS) : 0.019295 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012712 #CONJOIN_DISJUNCTIVE : 71 #RENAME_VARIABLES : 121 #UNFREEZE : 0 #CONJOIN : 125 #PROJECTAWAY : 93 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 115 #ADD_EQUALITY : 67 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 549). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 549). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 547). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 547). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 547). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 567). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 567). Cancelled while BasicCegarLoop was analyzing trace of length 26 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, 48 locations, 9 error locations. TIMEOUT Result, 50.3s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 5.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 494 SDtfs, 661 SDslu, 1978 SDs, 0 SdLazy, 1240 SolverSat, 112 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 38.8s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 89 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 348 ConstructedInterpolants, 9 QuantifiedInterpolants, 50951 SizeOfPredicates, 28 NumberOfNonLiveVariables, 290 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 17 InterpolantComputations, 12 PerfectInterpolantSequences, 4/14 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_cstrncpy-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-46-35-036.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-46-35-036.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-46-35-036.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncpy-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-46-35-036.csv Completed graceful shutdown