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_smtcomp.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 05:29:50,593 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:29:50,595 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:29:50,606 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:29:50,607 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:29:50,608 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:29:50,608 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:29:50,609 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:29:50,611 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:29:50,612 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:29:50,613 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:29:50,613 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:29:50,614 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:29:50,615 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:29:50,616 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:29:50,619 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:29:50,621 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:29:50,623 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:29:50,624 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:29:50,625 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:29:50,627 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:29:50,628 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:29:50,628 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:29:50,629 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:29:50,630 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:29:50,631 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:29:50,631 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:29:50,632 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:29:50,632 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:29:50,632 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:29:50,633 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:29:50,633 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_smtcomp.epf [2018-01-25 05:29:50,643 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:29:50,643 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:29:50,644 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:29:50,644 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:29:50,644 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:29:50,644 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:29:50,645 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:29:50,645 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:29:50,645 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:29:50,646 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:29:50,646 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:29:50,646 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:29:50,646 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:29:50,646 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:29:50,647 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:29:50,647 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:29:50,647 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:29:50,647 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:29:50,647 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:29:50,648 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:29:50,648 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:29:50,648 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:29:50,648 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:29:50,648 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:29:50,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:29:50,649 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:29:50,649 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:29:50,649 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:29:50,649 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:29:50,650 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:29:50,650 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:29:50,650 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:29:50,650 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:29:50,650 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:29:50,651 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:29:50,651 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:29:50,686 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:29:50,698 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:29:50,702 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:29:50,704 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:29:50,704 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:29:50,705 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 05:29:50,868 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:29:50,874 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:29:50,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:29:50,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:29:50,879 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:29:50,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:29:50" (1/1) ... [2018-01-25 05:29:50,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e47ad9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:29:50, skipping insertion in model container [2018-01-25 05:29:50,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:29:50" (1/1) ... [2018-01-25 05:29:50,899 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:29:50,939 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:29:51,056 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:29:51,071 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:29:51,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:29:51 WrapperNode [2018-01-25 05:29:51,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:29:51,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:29:51,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:29:51,080 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:29:51,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:29:51" (1/1) ... [2018-01-25 05:29:51,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:29:51" (1/1) ... [2018-01-25 05:29:51,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:29:51" (1/1) ... [2018-01-25 05:29:51,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:29:51" (1/1) ... [2018-01-25 05:29:51,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:29:51" (1/1) ... [2018-01-25 05:29:51,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:29:51" (1/1) ... [2018-01-25 05:29:51,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:29:51" (1/1) ... [2018-01-25 05:29:51,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:29:51,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:29:51,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:29:51,122 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:29:51,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:29:51" (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 05:29:51,187 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:29:51,187 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:29:51,187 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-01-25 05:29:51,187 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:29:51,188 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:29:51,188 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:29:51,188 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:29:51,188 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:29:51,188 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:29:51,188 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:29:51,189 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-01-25 05:29:51,189 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:29:51,189 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:29:51,189 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:29:51,427 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:29:51,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:29:51 BoogieIcfgContainer [2018-01-25 05:29:51,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:29:51,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:29:51,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:29:51,430 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:29:51,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:29:50" (1/3) ... [2018-01-25 05:29:51,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65797067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:29:51, skipping insertion in model container [2018-01-25 05:29:51,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:29:51" (2/3) ... [2018-01-25 05:29:51,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65797067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:29:51, skipping insertion in model container [2018-01-25 05:29:51,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:29:51" (3/3) ... [2018-01-25 05:29:51,433 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:29:51,439 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:29:51,445 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-25 05:29:51,482 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:29:51,482 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:29:51,482 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:29:51,482 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:29:51,483 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:29:51,483 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:29:51,483 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:29:51,483 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:29:51,484 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:29:51,505 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-01-25 05:29:51,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:29:51,512 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:29:51,513 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:29:51,513 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:29:51,518 INFO L82 PathProgramCache]: Analyzing trace with hash -428881312, now seen corresponding path program 1 times [2018-01-25 05:29:51,521 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:29:51,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:51,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:51,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:51,563 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:29:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:51,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:29:51,702 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 05:29:51,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:29:51,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:29:51,704 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:29:51,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:29:51,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:29:51,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:29:51,719 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 4 states. [2018-01-25 05:29:51,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:29:51,884 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-01-25 05:29:51,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:29:51,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 05:29:51,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:29:51,897 INFO L225 Difference]: With dead ends: 61 [2018-01-25 05:29:51,898 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 05:29:51,901 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 05:29:51,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 05:29:51,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-25 05:29:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-25 05:29:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-01-25 05:29:51,942 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 13 [2018-01-25 05:29:51,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:29:51,942 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-01-25 05:29:51,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:29:51,942 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-01-25 05:29:51,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:29:51,943 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:29:51,943 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:29:51,943 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:29:51,944 INFO L82 PathProgramCache]: Analyzing trace with hash -428881311, now seen corresponding path program 1 times [2018-01-25 05:29:51,944 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:29:51,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:51,945 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:51,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:51,945 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:29:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:51,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:29:52,113 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 05:29:52,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:29:52,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:29:52,114 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:29:52,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:29:52,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:29:52,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:29:52,117 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-01-25 05:29:52,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:29:52,171 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-01-25 05:29:52,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:29:52,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-25 05:29:52,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:29:52,172 INFO L225 Difference]: With dead ends: 44 [2018-01-25 05:29:52,172 INFO L226 Difference]: Without dead ends: 43 [2018-01-25 05:29:52,173 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:29:52,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-25 05:29:52,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-25 05:29:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 05:29:52,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-25 05:29:52,180 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 13 [2018-01-25 05:29:52,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:29:52,180 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-25 05:29:52,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:29:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-25 05:29:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:29:52,181 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:29:52,182 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 05:29:52,182 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:29:52,182 INFO L82 PathProgramCache]: Analyzing trace with hash 551620863, now seen corresponding path program 1 times [2018-01-25 05:29:52,182 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:29:52,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:52,183 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:52,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:52,184 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:29:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:52,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:29:52,275 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 05:29:52,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:29:52,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:29:52,276 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:29:52,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:29:52,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:29:52,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:29:52,277 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-01-25 05:29:52,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:29:52,464 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-01-25 05:29:52,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:29:52,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-25 05:29:52,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:29:52,468 INFO L225 Difference]: With dead ends: 46 [2018-01-25 05:29:52,468 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 05:29:52,468 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:29:52,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 05:29:52,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-01-25 05:29:52,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 05:29:52,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-01-25 05:29:52,473 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 18 [2018-01-25 05:29:52,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:29:52,474 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-01-25 05:29:52,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:29:52,474 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-01-25 05:29:52,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:29:52,474 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:29:52,474 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 05:29:52,474 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:29:52,475 INFO L82 PathProgramCache]: Analyzing trace with hash 551620864, now seen corresponding path program 1 times [2018-01-25 05:29:52,475 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:29:52,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:52,476 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:52,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:52,476 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:29:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:52,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:29:52,604 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 05:29:52,604 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:29:52,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 05:29:52,605 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:29:52,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:29:52,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:29:52,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:29:52,606 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 10 states. [2018-01-25 05:29:52,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:29:52,762 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-01-25 05:29:52,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:29:52,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-01-25 05:29:52,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:29:52,764 INFO L225 Difference]: With dead ends: 49 [2018-01-25 05:29:52,764 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 05:29:52,765 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 05:29:52,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 05:29:52,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-01-25 05:29:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-25 05:29:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-01-25 05:29:52,772 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 18 [2018-01-25 05:29:52,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:29:52,773 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-01-25 05:29:52,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:29:52,773 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-01-25 05:29:52,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:29:52,774 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:29:52,774 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 05:29:52,774 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:29:52,774 INFO L82 PathProgramCache]: Analyzing trace with hash -79622450, now seen corresponding path program 1 times [2018-01-25 05:29:52,774 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:29:52,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:52,776 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:52,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:52,776 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:29:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:52,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:29:52,933 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 05:29:52,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:29:52,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 05:29:52,934 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:29:52,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:29:52,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:29:52,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:29:52,935 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 10 states. [2018-01-25 05:29:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:29:53,083 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-01-25 05:29:53,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:29:53,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-01-25 05:29:53,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:29:53,084 INFO L225 Difference]: With dead ends: 47 [2018-01-25 05:29:53,084 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 05:29:53,084 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-25 05:29:53,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 05:29:53,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-01-25 05:29:53,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 05:29:53,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-25 05:29:53,089 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 19 [2018-01-25 05:29:53,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:29:53,089 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-25 05:29:53,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:29:53,090 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-25 05:29:53,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:29:53,090 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:29:53,090 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 05:29:53,090 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:29:53,091 INFO L82 PathProgramCache]: Analyzing trace with hash -79622449, now seen corresponding path program 1 times [2018-01-25 05:29:53,091 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:29:53,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:53,092 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:53,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:53,092 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:29:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:53,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:29:53,227 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 05:29:53,227 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:29:53,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 05:29:53,228 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:29:53,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:29:53,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:29:53,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:29:53,229 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 10 states. [2018-01-25 05:29:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:29:53,390 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-01-25 05:29:53,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:29:53,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-01-25 05:29:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:29:53,392 INFO L225 Difference]: With dead ends: 46 [2018-01-25 05:29:53,392 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 05:29:53,392 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 05:29:53,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 05:29:53,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-01-25 05:29:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-25 05:29:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-01-25 05:29:53,399 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 19 [2018-01-25 05:29:53,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:29:53,399 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-01-25 05:29:53,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:29:53,399 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-01-25 05:29:53,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:29:53,400 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:29:53,400 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 05:29:53,401 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:29:53,401 INFO L82 PathProgramCache]: Analyzing trace with hash 670305991, now seen corresponding path program 1 times [2018-01-25 05:29:53,402 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:29:53,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:53,403 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:53,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:53,403 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:29:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:53,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:29:53,449 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 05:29:53,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:29:53,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:29:53,450 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:29:53,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:29:53,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:29:53,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:29:53,451 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-01-25 05:29:53,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:29:53,533 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-01-25 05:29:53,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:29:53,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-25 05:29:53,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:29:53,544 INFO L225 Difference]: With dead ends: 47 [2018-01-25 05:29:53,544 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 05:29:53,544 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 05:29:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 05:29:53,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-01-25 05:29:53,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 05:29:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-25 05:29:53,549 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 24 [2018-01-25 05:29:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:29:53,550 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-25 05:29:53,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:29:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-25 05:29:53,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:29:53,550 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:29:53,550 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 05:29:53,551 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:29:53,551 INFO L82 PathProgramCache]: Analyzing trace with hash 670305992, now seen corresponding path program 1 times [2018-01-25 05:29:53,551 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:29:53,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:53,551 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:53,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:53,552 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:29:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:53,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:29:53,723 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 05:29:53,723 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:29:53,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:29:53,723 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:29:53,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:29:53,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:29:53,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:29:53,724 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-01-25 05:29:53,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:29:53,904 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-01-25 05:29:53,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:29:53,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-25 05:29:53,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:29:53,906 INFO L225 Difference]: With dead ends: 112 [2018-01-25 05:29:53,906 INFO L226 Difference]: Without dead ends: 96 [2018-01-25 05:29:53,907 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:29:53,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-25 05:29:53,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 72. [2018-01-25 05:29:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-25 05:29:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-01-25 05:29:53,918 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 24 [2018-01-25 05:29:53,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:29:53,918 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-01-25 05:29:53,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:29:53,918 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-01-25 05:29:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:29:53,919 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:29:53,920 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 05:29:53,920 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:29:53,920 INFO L82 PathProgramCache]: Analyzing trace with hash 689332191, now seen corresponding path program 1 times [2018-01-25 05:29:53,920 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:29:53,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:53,921 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:53,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:53,921 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:29:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:53,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:29:54,062 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 05:29:54,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:29:54,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:29:54,063 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:29:54,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:29:54,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:29:54,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:29:54,064 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 7 states. [2018-01-25 05:29:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:29:54,123 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2018-01-25 05:29:54,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:29:54,123 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-25 05:29:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:29:54,124 INFO L225 Difference]: With dead ends: 94 [2018-01-25 05:29:54,124 INFO L226 Difference]: Without dead ends: 70 [2018-01-25 05:29:54,125 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 05:29:54,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-25 05:29:54,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2018-01-25 05:29:54,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-25 05:29:54,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-01-25 05:29:54,133 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 24 [2018-01-25 05:29:54,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:29:54,133 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-01-25 05:29:54,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:29:54,134 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-01-25 05:29:54,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:29:54,135 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:29:54,135 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 05:29:54,135 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:29:54,136 INFO L82 PathProgramCache]: Analyzing trace with hash -918041910, now seen corresponding path program 1 times [2018-01-25 05:29:54,136 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:29:54,137 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:54,137 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:54,137 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:54,137 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:29:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:54,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:29:54,418 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 05:29:54,418 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:29:54,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 05:29:54,418 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:29:54,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 05:29:54,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 05:29:54,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:29:54,419 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 13 states. [2018-01-25 05:29:54,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:29:54,630 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-01-25 05:29:54,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 05:29:54,630 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-01-25 05:29:54,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:29:54,631 INFO L225 Difference]: With dead ends: 74 [2018-01-25 05:29:54,631 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 05:29:54,632 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-01-25 05:29:54,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 05:29:54,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-01-25 05:29:54,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-25 05:29:54,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2018-01-25 05:29:54,639 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 24 [2018-01-25 05:29:54,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:29:54,640 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-01-25 05:29:54,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 05:29:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-01-25 05:29:54,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:29:54,641 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:29:54,642 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 05:29:54,642 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:29:54,642 INFO L82 PathProgramCache]: Analyzing trace with hash -899015711, now seen corresponding path program 1 times [2018-01-25 05:29:54,642 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:29:54,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:54,643 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:54,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:54,643 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:29:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:54,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:29:54,804 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 05:29:54,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:29:54,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 05:29:54,805 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:29:54,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 05:29:54,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 05:29:54,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:29:54,806 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 11 states. [2018-01-25 05:29:55,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:29:55,040 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2018-01-25 05:29:55,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 05:29:55,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-01-25 05:29:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:29:55,044 INFO L225 Difference]: With dead ends: 148 [2018-01-25 05:29:55,044 INFO L226 Difference]: Without dead ends: 119 [2018-01-25 05:29:55,045 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-01-25 05:29:55,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-25 05:29:55,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2018-01-25 05:29:55,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-25 05:29:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2018-01-25 05:29:55,062 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 24 [2018-01-25 05:29:55,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:29:55,062 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2018-01-25 05:29:55,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 05:29:55,062 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2018-01-25 05:29:55,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:29:55,063 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:29:55,064 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 05:29:55,064 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:29:55,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1401806879, now seen corresponding path program 1 times [2018-01-25 05:29:55,064 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:29:55,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:55,065 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:55,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:55,065 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:29:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:55,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:29:55,303 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 05:29:55,303 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:29:55,303 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:29:55,304 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-25 05:29:55,305 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 05:29:55,350 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:29:55,350 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:29:58,461 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:29:58,462 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 05:29:58,497 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:29:58,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:29:58,497 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 05:29:58,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:58,506 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:29:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:58,548 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:29:58,606 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 05:29:58,610 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 05:29:58,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:58,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:58,619 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 05:29:58,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 05:29:58,818 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 05:29:58,861 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 05:29:58,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:29:58,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:29:58,932 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 05:29:58,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-25 05:29:59,145 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 15 DAG size of output 15 [2018-01-25 05:29:59,151 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 05:29:59,151 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:29:59,749 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 05:29:59,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:59,757 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 05:29:59,771 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 05:29:59,772 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:59,775 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:59,790 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 05:29:59,790 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:39, output treesize:7 [2018-01-25 05:29:59,800 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 05:29:59,822 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:29:59,822 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 05:29:59,836 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:59,836 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:29:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:59,919 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:29:59,925 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 05:29:59,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:59,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:59,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 05:30:00,021 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 05:30:00,023 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 05:30:00,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:00,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:00,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:00,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 05:30:00,231 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 05:30:00,237 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 05:30:00,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:30:00,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:30:00,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:30:00,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-25 05:30:00,387 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 05:30:00,387 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:30:00,609 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 05:30:00,617 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 05:30:00,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:00,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:00,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:00,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-25 05:30:00,698 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 05:30:00,700 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:30:00,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10, 12, 12] total 42 [2018-01-25 05:30:00,700 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:30:00,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-25 05:30:00,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-25 05:30:00,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1647, Unknown=0, NotChecked=0, Total=1806 [2018-01-25 05:30:00,702 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 19 states. [2018-01-25 05:30:03,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:30:03,690 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2018-01-25 05:30:03,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 05:30:03,690 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-01-25 05:30:03,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:30:03,691 INFO L225 Difference]: With dead ends: 138 [2018-01-25 05:30:03,691 INFO L226 Difference]: Without dead ends: 137 [2018-01-25 05:30:03,692 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=269, Invalid=2487, Unknown=0, NotChecked=0, Total=2756 [2018-01-25 05:30:03,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-25 05:30:03,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2018-01-25 05:30:03,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-25 05:30:03,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2018-01-25 05:30:03,706 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 24 [2018-01-25 05:30:03,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:30:03,707 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2018-01-25 05:30:03,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-25 05:30:03,707 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2018-01-25 05:30:03,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 05:30:03,708 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:30:03,709 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 05:30:03,709 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:30:03,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1797191857, now seen corresponding path program 1 times [2018-01-25 05:30:03,709 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:30:03,710 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:30:03,710 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:30:03,710 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:30:03,711 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:30:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:30:03,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:30:03,843 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 05:30:03,843 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:30:03,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:30:03,844 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:30:03,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:30:03,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:30:03,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:30:03,845 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 6 states. [2018-01-25 05:30:04,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:30:04,009 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2018-01-25 05:30:04,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:30:04,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-25 05:30:04,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:30:04,010 INFO L225 Difference]: With dead ends: 115 [2018-01-25 05:30:04,010 INFO L226 Difference]: Without dead ends: 64 [2018-01-25 05:30:04,010 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:30:04,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-25 05:30:04,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-01-25 05:30:04,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 05:30:04,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-25 05:30:04,018 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 25 [2018-01-25 05:30:04,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:30:04,019 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-25 05:30:04,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:30:04,019 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-25 05:30:04,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 05:30:04,020 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:30:04,020 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 05:30:04,020 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:30:04,020 INFO L82 PathProgramCache]: Analyzing trace with hash 506340240, now seen corresponding path program 1 times [2018-01-25 05:30:04,020 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:30:04,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:30:04,021 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:30:04,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:30:04,021 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:30:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:30:04,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:30:04,278 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 05:30:04,278 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:30:04,278 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:30:04,278 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-25 05:30:04,278 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 05:30:04,279 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:30:04,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:30:08,137 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:30:08,138 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 05:30:08,154 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:30:08,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:30:08,154 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 05:30:08,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:30:08,160 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:30:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:30:08,184 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:30:08,188 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 05:30:08,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:08,193 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 05:30:08,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:08,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:08,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:30:08,227 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:08,228 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:08,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:30:08,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:08,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-25 05:30:08,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:08,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:08,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-25 05:30:08,544 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 05:30:08,544 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:30:09,047 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 05:30:09,068 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:30:09,068 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 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 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:30:09,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:30:09,073 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:30:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:30:09,117 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:30:09,123 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 05:30:09,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:09,130 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 05:30:09,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:09,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:09,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-01-25 05:30:09,158 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:09,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:09,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:30:09,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:09,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-25 05:30:09,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:09,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:09,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:16 [2018-01-25 05:30:09,376 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 05:30:09,376 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:30:09,710 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-01-25 05:30:09,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:09,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-25 05:30:09,752 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 05:30:09,752 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:09,757 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-01-25 05:30:09,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:09,761 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:09,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:09,765 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:28, output treesize:11 [2018-01-25 05:30:09,816 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 05:30:09,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:30:09,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12, 14, 13] total 50 [2018-01-25 05:30:09,818 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:30:09,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-25 05:30:09,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-25 05:30:09,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2332, Unknown=0, NotChecked=0, Total=2550 [2018-01-25 05:30:09,819 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 26 states. [2018-01-25 05:30:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:30:10,456 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-01-25 05:30:10,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:30:10,457 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-01-25 05:30:10,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:30:10,457 INFO L225 Difference]: With dead ends: 58 [2018-01-25 05:30:10,458 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 05:30:10,459 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=365, Invalid=3295, Unknown=0, NotChecked=0, Total=3660 [2018-01-25 05:30:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 05:30:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-01-25 05:30:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 05:30:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-25 05:30:10,466 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 25 [2018-01-25 05:30:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:30:10,466 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-25 05:30:10,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-25 05:30:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-25 05:30:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:30:10,467 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:30:10,467 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:30:10,467 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:30:10,467 INFO L82 PathProgramCache]: Analyzing trace with hash -183633860, now seen corresponding path program 1 times [2018-01-25 05:30:10,468 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:30:10,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:30:10,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:30:10,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:30:10,469 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:30:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:30:10,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:30:10,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:30:10,836 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:30:10,836 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:30:10,837 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-25 05:30:10,837 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [8], [11], [16], [20], [22], [27], [28], [30], [31], [52], [53], [57], [60], [68], [70], [71], [72], [73], [74], [85], [86], [87], [89] [2018-01-25 05:30:10,838 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:30:10,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:30:12,962 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:30:12,962 INFO L268 AbstractInterpreter]: Visited 26 different actions 37 times. Merged at 6 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-01-25 05:30:12,964 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:30:12,964 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:30:12,964 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:30:12,969 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:30:12,969 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:30:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:30:12,989 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:30:12,992 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 05:30:12,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:12,997 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 05:30:12,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:13,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:13,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:30:13,010 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:13,011 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:13,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:30:13,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:13,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-25 05:30:13,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:13,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:13,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-25 05:30:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:30:13,199 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:30:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:30:13,645 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:30:13,645 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 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 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:30:13,649 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:30:13,649 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:30:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:30:13,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:30:13,710 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 05:30:13,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:13,715 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 05:30:13,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:13,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:13,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:30:13,728 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:13,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-25 05:30:13,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:13,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:13,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:13,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:30:13,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:13,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:13,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-25 05:30:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:30:14,073 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:30:14,711 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:14,711 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:46, output treesize:1 [2018-01-25 05:30:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:30:14,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:30:14,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14, 15, 14] total 53 [2018-01-25 05:30:14,760 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:30:14,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-25 05:30:14,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-25 05:30:14,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=2614, Unknown=0, NotChecked=0, Total=2862 [2018-01-25 05:30:14,761 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 23 states. [2018-01-25 05:30:15,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:30:15,761 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-01-25 05:30:15,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-25 05:30:15,761 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2018-01-25 05:30:15,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:30:15,761 INFO L225 Difference]: With dead ends: 68 [2018-01-25 05:30:15,761 INFO L226 Difference]: Without dead ends: 38 [2018-01-25 05:30:15,763 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=539, Invalid=4717, Unknown=0, NotChecked=0, Total=5256 [2018-01-25 05:30:15,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-25 05:30:15,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-25 05:30:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-25 05:30:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-01-25 05:30:15,766 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 29 [2018-01-25 05:30:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:30:15,766 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-01-25 05:30:15,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-25 05:30:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-01-25 05:30:15,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:30:15,767 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:30:15,767 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:30:15,767 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:30:15,767 INFO L82 PathProgramCache]: Analyzing trace with hash 996854439, now seen corresponding path program 1 times [2018-01-25 05:30:15,767 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:30:15,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:30:15,768 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:30:15,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:30:15,768 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:30:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:30:15,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:30:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:30:16,047 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:30:16,048 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:30:16,048 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-25 05:30:16,048 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [8], [11], [16], [20], [22], [27], [30], [36], [38], [43], [52], [53], [57], [62], [68], [70], [71], [72], [73], [74], [85], [86], [87], [89] [2018-01-25 05:30:16,049 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:30:16,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:30:19,208 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:30:19,208 INFO L268 AbstractInterpreter]: Visited 27 different actions 56 times. Merged at 11 different actions 28 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 33 variables. [2018-01-25 05:30:19,214 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:30:19,214 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:30:19,214 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:30:19,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:30:19,220 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:30:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:30:19,242 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:30:19,255 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 05:30:19,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:19,263 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 05:30:19,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:19,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:19,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:30:19,282 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:19,282 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:19,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:30:19,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:19,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-25 05:30:19,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:19,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:19,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-25 05:30:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:30:19,466 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:30:19,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:30:19,905 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:30:19,905 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 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 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:30:19,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:30:19,908 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:30:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:30:19,967 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:30:19,974 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 05:30:19,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:19,979 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 05:30:19,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:19,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:19,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:30:19,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:19,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-25 05:30:19,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:19,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:19,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:20,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:30:20,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:20,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:20,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-25 05:30:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:30:20,428 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:30:21,093 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:21,093 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:46, output treesize:1 [2018-01-25 05:30:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:30:21,102 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:30:21,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14, 16, 15] total 54 [2018-01-25 05:30:21,102 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:30:21,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-25 05:30:21,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-25 05:30:21,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=2712, Unknown=0, NotChecked=0, Total=2970 [2018-01-25 05:30:21,104 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 23 states. [2018-01-25 05:30:22,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:30:22,270 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-01-25 05:30:22,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-25 05:30:22,270 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-01-25 05:30:22,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:30:22,271 INFO L225 Difference]: With dead ends: 44 [2018-01-25 05:30:22,271 INFO L226 Difference]: Without dead ends: 35 [2018-01-25 05:30:22,272 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 70 SyntacticMatches, 9 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=523, Invalid=4733, Unknown=0, NotChecked=0, Total=5256 [2018-01-25 05:30:22,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-25 05:30:22,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-01-25 05:30:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-25 05:30:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-01-25 05:30:22,275 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-01-25 05:30:22,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:30:22,276 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-01-25 05:30:22,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-25 05:30:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-01-25 05:30:22,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:30:22,276 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:30:22,276 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:30:22,277 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:30:22,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1015880638, now seen corresponding path program 2 times [2018-01-25 05:30:22,277 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:30:22,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:30:22,278 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:30:22,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:30:22,278 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:30:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:30:22,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:30:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:30:22,728 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:30:22,728 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:30:22,728 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:30:22,728 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:30:22,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:30:22,729 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:30:22,733 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:30:22,734 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:30:22,745 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:30:22,751 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:30:22,753 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:30:22,757 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:30:22,759 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 05:30:22,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:22,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:22,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-25 05:30:22,765 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 05:30:22,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:22,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:22,772 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:22,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:30:22,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:22,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:22,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-25 05:30:22,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 05:30:22,812 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 05:30:22,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:22,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:22,818 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 05:30:22,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-25 05:30:23,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-25 05:30:23,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:30:23,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:23,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:23,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:30:23,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-25 05:30:23,087 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 22 treesize of output 18 [2018-01-25 05:30:23,092 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 18 treesize of output 15 [2018-01-25 05:30:23,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:30:23,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:30:23,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:30:23,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-25 05:30:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:30:23,149 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:30:23,689 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-01-25 05:30:23,704 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 12 treesize of output 11 [2018-01-25 05:30:23,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:23,721 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 22 treesize of output 20 [2018-01-25 05:30:23,723 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-25 05:30:23,723 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:23,726 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:23,728 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 21 treesize of output 17 [2018-01-25 05:30:23,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-01-25 05:30:23,730 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:23,731 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:23,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-25 05:30:23,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:30:23,761 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:63, output treesize:110 [2018-01-25 05:30:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:30:23,959 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:30:23,959 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 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 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:30:23,963 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:30:23,963 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:30:23,984 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:30:24,018 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:30:24,092 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:30:24,099 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:30:24,110 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 05:30:24,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:24,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:24,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-25 05:30:24,125 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 05:30:24,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:24,133 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:24,134 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:24,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:30:24,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:24,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:24,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-25 05:30:24,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 05:30:24,207 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 12 treesize of output 11 [2018-01-25 05:30:24,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:24,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:24,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:24,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-25 05:30:24,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-25 05:30:24,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:30:24,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:24,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:24,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:24,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-01-25 05:30:24,596 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 21 treesize of output 17 [2018-01-25 05:30:24,610 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 17 treesize of output 14 [2018-01-25 05:30:24,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:30:24,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:30:24,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:30:24,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-25 05:30:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:30:24,655 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:30:33,527 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-01-25 05:30:33,540 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 12 treesize of output 11 [2018-01-25 05:30:33,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:33,553 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 22 treesize of output 20 [2018-01-25 05:30:33,556 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-25 05:30:33,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:33,559 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:33,561 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 21 treesize of output 17 [2018-01-25 05:30:33,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-01-25 05:30:33,563 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:33,564 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:33,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-25 05:30:33,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-25 05:30:33,593 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-01-25 05:30:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:30:33,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:30:33,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16, 16, 16] total 57 [2018-01-25 05:30:33,826 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:30:33,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-25 05:30:33,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-25 05:30:33,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3097, Unknown=3, NotChecked=0, Total=3306 [2018-01-25 05:30:33,827 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 28 states. [2018-01-25 05:30:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:30:34,886 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-01-25 05:30:34,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 05:30:34,886 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 30 [2018-01-25 05:30:34,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:30:34,887 INFO L225 Difference]: With dead ends: 34 [2018-01-25 05:30:34,887 INFO L226 Difference]: Without dead ends: 33 [2018-01-25 05:30:34,888 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 71 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 8 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=473, Invalid=4780, Unknown=3, NotChecked=0, Total=5256 [2018-01-25 05:30:34,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-25 05:30:34,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-01-25 05:30:34,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-25 05:30:34,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-01-25 05:30:34,891 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-01-25 05:30:34,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:30:34,891 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-01-25 05:30:34,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-25 05:30:34,891 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-01-25 05:30:34,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 05:30:34,892 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:30:34,892 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:30:34,892 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:30:34,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1427528657, now seen corresponding path program 2 times [2018-01-25 05:30:34,892 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:30:34,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:30:34,893 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:30:34,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:30:34,893 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:30:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:30:34,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:30:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:30:35,177 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:30:35,177 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:30:35,177 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:30:35,177 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:30:35,177 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:30:35,178 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:30:35,183 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:30:35,183 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:30:35,194 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:30:35,200 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:30:35,206 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:30:35,208 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:30:35,211 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 05:30:35,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:35,215 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 05:30:35,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:35,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:35,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:30:35,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:35,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:35,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:30:35,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:35,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-25 05:30:35,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:35,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:35,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-25 05:30:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:30:35,446 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:30:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:30:35,943 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:30:35,943 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 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 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:30:35,946 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:30:35,946 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:30:35,961 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:30:36,000 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:30:36,038 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:30:36,044 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:30:36,047 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 05:30:36,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:36,052 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 05:30:36,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:36,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:36,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:30:36,061 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:36,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-25 05:30:36,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:36,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:36,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:30:36,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:30:36,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:30:36,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:30:36,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-25 05:30:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:30:36,514 INFO L314 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-01-25 05:30:36,752 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:30:36,753 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:30:36,756 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:30:36,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:30:36 BoogieIcfgContainer [2018-01-25 05:30:36,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:30:36,757 INFO L168 Benchmark]: Toolchain (without parser) took 45888.34 ms. Allocated memory was 304.6 MB in the beginning and 1.2 GB in the end (delta: 866.1 MB). Free memory was 264.7 MB in the beginning and 713.1 MB in the end (delta: -448.4 MB). Peak memory consumption was 417.7 MB. Max. memory is 5.3 GB. [2018-01-25 05:30:36,758 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 304.6 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:30:36,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.05 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 253.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-25 05:30:36,758 INFO L168 Benchmark]: Boogie Preprocessor took 42.59 ms. Allocated memory is still 304.6 MB. Free memory was 253.5 MB in the beginning and 251.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:30:36,758 INFO L168 Benchmark]: RCFGBuilder took 305.31 ms. Allocated memory is still 304.6 MB. Free memory was 251.5 MB in the beginning and 233.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 5.3 GB. [2018-01-25 05:30:36,758 INFO L168 Benchmark]: TraceAbstraction took 45328.46 ms. Allocated memory was 304.6 MB in the beginning and 1.2 GB in the end (delta: 866.1 MB). Free memory was 233.7 MB in the beginning and 713.1 MB in the end (delta: -479.4 MB). Peak memory consumption was 386.7 MB. Max. memory is 5.3 GB. [2018-01-25 05:30:36,760 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.15 ms. Allocated memory is still 304.6 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 204.05 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 253.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.59 ms. Allocated memory is still 304.6 MB. Free memory was 253.5 MB in the beginning and 251.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 305.31 ms. Allocated memory is still 304.6 MB. Free memory was 251.5 MB in the beginning and 233.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 45328.46 ms. Allocated memory was 304.6 MB in the beginning and 1.2 GB in the end (delta: 866.1 MB). Free memory was 233.7 MB in the beginning and 713.1 MB in the end (delta: -479.4 MB). Peak memory consumption was 386.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 : 277 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) : 19.487166 RENAME_VARIABLES(MILLISECONDS) : 0.965086 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 19.417424 PROJECTAWAY(MILLISECONDS) : 32.833154 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.087378 DISJOIN(MILLISECONDS) : 0.797584 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.008051 ADD_EQUALITY(MILLISECONDS) : 0.036597 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017936 #CONJOIN_DISJUNCTIVE : 71 #RENAME_VARIABLES : 121 #UNFREEZE : 0 #CONJOIN : 125 #PROJECTAWAY : 93 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 115 #ADD_EQUALITY : 67 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - 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) : 15.678911 RENAME_VARIABLES(MILLISECONDS) : 0.907972 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 7.916322 PROJECTAWAY(MILLISECONDS) : 0.116934 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.065490 DISJOIN(MILLISECONDS) : 0.827772 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.945367 ADD_EQUALITY(MILLISECONDS) : 0.021418 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013017 #CONJOIN_DISJUNCTIVE : 75 #RENAME_VARIABLES : 130 #UNFREEZE : 0 #CONJOIN : 130 #PROJECTAWAY : 98 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 19 #RENAME_VARIABLES_DISJUNCTIVE : 123 #ADD_EQUALITY : 67 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 25 LocStat_MAX_WEQGRAPH_SIZE : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 353 LocStat_NO_SUPPORTING_DISEQUALITIES : 59 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 72 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 19.976109 RENAME_VARIABLES(MILLISECONDS) : 4.828899 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 12.633103 PROJECTAWAY(MILLISECONDS) : 0.048451 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.049416 DISJOIN(MILLISECONDS) : 0.979000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 4.875738 ADD_EQUALITY(MILLISECONDS) : 0.015479 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005484 #CONJOIN_DISJUNCTIVE : 63 #RENAME_VARIABLES : 96 #UNFREEZE : 0 #CONJOIN : 120 #PROJECTAWAY : 82 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 93 #ADD_EQUALITY : 75 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 26 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 344 LocStat_NO_SUPPORTING_DISEQUALITIES : 55 LocStat_NO_DISJUNCTIONS : -52 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 72 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.296756 RENAME_VARIABLES(MILLISECONDS) : 0.417780 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.269123 PROJECTAWAY(MILLISECONDS) : 0.735594 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.031125 DISJOIN(MILLISECONDS) : 0.443030 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.433962 ADD_EQUALITY(MILLISECONDS) : 0.014287 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007033 #CONJOIN_DISJUNCTIVE : 99 #RENAME_VARIABLES : 172 #UNFREEZE : 0 #CONJOIN : 155 #PROJECTAWAY : 122 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 18 #RENAME_VARIABLES_DISJUNCTIVE : 167 #ADD_EQUALITY : 74 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * 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 32 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 53 known predicates. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 53 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 53 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 48 locations, 9 error locations. TIMEOUT Result, 45.2s OverallTime, 18 OverallIterations, 3 TraceHistogramMax, 8.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 559 SDtfs, 914 SDslu, 2893 SDs, 0 SdLazy, 2642 SolverSat, 218 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 812 GetRequests, 346 SyntacticMatches, 31 SemanticMatches, 435 ConstructedPredicates, 0 IntricatePredicates, 8 DeprecatedPredicates, 5572 ImplicationChecksByTransitivity, 23.3s 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, 12.3s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 93 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 21.0s InterpolantComputationTime, 659 NumberOfCodeBlocks, 659 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 898 ConstructedInterpolants, 56 QuantifiedInterpolants, 294411 SizeOfPredicates, 186 NumberOfNonLiveVariables, 1614 ConjunctsInSsa, 547 ConjunctsInUnsatCore, 37 InterpolantComputations, 12 PerfectInterpolantSequences, 4/119 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_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-30-36-773.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-30-36-773.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-30-36-773.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-30-36-773.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-30-36-773.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_05-30-36-773.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_05-30-36-773.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_05-30-36-773.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_05-30-36-773.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-30-36-773.csv Completed graceful shutdown