java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:35:44,029 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:35:44,031 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:35:44,046 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:35:44,046 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:35:44,047 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:35:44,048 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:35:44,050 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:35:44,052 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:35:44,053 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:35:44,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:35:44,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:35:44,055 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:35:44,056 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:35:44,057 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:35:44,059 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:35:44,061 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:35:44,063 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:35:44,065 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:35:44,066 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:35:44,068 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:35:44,068 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:35:44,069 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:35:44,070 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:35:44,070 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:35:44,072 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:35:44,072 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:35:44,072 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:35:44,073 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:35:44,073 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:35:44,073 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:35:44,074 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 05:35:44,082 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:35:44,082 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:35:44,083 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:35:44,083 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:35:44,083 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:35:44,083 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:35:44,083 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:35:44,083 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:35:44,084 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:35:44,084 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:35:44,084 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:35:44,084 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:35:44,084 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:35:44,084 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:35:44,084 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:35:44,084 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:35:44,085 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:35:44,085 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:35:44,085 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:35:44,085 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:35:44,085 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:35:44,085 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:35:44,085 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:35:44,086 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:35:44,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:35:44,086 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:35:44,086 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:35:44,086 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:35:44,086 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:35:44,087 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:35:44,087 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:35:44,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:35:44,087 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:35:44,087 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:35:44,088 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:35:44,088 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:35:44,119 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:35:44,130 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:35:44,133 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:35:44,134 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:35:44,134 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:35:44,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-free.i [2018-01-25 05:35:44,305 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:35:44,310 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:35:44,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:35:44,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:35:44,316 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:35:44,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:35:44" (1/1) ... [2018-01-25 05:35:44,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7accd80d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:35:44, skipping insertion in model container [2018-01-25 05:35:44,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:35:44" (1/1) ... [2018-01-25 05:35:44,333 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:35:44,371 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:35:44,482 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:35:44,498 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:35:44,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:35:44 WrapperNode [2018-01-25 05:35:44,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:35:44,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:35:44,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:35:44,507 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:35:44,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:35:44" (1/1) ... [2018-01-25 05:35:44,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:35:44" (1/1) ... [2018-01-25 05:35:44,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:35:44" (1/1) ... [2018-01-25 05:35:44,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:35:44" (1/1) ... [2018-01-25 05:35:44,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:35:44" (1/1) ... [2018-01-25 05:35:44,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:35:44" (1/1) ... [2018-01-25 05:35:44,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:35:44" (1/1) ... [2018-01-25 05:35:44,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:35:44,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:35:44,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:35:44,543 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:35:44,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:35:44" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:35:44,590 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:35:44,590 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:35:44,591 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-25 05:35:44,591 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:35:44,591 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:35:44,591 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:35:44,591 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:35:44,591 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:35:44,591 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:35:44,592 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:35:44,592 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:35:44,592 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-25 05:35:44,592 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:35:44,592 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:35:44,592 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:35:44,797 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:35:44,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:35:44 BoogieIcfgContainer [2018-01-25 05:35:44,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:35:44,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:35:44,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:35:44,801 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:35:44,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:35:44" (1/3) ... [2018-01-25 05:35:44,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7473b881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:35:44, skipping insertion in model container [2018-01-25 05:35:44,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:35:44" (2/3) ... [2018-01-25 05:35:44,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7473b881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:35:44, skipping insertion in model container [2018-01-25 05:35:44,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:35:44" (3/3) ... [2018-01-25 05:35:44,804 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_false-valid-free.i [2018-01-25 05:35:44,810 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:35:44,816 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-25 05:35:44,852 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:35:44,852 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:35:44,852 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:35:44,852 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:35:44,852 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:35:44,852 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:35:44,853 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:35:44,853 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:35:44,853 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:35:44,870 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-01-25 05:35:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-25 05:35:44,876 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:35:44,877 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:35:44,877 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:35:44,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989713, now seen corresponding path program 1 times [2018-01-25 05:35:44,882 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:35:44,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:44,922 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:35:44,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:44,922 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:35:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:44,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:35:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:45,065 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:35:45,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:35:45,065 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:35:45,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:35:45,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:35:45,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:35:45,085 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-01-25 05:35:45,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:35:45,301 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-01-25 05:35:45,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:35:45,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-01-25 05:35:45,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:35:45,314 INFO L225 Difference]: With dead ends: 84 [2018-01-25 05:35:45,314 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 05:35:45,318 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:35:45,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 05:35:45,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 05:35:45,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 05:35:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-01-25 05:35:45,346 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 11 [2018-01-25 05:35:45,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:35:45,347 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-01-25 05:35:45,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:35:45,347 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-01-25 05:35:45,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-25 05:35:45,347 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:35:45,348 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:35:45,348 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:35:45,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989714, now seen corresponding path program 1 times [2018-01-25 05:35:45,348 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:35:45,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:45,349 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:35:45,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:45,349 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:35:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:45,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:35:45,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:45,481 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:35:45,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:35:45,481 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:35:45,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:35:45,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:35:45,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:35:45,484 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 5 states. [2018-01-25 05:35:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:35:45,590 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-01-25 05:35:45,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:35:45,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-01-25 05:35:45,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:35:45,592 INFO L225 Difference]: With dead ends: 49 [2018-01-25 05:35:45,592 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 05:35:45,593 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:35:45,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 05:35:45,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 05:35:45,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 05:35:45,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-01-25 05:35:45,599 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 11 [2018-01-25 05:35:45,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:35:45,599 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-01-25 05:35:45,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:35:45,600 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-01-25 05:35:45,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 05:35:45,600 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:35:45,600 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:35:45,600 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:35:45,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525484, now seen corresponding path program 1 times [2018-01-25 05:35:45,601 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:35:45,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:45,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:35:45,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:45,602 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:35:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:45,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:35:45,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:45,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:35:45,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:35:45,690 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:35:45,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:35:45,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:35:45,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:35:45,691 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 6 states. [2018-01-25 05:35:45,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:35:45,810 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-01-25 05:35:45,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:35:45,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-01-25 05:35:45,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:35:45,811 INFO L225 Difference]: With dead ends: 48 [2018-01-25 05:35:45,811 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 05:35:45,812 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:35:45,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 05:35:45,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-25 05:35:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-25 05:35:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-01-25 05:35:45,817 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 17 [2018-01-25 05:35:45,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:35:45,817 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-01-25 05:35:45,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:35:45,817 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-01-25 05:35:45,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 05:35:45,818 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:35:45,818 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:35:45,818 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:35:45,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525483, now seen corresponding path program 1 times [2018-01-25 05:35:45,818 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:35:45,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:45,819 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:35:45,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:45,819 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:35:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:45,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:35:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:45,958 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:35:45,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:35:45,958 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:35:45,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:35:45,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:35:45,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:35:45,960 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 7 states. [2018-01-25 05:35:46,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:35:46,076 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-01-25 05:35:46,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:35:46,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-01-25 05:35:46,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:35:46,078 INFO L225 Difference]: With dead ends: 80 [2018-01-25 05:35:46,078 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 05:35:46,078 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:35:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 05:35:46,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-01-25 05:35:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 05:35:46,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-01-25 05:35:46,087 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 17 [2018-01-25 05:35:46,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:35:46,087 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-01-25 05:35:46,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:35:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-01-25 05:35:46,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 05:35:46,088 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:35:46,088 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:35:46,088 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:35:46,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2106816852, now seen corresponding path program 1 times [2018-01-25 05:35:46,089 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:35:46,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:46,090 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:35:46,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:46,090 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:35:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:46,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:35:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:46,266 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:46,266 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:35:46,267 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-01-25 05:35:46,269 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [16], [42], [43], [44], [45], [46], [47], [50], [76], [77], [78], [80] [2018-01-25 05:35:46,321 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:35:46,321 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:35:47,680 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:35:47,682 INFO L268 AbstractInterpreter]: Visited 19 different actions 28 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-25 05:35:47,724 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:35:47,724 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:47,724 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:35:47,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:35:47,739 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:35:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:47,780 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:35:47,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:35:47,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:47,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:35:47,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-25 05:35:47,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-25 05:35:47,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:47,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:35:47,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-01-25 05:35:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:48,219 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:35:49,332 WARN L143 SmtUtils]: Spent 269ms on a formula simplification that was a NOOP. DAG size: 17 [2018-01-25 05:35:49,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-01-25 05:35:49,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-25 05:35:49,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:49,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:35:49,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:35:49,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-01-25 05:35:49,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:49,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:49,450 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:35:49,454 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:35:49,455 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:35:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:49,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:35:49,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:35:49,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:49,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:35:49,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:49,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:35:49,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-25 05:35:49,572 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:35:49,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-25 05:35:49,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:49,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:35:49,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:35:49,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:35:49,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:49,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-25 05:35:49,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-01-25 05:35:49,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:49,753 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:35:49,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-01-25 05:35:49,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:49,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-01-25 05:35:49,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-25 05:35:49,958 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:49,960 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:35:49,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:35:49,963 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-01-25 05:35:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:49,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:35:49,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7, 7, 7] total 24 [2018-01-25 05:35:49,972 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:35:49,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 05:35:49,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 05:35:49,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=476, Unknown=2, NotChecked=0, Total=600 [2018-01-25 05:35:49,974 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 12 states. [2018-01-25 05:35:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:35:50,259 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-01-25 05:35:50,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:35:50,260 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-01-25 05:35:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:35:50,261 INFO L225 Difference]: With dead ends: 90 [2018-01-25 05:35:50,261 INFO L226 Difference]: Without dead ends: 63 [2018-01-25 05:35:50,262 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=162, Invalid=592, Unknown=2, NotChecked=0, Total=756 [2018-01-25 05:35:50,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-25 05:35:50,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2018-01-25 05:35:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 05:35:50,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-25 05:35:50,269 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 21 [2018-01-25 05:35:50,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:35:50,270 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-25 05:35:50,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 05:35:50,270 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-25 05:35:50,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 05:35:50,271 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:35:50,271 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:35:50,271 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:35:50,272 INFO L82 PathProgramCache]: Analyzing trace with hash -702775421, now seen corresponding path program 2 times [2018-01-25 05:35:50,272 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:35:50,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:50,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:35:50,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:50,273 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:35:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:50,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:35:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:50,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:50,445 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:35:50,445 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:35:50,445 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:35:50,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:50,446 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:35:50,451 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:35:50,451 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:35:50,467 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:35:50,476 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:35:50,478 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:35:50,480 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:35:50,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:35:50,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:50,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:35:50,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:50,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:35:50,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-25 05:35:50,526 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:35:50,526 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:35:50,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:35:50,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:50,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-25 05:35:50,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:50,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:35:50,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-01-25 05:35:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:50,722 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:35:50,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-01-25 05:35:50,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:50,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-01-25 05:35:50,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-25 05:35:50,937 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:50,938 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:35:50,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:35:50,941 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-01-25 05:35:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:50,978 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:50,978 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:35:50,981 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:35:50,981 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:35:51,000 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:35:51,029 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:35:51,040 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:35:51,045 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:35:51,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:35:51,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:51,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:35:51,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:51,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:35:51,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-25 05:35:51,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:35:51,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-25 05:35:51,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:51,124 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:35:51,125 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:35:51,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:35:51,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:51,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-25 05:35:51,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-01-25 05:35:51,179 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:51,179 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:35:51,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-01-25 05:35:51,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:51,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-01-25 05:35:51,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-25 05:35:51,248 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:51,249 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:35:51,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:35:51,251 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-01-25 05:35:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:51,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:35:51,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8, 8, 8] total 23 [2018-01-25 05:35:51,260 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:35:51,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 05:35:51,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 05:35:51,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2018-01-25 05:35:51,261 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 17 states. [2018-01-25 05:35:51,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:35:51,764 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-01-25 05:35:51,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:35:51,764 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-01-25 05:35:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:35:51,765 INFO L225 Difference]: With dead ends: 104 [2018-01-25 05:35:51,765 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 05:35:51,765 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 [2018-01-25 05:35:51,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 05:35:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2018-01-25 05:35:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 05:35:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-01-25 05:35:51,773 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 25 [2018-01-25 05:35:51,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:35:51,774 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-01-25 05:35:51,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 05:35:51,774 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-01-25 05:35:51,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:35:51,775 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:35:51,775 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:35:51,775 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:35:51,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1827026138, now seen corresponding path program 3 times [2018-01-25 05:35:51,776 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:35:51,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:51,777 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:35:51,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:51,777 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:35:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:51,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:35:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:51,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:51,996 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:35:51,997 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:35:51,997 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:35:51,997 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:51,997 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:35:52,006 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 05:35:52,006 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 05:35:52,021 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:52,035 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:52,043 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:35:52,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:35:52,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:35:52,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:52,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:35:52,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:52,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:35:52,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-25 05:35:52,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:35:52,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:35:52,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:35:52,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:52,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-25 05:35:52,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:52,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:35:52,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-25 05:35:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 05:35:52,282 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:35:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 05:35:52,491 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:52,492 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:35:52,494 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 05:35:52,495 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 05:35:52,512 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:52,540 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:52,550 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:35:52,554 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:35:52,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:35:52,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:52,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:35:52,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:52,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:35:52,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-25 05:35:52,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:35:52,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:35:52,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:35:52,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:52,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-25 05:35:52,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:52,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:35:52,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:22 [2018-01-25 05:35:52,762 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 05:35:52,763 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:35:52,977 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 05:35:52,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:35:52,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7, 7, 7] total 29 [2018-01-25 05:35:52,979 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:35:52,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 05:35:52,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 05:35:52,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2018-01-25 05:35:52,980 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 18 states. [2018-01-25 05:35:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:35:53,745 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-01-25 05:35:53,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:35:53,746 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2018-01-25 05:35:53,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:35:53,749 INFO L225 Difference]: With dead ends: 125 [2018-01-25 05:35:53,750 INFO L226 Difference]: Without dead ends: 90 [2018-01-25 05:35:53,751 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=338, Invalid=1302, Unknown=0, NotChecked=0, Total=1640 [2018-01-25 05:35:53,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-25 05:35:53,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2018-01-25 05:35:53,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 05:35:53,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-25 05:35:53,762 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 29 [2018-01-25 05:35:53,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:35:53,763 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-25 05:35:53,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 05:35:53,763 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-25 05:35:53,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-25 05:35:53,764 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:35:53,764 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:35:53,764 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:35:53,765 INFO L82 PathProgramCache]: Analyzing trace with hash -645884181, now seen corresponding path program 1 times [2018-01-25 05:35:53,765 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:35:53,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:53,766 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:35:53,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:53,766 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:35:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:53,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:35:53,906 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:53,907 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:53,907 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:35:53,907 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-01-25 05:35:53,907 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [12], [16], [20], [24], [29], [32], [42], [43], [44], [45], [46], [47], [50], [76], [77], [78], [80] [2018-01-25 05:35:53,908 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:35:53,909 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:35:55,727 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:35:55,727 INFO L268 AbstractInterpreter]: Visited 23 different actions 41 times. Merged at 9 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-25 05:35:55,734 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:35:55,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:55,735 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:35:55,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:35:55,741 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:35:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:55,774 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:35:56,171 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:56,171 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:35:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:56,620 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:56,621 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:35:56,629 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:35:56,629 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:35:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:56,670 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:35:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:56,678 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:35:56,716 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:56,718 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:35:56,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 22 [2018-01-25 05:35:56,718 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:35:56,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 05:35:56,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 05:35:56,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=263, Unknown=0, NotChecked=0, Total=462 [2018-01-25 05:35:56,719 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 15 states. [2018-01-25 05:35:57,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:35:57,287 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2018-01-25 05:35:57,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:35:57,289 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-01-25 05:35:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:35:57,290 INFO L225 Difference]: With dead ends: 136 [2018-01-25 05:35:57,290 INFO L226 Difference]: Without dead ends: 102 [2018-01-25 05:35:57,291 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=263, Unknown=0, NotChecked=0, Total=462 [2018-01-25 05:35:57,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-25 05:35:57,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 86. [2018-01-25 05:35:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-25 05:35:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-01-25 05:35:57,302 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 40 [2018-01-25 05:35:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:35:57,302 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-01-25 05:35:57,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 05:35:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-01-25 05:35:57,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-25 05:35:57,304 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:35:57,304 INFO L322 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:35:57,304 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:35:57,304 INFO L82 PathProgramCache]: Analyzing trace with hash -2113361740, now seen corresponding path program 2 times [2018-01-25 05:35:57,304 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:35:57,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:57,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:35:57,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:57,305 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:35:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:57,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:35:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:57,582 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:57,582 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:35:57,582 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:35:57,582 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:35:57,582 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:57,583 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:35:57,605 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:35:57,605 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:35:57,618 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:35:57,631 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:35:57,634 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:35:57,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:35:57,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:57,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:35:57,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-01-25 05:35:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-25 05:35:57,944 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:35:58,190 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-25 05:35:58,211 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:35:58,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [10] total 20 [2018-01-25 05:35:58,211 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:35:58,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:35:58,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:35:58,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-01-25 05:35:58,212 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 8 states. [2018-01-25 05:35:58,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:35:58,527 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2018-01-25 05:35:58,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:35:58,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-01-25 05:35:58,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:35:58,530 INFO L225 Difference]: With dead ends: 86 [2018-01-25 05:35:58,531 INFO L226 Difference]: Without dead ends: 81 [2018-01-25 05:35:58,531 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2018-01-25 05:35:58,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-25 05:35:58,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-25 05:35:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-25 05:35:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-01-25 05:35:58,546 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 44 [2018-01-25 05:35:58,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:35:58,547 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-01-25 05:35:58,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:35:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-01-25 05:35:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-25 05:35:58,548 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:35:58,548 INFO L322 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:35:58,548 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:35:58,548 INFO L82 PathProgramCache]: Analyzing trace with hash -2113361741, now seen corresponding path program 1 times [2018-01-25 05:35:58,549 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:35:58,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:58,549 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:35:58,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:58,550 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:35:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:58,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:35:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-25 05:35:58,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:35:58,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:35:58,612 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:35:58,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:35:58,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:35:58,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:35:58,613 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 4 states. [2018-01-25 05:35:58,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:35:58,669 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-01-25 05:35:58,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:35:58,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-01-25 05:35:58,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:35:58,671 INFO L225 Difference]: With dead ends: 81 [2018-01-25 05:35:58,671 INFO L226 Difference]: Without dead ends: 79 [2018-01-25 05:35:58,671 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:35:58,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-25 05:35:58,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-25 05:35:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-25 05:35:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-01-25 05:35:58,684 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 44 [2018-01-25 05:35:58,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:35:58,684 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-01-25 05:35:58,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:35:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-01-25 05:35:58,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-25 05:35:58,686 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:35:58,686 INFO L322 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:35:58,686 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:35:58,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1791473436, now seen corresponding path program 1 times [2018-01-25 05:35:58,687 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:35:58,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:58,688 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:35:58,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:58,688 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:35:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:58,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:35:58,849 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-25 05:35:58,849 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:58,849 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:35:58,850 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2018-01-25 05:35:58,850 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [12], [16], [20], [24], [27], [29], [30], [34], [38], [42], [43], [44], [45], [46], [47], [50], [52], [65], [66], [70], [76], [77], [78], [80], [81] [2018-01-25 05:35:58,851 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:35:58,852 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:36:04,523 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:36:04,523 INFO L268 AbstractInterpreter]: Visited 31 different actions 83 times. Merged at 17 different actions 47 times. Never widened. Found 7 fixpoints after 4 different actions. Largest state had 27 variables. [2018-01-25 05:36:04,528 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:36:04,528 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:04,528 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:36:04,533 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:04,533 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:36:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:04,559 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-25 05:36:04,634 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-25 05:36:04,799 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:04,799 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 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 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:36:04,802 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:04,802 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:36:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:04,853 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-25 05:36:04,865 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-25 05:36:04,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:36:04,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11, 10, 11] total 26 [2018-01-25 05:36:04,965 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:36:04,965 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 05:36:04,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 05:36:04,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=412, Unknown=0, NotChecked=0, Total=650 [2018-01-25 05:36:04,966 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 18 states. [2018-01-25 05:36:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:05,157 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2018-01-25 05:36:05,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:36:05,157 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 73 [2018-01-25 05:36:05,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:05,159 INFO L225 Difference]: With dead ends: 130 [2018-01-25 05:36:05,159 INFO L226 Difference]: Without dead ends: 91 [2018-01-25 05:36:05,159 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 273 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=263, Invalid=439, Unknown=0, NotChecked=0, Total=702 [2018-01-25 05:36:05,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-25 05:36:05,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-01-25 05:36:05,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-25 05:36:05,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-01-25 05:36:05,172 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 73 [2018-01-25 05:36:05,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:05,172 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-01-25 05:36:05,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 05:36:05,173 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-01-25 05:36:05,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-25 05:36:05,174 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:05,174 INFO L322 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:36:05,174 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:36:05,175 INFO L82 PathProgramCache]: Analyzing trace with hash 526780668, now seen corresponding path program 2 times [2018-01-25 05:36:05,175 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:05,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:05,176 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:05,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:05,176 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:05,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-01-25 05:36:05,341 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:05,342 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:36:05,342 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:36:05,342 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:36:05,342 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:05,342 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:36:05,350 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:36:05,350 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:36:05,371 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:05,386 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:05,392 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:05,396 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:05,564 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-01-25 05:36:05,565 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:05,763 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-01-25 05:36:05,784 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:05,785 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 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 14 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:36:05,787 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:36:05,788 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:36:05,808 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:05,864 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:05,882 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:05,887 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:05,896 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-01-25 05:36:05,896 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:05,945 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-01-25 05:36:05,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:36:05,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12, 11, 12] total 29 [2018-01-25 05:36:05,947 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:36:05,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-25 05:36:05,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-25 05:36:05,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=513, Unknown=0, NotChecked=0, Total=812 [2018-01-25 05:36:05,948 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 20 states. [2018-01-25 05:36:06,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:06,069 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2018-01-25 05:36:06,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 05:36:06,070 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 81 [2018-01-25 05:36:06,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:06,071 INFO L225 Difference]: With dead ends: 142 [2018-01-25 05:36:06,071 INFO L226 Difference]: Without dead ends: 99 [2018-01-25 05:36:06,071 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 303 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=543, Unknown=0, NotChecked=0, Total=870 [2018-01-25 05:36:06,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-25 05:36:06,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-01-25 05:36:06,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-25 05:36:06,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-01-25 05:36:06,082 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 81 [2018-01-25 05:36:06,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:06,083 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-01-25 05:36:06,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-25 05:36:06,083 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-01-25 05:36:06,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-25 05:36:06,084 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:06,085 INFO L322 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:36:06,085 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:36:06,085 INFO L82 PathProgramCache]: Analyzing trace with hash -2016762916, now seen corresponding path program 3 times [2018-01-25 05:36:06,085 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:06,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:06,086 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:36:06,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:06,086 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:06,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:06,227 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-01-25 05:36:06,228 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:06,228 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:36:06,228 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:36:06,228 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:36:06,228 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:06,228 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:36:06,235 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 05:36:06,235 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 05:36:06,249 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:06,252 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:06,255 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:06,259 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:06,266 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:06,275 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:06,293 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:06,324 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:06,335 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:06,336 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:06,338 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:06,416 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-01-25 05:36:06,416 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-01-25 05:36:06,604 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:06,604 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 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 16 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:36:06,607 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 05:36:06,608 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 05:36:06,628 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:06,671 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:06,726 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:06,789 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:06,870 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:06,972 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:07,115 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:07,289 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:07,514 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:07,538 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:07,545 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-01-25 05:36:07,555 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-01-25 05:36:07,619 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:36:07,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13, 12, 13] total 32 [2018-01-25 05:36:07,620 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:36:07,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-25 05:36:07,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-25 05:36:07,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=625, Unknown=0, NotChecked=0, Total=992 [2018-01-25 05:36:07,621 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 22 states. [2018-01-25 05:36:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:07,794 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2018-01-25 05:36:07,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 05:36:07,794 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 89 [2018-01-25 05:36:07,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:07,796 INFO L225 Difference]: With dead ends: 154 [2018-01-25 05:36:07,796 INFO L226 Difference]: Without dead ends: 107 [2018-01-25 05:36:07,797 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 333 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=398, Invalid=658, Unknown=0, NotChecked=0, Total=1056 [2018-01-25 05:36:07,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-25 05:36:07,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-01-25 05:36:07,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-25 05:36:07,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-01-25 05:36:07,816 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 89 [2018-01-25 05:36:07,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:07,816 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-01-25 05:36:07,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-25 05:36:07,816 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-01-25 05:36:07,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-25 05:36:07,818 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:07,818 INFO L322 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:36:07,818 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:36:07,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1885341628, now seen corresponding path program 4 times [2018-01-25 05:36:07,819 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:07,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:07,820 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:36:07,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:07,820 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:07,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-01-25 05:36:08,086 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:08,087 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:36:08,087 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:36:08,088 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:36:08,088 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:08,088 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:36:08,093 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-25 05:36:08,093 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-25 05:36:08,120 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:08,123 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:08,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:36:08,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:36:08,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:36:08,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2018-01-25 05:36:08,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-25 05:36:08,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:36:08,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-25 05:36:08,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:17 [2018-01-25 05:36:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 136 proven. 188 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:08,487 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:08,792 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:08,849 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:08,851 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:08,856 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:36:08,902 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:08,905 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:08,908 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:08,913 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:36:08,959 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:08,962 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:08,964 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:08,966 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:36:09,187 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:36:09,241 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:09,243 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:09,245 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:09,422 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:09,460 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:09,506 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:36:09,565 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:09,567 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:09,569 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:09,571 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:36:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 136 proven. 188 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:10,007 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:10,007 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 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 18 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:36:10,010 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-25 05:36:10,010 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-25 05:36:10,064 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:10,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:10,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:36:10,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:36:10,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:36:10,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2018-01-25 05:36:10,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-25 05:36:10,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:36:10,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-25 05:36:10,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:17 [2018-01-25 05:36:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 136 proven. 188 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:10,113 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:10,293 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:10,295 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:10,298 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:10,334 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:10,336 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:10,339 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:10,341 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:36:10,345 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:10,348 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:10,352 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:10,615 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:36:10,617 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:10,619 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:10,621 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:10,624 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:36:10,687 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:10,740 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:10,787 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:36:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 136 proven. 188 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:11,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:36:11,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 26, 28, 26, 26] total 65 [2018-01-25 05:36:11,009 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:36:11,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-25 05:36:11,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-25 05:36:11,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=810, Invalid=3350, Unknown=0, NotChecked=0, Total=4160 [2018-01-25 05:36:11,010 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 38 states. [2018-01-25 05:36:11,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:11,545 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2018-01-25 05:36:11,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 05:36:11,545 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 97 [2018-01-25 05:36:11,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:11,546 INFO L225 Difference]: With dead ends: 166 [2018-01-25 05:36:11,546 INFO L226 Difference]: Without dead ends: 115 [2018-01-25 05:36:11,547 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 319 SyntacticMatches, 19 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 3630 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1185, Invalid=5135, Unknown=0, NotChecked=0, Total=6320 [2018-01-25 05:36:11,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-25 05:36:11,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-01-25 05:36:11,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-25 05:36:11,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-01-25 05:36:11,559 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 97 [2018-01-25 05:36:11,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:11,560 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-01-25 05:36:11,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-25 05:36:11,560 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-01-25 05:36:11,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-25 05:36:11,561 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:11,561 INFO L322 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:36:11,561 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:36:11,562 INFO L82 PathProgramCache]: Analyzing trace with hash -984566628, now seen corresponding path program 5 times [2018-01-25 05:36:11,562 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:11,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:11,563 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:36:11,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:11,563 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:11,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:11,734 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-01-25 05:36:11,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:11,735 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:36:11,735 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:36:11,735 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:36:11,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:11,735 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:36:11,740 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-25 05:36:11,741 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:36:11,750 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:11,753 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:11,757 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:11,762 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:11,770 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:11,787 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:11,814 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:11,847 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:12,056 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:12,102 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:12,819 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:12,823 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:12,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:12,839 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-01-25 05:36:12,840 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-01-25 05:36:13,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:13,000 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 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 20 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:36:13,003 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-25 05:36:13,003 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:36:13,013 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:13,019 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:13,029 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:13,042 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:13,071 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:13,109 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:13,164 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:13,239 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:13,455 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:13,754 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:14,227 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:14,265 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:14,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-01-25 05:36:14,279 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-01-25 05:36:14,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:36:14,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13, 13, 13] total 27 [2018-01-25 05:36:14,295 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:36:14,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 05:36:14,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 05:36:14,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2018-01-25 05:36:14,295 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 16 states. [2018-01-25 05:36:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:14,477 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2018-01-25 05:36:14,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 05:36:14,477 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2018-01-25 05:36:14,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:14,478 INFO L225 Difference]: With dead ends: 178 [2018-01-25 05:36:14,478 INFO L226 Difference]: Without dead ends: 123 [2018-01-25 05:36:14,479 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=580, Invalid=826, Unknown=0, NotChecked=0, Total=1406 [2018-01-25 05:36:14,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-25 05:36:14,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-01-25 05:36:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-25 05:36:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-01-25 05:36:14,497 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 105 [2018-01-25 05:36:14,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:14,497 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-01-25 05:36:14,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 05:36:14,497 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-01-25 05:36:14,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-01-25 05:36:14,498 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:14,498 INFO L322 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:36:14,498 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:36:14,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1299764612, now seen corresponding path program 6 times [2018-01-25 05:36:14,498 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:14,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:14,499 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:36:14,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:14,499 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:14,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-01-25 05:36:14,691 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:14,691 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:36:14,691 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:36:14,691 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:36:14,692 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:14,692 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:36:14,697 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-25 05:36:14,697 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-25 05:36:14,710 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:14,714 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:14,717 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:14,721 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:14,730 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:14,751 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:14,790 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:14,849 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:14,928 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:15,080 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:15,205 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:15,437 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:15,438 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:15,441 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:15,454 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-01-25 05:36:15,454 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-01-25 05:36:15,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:15,652 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 22 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 22 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:36:15,660 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-25 05:36:15,660 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-25 05:36:15,683 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:15,727 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:15,775 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:15,847 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:15,927 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:16,018 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:16,127 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:16,246 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:16,414 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:16,657 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:16,886 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:17,190 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:36:17,228 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:17,235 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-01-25 05:36:17,245 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:17,264 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-01-25 05:36:17,266 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:36:17,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14, 14, 14] total 29 [2018-01-25 05:36:17,267 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:36:17,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 05:36:17,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 05:36:17,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2018-01-25 05:36:17,268 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 17 states. [2018-01-25 05:36:17,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:17,438 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2018-01-25 05:36:17,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 05:36:17,439 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 113 [2018-01-25 05:36:17,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:17,440 INFO L225 Difference]: With dead ends: 190 [2018-01-25 05:36:17,440 INFO L226 Difference]: Without dead ends: 131 [2018-01-25 05:36:17,440 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=680, Invalid=960, Unknown=0, NotChecked=0, Total=1640 [2018-01-25 05:36:17,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-25 05:36:17,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-01-25 05:36:17,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-25 05:36:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-01-25 05:36:17,451 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 113 [2018-01-25 05:36:17,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:17,451 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-01-25 05:36:17,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 05:36:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-01-25 05:36:17,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-01-25 05:36:17,452 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:17,453 INFO L322 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:36:17,453 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:36:17,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1012012708, now seen corresponding path program 7 times [2018-01-25 05:36:17,453 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:17,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:17,454 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:36:17,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:17,454 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:17,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-01-25 05:36:17,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:17,641 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:36:17,641 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:36:17,641 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:36:17,642 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:17,642 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:36:17,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:17,648 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:36:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:17,682 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:17,796 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-01-25 05:36:17,796 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-01-25 05:36:18,111 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:18,111 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 24 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 24 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:36:18,114 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:18,114 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:36:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:18,186 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-01-25 05:36:18,204 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:18,305 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-01-25 05:36:18,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:36:18,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17, 16, 17] total 44 [2018-01-25 05:36:18,306 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:36:18,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-25 05:36:18,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-25 05:36:18,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=709, Invalid=1183, Unknown=0, NotChecked=0, Total=1892 [2018-01-25 05:36:18,307 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 30 states. [2018-01-25 05:36:18,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:18,467 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2018-01-25 05:36:18,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 05:36:18,467 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 121 [2018-01-25 05:36:18,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:18,468 INFO L225 Difference]: With dead ends: 202 [2018-01-25 05:36:18,468 INFO L226 Difference]: Without dead ends: 139 [2018-01-25 05:36:18,469 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 453 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=752, Invalid=1228, Unknown=0, NotChecked=0, Total=1980 [2018-01-25 05:36:18,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-25 05:36:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-01-25 05:36:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 05:36:18,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-01-25 05:36:18,480 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 121 [2018-01-25 05:36:18,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:18,480 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-01-25 05:36:18,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-25 05:36:18,481 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-01-25 05:36:18,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-01-25 05:36:18,481 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:18,481 INFO L322 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:36:18,482 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:36:18,482 INFO L82 PathProgramCache]: Analyzing trace with hash 70218044, now seen corresponding path program 8 times [2018-01-25 05:36:18,482 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:18,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:18,483 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:36:18,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:18,483 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:18,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-01-25 05:36:18,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:18,685 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:36:18,685 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:36:18,686 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:36:18,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:18,686 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:36:18,691 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:36:18,691 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:36:18,706 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:18,722 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:18,725 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:18,727 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:18,867 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-01-25 05:36:18,867 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-01-25 05:36:19,201 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:19,201 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 26 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 26 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:36:19,204 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:36:19,205 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:36:19,226 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:19,293 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:36:19,320 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:19,326 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:19,347 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-01-25 05:36:19,348 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-01-25 05:36:19,485 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:36:19,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18, 17, 18] total 47 [2018-01-25 05:36:19,485 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:36:19,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-25 05:36:19,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-25 05:36:19,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=1350, Unknown=0, NotChecked=0, Total=2162 [2018-01-25 05:36:19,487 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 32 states. [2018-01-25 05:36:19,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:19,742 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2018-01-25 05:36:19,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 05:36:19,743 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 129 [2018-01-25 05:36:19,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:19,744 INFO L225 Difference]: With dead ends: 214 [2018-01-25 05:36:19,744 INFO L226 Difference]: Without dead ends: 147 [2018-01-25 05:36:19,745 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 483 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=858, Invalid=1398, Unknown=0, NotChecked=0, Total=2256 [2018-01-25 05:36:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-25 05:36:19,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2018-01-25 05:36:19,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-25 05:36:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-01-25 05:36:19,758 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 129 [2018-01-25 05:36:19,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:19,759 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-01-25 05:36:19,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-25 05:36:19,759 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-01-25 05:36:19,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-01-25 05:36:19,760 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:19,760 INFO L322 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:36:19,760 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:36:19,761 INFO L82 PathProgramCache]: Analyzing trace with hash 523649564, now seen corresponding path program 9 times [2018-01-25 05:36:19,761 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:19,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:19,762 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:36:19,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:19,762 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:19,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:20,071 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-01-25 05:36:20,071 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:20,071 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:36:20,071 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:36:20,071 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:36:20,072 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:20,072 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:36:20,079 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 05:36:20,079 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 05:36:20,097 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:20,111 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:20,121 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:20,132 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:20,140 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:20,160 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:20,183 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:20,197 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:20,222 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:20,240 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:20,329 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:20,415 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:20,521 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:20,614 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:20,847 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:20,849 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:20,854 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-01-25 05:36:20,893 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-01-25 05:36:21,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:21,154 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 28 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 28 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:36:21,157 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 05:36:21,157 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 05:36:21,178 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:21,231 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:21,290 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:21,355 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:21,427 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:21,530 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:21,660 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:21,815 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:21,980 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:22,200 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:22,468 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:22,807 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:23,157 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:23,628 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:24,206 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:36:24,255 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:24,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-01-25 05:36:24,427 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:36:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-01-25 05:36:24,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:36:24,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17, 18, 19] total 66 [2018-01-25 05:36:24,801 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:36:24,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-25 05:36:24,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-25 05:36:24,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1555, Invalid=2735, Unknown=0, NotChecked=0, Total=4290 [2018-01-25 05:36:24,803 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 20 states. [2018-01-25 05:36:24,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:36:24,934 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2018-01-25 05:36:24,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-25 05:36:24,935 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2018-01-25 05:36:24,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:36:24,935 INFO L225 Difference]: With dead ends: 226 [2018-01-25 05:36:24,935 INFO L226 Difference]: Without dead ends: 155 [2018-01-25 05:36:24,937 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 528 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2061 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1620, Invalid=2802, Unknown=0, NotChecked=0, Total=4422 [2018-01-25 05:36:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-25 05:36:24,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2018-01-25 05:36:24,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-25 05:36:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-01-25 05:36:24,950 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 137 [2018-01-25 05:36:24,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:36:24,950 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-01-25 05:36:24,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-25 05:36:24,950 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-01-25 05:36:24,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-01-25 05:36:24,951 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:36:24,951 INFO L322 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:36:24,951 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 05:36:24,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2142034940, now seen corresponding path program 10 times [2018-01-25 05:36:24,951 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:36:24,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:24,952 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:36:24,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:36:24,952 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:36:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:36:24,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:36:25,248 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-01-25 05:36:25,249 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:25,249 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:36:25,249 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:36:25,249 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:36:25,249 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:36:25,249 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:36:25,262 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-25 05:36:25,262 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-25 05:36:25,304 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:36:25,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:36:25,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:36:25,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:36:25,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:36:25,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2018-01-25 05:36:25,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-25 05:36:25,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:36:25,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-25 05:36:25,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:17 [2018-01-25 05:36:25,942 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 406 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:36:25,942 INFO L314 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-01-25 05:36:27,722 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:36:27,722 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:36:27,725 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:36:27,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:36:27 BoogieIcfgContainer [2018-01-25 05:36:27,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:36:27,726 INFO L168 Benchmark]: Toolchain (without parser) took 43420.72 ms. Allocated memory was 300.9 MB in the beginning and 1.1 GB in the end (delta: 753.9 MB). Free memory was 261.0 MB in the beginning and 819.4 MB in the end (delta: -558.4 MB). Peak memory consumption was 195.5 MB. Max. memory is 5.3 GB. [2018-01-25 05:36:27,727 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:36:27,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 195.11 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 249.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. [2018-01-25 05:36:27,727 INFO L168 Benchmark]: Boogie Preprocessor took 36.35 ms. Allocated memory is still 300.9 MB. Free memory was 249.7 MB in the beginning and 248.7 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. [2018-01-25 05:36:27,728 INFO L168 Benchmark]: RCFGBuilder took 255.03 ms. Allocated memory is still 300.9 MB. Free memory was 248.7 MB in the beginning and 231.1 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:36:27,728 INFO L168 Benchmark]: TraceAbstraction took 42926.81 ms. Allocated memory was 300.9 MB in the beginning and 1.1 GB in the end (delta: 753.9 MB). Free memory was 230.1 MB in the beginning and 819.4 MB in the end (delta: -589.4 MB). Peak memory consumption was 164.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:36:27,730 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 195.11 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 249.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.35 ms. Allocated memory is still 300.9 MB. Free memory was 249.7 MB in the beginning and 248.7 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. * RCFGBuilder took 255.03 ms. Allocated memory is still 300.9 MB. Free memory was 248.7 MB in the beginning and 231.1 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 42926.81 ms. Allocated memory was 300.9 MB in the beginning and 1.1 GB in the end (delta: 753.9 MB). Free memory was 230.1 MB in the beginning and 819.4 MB in the end (delta: -589.4 MB). Peak memory consumption was 164.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 18 LocStat_MAX_WEQGRAPH_SIZE : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 263 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -36 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 25 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 65 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 26 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 6.162275 RENAME_VARIABLES(MILLISECONDS) : 1.117598 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 3.073584 PROJECTAWAY(MILLISECONDS) : 0.095218 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.118934 DISJOIN(MILLISECONDS) : 0.635759 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.140640 ADD_EQUALITY(MILLISECONDS) : 0.136299 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.031549 #CONJOIN_DISJUNCTIVE : 48 #RENAME_VARIABLES : 88 #UNFREEZE : 0 #CONJOIN : 107 #PROJECTAWAY : 72 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 83 #ADD_EQUALITY : 67 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 337 LocStat_NO_SUPPORTING_DISEQUALITIES : 50 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 67 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 6.753275 RENAME_VARIABLES(MILLISECONDS) : 0.949828 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 3.348196 PROJECTAWAY(MILLISECONDS) : 0.081650 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.054038 DISJOIN(MILLISECONDS) : 0.469814 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.974099 ADD_EQUALITY(MILLISECONDS) : 0.026879 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010832 #CONJOIN_DISJUNCTIVE : 69 #RENAME_VARIABLES : 130 #UNFREEZE : 0 #CONJOIN : 128 #PROJECTAWAY : 97 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 13 #RENAME_VARIABLES_DISJUNCTIVE : 125 #ADD_EQUALITY : 69 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 29 LocStat_MAX_WEQGRAPH_SIZE : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 450 LocStat_NO_SUPPORTING_DISEQUALITIES : 72 LocStat_NO_DISJUNCTIONS : -58 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 37 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 86 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 40 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.212810 RENAME_VARIABLES(MILLISECONDS) : 0.134126 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.179234 PROJECTAWAY(MILLISECONDS) : 0.045330 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.058390 DISJOIN(MILLISECONDS) : 0.342502 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.150355 ADD_EQUALITY(MILLISECONDS) : 0.021552 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010354 #CONJOIN_DISJUNCTIVE : 139 #RENAME_VARIABLES : 301 #UNFREEZE : 0 #CONJOIN : 274 #PROJECTAWAY : 213 #ADD_WEAK_EQUALITY : 12 #DISJOIN : 28 #RENAME_VARIABLES_DISJUNCTIVE : 292 #ADD_EQUALITY : 81 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 146 with TraceHistMax 16, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 146 with TraceHistMax 16, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 146 with TraceHistMax 16, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 146 with TraceHistMax 16, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 146 with TraceHistMax 16, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 146 with TraceHistMax 16, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 146 with TraceHistMax 16, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 146 with TraceHistMax 16, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 146 with TraceHistMax 16, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 146 with TraceHistMax 16, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 146 with TraceHistMax 16, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 146 with TraceHistMax 16, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 146 with TraceHistMax 16, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 146 with TraceHistMax 16, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 146 with TraceHistMax 16, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 146 with TraceHistMax 16, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 629]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 146 with TraceHistMax 16, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 17 error locations. TIMEOUT Result, 42.8s OverallTime, 20 OverallIterations, 16 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 549 SDtfs, 2878 SDslu, 3536 SDs, 0 SdLazy, 2853 SolverSat, 630 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4639 GetRequests, 4032 SyntacticMatches, 55 SemanticMatches, 552 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 9744 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 8.9s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 93 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 10.5s SatisfiabilityAnalysisTime, 14.3s InterpolantComputationTime, 3368 NumberOfCodeBlocks, 3306 NumberOfCodeBlocksAsserted, 140 NumberOfCheckSat, 5459 ConstructedInterpolants, 386 QuantifiedInterpolants, 2589135 SizeOfPredicates, 90 NumberOfNonLiveVariables, 6945 ConjunctsInSsa, 392 ConjunctsInUnsatCore, 73 InterpolantComputations, 7 PerfectInterpolantSequences, 9768/19908 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-36-27-740.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-36-27-740.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-36-27-740.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-36-27-740.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-36-27-740.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_05-36-27-740.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_05-36-27-740.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-36-27-740.csv Completed graceful shutdown