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_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:28:03,508 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:28:03,509 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:28:03,525 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:28:03,526 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:28:03,527 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:28:03,528 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:28:03,529 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:28:03,532 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:28:03,533 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:28:03,534 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:28:03,534 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:28:03,535 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:28:03,536 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:28:03,537 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:28:03,540 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:28:03,542 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:28:03,544 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:28:03,546 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:28:03,547 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:28:03,550 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:28:03,550 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:28:03,550 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:28:03,551 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:28:03,552 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:28:03,554 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:28:03,554 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:28:03,555 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:28:03,555 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:28:03,555 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:28:03,556 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:28:03,556 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:28:03,565 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:28:03,565 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:28:03,566 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:28:03,566 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:28:03,566 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:28:03,566 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:28:03,567 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:28:03,567 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:28:03,567 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:28:03,567 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:28:03,568 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:28:03,568 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:28:03,568 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:28:03,568 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:28:03,568 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:28:03,568 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:28:03,568 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:28:03,569 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:28:03,569 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:28:03,569 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:28:03,569 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:28:03,569 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:28:03,569 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:28:03,570 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:28:03,570 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:28:03,570 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:28:03,570 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:28:03,570 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:28:03,571 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:28:03,571 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:28:03,571 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:28:03,571 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:28:03,571 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:28:03,571 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:28:03,572 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:28:03,572 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:28:03,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:28:03,622 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:28:03,627 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:28:03,628 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:28:03,629 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:28:03,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:28:03,820 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:28:03,827 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:28:03,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:28:03,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:28:03,835 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:28:03,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:28:03" (1/1) ... [2018-01-25 05:28:03,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78582bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:03, skipping insertion in model container [2018-01-25 05:28:03,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:28:03" (1/1) ... [2018-01-25 05:28:03,858 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:28:03,901 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:28:04,018 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:28:04,035 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:28:04,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:04 WrapperNode [2018-01-25 05:28:04,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:28:04,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:28:04,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:28:04,045 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:28:04,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:04" (1/1) ... [2018-01-25 05:28:04,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:04" (1/1) ... [2018-01-25 05:28:04,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:04" (1/1) ... [2018-01-25 05:28:04,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:04" (1/1) ... [2018-01-25 05:28:04,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:04" (1/1) ... [2018-01-25 05:28:04,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:04" (1/1) ... [2018-01-25 05:28:04,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:04" (1/1) ... [2018-01-25 05:28:04,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:28:04,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:28:04,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:28:04,083 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:28:04,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:04" (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:28:04,131 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:28:04,131 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:28:04,131 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2018-01-25 05:28:04,131 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:28:04,131 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:28:04,131 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:28:04,131 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:28:04,132 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:28:04,132 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:28:04,132 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:28:04,132 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlcpy [2018-01-25 05:28:04,132 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:28:04,132 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:28:04,132 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:28:04,341 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:28:04,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:28:04 BoogieIcfgContainer [2018-01-25 05:28:04,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:28:04,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:28:04,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:28:04,345 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:28:04,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:28:03" (1/3) ... [2018-01-25 05:28:04,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9fcb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:28:04, skipping insertion in model container [2018-01-25 05:28:04,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:04" (2/3) ... [2018-01-25 05:28:04,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9fcb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:28:04, skipping insertion in model container [2018-01-25 05:28:04,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:28:04" (3/3) ... [2018-01-25 05:28:04,349 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:28:04,358 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:28:04,365 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-25 05:28:04,413 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:28:04,414 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:28:04,414 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:28:04,414 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:28:04,414 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:28:04,414 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:28:04,414 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:28:04,414 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:28:04,415 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:28:04,432 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-25 05:28:04,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:28:04,438 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:04,439 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:04,439 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:04,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619982, now seen corresponding path program 1 times [2018-01-25 05:28:04,445 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:04,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:04,484 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:04,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:04,484 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:04,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:04,648 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:28:04,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:04,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:28:04,651 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:04,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:28:04,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:28:04,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:28:04,738 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-01-25 05:28:04,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:04,874 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-01-25 05:28:04,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:28:04,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 05:28:04,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:04,887 INFO L225 Difference]: With dead ends: 79 [2018-01-25 05:28:04,888 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 05:28:04,892 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:28:04,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 05:28:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 05:28:04,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 05:28:04,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-01-25 05:28:04,933 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 13 [2018-01-25 05:28:04,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:04,933 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-01-25 05:28:04,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:28:04,934 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-01-25 05:28:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:28:04,934 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:04,934 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:04,935 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:04,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619983, now seen corresponding path program 1 times [2018-01-25 05:28:04,935 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:04,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:04,936 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:04,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:04,937 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:04,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:05,085 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:28:05,085 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:05,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:28:05,086 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:05,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:28:05,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:28:05,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:28:05,088 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2018-01-25 05:28:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:05,166 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-01-25 05:28:05,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:28:05,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-25 05:28:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:05,168 INFO L225 Difference]: With dead ends: 51 [2018-01-25 05:28:05,168 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 05:28:05,169 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:28:05,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 05:28:05,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-25 05:28:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 05:28:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-01-25 05:28:05,177 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 13 [2018-01-25 05:28:05,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:05,177 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-01-25 05:28:05,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:28:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-01-25 05:28:05,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:28:05,178 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:05,178 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:05,178 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:05,179 INFO L82 PathProgramCache]: Analyzing trace with hash 390579246, now seen corresponding path program 1 times [2018-01-25 05:28:05,179 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:05,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:05,180 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:05,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:05,180 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:05,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:05,226 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:28:05,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:05,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:28:05,227 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:05,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:28:05,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:28:05,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:28:05,228 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-01-25 05:28:05,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:05,282 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-01-25 05:28:05,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:28:05,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:28:05,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:05,284 INFO L225 Difference]: With dead ends: 50 [2018-01-25 05:28:05,284 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 05:28:05,284 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:28:05,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 05:28:05,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 05:28:05,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 05:28:05,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-01-25 05:28:05,291 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 14 [2018-01-25 05:28:05,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:05,291 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-01-25 05:28:05,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:28:05,292 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-01-25 05:28:05,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:28:05,292 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:05,292 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:05,292 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:05,293 INFO L82 PathProgramCache]: Analyzing trace with hash 390579247, now seen corresponding path program 1 times [2018-01-25 05:28:05,293 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:05,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:05,294 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:05,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:05,294 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:05,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:05,372 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:28:05,372 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:05,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:28:05,372 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:05,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:28:05,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:28:05,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:28:05,373 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 5 states. [2018-01-25 05:28:05,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:05,409 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-01-25 05:28:05,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:28:05,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 05:28:05,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:05,411 INFO L225 Difference]: With dead ends: 49 [2018-01-25 05:28:05,411 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 05:28:05,411 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:28:05,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 05:28:05,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 05:28:05,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 05:28:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-01-25 05:28:05,418 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 14 [2018-01-25 05:28:05,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:05,418 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-01-25 05:28:05,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:28:05,419 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-01-25 05:28:05,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:28:05,419 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:05,419 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:05,420 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:05,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349366, now seen corresponding path program 1 times [2018-01-25 05:28:05,420 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:05,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:05,421 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:05,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:05,421 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:05,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:05,474 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:28:05,474 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:05,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:28:05,475 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:05,475 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:28:05,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:28:05,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:28:05,476 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 5 states. [2018-01-25 05:28:05,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:05,542 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-01-25 05:28:05,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:28:05,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 05:28:05,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:05,543 INFO L225 Difference]: With dead ends: 48 [2018-01-25 05:28:05,543 INFO L226 Difference]: Without dead ends: 47 [2018-01-25 05:28:05,543 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:28:05,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-25 05:28:05,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-25 05:28:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 05:28:05,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-01-25 05:28:05,549 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2018-01-25 05:28:05,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:05,549 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-01-25 05:28:05,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:28:05,549 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-01-25 05:28:05,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:28:05,550 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:05,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] [2018-01-25 05:28:05,550 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:05,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349365, now seen corresponding path program 1 times [2018-01-25 05:28:05,551 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:05,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:05,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:05,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:05,552 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:05,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:05,667 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:28:05,667 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:05,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:28:05,668 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:05,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:28:05,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:28:05,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:28:05,669 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 8 states. [2018-01-25 05:28:05,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:05,780 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-01-25 05:28:05,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:28:05,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-25 05:28:05,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:05,782 INFO L225 Difference]: With dead ends: 63 [2018-01-25 05:28:05,782 INFO L226 Difference]: Without dead ends: 62 [2018-01-25 05:28:05,783 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:28:05,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-25 05:28:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-01-25 05:28:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 05:28:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-01-25 05:28:05,790 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 20 [2018-01-25 05:28:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:05,790 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-01-25 05:28:05,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:28:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-01-25 05:28:05,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 05:28:05,791 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:05,791 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:05,791 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:05,792 INFO L82 PathProgramCache]: Analyzing trace with hash -698055293, now seen corresponding path program 1 times [2018-01-25 05:28:05,792 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:05,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:05,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:05,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:05,793 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:05,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:05,854 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:28:05,854 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:05,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:28:05,855 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:05,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:28:05,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:28:05,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:28:05,856 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-01-25 05:28:05,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:05,962 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-01-25 05:28:05,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:28:05,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-25 05:28:05,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:05,970 INFO L225 Difference]: With dead ends: 53 [2018-01-25 05:28:05,970 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 05:28:05,971 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:28:05,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 05:28:05,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-25 05:28:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 05:28:05,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-01-25 05:28:05,977 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 21 [2018-01-25 05:28:05,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:05,978 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-01-25 05:28:05,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:28:05,978 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-01-25 05:28:05,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 05:28:05,979 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:05,979 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:05,979 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:05,979 INFO L82 PathProgramCache]: Analyzing trace with hash -698055292, now seen corresponding path program 1 times [2018-01-25 05:28:05,979 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:05,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:05,980 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:05,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:05,981 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:05,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:06,098 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:28:06,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:06,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:28:06,099 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:06,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:28:06,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:28:06,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:28:06,100 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-01-25 05:28:06,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:06,209 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-01-25 05:28:06,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:28:06,209 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-25 05:28:06,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:06,210 INFO L225 Difference]: With dead ends: 63 [2018-01-25 05:28:06,210 INFO L226 Difference]: Without dead ends: 62 [2018-01-25 05:28:06,211 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:28:06,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-25 05:28:06,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-01-25 05:28:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 05:28:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-01-25 05:28:06,215 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 21 [2018-01-25 05:28:06,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:06,215 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-01-25 05:28:06,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:28:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-01-25 05:28:06,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:28:06,216 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:06,216 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:06,216 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:06,216 INFO L82 PathProgramCache]: Analyzing trace with hash -164877615, now seen corresponding path program 1 times [2018-01-25 05:28:06,216 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:06,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:06,217 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:06,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:06,217 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:06,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:06,270 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:28:06,271 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:06,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:28:06,271 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:06,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:28:06,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:28:06,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:28:06,272 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-01-25 05:28:06,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:06,348 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-01-25 05:28:06,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:28:06,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 05:28:06,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:06,349 INFO L225 Difference]: With dead ends: 53 [2018-01-25 05:28:06,349 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 05:28:06,350 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:28:06,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 05:28:06,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-25 05:28:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 05:28:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-01-25 05:28:06,355 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-01-25 05:28:06,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:06,355 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-01-25 05:28:06,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:28:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-01-25 05:28:06,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:28:06,356 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:06,356 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:06,356 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:06,357 INFO L82 PathProgramCache]: Analyzing trace with hash -164877614, now seen corresponding path program 1 times [2018-01-25 05:28:06,357 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:06,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:06,358 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:06,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:06,358 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:06,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:06,518 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:28:06,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:06,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:28:06,518 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:06,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:28:06,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:28:06,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:28:06,519 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-01-25 05:28:06,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:06,642 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-01-25 05:28:06,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:28:06,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-25 05:28:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:06,643 INFO L225 Difference]: With dead ends: 64 [2018-01-25 05:28:06,643 INFO L226 Difference]: Without dead ends: 63 [2018-01-25 05:28:06,644 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-25 05:28:06,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-25 05:28:06,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-01-25 05:28:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 05:28:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-01-25 05:28:06,649 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 22 [2018-01-25 05:28:06,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:06,649 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-01-25 05:28:06,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:28:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-01-25 05:28:06,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:28:06,650 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:06,650 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:06,651 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:06,651 INFO L82 PathProgramCache]: Analyzing trace with hash 634059438, now seen corresponding path program 1 times [2018-01-25 05:28:06,651 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:06,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:06,652 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:06,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:06,652 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:06,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:06,695 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:28:06,696 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:06,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:28:06,696 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:06,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:28:06,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:28:06,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:28:06,696 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-01-25 05:28:06,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:06,743 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-01-25 05:28:06,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:28:06,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 05:28:06,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:06,743 INFO L225 Difference]: With dead ends: 53 [2018-01-25 05:28:06,743 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 05:28:06,744 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:28:06,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 05:28:06,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-25 05:28:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 05:28:06,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-01-25 05:28:06,749 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-01-25 05:28:06,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:06,749 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-01-25 05:28:06,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:28:06,749 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-01-25 05:28:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:28:06,750 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:06,750 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:06,750 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:06,750 INFO L82 PathProgramCache]: Analyzing trace with hash 634059439, now seen corresponding path program 1 times [2018-01-25 05:28:06,750 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:06,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:06,751 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:06,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:06,751 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:06,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:06,891 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:28:06,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:06,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:28:06,901 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:06,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:28:06,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:28:06,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:28:06,902 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-01-25 05:28:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:07,018 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-01-25 05:28:07,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:28:07,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-25 05:28:07,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:07,019 INFO L225 Difference]: With dead ends: 60 [2018-01-25 05:28:07,019 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 05:28:07,019 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:28:07,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 05:28:07,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-01-25 05:28:07,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 05:28:07,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-01-25 05:28:07,024 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2018-01-25 05:28:07,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:07,024 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-01-25 05:28:07,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:28:07,024 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2018-01-25 05:28:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:28:07,025 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:07,025 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:07,025 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:07,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1535458206, now seen corresponding path program 1 times [2018-01-25 05:28:07,026 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:07,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:07,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:07,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:07,027 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:07,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:07,337 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:28:07,337 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:07,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 05:28:07,337 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:07,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 05:28:07,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 05:28:07,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:28:07,338 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 11 states. [2018-01-25 05:28:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:07,529 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2018-01-25 05:28:07,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 05:28:07,529 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-01-25 05:28:07,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:07,530 INFO L225 Difference]: With dead ends: 85 [2018-01-25 05:28:07,530 INFO L226 Difference]: Without dead ends: 84 [2018-01-25 05:28:07,530 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-01-25 05:28:07,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-25 05:28:07,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2018-01-25 05:28:07,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-25 05:28:07,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2018-01-25 05:28:07,535 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 26 [2018-01-25 05:28:07,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:07,535 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2018-01-25 05:28:07,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 05:28:07,536 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2018-01-25 05:28:07,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:28:07,536 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:07,537 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:07,537 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:07,537 INFO L82 PathProgramCache]: Analyzing trace with hash -44170330, now seen corresponding path program 1 times [2018-01-25 05:28:07,537 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:07,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:07,538 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:07,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:07,538 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:07,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:07,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 05:28:07,613 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:07,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:28:07,613 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:07,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:28:07,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:28:07,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:28:07,614 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand 6 states. [2018-01-25 05:28:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:07,647 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-01-25 05:28:07,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:28:07,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 05:28:07,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:07,648 INFO L225 Difference]: With dead ends: 80 [2018-01-25 05:28:07,649 INFO L226 Difference]: Without dead ends: 62 [2018-01-25 05:28:07,649 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:28:07,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-25 05:28:07,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-25 05:28:07,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-25 05:28:07,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2018-01-25 05:28:07,654 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 26 [2018-01-25 05:28:07,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:07,654 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-01-25 05:28:07,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:28:07,655 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2018-01-25 05:28:07,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:28:07,655 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:07,655 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:07,656 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:07,656 INFO L82 PathProgramCache]: Analyzing trace with hash 355579118, now seen corresponding path program 1 times [2018-01-25 05:28:07,656 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:07,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:07,657 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:07,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:07,657 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:07,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:07,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:28:07,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:07,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 05:28:07,777 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:07,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:28:07,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:28:07,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:28:07,777 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 10 states. [2018-01-25 05:28:07,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:07,969 INFO L93 Difference]: Finished difference Result 138 states and 160 transitions. [2018-01-25 05:28:07,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:28:07,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-01-25 05:28:07,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:07,970 INFO L225 Difference]: With dead ends: 138 [2018-01-25 05:28:07,970 INFO L226 Difference]: Without dead ends: 105 [2018-01-25 05:28:07,971 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-01-25 05:28:07,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-25 05:28:07,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2018-01-25 05:28:07,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-25 05:28:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-01-25 05:28:07,978 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 27 [2018-01-25 05:28:07,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:07,979 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-01-25 05:28:07,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:28:07,979 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-01-25 05:28:07,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:28:07,980 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:07,980 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:07,980 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:07,980 INFO L82 PathProgramCache]: Analyzing trace with hash 505638783, now seen corresponding path program 1 times [2018-01-25 05:28:07,980 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:07,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:07,981 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:07,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:07,981 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:07,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 05:28:08,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:08,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:28:08,127 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:08,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:28:08,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:28:08,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:28:08,128 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 6 states. [2018-01-25 05:28:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:08,218 INFO L93 Difference]: Finished difference Result 128 states and 150 transitions. [2018-01-25 05:28:08,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:28:08,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-25 05:28:08,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:08,219 INFO L225 Difference]: With dead ends: 128 [2018-01-25 05:28:08,219 INFO L226 Difference]: Without dead ends: 94 [2018-01-25 05:28:08,220 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:28:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-25 05:28:08,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-01-25 05:28:08,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-25 05:28:08,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2018-01-25 05:28:08,226 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 27 [2018-01-25 05:28:08,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:08,227 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2018-01-25 05:28:08,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:28:08,227 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2018-01-25 05:28:08,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:28:08,228 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:08,228 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:08,228 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:08,228 INFO L82 PathProgramCache]: Analyzing trace with hash 778280944, now seen corresponding path program 1 times [2018-01-25 05:28:08,229 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:08,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:08,229 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:08,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:08,230 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:08,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:08,450 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:28:08,451 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:08,451 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:28:08,452 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-25 05:28:08,453 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [9], [14], [15], [17], [18], [25], [65], [66], [70], [75], [81], [83], [84], [85], [86], [87], [90], [101], [102], [103], [105] [2018-01-25 05:28:08,493 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:28:08,493 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:28:12,958 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:28:12,959 INFO L268 AbstractInterpreter]: Visited 24 different actions 58 times. Merged at 7 different actions 33 times. Widened at 1 different actions 1 times. Found 2 fixpoints after 2 different actions. Largest state had 31 variables. [2018-01-25 05:28:12,969 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:28:12,969 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:12,969 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:28:12,981 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:12,981 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:28:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:13,028 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:28:13,067 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:28:13,069 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:28:13,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:13,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:13,084 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:28:13,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 05:28:13,360 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:28:13,409 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:28:13,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:28:13,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:13,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:13,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-25 05:28:13,659 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 15 DAG size of output 15 [2018-01-25 05:28:13,664 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:28:13,664 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:28:14,071 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:28:14,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:14,086 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:28:14,099 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:28:14,100 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:14,104 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:14,112 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:28:14,112 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:39, output treesize:7 [2018-01-25 05:28:14,121 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:28:14,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:14,142 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:28:14,145 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:14,145 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:28:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:14,222 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:28:14,238 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:28:14,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:14,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:14,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 05:28:14,254 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:28:14,256 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:28:14,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:14,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:14,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:14,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 05:28:14,392 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:28:14,400 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:28:14,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:28:14,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:14,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:14,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-25 05:28:14,503 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:28:14,503 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:28:14,637 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:28:14,645 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:28:14,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:14,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:14,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:14,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-25 05:28:14,722 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:28:14,724 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:28:14,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 11, 11] total 35 [2018-01-25 05:28:14,724 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:28:14,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 05:28:14,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 05:28:14,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1128, Unknown=0, NotChecked=0, Total=1260 [2018-01-25 05:28:14,725 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand 17 states. [2018-01-25 05:28:17,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:17,891 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2018-01-25 05:28:17,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 05:28:17,892 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-01-25 05:28:17,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:17,893 INFO L225 Difference]: With dead ends: 135 [2018-01-25 05:28:17,893 INFO L226 Difference]: Without dead ends: 134 [2018-01-25 05:28:17,894 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=229, Invalid=1751, Unknown=0, NotChecked=0, Total=1980 [2018-01-25 05:28:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-25 05:28:17,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 95. [2018-01-25 05:28:17,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-25 05:28:17,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2018-01-25 05:28:17,904 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 27 [2018-01-25 05:28:17,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:17,904 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2018-01-25 05:28:17,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 05:28:17,904 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2018-01-25 05:28:17,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:28:17,905 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:17,905 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:17,905 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:17,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1643094554, now seen corresponding path program 1 times [2018-01-25 05:28:17,905 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:17,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:17,906 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:17,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:17,907 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:17,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:18,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:28:18,144 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:18,144 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:28:18,145 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 05:28:18,145 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [9], [14], [15], [18], [20], [25], [65], [66], [70], [75], [81], [83], [84], [85], [86], [87], [90], [101], [102], [103], [105] [2018-01-25 05:28:18,146 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:28:18,146 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:28:22,793 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:28:22,793 INFO L268 AbstractInterpreter]: Visited 24 different actions 45 times. Merged at 7 different actions 21 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-01-25 05:28:22,798 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:28:22,798 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:22,798 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:28:22,803 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:22,803 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:28:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:22,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:28:22,831 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:28:22,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:22,836 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:28:22,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:22,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:22,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:28:22,864 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:28:22,865 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:28:22,865 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:28:22,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:22,872 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:28:22,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:22,876 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:28:22,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-25 05:28:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:28:23,002 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:28:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:28:23,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:23,348 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:28:23,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:23,352 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:28:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:23,399 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:28:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:28:23,710 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:28:23,879 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:28:23,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:23,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:23,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:14 [2018-01-25 05:28:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:28:23,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:28:23,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10, 11, 11] total 45 [2018-01-25 05:28:23,986 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:28:23,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-25 05:28:23,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-25 05:28:23,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1872, Unknown=0, NotChecked=0, Total=2070 [2018-01-25 05:28:23,987 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand 22 states. [2018-01-25 05:28:24,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:24,534 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2018-01-25 05:28:24,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:28:24,535 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-01-25 05:28:24,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:24,535 INFO L225 Difference]: With dead ends: 113 [2018-01-25 05:28:24,535 INFO L226 Difference]: Without dead ends: 112 [2018-01-25 05:28:24,536 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=329, Invalid=2641, Unknown=0, NotChecked=0, Total=2970 [2018-01-25 05:28:24,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-25 05:28:24,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2018-01-25 05:28:24,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-25 05:28:24,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2018-01-25 05:28:24,542 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 28 [2018-01-25 05:28:24,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:24,543 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2018-01-25 05:28:24,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-25 05:28:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2018-01-25 05:28:24,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:28:24,543 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:24,543 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:24,543 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:24,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1433698709, now seen corresponding path program 1 times [2018-01-25 05:28:24,544 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:24,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:24,544 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:24,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:24,544 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:24,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:24,708 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:28:24,708 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:24,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:28:24,708 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:24,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:28:24,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:28:24,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:28:24,709 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 8 states. [2018-01-25 05:28:24,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:24,780 INFO L93 Difference]: Finished difference Result 131 states and 151 transitions. [2018-01-25 05:28:24,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:28:24,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-01-25 05:28:24,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:24,781 INFO L225 Difference]: With dead ends: 131 [2018-01-25 05:28:24,781 INFO L226 Difference]: Without dead ends: 102 [2018-01-25 05:28:24,781 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:28:24,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-25 05:28:24,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2018-01-25 05:28:24,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-25 05:28:24,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2018-01-25 05:28:24,787 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 29 [2018-01-25 05:28:24,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:24,787 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2018-01-25 05:28:24,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:28:24,787 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2018-01-25 05:28:24,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:28:24,788 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:24,788 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:24,788 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:24,788 INFO L82 PathProgramCache]: Analyzing trace with hash -163894416, now seen corresponding path program 1 times [2018-01-25 05:28:24,788 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:24,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:24,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:24,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:24,789 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:24,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:28:24,976 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:24,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-25 05:28:24,976 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:24,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 05:28:24,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 05:28:24,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:28:24,976 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand 13 states. [2018-01-25 05:28:25,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:25,245 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2018-01-25 05:28:25,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 05:28:25,246 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-01-25 05:28:25,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:25,246 INFO L225 Difference]: With dead ends: 127 [2018-01-25 05:28:25,246 INFO L226 Difference]: Without dead ends: 112 [2018-01-25 05:28:25,247 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2018-01-25 05:28:25,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-25 05:28:25,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2018-01-25 05:28:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-25 05:28:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2018-01-25 05:28:25,251 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 30 [2018-01-25 05:28:25,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:25,252 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2018-01-25 05:28:25,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 05:28:25,252 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2018-01-25 05:28:25,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:28:25,252 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:25,252 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:25,252 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:25,252 INFO L82 PathProgramCache]: Analyzing trace with hash 215739387, now seen corresponding path program 1 times [2018-01-25 05:28:25,253 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:25,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:25,253 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:25,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:25,253 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:25,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:25,355 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:28:25,355 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:25,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:28:25,355 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:25,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:28:25,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:28:25,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:28:25,356 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand 6 states. [2018-01-25 05:28:25,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:25,469 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-01-25 05:28:25,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:28:25,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-25 05:28:25,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:25,469 INFO L225 Difference]: With dead ends: 92 [2018-01-25 05:28:25,470 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 05:28:25,470 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:28:25,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 05:28:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-25 05:28:25,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 05:28:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-25 05:28:25,473 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 30 [2018-01-25 05:28:25,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:25,473 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-25 05:28:25,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:28:25,473 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-25 05:28:25,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:28:25,473 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:25,474 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:25,474 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:25,474 INFO L82 PathProgramCache]: Analyzing trace with hash -297907922, now seen corresponding path program 1 times [2018-01-25 05:28:25,474 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:25,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:25,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:25,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:25,475 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:25,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:25,755 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:28:25,755 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:25,755 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:28:25,755 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-25 05:28:25,755 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [9], [12], [34], [37], [38], [46], [48], [49], [51], [56], [65], [66], [70], [75], [81], [83], [84], [85], [86], [87], [90], [101], [102], [103], [105] [2018-01-25 05:28:25,757 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:28:25,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:28:26,730 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:28:26,730 INFO L268 AbstractInterpreter]: Visited 28 different actions 33 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-01-25 05:28:26,733 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:28:26,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:26,733 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:28:26,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:26,747 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:28:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:26,766 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:28:26,769 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:28:26,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:26,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:26,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:28:26,789 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:28:26,789 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:28:26,790 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:28:26,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:26,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:26,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-25 05:28:26,824 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 14 treesize of output 11 [2018-01-25 05:28:26,825 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:28:26,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:26,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:26,900 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:28:26,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-25 05:28:26,990 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 22 treesize of output 23 [2018-01-25 05:28:26,993 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:28:26,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:26,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:27,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-25 05:28:27,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-25 05:28:27,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-01-25 05:28:27,086 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 5 treesize of output 1 [2018-01-25 05:28:27,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:27,099 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:28:27,099 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 05:28:27,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:27,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:27,129 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-01-25 05:28:27,165 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:28:27,165 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:28:27,395 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:28:27,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:27,401 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:28:27,410 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:28:27,410 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:27,412 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:27,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:27,417 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:7 [2018-01-25 05:28:27,448 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:28:27,468 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:27,468 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:28:27,471 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:27,471 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:28:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:27,517 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:28:27,520 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:28:27,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:27,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:27,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:28:27,529 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:28:27,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:27,536 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:28:27,536 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:28:27,537 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:28:27,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:27,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:27,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-01-25 05:28:27,576 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:28:27,577 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:28:27,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:27,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:27,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:27,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-25 05:28:27,672 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:28:27,674 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:28:27,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:27,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:27,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-25 05:28:27,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2018-01-25 05:28:27,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-01-25 05:28:27,760 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 5 treesize of output 1 [2018-01-25 05:28:27,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:27,768 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:28:27,768 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 05:28:27,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:27,782 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:28:27,782 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:30 [2018-01-25 05:28:27,870 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:28:27,870 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:28:28,003 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:28:28,010 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:28:28,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:28,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:28,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:28,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-25 05:28:28,100 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:28:28,102 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:28:28,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 10, 14, 12] total 44 [2018-01-25 05:28:28,102 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:28:28,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-25 05:28:28,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-25 05:28:28,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1801, Unknown=0, NotChecked=0, Total=1980 [2018-01-25 05:28:28,103 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 23 states. [2018-01-25 05:28:28,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:28,836 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-01-25 05:28:28,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 05:28:28,836 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-01-25 05:28:28,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:28,837 INFO L225 Difference]: With dead ends: 65 [2018-01-25 05:28:28,837 INFO L226 Difference]: Without dead ends: 64 [2018-01-25 05:28:28,838 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 79 SyntacticMatches, 10 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=318, Invalid=2762, Unknown=0, NotChecked=0, Total=3080 [2018-01-25 05:28:28,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-25 05:28:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2018-01-25 05:28:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-25 05:28:28,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-01-25 05:28:28,841 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 30 [2018-01-25 05:28:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:28,841 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-01-25 05:28:28,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-25 05:28:28,842 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-01-25 05:28:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 05:28:28,842 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:28,842 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:28,842 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:28,842 INFO L82 PathProgramCache]: Analyzing trace with hash -119267187, now seen corresponding path program 1 times [2018-01-25 05:28:28,843 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:28,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:28,843 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:28,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:28,843 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:28,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:29,068 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:28:29,068 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:29,068 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:28:29,068 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-25 05:28:29,068 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [9], [12], [14], [15], [18], [25], [34], [37], [38], [46], [48], [51], [65], [66], [70], [75], [81], [83], [84], [85], [86], [87], [90], [101], [102], [103], [105] [2018-01-25 05:28:29,069 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:28:29,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:28:32,290 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:28:32,290 INFO L268 AbstractInterpreter]: Visited 30 different actions 69 times. Merged at 13 different actions 39 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 33 variables. [2018-01-25 05:28:32,303 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:28:32,303 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:32,303 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:28:32,312 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:32,313 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:28:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:32,335 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:28:32,340 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:28:32,341 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:28:32,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:32,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:32,346 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:28:32,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 05:28:32,420 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:28:32,425 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:28:32,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:28:32,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:32,435 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:28:32,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-25 05:28:32,465 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:28:32,465 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:28:32,619 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:28:32,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:32,627 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:28:32,636 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:28:32,636 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:32,637 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:32,642 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:28:32,642 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:39, output treesize:7 [2018-01-25 05:28:32,647 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:28:32,667 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:32,668 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:28:32,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:32,671 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:28:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:32,756 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:28:32,760 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:28:32,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:32,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:32,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 05:28:32,773 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:28:32,774 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:28:32,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:32,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:32,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:32,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 05:28:32,898 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:28:32,902 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:28:32,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:28:32,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:32,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:32,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-25 05:28:32,989 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:28:32,989 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:28:33,111 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:28:33,120 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:28:33,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:33,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:33,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:33,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-25 05:28:33,189 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:28:33,190 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:28:33,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 11, 11] total 35 [2018-01-25 05:28:33,191 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:28:33,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 05:28:33,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 05:28:33,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1129, Unknown=0, NotChecked=0, Total=1260 [2018-01-25 05:28:33,192 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 17 states. [2018-01-25 05:28:34,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:34,317 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-01-25 05:28:34,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 05:28:34,317 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-01-25 05:28:34,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:34,318 INFO L225 Difference]: With dead ends: 68 [2018-01-25 05:28:34,318 INFO L226 Difference]: Without dead ends: 67 [2018-01-25 05:28:34,318 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=1602, Unknown=0, NotChecked=0, Total=1806 [2018-01-25 05:28:34,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-25 05:28:34,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-01-25 05:28:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-25 05:28:34,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-01-25 05:28:34,322 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 32 [2018-01-25 05:28:34,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:34,322 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-01-25 05:28:34,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 05:28:34,322 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-01-25 05:28:34,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 05:28:34,322 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:34,322 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:34,322 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:34,323 INFO L82 PathProgramCache]: Analyzing trace with hash -451522982, now seen corresponding path program 2 times [2018-01-25 05:28:34,323 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:34,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:34,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:34,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:34,323 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:34,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:28:34,706 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:34,706 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:28:34,706 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:28:34,706 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:28:34,706 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:34,707 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:28:34,713 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:28:34,713 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:28:34,728 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:28:34,736 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:28:34,740 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:28:34,743 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:28:34,750 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:28:34,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:34,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:34,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-25 05:28:34,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:28:34,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:28:34,759 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:28:34,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:34,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:28:34,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:34,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:34,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-25 05:28:34,809 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:28:34,811 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:28:34,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:34,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:34,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:28:34,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-25 05:28:34,988 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:28:34,990 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:28:34,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:34,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:35,001 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:28:35,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-25 05:28:35,064 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:28:35,070 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:28:35,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:28:35,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:35,081 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:28:35,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-25 05:28:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:28:35,132 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:28:35,620 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 37 treesize of output 28 [2018-01-25 05:28:35,633 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:28:35,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:35,646 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 18 [2018-01-25 05:28:35,647 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:28:35,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:35,651 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:35,652 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:28:35,654 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 15 treesize of output 10 [2018-01-25 05:28:35,654 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:35,657 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:35,668 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:28:35,687 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:28:35,688 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:63, output treesize:110 [2018-01-25 05:28:35,889 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:28:35,909 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:35,909 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:28:35,912 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:28:35,912 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:28:35,931 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:28:35,960 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:28:36,029 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:28:36,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:28:36,039 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:28:36,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:36,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:36,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-25 05:28:36,058 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:28:36,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:36,065 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:28:36,066 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:28:36,066 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:28:36,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:36,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:36,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-25 05:28:36,114 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:28:36,115 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:28:36,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:36,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:36,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:36,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-25 05:28:36,295 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:28:36,297 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:28:36,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:36,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:36,308 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:28:36,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-01-25 05:28:36,489 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:28:36,495 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:28:36,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:28:36,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:36,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:36,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-25 05:28:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:28:36,541 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:28:46,982 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 37 treesize of output 28 [2018-01-25 05:28:46,994 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:28:46,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:47,007 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 18 [2018-01-25 05:28:47,009 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:28:47,009 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:47,012 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:47,013 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:28:47,015 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 15 treesize of output 10 [2018-01-25 05:28:47,015 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:47,017 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:47,026 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:28:47,043 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:28:47,043 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-01-25 05:28:47,249 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:28:47,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:28:47,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15] total 54 [2018-01-25 05:28:47,251 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:28:47,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-25 05:28:47,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-25 05:28:47,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2763, Unknown=5, NotChecked=0, Total=2970 [2018-01-25 05:28:47,252 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 26 states. [2018-01-25 05:28:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:48,602 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-01-25 05:28:48,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-25 05:28:48,602 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-01-25 05:28:48,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:48,602 INFO L225 Difference]: With dead ends: 69 [2018-01-25 05:28:48,603 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 05:28:48,604 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 85 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 7 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=506, Invalid=4601, Unknown=5, NotChecked=0, Total=5112 [2018-01-25 05:28:48,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 05:28:48,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-01-25 05:28:48,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 05:28:48,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-01-25 05:28:48,610 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 33 [2018-01-25 05:28:48,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:48,610 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-01-25 05:28:48,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-25 05:28:48,610 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-01-25 05:28:48,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 05:28:48,611 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:48,611 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 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:28:48,611 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:28:48,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1502086491, now seen corresponding path program 2 times [2018-01-25 05:28:48,611 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:48,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:48,611 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:28:48,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:48,612 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:48,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:49,590 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:28:49,590 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:49,590 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:28:49,590 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:28:49,590 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:28:49,590 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:49,591 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:28:49,596 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:28:49,597 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:28:49,609 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:28:49,615 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:28:49,618 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:28:49,621 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:28:49,627 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:28:49,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:49,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:49,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-25 05:28:49,667 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:28:49,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:49,674 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:28:49,675 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:28:49,675 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:28:49,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:49,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:49,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-25 05:28:49,727 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:28:49,729 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:28:49,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:49,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:49,736 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:28:49,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-25 05:28:49,843 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:28:49,845 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:28:49,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:49,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:49,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-25 05:28:49,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:30 [2018-01-25 05:28:50,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-01-25 05:28:50,040 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:28:50,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:28:50,047 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 5 treesize of output 1 [2018-01-25 05:28:50,047 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:50,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:50,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:50,059 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 Received shutdown request... [2018-01-25 05:28:50,107 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:28:50,107 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:28:50,110 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:28:50,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:28:50 BoogieIcfgContainer [2018-01-25 05:28:50,110 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:28:50,111 INFO L168 Benchmark]: Toolchain (without parser) took 46289.84 ms. Allocated memory was 302.0 MB in the beginning and 1.2 GB in the end (delta: 882.9 MB). Free memory was 261.0 MB in the beginning and 426.6 MB in the end (delta: -165.6 MB). Peak memory consumption was 717.3 MB. Max. memory is 5.3 GB. [2018-01-25 05:28:50,111 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 302.0 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:28:50,111 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.48 ms. Allocated memory is still 302.0 MB. Free memory was 261.0 MB in the beginning and 251.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:28:50,112 INFO L168 Benchmark]: Boogie Preprocessor took 38.09 ms. Allocated memory is still 302.0 MB. Free memory was 251.0 MB in the beginning and 249.0 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:28:50,112 INFO L168 Benchmark]: RCFGBuilder took 258.99 ms. Allocated memory is still 302.0 MB. Free memory was 249.0 MB in the beginning and 228.5 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:28:50,112 INFO L168 Benchmark]: TraceAbstraction took 45767.52 ms. Allocated memory was 302.0 MB in the beginning and 1.2 GB in the end (delta: 882.9 MB). Free memory was 228.5 MB in the beginning and 426.6 MB in the end (delta: -198.1 MB). Peak memory consumption was 684.8 MB. Max. memory is 5.3 GB. [2018-01-25 05:28:50,113 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.19 ms. Allocated memory is still 302.0 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.48 ms. Allocated memory is still 302.0 MB. Free memory was 261.0 MB in the beginning and 251.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.09 ms. Allocated memory is still 302.0 MB. Free memory was 251.0 MB in the beginning and 249.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 258.99 ms. Allocated memory is still 302.0 MB. Free memory was 249.0 MB in the beginning and 228.5 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 45767.52 ms. Allocated memory was 302.0 MB in the beginning and 1.2 GB in the end (delta: 882.9 MB). Free memory was 228.5 MB in the beginning and 426.6 MB in the end (delta: -198.1 MB). Peak memory consumption was 684.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 5 LocStat_NO_SUPPORTING_EQUALITIES : 309 LocStat_NO_SUPPORTING_DISEQUALITIES : 47 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 20.264397 RENAME_VARIABLES(MILLISECONDS) : 2.104030 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 20.198471 PROJECTAWAY(MILLISECONDS) : 24.798814 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.081539 DISJOIN(MILLISECONDS) : 1.535236 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 2.139996 ADD_EQUALITY(MILLISECONDS) : 0.112919 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010813 #CONJOIN_DISJUNCTIVE : 104 #RENAME_VARIABLES : 191 #UNFREEZE : 0 #CONJOIN : 168 #PROJECTAWAY : 131 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 20 #RENAME_VARIABLES_DISJUNCTIVE : 181 #ADD_EQUALITY : 71 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 5 LocStat_NO_SUPPORTING_EQUALITIES : 321 LocStat_NO_SUPPORTING_DISEQUALITIES : 47 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 6.626170 RENAME_VARIABLES(MILLISECONDS) : 1.635500 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 6.583688 PROJECTAWAY(MILLISECONDS) : 15.742431 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.067574 DISJOIN(MILLISECONDS) : 1.785796 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.658180 ADD_EQUALITY(MILLISECONDS) : 0.023502 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012278 #CONJOIN_DISJUNCTIVE : 84 #RENAME_VARIABLES : 148 #UNFREEZE : 0 #CONJOIN : 145 #PROJECTAWAY : 108 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 17 #RENAME_VARIABLES_DISJUNCTIVE : 141 #ADD_EQUALITY : 71 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 391 LocStat_NO_SUPPORTING_DISEQUALITIES : 67 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 66 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 35 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 14.737028 RENAME_VARIABLES(MILLISECONDS) : 3.116406 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 14.679642 PROJECTAWAY(MILLISECONDS) : 20.743858 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.051173 DISJOIN(MILLISECONDS) : 1.389140 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 3.153384 ADD_EQUALITY(MILLISECONDS) : 0.011861 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008145 #CONJOIN_DISJUNCTIVE : 56 #RENAME_VARIABLES : 88 #UNFREEZE : 0 #CONJOIN : 108 #PROJECTAWAY : 80 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 7 #RENAME_VARIABLES_DISJUNCTIVE : 85 #ADD_EQUALITY : 69 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 29 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 439 LocStat_NO_SUPPORTING_DISEQUALITIES : 70 LocStat_NO_DISJUNCTIONS : -58 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 36 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 76 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 3.887099 RENAME_VARIABLES(MILLISECONDS) : 0.586692 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.886014 PROJECTAWAY(MILLISECONDS) : 0.076186 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.026663 DISJOIN(MILLISECONDS) : 0.289574 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.605405 ADD_EQUALITY(MILLISECONDS) : 0.016191 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011090 #CONJOIN_DISJUNCTIVE : 128 #RENAME_VARIABLES : 232 #UNFREEZE : 0 #CONJOIN : 194 #PROJECTAWAY : 156 #ADD_WEAK_EQUALITY : 13 #DISJOIN : 26 #RENAME_VARIABLES_DISJUNCTIVE : 225 #ADD_EQUALITY : 80 #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 555). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 13 error locations. TIMEOUT Result, 45.7s OverallTime, 25 OverallIterations, 3 TraceHistogramMax, 9.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 954 SDtfs, 1587 SDslu, 4175 SDs, 0 SdLazy, 3294 SolverSat, 275 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 886 GetRequests, 446 SyntacticMatches, 25 SemanticMatches, 415 ConstructedPredicates, 0 IntricatePredicates, 7 DeprecatedPredicates, 3890 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 13.3s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 173 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 20.3s InterpolantComputationTime, 869 NumberOfCodeBlocks, 869 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1125 ConstructedInterpolants, 103 QuantifiedInterpolants, 337001 SizeOfPredicates, 176 NumberOfNonLiveVariables, 1642 ConjunctsInSsa, 451 ConjunctsInUnsatCore, 44 InterpolantComputations, 19 PerfectInterpolantSequences, 13/158 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-28-50-123.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-28-50-123.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-28-50-123.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-28-50-123.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-28-50-123.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_05-28-50-123.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_05-28-50-123.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_05-28-50-123.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_05-28-50-123.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-28-50-123.csv Completed graceful shutdown