java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:35:21,100 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:35:21,102 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:35:21,119 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:35:21,120 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:35:21,121 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:35:21,122 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:35:21,123 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:35:21,126 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:35:21,126 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:35:21,127 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:35:21,127 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:35:21,128 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:35:21,129 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:35:21,130 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:35:21,133 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:35:21,135 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:35:21,137 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:35:21,138 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:35:21,140 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:35:21,142 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:35:21,142 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:35:21,143 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:35:21,144 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:35:21,145 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:35:21,146 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:35:21,147 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:35:21,147 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:35:21,148 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:35:21,148 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:35:21,148 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:35:21,149 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 02:35:21,160 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:35:21,160 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:35:21,161 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:35:21,161 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:35:21,162 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:35:21,162 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:35:21,162 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:35:21,162 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:35:21,162 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:35:21,165 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:35:21,165 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:35:21,165 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:35:21,166 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:35:21,166 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:35:21,166 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:35:21,166 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:35:21,166 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:35:21,167 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:35:21,167 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:35:21,167 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:35:21,167 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:35:21,167 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:35:21,168 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:35:21,168 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:35:21,169 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:35:21,170 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:35:21,170 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:35:21,170 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:35:21,170 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:35:21,171 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:35:21,171 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:35:21,171 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:35:21,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:35:21,171 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:35:21,172 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:35:21,172 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:35:21,173 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:35:21,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:35:21,249 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:35:21,256 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:35:21,259 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:35:21,259 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:35:21,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:35:21,457 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:35:21,465 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:35:21,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:35:21,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:35:21,474 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:35:21,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:35:21" (1/1) ... [2018-01-25 02:35:21,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38712f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:35:21, skipping insertion in model container [2018-01-25 02:35:21,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:35:21" (1/1) ... [2018-01-25 02:35:21,493 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:35:21,552 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:35:21,688 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:35:21,712 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:35:21,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:35:21 WrapperNode [2018-01-25 02:35:21,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:35:21,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:35:21,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:35:21,723 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:35:21,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:35:21" (1/1) ... [2018-01-25 02:35:21,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:35:21" (1/1) ... [2018-01-25 02:35:21,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:35:21" (1/1) ... [2018-01-25 02:35:21,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:35:21" (1/1) ... [2018-01-25 02:35:21,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:35:21" (1/1) ... [2018-01-25 02:35:21,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:35:21" (1/1) ... [2018-01-25 02:35:21,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:35:21" (1/1) ... [2018-01-25 02:35:21,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:35:21,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:35:21,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:35:21,779 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:35:21,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:35:21" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:35:21,852 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:35:21,853 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:35:21,853 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-25 02:35:21,853 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:35:21,853 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:35:21,853 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:35:21,854 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:35:21,854 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:35:21,854 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:35:21,854 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:35:21,854 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-25 02:35:21,854 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:35:21,854 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:35:21,855 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:35:22,238 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:35:22,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:35:22 BoogieIcfgContainer [2018-01-25 02:35:22,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:35:22,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:35:22,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:35:22,242 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:35:22,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:35:21" (1/3) ... [2018-01-25 02:35:22,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e53b06d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:35:22, skipping insertion in model container [2018-01-25 02:35:22,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:35:21" (2/3) ... [2018-01-25 02:35:22,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e53b06d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:35:22, skipping insertion in model container [2018-01-25 02:35:22,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:35:22" (3/3) ... [2018-01-25 02:35:22,247 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:35:22,257 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:35:22,265 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 02:35:22,320 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:35:22,321 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:35:22,321 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:35:22,321 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:35:22,321 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:35:22,321 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:35:22,321 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:35:22,321 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:35:22,322 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:35:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-25 02:35:22,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:35:22,362 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:35:22,363 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:35:22,363 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:35:22,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1779029996, now seen corresponding path program 1 times [2018-01-25 02:35:22,374 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:35:22,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:22,436 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:35:22,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:22,436 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:35:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:35:22,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:35:22,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 02:35:22,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:35:22,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:35:22,711 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:35:22,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:35:22,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:35:22,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:35:22,806 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2018-01-25 02:35:22,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:35:22,972 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-01-25 02:35:22,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:35:22,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 02:35:22,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:35:22,983 INFO L225 Difference]: With dead ends: 83 [2018-01-25 02:35:22,983 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 02:35:22,987 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:35:23,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 02:35:23,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-25 02:35:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 02:35:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-01-25 02:35:23,023 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 13 [2018-01-25 02:35:23,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:35:23,023 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-01-25 02:35:23,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:35:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-01-25 02:35:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:35:23,024 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:35:23,024 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:35:23,025 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:35:23,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1779029997, now seen corresponding path program 1 times [2018-01-25 02:35:23,026 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:35:23,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:23,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:35:23,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:23,028 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:35:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:35:23,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:35:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:35:23,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:35:23,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:35:23,322 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:35:23,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:35:23,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:35:23,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:35:23,325 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 6 states. [2018-01-25 02:35:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:35:23,418 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-01-25 02:35:23,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:35:23,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-25 02:35:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:35:23,420 INFO L225 Difference]: With dead ends: 57 [2018-01-25 02:35:23,420 INFO L226 Difference]: Without dead ends: 56 [2018-01-25 02:35:23,421 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:35:23,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-25 02:35:23,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-25 02:35:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 02:35:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-01-25 02:35:23,428 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 13 [2018-01-25 02:35:23,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:35:23,428 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-01-25 02:35:23,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:35:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-01-25 02:35:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:35:23,429 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:35:23,429 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:35:23,429 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:35:23,429 INFO L82 PathProgramCache]: Analyzing trace with hash -684644977, now seen corresponding path program 1 times [2018-01-25 02:35:23,429 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:35:23,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:23,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:35:23,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:23,431 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:35:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:35:23,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:35:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:35:23,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:35:23,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:35:23,479 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:35:23,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:35:23,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:35:23,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:35:23,480 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 4 states. [2018-01-25 02:35:23,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:35:23,618 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-01-25 02:35:23,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:35:23,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 02:35:23,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:35:23,620 INFO L225 Difference]: With dead ends: 56 [2018-01-25 02:35:23,620 INFO L226 Difference]: Without dead ends: 55 [2018-01-25 02:35:23,621 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:35:23,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-25 02:35:23,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-25 02:35:23,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 02:35:23,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-01-25 02:35:23,628 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 14 [2018-01-25 02:35:23,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:35:23,629 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-01-25 02:35:23,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:35:23,629 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-01-25 02:35:23,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:35:23,630 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:35:23,630 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:35:23,630 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:35:23,630 INFO L82 PathProgramCache]: Analyzing trace with hash -684644976, now seen corresponding path program 1 times [2018-01-25 02:35:23,630 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:35:23,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:23,632 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:35:23,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:23,632 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:35:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:35:23,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:35:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:35:23,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:35:23,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:35:23,749 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:35:23,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:35:23,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:35:23,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:35:23,750 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 5 states. [2018-01-25 02:35:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:35:23,807 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-01-25 02:35:23,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:35:23,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 02:35:23,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:35:23,809 INFO L225 Difference]: With dead ends: 55 [2018-01-25 02:35:23,809 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 02:35:23,810 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:35:23,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 02:35:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-25 02:35:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 02:35:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-01-25 02:35:23,817 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 14 [2018-01-25 02:35:23,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:35:23,818 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-01-25 02:35:23,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:35:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-01-25 02:35:23,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 02:35:23,819 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:35:23,819 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:35:23,820 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:35:23,820 INFO L82 PathProgramCache]: Analyzing trace with hash 518960417, now seen corresponding path program 1 times [2018-01-25 02:35:23,820 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:35:23,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:23,821 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:35:23,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:23,822 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:35:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:35:23,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:35:23,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:35:23,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:35:23,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:35:23,893 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:35:23,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:35:23,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:35:23,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:35:23,894 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 5 states. [2018-01-25 02:35:23,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:35:23,985 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-01-25 02:35:23,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:35:23,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-25 02:35:23,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:35:23,986 INFO L225 Difference]: With dead ends: 54 [2018-01-25 02:35:23,986 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 02:35:23,987 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:35:23,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 02:35:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 02:35:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 02:35:23,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-01-25 02:35:23,994 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2018-01-25 02:35:23,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:35:23,994 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-01-25 02:35:23,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:35:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-01-25 02:35:23,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 02:35:23,995 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:35:23,995 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:35:23,995 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:35:23,996 INFO L82 PathProgramCache]: Analyzing trace with hash 518960418, now seen corresponding path program 1 times [2018-01-25 02:35:23,996 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:35:23,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:23,997 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:35:23,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:23,997 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:35:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:35:24,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:35:24,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:35:24,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:35:24,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:35:24,130 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:35:24,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:35:24,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:35:24,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:35:24,132 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 8 states. [2018-01-25 02:35:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:35:24,301 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-01-25 02:35:24,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:35:24,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-25 02:35:24,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:35:24,305 INFO L225 Difference]: With dead ends: 77 [2018-01-25 02:35:24,305 INFO L226 Difference]: Without dead ends: 74 [2018-01-25 02:35:24,305 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 02:35:24,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-25 02:35:24,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2018-01-25 02:35:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-25 02:35:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2018-01-25 02:35:24,317 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 22 [2018-01-25 02:35:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:35:24,317 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2018-01-25 02:35:24,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:35:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2018-01-25 02:35:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 02:35:24,318 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:35:24,319 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] [2018-01-25 02:35:24,319 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:35:24,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1092096233, now seen corresponding path program 1 times [2018-01-25 02:35:24,319 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:35:24,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:24,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:35:24,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:24,321 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:35:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:35:24,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:35:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:35:24,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:35:24,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:35:24,375 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:35:24,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:35:24,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:35:24,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:35:24,376 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 5 states. [2018-01-25 02:35:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:35:24,461 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2018-01-25 02:35:24,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:35:24,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-25 02:35:24,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:35:24,463 INFO L225 Difference]: With dead ends: 61 [2018-01-25 02:35:24,463 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 02:35:24,463 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:35:24,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 02:35:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-25 02:35:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-25 02:35:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-01-25 02:35:24,470 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 23 [2018-01-25 02:35:24,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:35:24,471 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-01-25 02:35:24,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:35:24,471 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-01-25 02:35:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 02:35:24,472 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:35:24,472 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] [2018-01-25 02:35:24,472 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:35:24,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1092096232, now seen corresponding path program 1 times [2018-01-25 02:35:24,472 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:35:24,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:24,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:35:24,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:24,474 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:35:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:35:24,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:35:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:35:24,725 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:35:24,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:35:24,725 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:35:24,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:35:24,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:35:24,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:35:24,726 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 8 states. [2018-01-25 02:35:24,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:35:24,993 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2018-01-25 02:35:24,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:35:24,994 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-25 02:35:24,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:35:24,995 INFO L225 Difference]: With dead ends: 70 [2018-01-25 02:35:24,995 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 02:35:24,996 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:35:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 02:35:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-01-25 02:35:25,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-25 02:35:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-01-25 02:35:25,003 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 23 [2018-01-25 02:35:25,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:35:25,003 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-01-25 02:35:25,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:35:25,003 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-01-25 02:35:25,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 02:35:25,004 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:35:25,005 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:35:25,005 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:35:25,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2118091962, now seen corresponding path program 1 times [2018-01-25 02:35:25,005 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:35:25,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:25,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:35:25,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:25,006 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:35:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:35:25,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:35:25,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:35:25,165 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:35:25,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:35:25,166 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:35:25,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:35:25,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:35:25,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:35:25,167 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 6 states. [2018-01-25 02:35:25,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:35:25,417 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2018-01-25 02:35:25,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:35:25,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 02:35:25,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:35:25,418 INFO L225 Difference]: With dead ends: 61 [2018-01-25 02:35:25,418 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 02:35:25,419 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:35:25,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 02:35:25,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-25 02:35:25,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 02:35:25,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-01-25 02:35:25,425 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 26 [2018-01-25 02:35:25,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:35:25,425 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-01-25 02:35:25,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:35:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-01-25 02:35:25,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 02:35:25,426 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:35:25,426 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] [2018-01-25 02:35:25,426 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:35:25,426 INFO L82 PathProgramCache]: Analyzing trace with hash 487859445, now seen corresponding path program 1 times [2018-01-25 02:35:25,427 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:35:25,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:25,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:35:25,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:25,427 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:35:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:35:25,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:35:25,455 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 02:35:25,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:35:25,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:35:25,455 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:35:25,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:35:25,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:35:25,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:35:25,456 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 3 states. [2018-01-25 02:35:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:35:25,474 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-01-25 02:35:25,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:35:25,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-25 02:35:25,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:35:25,475 INFO L225 Difference]: With dead ends: 69 [2018-01-25 02:35:25,475 INFO L226 Difference]: Without dead ends: 47 [2018-01-25 02:35:25,476 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:35:25,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-25 02:35:25,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-25 02:35:25,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 02:35:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-01-25 02:35:25,483 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 28 [2018-01-25 02:35:25,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:35:25,483 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-01-25 02:35:25,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:35:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-01-25 02:35:25,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 02:35:25,484 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:35:25,485 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:35:25,485 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:35:25,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1854244690, now seen corresponding path program 1 times [2018-01-25 02:35:25,485 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:35:25,486 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:25,486 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:35:25,486 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:25,486 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:35:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:35:25,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:35:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:35:25,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:35:25,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:35:25,526 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:35:25,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:35:25,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:35:25,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:35:25,527 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 3 states. [2018-01-25 02:35:25,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:35:25,536 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2018-01-25 02:35:25,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:35:25,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-01-25 02:35:25,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:35:25,538 INFO L225 Difference]: With dead ends: 68 [2018-01-25 02:35:25,538 INFO L226 Difference]: Without dead ends: 47 [2018-01-25 02:35:25,538 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:35:25,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-25 02:35:25,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-25 02:35:25,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 02:35:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-01-25 02:35:25,544 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 31 [2018-01-25 02:35:25,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:35:25,545 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-01-25 02:35:25,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:35:25,545 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-01-25 02:35:25,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 02:35:25,546 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:35:25,546 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:35:25,546 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:35:25,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2022484201, now seen corresponding path program 1 times [2018-01-25 02:35:25,547 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:35:25,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:25,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:35:25,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:25,548 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:35:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:35:25,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:35:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:35:25,885 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:35:25,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 02:35:25,885 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:35:25,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 02:35:25,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 02:35:25,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:35:25,886 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 12 states. [2018-01-25 02:35:26,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:35:26,157 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-01-25 02:35:26,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 02:35:26,158 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-01-25 02:35:26,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:35:26,158 INFO L225 Difference]: With dead ends: 89 [2018-01-25 02:35:26,159 INFO L226 Difference]: Without dead ends: 47 [2018-01-25 02:35:26,159 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-01-25 02:35:26,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-25 02:35:26,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-25 02:35:26,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 02:35:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-01-25 02:35:26,165 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 33 [2018-01-25 02:35:26,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:35:26,165 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-01-25 02:35:26,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 02:35:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-01-25 02:35:26,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 02:35:26,166 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:35:26,166 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:35:26,166 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:35:26,167 INFO L82 PathProgramCache]: Analyzing trace with hash -349255061, now seen corresponding path program 1 times [2018-01-25 02:35:26,167 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:35:26,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:26,168 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:35:26,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:35:26,168 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:35:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:35:26,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:35:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:35:26,374 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:35:26,375 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:35:26,375 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-01-25 02:35:26,377 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [20], [21], [22], [25], [28], [37], [41], [45], [47], [50], [51], [53], [54], [57], [65], [70], [71], [74], [79], [99], [100], [101], [103] [2018-01-25 02:35:26,450 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:35:26,450 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:36:03,672 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:36:03,673 INFO L268 AbstractInterpreter]: Visited 30 different actions 54 times. Merged at 12 different actions 24 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-01-25 02:36:03,703 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:36:03,703 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:36:03,703 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:36:03,713 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:03,714 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:36:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:03,757 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:36:03,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:36:03,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:03,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:36:03,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 02:36:03,955 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:36:03,956 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:36:03,957 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 02:36:03,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:03,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:36:03,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-25 02:36:04,000 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 02:36:04,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-25 02:36:04,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:04,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:36:04,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 02:36:04,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-25 02:36:04,145 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 25 treesize of output 26 [2018-01-25 02:36:04,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-25 02:36:04,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:04,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:36:04,171 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 02:36:04,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-25 02:36:04,430 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 28 treesize of output 26 [2018-01-25 02:36:04,437 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 14 treesize of output 11 [2018-01-25 02:36:04,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:36:04,448 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 8 treesize of output 1 [2018-01-25 02:36:04,448 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:04,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:36:04,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:36:04,466 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-01-25 02:36:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:36:04,568 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:36:04,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-25 02:36:04,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:04,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 02:36:05,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 02:36:05,014 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:05,017 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:36:05,029 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 02:36:05,030 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-01-25 02:36:05,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:36:05,092 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:36:05,093 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:36:05,096 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:05,096 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:36:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:05,151 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:36:05,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:36:05,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:05,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:36:05,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:05,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:36:05,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 02:36:05,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:36:05,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:36:05,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 02:36:05,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:05,233 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 02:36:05,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:05,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:36:05,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-25 02:36:05,310 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 02:36:05,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 02:36:05,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:05,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:36:05,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:36:05,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-25 02:36:05,358 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 29 treesize of output 30 [2018-01-25 02:36:05,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 02:36:05,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:05,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:36:05,371 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 02:36:05,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-25 02:36:05,708 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 31 treesize of output 29 [2018-01-25 02:36:05,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-01-25 02:36:05,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:05,720 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 16 [2018-01-25 02:36:05,721 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 02:36:05,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:36:05,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:36:05,740 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-01-25 02:36:06,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:36:06,024 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:36:06,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 02:36:06,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 02:36:06,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:06,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:36:06,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:36:06,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-25 02:36:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:36:06,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:36:06,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 10, 14, 12] total 51 [2018-01-25 02:36:06,514 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:36:06,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-25 02:36:06,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-25 02:36:06,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2457, Unknown=0, NotChecked=0, Total=2652 [2018-01-25 02:36:06,515 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 24 states. [2018-01-25 02:36:07,581 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 73 DAG size of output 53 [2018-01-25 02:36:08,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:36:08,455 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-01-25 02:36:08,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 02:36:08,455 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2018-01-25 02:36:08,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:36:08,456 INFO L225 Difference]: With dead ends: 69 [2018-01-25 02:36:08,456 INFO L226 Difference]: Without dead ends: 66 [2018-01-25 02:36:08,457 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=343, Invalid=3439, Unknown=0, NotChecked=0, Total=3782 [2018-01-25 02:36:08,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-25 02:36:08,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-01-25 02:36:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 02:36:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-01-25 02:36:08,465 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 33 [2018-01-25 02:36:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:36:08,466 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-01-25 02:36:08,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-25 02:36:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-01-25 02:36:08,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 02:36:08,467 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:36:08,467 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, 1, 1, 1, 1, 1, 1] [2018-01-25 02:36:08,467 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 02:36:08,467 INFO L82 PathProgramCache]: Analyzing trace with hash 2057994991, now seen corresponding path program 1 times [2018-01-25 02:36:08,467 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:36:08,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:08,469 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:08,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:08,469 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:36:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:08,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:36:08,749 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 02:36:08,749 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:36:08,750 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:36:08,750 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-25 02:36:08,750 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [20], [21], [22], [25], [28], [37], [41], [45], [47], [50], [51], [54], [56], [57], [65], [70], [71], [74], [79], [99], [100], [101], [103] [2018-01-25 02:36:08,752 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:36:08,752 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown