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/cstrcspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 19:45:35,874 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 19:45:35,875 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 19:45:35,888 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 19:45:35,888 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 19:45:35,889 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 19:45:35,890 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 19:45:35,892 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 19:45:35,894 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 19:45:35,895 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 19:45:35,896 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 19:45:35,896 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 19:45:35,897 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 19:45:35,897 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 19:45:35,898 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 19:45:35,901 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 19:45:35,903 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 19:45:35,905 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 19:45:35,906 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 19:45:35,908 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 19:45:35,910 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 19:45:35,910 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 19:45:35,910 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 19:45:35,911 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 19:45:35,912 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 19:45:35,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 19:45:35,914 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 19:45:35,914 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 19:45:35,915 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 19:45:35,915 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 19:45:35,915 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 19:45:35,916 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:45:35,926 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 19:45:35,926 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 19:45:35,927 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 19:45:35,927 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 19:45:35,927 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 19:45:35,928 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 19:45:35,928 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 19:45:35,928 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 19:45:35,928 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 19:45:35,929 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 19:45:35,929 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 19:45:35,929 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 19:45:35,929 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 19:45:35,930 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 19:45:35,930 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 19:45:35,930 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 19:45:35,930 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 19:45:35,930 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 19:45:35,931 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 19:45:35,931 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 19:45:35,931 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 19:45:35,931 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 19:45:35,931 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 19:45:35,932 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 19:45:35,932 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 19:45:35,932 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 19:45:35,932 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 19:45:35,932 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 19:45:35,933 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 19:45:35,933 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 19:45:35,933 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 19:45:35,933 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 19:45:35,933 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 19:45:35,934 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 19:45:35,934 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 19:45:35,935 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 19:45:35,935 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 19:45:35,968 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 19:45:35,978 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 19:45:35,982 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 19:45:35,983 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 19:45:35,983 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 19:45:35,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:45:36,141 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 19:45:36,146 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 19:45:36,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 19:45:36,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 19:45:36,152 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 19:45:36,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:45:36" (1/1) ... [2018-01-24 19:45:36,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@131c1c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:36, skipping insertion in model container [2018-01-24 19:45:36,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:45:36" (1/1) ... [2018-01-24 19:45:36,170 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:45:36,209 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:45:36,327 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:45:36,350 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:45:36,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:36 WrapperNode [2018-01-24 19:45:36,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 19:45:36,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 19:45:36,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 19:45:36,360 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 19:45:36,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:36" (1/1) ... [2018-01-24 19:45:36,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:36" (1/1) ... [2018-01-24 19:45:36,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:36" (1/1) ... [2018-01-24 19:45:36,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:36" (1/1) ... [2018-01-24 19:45:36,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:36" (1/1) ... [2018-01-24 19:45:36,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:36" (1/1) ... [2018-01-24 19:45:36,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:36" (1/1) ... [2018-01-24 19:45:36,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 19:45:36,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 19:45:36,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 19:45:36,398 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 19:45:36,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:36" (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:45:36,446 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 19:45:36,446 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 19:45:36,446 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-01-24 19:45:36,447 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 19:45:36,447 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 19:45:36,447 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 19:45:36,447 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 19:45:36,447 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 19:45:36,447 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 19:45:36,447 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 19:45:36,447 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-01-24 19:45:36,447 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 19:45:36,447 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 19:45:36,448 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 19:45:36,704 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 19:45:36,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:45:36 BoogieIcfgContainer [2018-01-24 19:45:36,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 19:45:36,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 19:45:36,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 19:45:36,708 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 19:45:36,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 07:45:36" (1/3) ... [2018-01-24 19:45:36,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d2d93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:45:36, skipping insertion in model container [2018-01-24 19:45:36,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:36" (2/3) ... [2018-01-24 19:45:36,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d2d93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:45:36, skipping insertion in model container [2018-01-24 19:45:36,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:45:36" (3/3) ... [2018-01-24 19:45:36,711 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:45:36,717 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 19:45:36,724 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 19:45:36,760 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 19:45:36,760 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 19:45:36,760 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 19:45:36,760 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 19:45:36,760 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 19:45:36,760 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 19:45:36,760 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 19:45:36,761 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 19:45:36,761 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 19:45:36,778 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-24 19:45:36,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 19:45:36,784 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:36,785 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:45:36,785 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:45:36,789 INFO L82 PathProgramCache]: Analyzing trace with hash -21044599, now seen corresponding path program 1 times [2018-01-24 19:45:36,791 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:36,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:36,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:36,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:36,832 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:36,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:37,014 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:45:37,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:37,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:45:37,016 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:37,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:45:37,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:45:37,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:45:37,108 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-01-24 19:45:37,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:37,298 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2018-01-24 19:45:37,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:45:37,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 19:45:37,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:37,308 INFO L225 Difference]: With dead ends: 96 [2018-01-24 19:45:37,308 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 19:45:37,312 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:45:37,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 19:45:37,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 19:45:37,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 19:45:37,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-24 19:45:37,347 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-01-24 19:45:37,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:37,347 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-24 19:45:37,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:45:37,348 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-24 19:45:37,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 19:45:37,348 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:37,348 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:45:37,348 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:45:37,349 INFO L82 PathProgramCache]: Analyzing trace with hash -21044598, now seen corresponding path program 1 times [2018-01-24 19:45:37,349 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:37,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:37,350 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:37,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:37,350 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:37,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:45:37,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:37,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:45:37,506 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:37,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:45:37,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:45:37,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:45:37,508 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-01-24 19:45:37,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:37,585 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-01-24 19:45:37,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:45:37,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 19:45:37,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:37,587 INFO L225 Difference]: With dead ends: 54 [2018-01-24 19:45:37,587 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 19:45:37,588 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:45:37,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 19:45:37,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 19:45:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 19:45:37,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-01-24 19:45:37,596 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-01-24 19:45:37,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:37,597 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-01-24 19:45:37,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:45:37,597 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-01-24 19:45:37,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 19:45:37,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:37,598 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:45:37,598 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:45:37,598 INFO L82 PathProgramCache]: Analyzing trace with hash -652382516, now seen corresponding path program 1 times [2018-01-24 19:45:37,598 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:37,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:37,599 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:37,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:37,600 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:37,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:37,645 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:45:37,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:37,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:45:37,645 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:37,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:45:37,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:45:37,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:45:37,647 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-01-24 19:45:37,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:37,717 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-01-24 19:45:37,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:45:37,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 19:45:37,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:37,719 INFO L225 Difference]: With dead ends: 53 [2018-01-24 19:45:37,719 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 19:45:37,720 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:45:37,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 19:45:37,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 19:45:37,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 19:45:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-24 19:45:37,727 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-01-24 19:45:37,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:37,727 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-24 19:45:37,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:45:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-24 19:45:37,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 19:45:37,728 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:37,728 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:45:37,729 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:45:37,729 INFO L82 PathProgramCache]: Analyzing trace with hash -652382515, now seen corresponding path program 1 times [2018-01-24 19:45:37,729 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:37,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:37,730 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:37,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:37,730 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:37,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:37,810 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:45:37,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:37,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:45:37,810 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:37,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:45:37,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:45:37,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:45:37,811 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-24 19:45:37,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:37,882 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-24 19:45:37,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:45:37,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 19:45:37,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:37,884 INFO L225 Difference]: With dead ends: 52 [2018-01-24 19:45:37,884 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 19:45:37,884 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-24 19:45:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 19:45:37,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 19:45:37,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 19:45:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-24 19:45:37,889 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-01-24 19:45:37,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:37,890 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-24 19:45:37,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:45:37,890 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-24 19:45:37,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 19:45:37,891 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:37,891 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:45:37,891 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:45:37,891 INFO L82 PathProgramCache]: Analyzing trace with hash 470787565, now seen corresponding path program 1 times [2018-01-24 19:45:37,891 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:37,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:37,892 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:37,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:37,892 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:37,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:37,939 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:45:37,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:37,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:45:37,940 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:37,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:45:37,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:45:37,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:45:37,941 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-01-24 19:45:38,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:38,016 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-24 19:45:38,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 19:45:38,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 19:45:38,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:38,017 INFO L225 Difference]: With dead ends: 51 [2018-01-24 19:45:38,017 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 19:45:38,017 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:45:38,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 19:45:38,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 19:45:38,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 19:45:38,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-24 19:45:38,022 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-01-24 19:45:38,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:38,022 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-24 19:45:38,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:45:38,023 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-24 19:45:38,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 19:45:38,023 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:38,023 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:45:38,023 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:45:38,024 INFO L82 PathProgramCache]: Analyzing trace with hash 470787566, now seen corresponding path program 1 times [2018-01-24 19:45:38,024 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:38,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:38,025 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:38,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:38,025 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:38,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:38,130 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:45:38,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:38,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 19:45:38,158 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:38,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 19:45:38,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 19:45:38,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:45:38,158 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-01-24 19:45:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:38,277 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-01-24 19:45:38,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 19:45:38,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 19:45:38,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:38,281 INFO L225 Difference]: With dead ends: 75 [2018-01-24 19:45:38,282 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 19:45:38,282 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:45:38,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 19:45:38,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-01-24 19:45:38,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 19:45:38,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-01-24 19:45:38,289 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2018-01-24 19:45:38,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:38,290 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-01-24 19:45:38,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 19:45:38,290 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-01-24 19:45:38,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 19:45:38,291 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:38,291 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-24 19:45:38,291 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:45:38,291 INFO L82 PathProgramCache]: Analyzing trace with hash 947097224, now seen corresponding path program 1 times [2018-01-24 19:45:38,292 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:38,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:38,293 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:38,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:38,293 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:38,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:38,342 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:45:38,342 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:38,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:45:38,342 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:38,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:45:38,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:45:38,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:45:38,343 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-01-24 19:45:38,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:38,434 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-01-24 19:45:38,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:45:38,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-24 19:45:38,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:38,436 INFO L225 Difference]: With dead ends: 56 [2018-01-24 19:45:38,437 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 19:45:38,437 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:45:38,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 19:45:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-01-24 19:45:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 19:45:38,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-24 19:45:38,443 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-01-24 19:45:38,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:38,443 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-24 19:45:38,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:45:38,444 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-24 19:45:38,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 19:45:38,444 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:38,445 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-24 19:45:38,445 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:45:38,445 INFO L82 PathProgramCache]: Analyzing trace with hash 947097225, now seen corresponding path program 1 times [2018-01-24 19:45:38,445 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:38,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:38,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:38,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:38,446 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:38,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:38,649 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:45:38,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:38,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 19:45:38,650 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:38,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 19:45:38,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 19:45:38,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 19:45:38,651 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-01-24 19:45:38,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:38,764 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-24 19:45:38,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 19:45:38,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-01-24 19:45:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:38,766 INFO L225 Difference]: With dead ends: 70 [2018-01-24 19:45:38,766 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 19:45:38,766 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-24 19:45:38,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 19:45:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-01-24 19:45:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 19:45:38,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-01-24 19:45:38,773 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2018-01-24 19:45:38,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:38,774 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-01-24 19:45:38,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 19:45:38,774 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-01-24 19:45:38,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 19:45:38,775 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:38,775 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:45:38,775 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:45:38,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1236428998, now seen corresponding path program 1 times [2018-01-24 19:45:38,776 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:38,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:38,777 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:38,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:38,777 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:38,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:38,884 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:45:38,884 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:38,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:45:38,884 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:38,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:45:38,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:45:38,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:45:38,885 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 6 states. [2018-01-24 19:45:39,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:39,029 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-01-24 19:45:39,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 19:45:39,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-24 19:45:39,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:39,031 INFO L225 Difference]: With dead ends: 58 [2018-01-24 19:45:39,031 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 19:45:39,031 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:45:39,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 19:45:39,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 19:45:39,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 19:45:39,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-01-24 19:45:39,038 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2018-01-24 19:45:39,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:39,038 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-01-24 19:45:39,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:45:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-01-24 19:45:39,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 19:45:39,039 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:39,040 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, 1, 1, 1] [2018-01-24 19:45:39,040 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:45:39,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1333847614, now seen corresponding path program 1 times [2018-01-24 19:45:39,040 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:39,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:39,041 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:39,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:39,041 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:39,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:39,071 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:45:39,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:39,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:45:39,071 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:39,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 19:45:39,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 19:45:39,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 19:45:39,072 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2018-01-24 19:45:39,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:39,081 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2018-01-24 19:45:39,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 19:45:39,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-24 19:45:39,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:39,082 INFO L225 Difference]: With dead ends: 78 [2018-01-24 19:45:39,082 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 19:45:39,082 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-24 19:45:39,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 19:45:39,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 19:45:39,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 19:45:39,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-24 19:45:39,089 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-01-24 19:45:39,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:39,090 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-24 19:45:39,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 19:45:39,090 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-24 19:45:39,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 19:45:39,091 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:39,091 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, 1, 1, 1, 1, 1] [2018-01-24 19:45:39,092 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:45:39,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1745742785, now seen corresponding path program 1 times [2018-01-24 19:45:39,092 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:39,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:39,093 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:39,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:39,093 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:39,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 19:45:39,336 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:39,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 19:45:39,337 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:39,337 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 19:45:39,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 19:45:39,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-24 19:45:39,337 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2018-01-24 19:45:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:39,527 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-01-24 19:45:39,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 19:45:39,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-24 19:45:39,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:39,528 INFO L225 Difference]: With dead ends: 93 [2018-01-24 19:45:39,528 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 19:45:39,528 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-01-24 19:45:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 19:45:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 19:45:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 19:45:39,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 19:45:39,533 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 30 [2018-01-24 19:45:39,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:39,533 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 19:45:39,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 19:45:39,533 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 19:45:39,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 19:45:39,534 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:39,534 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, 1, 1, 1, 1, 1] [2018-01-24 19:45:39,534 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:45:39,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1611729279, now seen corresponding path program 1 times [2018-01-24 19:45:39,534 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:39,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:39,535 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:39,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:39,535 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:39,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:39,702 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:45:39,702 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:39,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 19:45:39,702 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:39,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 19:45:39,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 19:45:39,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-24 19:45:39,703 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 11 states. [2018-01-24 19:45:39,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:39,877 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-01-24 19:45:39,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 19:45:39,878 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-24 19:45:39,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:39,878 INFO L225 Difference]: With dead ends: 107 [2018-01-24 19:45:39,878 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 19:45:39,879 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-01-24 19:45:39,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 19:45:39,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-01-24 19:45:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 19:45:39,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-01-24 19:45:39,888 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 30 [2018-01-24 19:45:39,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:39,888 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-01-24 19:45:39,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 19:45:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-01-24 19:45:39,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 19:45:39,890 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:39,890 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, 1, 1, 1, 1, 1] [2018-01-24 19:45:39,890 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:45:39,890 INFO L82 PathProgramCache]: Analyzing trace with hash -193709055, now seen corresponding path program 1 times [2018-01-24 19:45:39,890 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:39,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:39,891 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:39,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:39,892 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:39,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:40,088 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:45:40,088 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:45:40,089 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:45:40,089 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-24 19:45:40,092 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [14], [15], [18], [22], [24], [26], [27], [30], [31], [34], [42], [63], [68], [74], [76], [77], [78], [79], [80], [83], [94], [95], [96], [98] [2018-01-24 19:45:40,136 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:45:40,137 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 19:46:08,076 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 19:46:08,104 INFO L268 AbstractInterpreter]: Visited 29 different actions 45 times. Merged at 8 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-01-24 19:46:08,125 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 19:46:08,125 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:46:08,126 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-24 19:46:08,138 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:46:08,138 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:46:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:46:08,179 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:46:08,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 19:46:08,246 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-24 19:46:08,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:46:08,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:08,272 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-24 19:46:08,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 19:46:08,459 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 18 treesize of output 14 [2018-01-24 19:46:08,469 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-24 19:46:08,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:46:08,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:46:08,492 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-24 19:46:08,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 19:46:08,636 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:46:08,636 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:46:09,110 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-24 19:46:09,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:46:09,146 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-24 19:46:09,198 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-24 19:46:09,198 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 19:46:09,200 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:09,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:09,220 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 19:46:09,253 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:46:09,290 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:46:09,290 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-24 19:46:09,297 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:46:09,297 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:46:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:46:09,392 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:46:09,401 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-24 19:46:09,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:46:09,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:09,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 19:46:09,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 19:46:09,473 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-24 19:46:09,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:46:09,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:09,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:09,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 19:46:09,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 19:46:09,615 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-24 19:46:09,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:46:09,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:46:09,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:46:09,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2018-01-24 19:46:09,750 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:46:09,751 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:46:09,846 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-24 19:46:09,854 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-24 19:46:09,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:46:09,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:09,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:46:09,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 19:46:09,998 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:46:10,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 19:46:10,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10, 12, 12] total 41 [2018-01-24 19:46:10,000 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 19:46:10,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 19:46:10,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 19:46:10,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1559, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 19:46:10,002 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 20 states. [2018-01-24 19:46:10,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:46:10,856 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-01-24 19:46:10,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 19:46:10,856 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-01-24 19:46:10,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:46:10,858 INFO L225 Difference]: With dead ends: 106 [2018-01-24 19:46:10,859 INFO L226 Difference]: Without dead ends: 103 [2018-01-24 19:46:10,860 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=320, Invalid=2332, Unknown=0, NotChecked=0, Total=2652 [2018-01-24 19:46:10,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-24 19:46:10,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2018-01-24 19:46:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 19:46:10,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-01-24 19:46:10,874 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 30 [2018-01-24 19:46:10,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:46:10,874 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-01-24 19:46:10,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 19:46:10,874 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-01-24 19:46:10,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 19:46:10,875 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:46:10,875 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, 1, 1, 1, 1, 1, 1] [2018-01-24 19:46:10,875 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:46:10,876 INFO L82 PathProgramCache]: Analyzing trace with hash -276872451, now seen corresponding path program 1 times [2018-01-24 19:46:10,876 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:46:10,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:46:10,877 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:46:10,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:46:10,877 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:46:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:46:10,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:46:11,182 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:46:11,182 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:46:11,182 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:46:11,183 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-01-24 19:46:11,183 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [9], [14], [15], [18], [22], [24], [27], [36], [40], [46], [52], [54], [63], [68], [72], [76], [77], [78], [79], [80], [83], [94], [95], [96], [98] [2018-01-24 19:46:11,184 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:46:11,184 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