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_mostprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 19:53:33,886 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 19:53:33,889 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 19:53:33,904 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 19:53:33,905 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 19:53:33,906 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 19:53:33,907 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 19:53:33,909 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 19:53:33,911 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 19:53:33,912 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 19:53:33,913 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 19:53:33,913 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 19:53:33,914 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 19:53:33,916 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 19:53:33,917 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 19:53:33,919 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 19:53:33,921 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 19:53:33,923 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 19:53:33,925 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 19:53:33,926 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 19:53:33,928 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 19:53:33,929 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 19:53:33,929 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 19:53:33,930 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 19:53:33,931 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 19:53:33,932 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 19:53:33,932 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 19:53:33,933 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 19:53:33,933 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 19:53:33,933 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 19:53:33,934 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 19:53:33,934 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_mostprecise.epf [2018-01-24 19:53:33,944 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 19:53:33,944 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 19:53:33,945 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 19:53:33,945 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 19:53:33,946 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 19:53:33,946 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 19:53:33,946 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 19:53:33,946 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 19:53:33,946 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 19:53:33,947 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 19:53:33,947 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 19:53:33,947 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 19:53:33,948 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 19:53:33,948 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 19:53:33,948 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 19:53:33,948 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 19:53:33,948 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 19:53:33,948 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 19:53:33,949 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 19:53:33,949 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 19:53:33,949 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 19:53:33,949 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 19:53:33,949 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 19:53:33,950 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 19:53:33,950 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 19:53:33,950 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 19:53:33,950 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 19:53:33,950 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 19:53:33,951 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 19:53:33,951 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 19:53:33,951 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 19:53:33,951 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 19:53:33,951 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 19:53:33,951 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 19:53:33,952 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 19:53:33,953 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 19:53:33,953 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 19:53:33,988 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 19:53:34,000 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 19:53:34,005 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 19:53:34,006 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 19:53:34,007 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 19:53:34,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:53:34,175 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 19:53:34,181 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 19:53:34,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 19:53:34,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 19:53:34,189 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 19:53:34,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:53:34" (1/1) ... [2018-01-24 19:53:34,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3565d9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:34, skipping insertion in model container [2018-01-24 19:53:34,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:53:34" (1/1) ... [2018-01-24 19:53:34,211 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:53:34,250 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:53:34,364 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:53:34,379 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:53:34,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:34 WrapperNode [2018-01-24 19:53:34,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 19:53:34,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 19:53:34,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 19:53:34,387 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 19:53:34,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:34" (1/1) ... [2018-01-24 19:53:34,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:34" (1/1) ... [2018-01-24 19:53:34,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:34" (1/1) ... [2018-01-24 19:53:34,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:34" (1/1) ... [2018-01-24 19:53:34,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:34" (1/1) ... [2018-01-24 19:53:34,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:34" (1/1) ... [2018-01-24 19:53:34,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:34" (1/1) ... [2018-01-24 19:53:34,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 19:53:34,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 19:53:34,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 19:53:34,425 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 19:53:34,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:34" (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-24 19:53:34,478 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 19:53:34,479 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 19:53:34,479 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-01-24 19:53:34,479 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 19:53:34,479 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 19:53:34,479 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 19:53:34,479 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 19:53:34,479 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 19:53:34,479 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 19:53:34,479 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 19:53:34,479 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-01-24 19:53:34,480 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 19:53:34,480 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 19:53:34,480 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 19:53:34,671 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 19:53:34,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:53:34 BoogieIcfgContainer [2018-01-24 19:53:34,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 19:53:34,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 19:53:34,672 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 19:53:34,674 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 19:53:34,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 07:53:34" (1/3) ... [2018-01-24 19:53:34,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a05e61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:53:34, skipping insertion in model container [2018-01-24 19:53:34,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:34" (2/3) ... [2018-01-24 19:53:34,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a05e61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:53:34, skipping insertion in model container [2018-01-24 19:53:34,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:53:34" (3/3) ... [2018-01-24 19:53:34,677 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:53:34,684 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 19:53:34,691 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 19:53:34,731 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 19:53:34,731 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 19:53:34,731 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 19:53:34,731 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 19:53:34,731 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 19:53:34,731 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 19:53:34,732 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 19:53:34,732 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 19:53:34,733 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 19:53:34,754 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-01-24 19:53:34,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 19:53:34,762 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:34,763 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:34,763 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:34,769 INFO L82 PathProgramCache]: Analyzing trace with hash 955833556, now seen corresponding path program 1 times [2018-01-24 19:53:34,771 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:34,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:34,817 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:34,817 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:34,817 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:34,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:35,034 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-24 19:53:35,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:35,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:53:35,037 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:35,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:53:35,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:53:35,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:53:35,051 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-01-24 19:53:35,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:35,244 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-01-24 19:53:35,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:53:35,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 19:53:35,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:35,257 INFO L225 Difference]: With dead ends: 73 [2018-01-24 19:53:35,257 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 19:53:35,261 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:53:35,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 19:53:35,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 19:53:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 19:53:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-24 19:53:35,302 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 13 [2018-01-24 19:53:35,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:35,303 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-24 19:53:35,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:53:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-24 19:53:35,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 19:53:35,304 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:35,304 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:35,305 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:35,305 INFO L82 PathProgramCache]: Analyzing trace with hash 955833557, now seen corresponding path program 1 times [2018-01-24 19:53:35,305 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:35,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:35,306 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:35,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:35,307 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:35,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:35,479 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-24 19:53:35,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:35,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:53:35,480 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:35,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:53:35,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:53:35,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:53:35,482 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-01-24 19:53:35,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:35,563 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-01-24 19:53:35,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:53:35,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 19:53:35,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:35,564 INFO L225 Difference]: With dead ends: 49 [2018-01-24 19:53:35,564 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 19:53:35,566 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 19:53:35,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 19:53:35,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 19:53:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 19:53:35,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-01-24 19:53:35,573 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 13 [2018-01-24 19:53:35,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:35,573 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-01-24 19:53:35,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:53:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-01-24 19:53:35,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 19:53:35,574 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:35,574 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:35,574 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:35,575 INFO L82 PathProgramCache]: Analyzing trace with hash -433930803, now seen corresponding path program 1 times [2018-01-24 19:53:35,575 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:35,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:35,576 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:35,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:35,576 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:35,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:35,758 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-24 19:53:35,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:35,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:53:35,758 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:35,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:53:35,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:53:35,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:53:35,759 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 5 states. [2018-01-24 19:53:35,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:35,808 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-01-24 19:53:35,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:53:35,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 19:53:35,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:35,809 INFO L225 Difference]: With dead ends: 48 [2018-01-24 19:53:35,809 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 19:53:35,810 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:53:35,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 19:53:35,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 19:53:35,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 19:53:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-01-24 19:53:35,814 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 14 [2018-01-24 19:53:35,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:35,815 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-01-24 19:53:35,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:53:35,815 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-01-24 19:53:35,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 19:53:35,815 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:35,815 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:35,816 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:35,816 INFO L82 PathProgramCache]: Analyzing trace with hash -433930804, now seen corresponding path program 1 times [2018-01-24 19:53:35,816 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:35,817 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:35,817 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:35,817 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:35,817 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:35,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:35,856 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-24 19:53:35,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:35,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:53:35,856 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:35,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:53:35,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:53:35,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:53:35,857 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 4 states. [2018-01-24 19:53:35,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:35,926 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-01-24 19:53:35,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:53:35,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 19:53:35,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:35,927 INFO L225 Difference]: With dead ends: 47 [2018-01-24 19:53:35,927 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 19:53:35,928 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-24 19:53:35,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 19:53:35,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 19:53:35,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 19:53:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-24 19:53:35,932 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 14 [2018-01-24 19:53:35,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:35,933 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-24 19:53:35,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:53:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-24 19:53:35,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 19:53:35,933 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:35,933 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:35,933 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:35,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2009852195, now seen corresponding path program 1 times [2018-01-24 19:53:35,934 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:35,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:35,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:35,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:35,935 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:35,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:35,984 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-24 19:53:35,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:35,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:53:35,984 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:35,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:53:35,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:53:35,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:53:35,986 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 5 states. [2018-01-24 19:53:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:36,048 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-01-24 19:53:36,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 19:53:36,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 19:53:36,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:36,050 INFO L225 Difference]: With dead ends: 46 [2018-01-24 19:53:36,050 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 19:53:36,050 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-24 19:53:36,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 19:53:36,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-24 19:53:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 19:53:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-01-24 19:53:36,056 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 18 [2018-01-24 19:53:36,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:36,057 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-01-24 19:53:36,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:53:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-01-24 19:53:36,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 19:53:36,058 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:36,058 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:36,058 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:36,058 INFO L82 PathProgramCache]: Analyzing trace with hash 2009852196, now seen corresponding path program 1 times [2018-01-24 19:53:36,058 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:36,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:36,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:36,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:36,059 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:36,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:36,171 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-24 19:53:36,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:36,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 19:53:36,171 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:36,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 19:53:36,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 19:53:36,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:53:36,173 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 8 states. [2018-01-24 19:53:36,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:36,274 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-24 19:53:36,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 19:53:36,274 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 19:53:36,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:36,276 INFO L225 Difference]: With dead ends: 61 [2018-01-24 19:53:36,277 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 19:53:36,277 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-24 19:53:36,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 19:53:36,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2018-01-24 19:53:36,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 19:53:36,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-24 19:53:36,283 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 18 [2018-01-24 19:53:36,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:36,283 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-24 19:53:36,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 19:53:36,283 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-24 19:53:36,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 19:53:36,284 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:36,284 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:36,284 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:36,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1267324412, now seen corresponding path program 1 times [2018-01-24 19:53:36,284 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:36,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:36,285 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:36,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:36,285 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:36,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:36,364 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-24 19:53:36,365 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:36,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:53:36,365 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:36,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:53:36,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:53:36,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:53:36,366 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 6 states. [2018-01-24 19:53:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:36,455 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-01-24 19:53:36,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:53:36,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-24 19:53:36,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:36,489 INFO L225 Difference]: With dead ends: 50 [2018-01-24 19:53:36,489 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 19:53:36,490 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:53:36,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 19:53:36,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 19:53:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 19:53:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-24 19:53:36,494 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 20 [2018-01-24 19:53:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:36,494 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-24 19:53:36,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:53:36,494 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-24 19:53:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 19:53:36,495 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:36,495 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:36,495 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:36,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1267324411, now seen corresponding path program 1 times [2018-01-24 19:53:36,495 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:36,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:36,496 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:36,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:36,496 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:36,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:36,595 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-24 19:53:36,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:36,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 19:53:36,595 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:36,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 19:53:36,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 19:53:36,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 19:53:36,596 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 9 states. [2018-01-24 19:53:36,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:36,706 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-01-24 19:53:36,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 19:53:36,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-24 19:53:36,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:36,707 INFO L225 Difference]: With dead ends: 50 [2018-01-24 19:53:36,707 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 19:53:36,707 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 19:53:36,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 19:53:36,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 19:53:36,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 19:53:36,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-24 19:53:36,714 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 20 [2018-01-24 19:53:36,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:36,714 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-24 19:53:36,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 19:53:36,714 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-24 19:53:36,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 19:53:36,715 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:36,715 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-24 19:53:36,715 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:36,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1871951781, now seen corresponding path program 1 times [2018-01-24 19:53:36,716 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:36,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:36,717 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:36,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:36,717 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:36,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:36,774 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-24 19:53:36,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:36,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:53:36,775 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:36,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:53:36,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:53:36,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:53:36,776 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-01-24 19:53:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:36,847 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-01-24 19:53:36,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:53:36,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 19:53:36,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:36,848 INFO L225 Difference]: With dead ends: 49 [2018-01-24 19:53:36,848 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 19:53:36,849 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:53:36,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 19:53:36,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 19:53:36,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 19:53:36,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-01-24 19:53:36,855 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 22 [2018-01-24 19:53:36,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:36,855 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-01-24 19:53:36,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:53:36,855 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-01-24 19:53:36,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 19:53:36,856 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:36,856 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-24 19:53:36,856 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:36,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1871951782, now seen corresponding path program 1 times [2018-01-24 19:53:36,857 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:36,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:36,858 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:36,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:36,858 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:36,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:37,096 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-24 19:53:37,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:37,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 19:53:37,096 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:37,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 19:53:37,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 19:53:37,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:53:37,097 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 8 states. [2018-01-24 19:53:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:37,316 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-01-24 19:53:37,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 19:53:37,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-24 19:53:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:37,317 INFO L225 Difference]: With dead ends: 58 [2018-01-24 19:53:37,317 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 19:53:37,318 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 19:53:37,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 19:53:37,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-01-24 19:53:37,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 19:53:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-24 19:53:37,328 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 22 [2018-01-24 19:53:37,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:37,328 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-24 19:53:37,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 19:53:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-24 19:53:37,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 19:53:37,329 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:37,329 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:37,330 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:37,330 INFO L82 PathProgramCache]: Analyzing trace with hash -645685358, now seen corresponding path program 1 times [2018-01-24 19:53:37,330 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:37,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:37,331 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:37,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:37,331 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:37,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:37,390 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-24 19:53:37,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:37,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:53:37,391 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:37,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:53:37,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:53:37,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:53:37,391 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-01-24 19:53:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:37,446 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-01-24 19:53:37,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:53:37,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 19:53:37,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:37,447 INFO L225 Difference]: With dead ends: 49 [2018-01-24 19:53:37,447 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 19:53:37,448 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:53:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 19:53:37,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 19:53:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 19:53:37,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-01-24 19:53:37,451 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 24 [2018-01-24 19:53:37,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:37,451 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-01-24 19:53:37,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:53:37,451 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-01-24 19:53:37,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 19:53:37,452 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:37,452 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:37,452 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:37,452 INFO L82 PathProgramCache]: Analyzing trace with hash -645685357, now seen corresponding path program 1 times [2018-01-24 19:53:37,452 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:37,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:37,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:37,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:37,453 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:37,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:37,545 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-24 19:53:37,545 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:37,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 19:53:37,545 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:37,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 19:53:37,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 19:53:37,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 19:53:37,546 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 9 states. [2018-01-24 19:53:37,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:37,691 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-01-24 19:53:37,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 19:53:37,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-01-24 19:53:37,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:37,692 INFO L225 Difference]: With dead ends: 58 [2018-01-24 19:53:37,692 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 19:53:37,692 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-01-24 19:53:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 19:53:37,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2018-01-24 19:53:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 19:53:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-24 19:53:37,696 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 24 [2018-01-24 19:53:37,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:37,697 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-24 19:53:37,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 19:53:37,697 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-24 19:53:37,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 19:53:37,698 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:37,698 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:37,698 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:37,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1460131898, now seen corresponding path program 1 times [2018-01-24 19:53:37,698 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:37,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:37,699 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:37,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:37,700 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:37,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:53:37,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:37,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 19:53:37,954 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:37,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 19:53:37,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 19:53:37,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-24 19:53:37,954 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 12 states. [2018-01-24 19:53:38,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:38,218 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-01-24 19:53:38,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 19:53:38,219 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-01-24 19:53:38,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:38,219 INFO L225 Difference]: With dead ends: 106 [2018-01-24 19:53:38,219 INFO L226 Difference]: Without dead ends: 81 [2018-01-24 19:53:38,220 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-01-24 19:53:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-24 19:53:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-01-24 19:53:38,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-24 19:53:38,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-01-24 19:53:38,226 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 25 [2018-01-24 19:53:38,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:38,226 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-01-24 19:53:38,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 19:53:38,227 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-01-24 19:53:38,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 19:53:38,228 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:38,228 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:38,228 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:38,228 INFO L82 PathProgramCache]: Analyzing trace with hash -228811844, now seen corresponding path program 1 times [2018-01-24 19:53:38,228 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:38,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:38,229 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:38,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:38,230 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:38,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:38,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:53:38,481 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:53:38,481 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:53:38,482 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-24 19:53:38,484 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [11], [12], [19], [20], [26], [42], [47], [51], [55], [56], [57], [58], [59], [62], [73], [74], [75], [77] [2018-01-24 19:53:38,544 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:53:38,544 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