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-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:34:32,388 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:34:32,390 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:34:32,403 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:34:32,403 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:34:32,404 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:34:32,405 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:34:32,407 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:34:32,408 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:34:32,409 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:34:32,409 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:34:32,409 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:34:32,410 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:34:32,411 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:34:32,412 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:34:32,414 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:34:32,416 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:34:32,418 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:34:32,419 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:34:32,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:34:32,423 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:34:32,423 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:34:32,423 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:34:32,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:34:32,425 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:34:32,426 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:34:32,427 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:34:32,427 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:34:32,427 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:34:32,428 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:34:32,428 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:34:32,429 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:34:32,438 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:34:32,439 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:34:32,440 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:34:32,440 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:34:32,440 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:34:32,440 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:34:32,440 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:34:32,441 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:34:32,441 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:34:32,441 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:34:32,442 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:34:32,442 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:34:32,442 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:34:32,442 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:34:32,442 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:34:32,443 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:34:32,443 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:34:32,443 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:34:32,443 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:34:32,443 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:34:32,444 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:34:32,444 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:34:32,444 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:34:32,444 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:34:32,444 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:34:32,444 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:34:32,445 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:34:32,445 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:34:32,445 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:34:32,445 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:34:32,445 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:34:32,446 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:34:32,446 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:34:32,446 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:34:32,447 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:34:32,447 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:34:32,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:34:32,493 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:34:32,498 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:34:32,499 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:34:32,500 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:34:32,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-deref.i [2018-01-25 05:34:32,677 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:34:32,682 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:34:32,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:34:32,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:34:32,689 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:34:32,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:34:32" (1/1) ... [2018-01-25 05:34:32,692 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:34:32, skipping insertion in model container [2018-01-25 05:34:32,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:34:32" (1/1) ... [2018-01-25 05:34:32,710 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:34:32,750 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:34:32,855 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:34:32,870 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:34:32,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:34:32 WrapperNode [2018-01-25 05:34:32,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:34:32,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:34:32,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:34:32,878 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:34:32,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:34:32" (1/1) ... [2018-01-25 05:34:32,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:34:32" (1/1) ... [2018-01-25 05:34:32,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:34:32" (1/1) ... [2018-01-25 05:34:32,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:34:32" (1/1) ... [2018-01-25 05:34:32,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:34:32" (1/1) ... [2018-01-25 05:34:32,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:34:32" (1/1) ... [2018-01-25 05:34:32,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:34:32" (1/1) ... [2018-01-25 05:34:32,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:34:32,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:34:32,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:34:32,914 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:34:32,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:34:32" (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:34:32,957 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:34:32,958 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:34:32,958 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-25 05:34:32,958 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:34:32,958 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:34:32,958 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:34:32,958 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:34:32,959 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:34:32,959 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:34:32,959 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:34:32,959 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:34:32,959 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-25 05:34:32,959 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:34:32,959 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:34:32,960 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:34:33,178 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:34:33,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:34:33 BoogieIcfgContainer [2018-01-25 05:34:33,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:34:33,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:34:33,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:34:33,182 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:34:33,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:34:32" (1/3) ... [2018-01-25 05:34:33,184 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:34:33, skipping insertion in model container [2018-01-25 05:34:33,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:34:32" (2/3) ... [2018-01-25 05:34:33,185 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:34:33, skipping insertion in model container [2018-01-25 05:34:33,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:34:33" (3/3) ... [2018-01-25 05:34:33,189 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_false-valid-deref.i [2018-01-25 05:34:33,197 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:34:33,203 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-25 05:34:33,241 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:34:33,242 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:34:33,242 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:34:33,242 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:34:33,242 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:34:33,242 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:34:33,242 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:34:33,243 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:34:33,244 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:34:33,266 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-01-25 05:34:33,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-25 05:34:33,273 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:34:33,274 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:34:33,274 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:34:33,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989713, now seen corresponding path program 1 times [2018-01-25 05:34:33,280 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:34:33,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:33,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:34:33,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:33,324 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:34:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:33,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:34:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:34:33,481 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:34:33,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:34:33,481 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:34:33,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:34:33,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:34:33,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:34:33,497 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-01-25 05:34:33,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:34:33,757 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-01-25 05:34:33,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:34:33,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-01-25 05:34:33,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:34:33,768 INFO L225 Difference]: With dead ends: 84 [2018-01-25 05:34:33,768 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 05:34:33,771 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:34:33,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 05:34:33,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 05:34:33,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 05:34:33,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-01-25 05:34:33,798 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 11 [2018-01-25 05:34:33,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:34:33,798 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-01-25 05:34:33,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:34:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-01-25 05:34:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-25 05:34:33,799 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:34:33,799 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:34:33,799 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:34:33,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989714, now seen corresponding path program 1 times [2018-01-25 05:34:33,800 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:34:33,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:33,801 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:34:33,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:33,801 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:34:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:33,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:34:33,913 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:34:33,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:34:33,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:34:33,939 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:34:33,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:34:33,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:34:33,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:34:33,941 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 5 states. [2018-01-25 05:34:34,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:34:34,050 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-01-25 05:34:34,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:34:34,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-01-25 05:34:34,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:34:34,052 INFO L225 Difference]: With dead ends: 49 [2018-01-25 05:34:34,053 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 05:34:34,054 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:34:34,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 05:34:34,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 05:34:34,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 05:34:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-01-25 05:34:34,061 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 11 [2018-01-25 05:34:34,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:34:34,061 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-01-25 05:34:34,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:34:34,061 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-01-25 05:34:34,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 05:34:34,062 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:34:34,062 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:34:34,062 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:34:34,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525484, now seen corresponding path program 1 times [2018-01-25 05:34:34,063 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:34:34,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:34,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:34:34,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:34,064 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:34:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:34,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:34:34,184 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:34:34,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:34:34,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:34:34,184 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:34:34,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:34:34,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:34:34,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:34:34,185 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 6 states. [2018-01-25 05:34:34,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:34:34,290 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-01-25 05:34:34,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:34:34,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-01-25 05:34:34,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:34:34,292 INFO L225 Difference]: With dead ends: 48 [2018-01-25 05:34:34,292 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 05:34:34,292 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:34:34,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 05:34:34,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-25 05:34:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-25 05:34:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-01-25 05:34:34,300 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 17 [2018-01-25 05:34:34,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:34:34,300 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-01-25 05:34:34,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:34:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-01-25 05:34:34,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 05:34:34,301 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:34:34,301 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:34:34,302 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:34:34,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525483, now seen corresponding path program 1 times [2018-01-25 05:34:34,302 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:34:34,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:34,303 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:34:34,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:34,304 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:34:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:34,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:34:34,446 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:34:34,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:34:34,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:34:34,447 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:34:34,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:34:34,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:34:34,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:34:34,448 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 7 states. [2018-01-25 05:34:34,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:34:34,561 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-01-25 05:34:34,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:34:34,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-01-25 05:34:34,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:34:34,563 INFO L225 Difference]: With dead ends: 80 [2018-01-25 05:34:34,563 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 05:34:34,563 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:34:34,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 05:34:34,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-01-25 05:34:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 05:34:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-01-25 05:34:34,570 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 17 [2018-01-25 05:34:34,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:34:34,571 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-01-25 05:34:34,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:34:34,571 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-01-25 05:34:34,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 05:34:34,572 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:34:34,572 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:34:34,572 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:34:34,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2106816852, now seen corresponding path program 1 times [2018-01-25 05:34:34,572 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:34:34,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:34,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:34:34,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:34,574 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:34:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:34,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:34:34,738 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:34:34,739 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:34,739 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:34:34,740 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-01-25 05:34:34,741 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:34:34,787 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:34:34,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:34:36,121 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:34:36,122 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:34:36,133 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:34:36,133 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:36,133 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:34:36,148 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:34:36,148 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:34:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:36,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:34:36,227 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:34:36,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:36,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:34:36,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-25 05:34:36,338 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:34:36,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:36,372 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:34:36,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-01-25 05:34:36,622 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:34:36,623 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:34:37,166 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:34:37,200 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:34:37,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:37,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:34:37,209 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:34:37,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-01-25 05:34:37,240 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:34:37,274 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:37,274 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:34:37,279 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:34:37,279 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:34:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:37,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:34:37,335 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:34:37,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:37,343 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:34:37,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:37,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:34:37,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-25 05:34:37,407 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:34:37,408 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:34:37,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:37,423 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:34:37,424 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:34:37,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:34:37,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:37,440 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:34:37,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-01-25 05:34:37,586 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:34:37,587 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:34:37,692 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:34:37,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:37,703 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:34:37,719 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:34:37,720 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:37,721 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:34:37,724 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:34:37,724 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-01-25 05:34:37,731 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:34:37,733 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:34:37,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7, 7, 7] total 24 [2018-01-25 05:34:37,733 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:34:37,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 05:34:37,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 05:34:37,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=477, Unknown=1, NotChecked=0, Total=600 [2018-01-25 05:34:37,734 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 12 states. [2018-01-25 05:34:38,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:34:38,034 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-01-25 05:34:38,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:34:38,035 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-01-25 05:34:38,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:34:38,036 INFO L225 Difference]: With dead ends: 90 [2018-01-25 05:34:38,036 INFO L226 Difference]: Without dead ends: 63 [2018-01-25 05:34:38,037 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=162, Invalid=593, Unknown=1, NotChecked=0, Total=756 [2018-01-25 05:34:38,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-25 05:34:38,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2018-01-25 05:34:38,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 05:34:38,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-25 05:34:38,044 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 21 [2018-01-25 05:34:38,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:34:38,044 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-25 05:34:38,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 05:34:38,044 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-25 05:34:38,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 05:34:38,045 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:34:38,045 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:34:38,045 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:34:38,046 INFO L82 PathProgramCache]: Analyzing trace with hash -702775421, now seen corresponding path program 2 times [2018-01-25 05:34:38,046 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:34:38,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:38,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:34:38,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:38,047 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:34:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:38,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:34:38,270 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:34:38,270 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:38,270 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:34:38,270 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:34:38,271 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:34:38,271 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:38,271 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:34:38,278 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:34:38,278 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:34:38,291 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:38,294 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:38,295 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:34:38,298 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:34:38,307 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:34:38,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:38,316 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:34:38,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:38,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:34:38,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-25 05:34:38,385 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:34:38,389 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:34:38,390 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:34:38,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:38,413 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:34:38,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:38,422 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:34:38,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-01-25 05:34:38,552 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:34:38,552 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:34:38,687 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:34:38,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:38,690 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:34:38,705 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:34:38,705 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:38,706 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:34:38,709 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:34:38,709 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-01-25 05:34:38,725 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:34:38,746 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:38,746 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:34:38,750 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:34:38,750 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:34:38,771 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:38,801 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:38,813 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:34:38,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:34:38,822 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:34:38,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:38,843 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:34:38,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:38,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:34:38,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-25 05:34:38,860 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:34:38,861 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:34:38,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:38,878 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:34:38,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:34:38,880 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:34:38,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:38,905 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:34:38,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-01-25 05:34:38,971 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:34:38,971 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:34:39,023 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:34:39,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:39,027 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:34:39,037 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:34:39,037 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:39,039 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:34:39,041 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:34:39,042 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-01-25 05:34:39,056 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:34:39,061 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:34:39,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8, 8, 8] total 23 [2018-01-25 05:34:39,061 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:34:39,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 05:34:39,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 05:34:39,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2018-01-25 05:34:39,063 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 17 states. [2018-01-25 05:34:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:34:39,611 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-01-25 05:34:39,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:34:39,612 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-01-25 05:34:39,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:34:39,612 INFO L225 Difference]: With dead ends: 104 [2018-01-25 05:34:39,613 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 05:34:39,613 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 [2018-01-25 05:34:39,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 05:34:39,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2018-01-25 05:34:39,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 05:34:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-01-25 05:34:39,620 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 25 [2018-01-25 05:34:39,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:34:39,620 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-01-25 05:34:39,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 05:34:39,621 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-01-25 05:34:39,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:34:39,621 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:34:39,621 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:34:39,621 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:34:39,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1827026138, now seen corresponding path program 3 times [2018-01-25 05:34:39,622 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:34:39,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:39,622 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:34:39,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:39,623 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:34:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:39,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:34:39,830 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:34:39,830 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:39,830 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:34:39,831 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:34:39,831 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:34:39,831 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:39,831 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:34:39,839 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 05:34:39,839 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 05:34:39,850 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:39,853 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:39,854 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:34:39,856 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:34:39,859 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:34:39,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:39,863 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:34:39,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:39,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:34:39,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-25 05:34:39,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:34:39,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:34:39,894 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:34:39,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:39,900 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:34:39,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:39,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:34:39,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-25 05:34:40,036 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:34:40,036 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:34:40,386 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:34:40,406 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:40,407 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:34:40,411 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 05:34:40,411 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 05:34:40,428 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:40,456 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:40,467 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:34:40,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:34:40,474 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:34:40,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:40,481 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:34:40,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:40,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:34:40,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-25 05:34:40,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:34:40,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:34:40,528 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:34:40,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:40,535 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:34:40,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:40,540 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:34:40,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:22 [2018-01-25 05:34:40,691 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:34:40,692 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:34:40,847 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:34:40,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:34:40,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7, 7, 7] total 29 [2018-01-25 05:34:40,849 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:34:40,849 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 05:34:40,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 05:34:40,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2018-01-25 05:34:40,850 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 18 states. [2018-01-25 05:34:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:34:41,668 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-01-25 05:34:41,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:34:41,668 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2018-01-25 05:34:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:34:41,672 INFO L225 Difference]: With dead ends: 125 [2018-01-25 05:34:41,672 INFO L226 Difference]: Without dead ends: 90 [2018-01-25 05:34:41,673 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=338, Invalid=1302, Unknown=0, NotChecked=0, Total=1640 [2018-01-25 05:34:41,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-25 05:34:41,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2018-01-25 05:34:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 05:34:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-25 05:34:41,683 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 29 [2018-01-25 05:34:41,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:34:41,684 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-25 05:34:41,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 05:34:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-25 05:34:41,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-25 05:34:41,685 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:34:41,685 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:34:41,685 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:34:41,686 INFO L82 PathProgramCache]: Analyzing trace with hash -645884181, now seen corresponding path program 1 times [2018-01-25 05:34:41,686 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:34:41,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:41,687 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:34:41,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:41,687 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:34:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:41,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:34:41,807 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:34:41,807 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:41,807 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:34:41,807 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-01-25 05:34:41,807 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:34:41,809 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:34:41,809 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:34:43,852 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:34:43,852 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:34:43,864 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:34:43,864 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:43,864 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:34:43,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:34:43,874 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:34:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:43,902 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:34:44,023 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:34:44,023 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:34:44,214 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:34:44,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:44,248 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:34:44,253 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:34:44,254 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:34:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:44,313 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:34:44,320 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:34:44,321 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:34:44,346 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:34:44,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:34:44,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 22 [2018-01-25 05:34:44,349 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:34:44,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 05:34:44,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 05:34:44,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=263, Unknown=0, NotChecked=0, Total=462 [2018-01-25 05:34:44,350 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 15 states. [2018-01-25 05:34:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:34:44,544 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2018-01-25 05:34:44,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:34:44,546 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-01-25 05:34:44,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:34:44,547 INFO L225 Difference]: With dead ends: 136 [2018-01-25 05:34:44,547 INFO L226 Difference]: Without dead ends: 102 [2018-01-25 05:34:44,547 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=263, Unknown=0, NotChecked=0, Total=462 [2018-01-25 05:34:44,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-25 05:34:44,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 86. [2018-01-25 05:34:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-25 05:34:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-01-25 05:34:44,560 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 40 [2018-01-25 05:34:44,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:34:44,561 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-01-25 05:34:44,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 05:34:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-01-25 05:34:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-25 05:34:44,562 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:34:44,562 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:34:44,562 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:34:44,563 INFO L82 PathProgramCache]: Analyzing trace with hash -2113361740, now seen corresponding path program 2 times [2018-01-25 05:34:44,563 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:34:44,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:44,564 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:34:44,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:44,564 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:34:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:44,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:34:44,741 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:34:44,741 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:44,741 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:34:44,742 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:34:44,742 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:34:44,742 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:44,742 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:34:44,755 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:34:44,755 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:34:44,774 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:44,777 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:34:44,780 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:34:44,788 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:34:44,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:44,795 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:34:44,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-01-25 05:34:44,964 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:34:44,964 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:34:45,170 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:34:45,192 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:34:45,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [10] total 20 [2018-01-25 05:34:45,192 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:34:45,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:34:45,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:34:45,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-01-25 05:34:45,193 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 8 states. [2018-01-25 05:34:45,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:34:45,401 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2018-01-25 05:34:45,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:34:45,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-01-25 05:34:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:34:45,402 INFO L225 Difference]: With dead ends: 86 [2018-01-25 05:34:45,403 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 05:34:45,403 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2018-01-25 05:34:45,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 05:34:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-25 05:34:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-25 05:34:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-01-25 05:34:45,417 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 44 [2018-01-25 05:34:45,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:34:45,417 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-01-25 05:34:45,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:34:45,418 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-01-25 05:34:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-25 05:34:45,419 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:34:45,419 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:34:45,419 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:34:45,419 INFO L82 PathProgramCache]: Analyzing trace with hash -2113361741, now seen corresponding path program 1 times [2018-01-25 05:34:45,419 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:34:45,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:45,420 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:34:45,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:45,421 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:34:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:45,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:34:45,473 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:34:45,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:34:45,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:34:45,474 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:34:45,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:34:45,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:34:45,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:34:45,474 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 4 states. [2018-01-25 05:34:45,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:34:45,514 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-01-25 05:34:45,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:34:45,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-01-25 05:34:45,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:34:45,515 INFO L225 Difference]: With dead ends: 73 [2018-01-25 05:34:45,515 INFO L226 Difference]: Without dead ends: 71 [2018-01-25 05:34:45,516 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:34:45,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-25 05:34:45,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-25 05:34:45,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-25 05:34:45,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-01-25 05:34:45,526 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 44 [2018-01-25 05:34:45,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:34:45,526 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-01-25 05:34:45,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:34:45,526 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-01-25 05:34:45,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-25 05:34:45,527 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:34:45,527 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] [2018-01-25 05:34:45,527 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:34:45,528 INFO L82 PathProgramCache]: Analyzing trace with hash -747893621, now seen corresponding path program 1 times [2018-01-25 05:34:45,528 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:34:45,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:45,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:34:45,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:45,529 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:34:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:45,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:34:45,650 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:34:45,650 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:45,650 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:34:45,650 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-01-25 05:34:45,650 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], [54], [76], [77], [78], [80], [81] [2018-01-25 05:34:45,651 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:34:45,651 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:34:50,772 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:34:50,772 INFO L268 AbstractInterpreter]: Visited 28 different actions 74 times. Merged at 14 different actions 41 times. Never widened. Found 7 fixpoints after 4 different actions. Largest state had 26 variables. [2018-01-25 05:34:50,774 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:34:50,774 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:50,774 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:34:50,780 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:34:50,780 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:34:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:50,802 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:34:50,862 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:34:50,863 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:34:50,996 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:34:51,021 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:51,021 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:34:51,024 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:34:51,025 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:34:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:51,076 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:34:51,092 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:34:51,092 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:34:51,165 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:34:51,166 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:34:51,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11, 10, 11] total 26 [2018-01-25 05:34:51,167 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:34:51,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 05:34:51,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 05:34:51,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=412, Unknown=0, NotChecked=0, Total=650 [2018-01-25 05:34:51,168 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 18 states. [2018-01-25 05:34:51,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:34:51,320 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2018-01-25 05:34:51,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:34:51,320 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-01-25 05:34:51,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:34:51,321 INFO L225 Difference]: With dead ends: 114 [2018-01-25 05:34:51,321 INFO L226 Difference]: Without dead ends: 83 [2018-01-25 05:34:51,322 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 261 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:34:51,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-25 05:34:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-01-25 05:34:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-25 05:34:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-01-25 05:34:51,336 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 70 [2018-01-25 05:34:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:34:51,336 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-01-25 05:34:51,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 05:34:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-01-25 05:34:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-25 05:34:51,338 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:34:51,338 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] [2018-01-25 05:34:51,338 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:34:51,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1885472427, now seen corresponding path program 2 times [2018-01-25 05:34:51,339 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:34:51,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:51,340 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:34:51,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:51,340 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:34:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:51,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:34:51,527 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:34:51,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:51,527 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:34:51,528 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:34:51,528 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:34:51,528 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:51,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 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:34:51,537 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:34:51,537 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:34:51,555 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:51,570 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:51,573 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:34:51,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:34:51,682 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:34:51,682 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:34:51,941 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:34:51,962 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:51,962 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:34:51,965 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:34:51,965 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:34:51,987 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:52,038 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:52,058 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:34:52,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:34:52,072 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:34:52,072 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:34:52,155 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:34:52,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:34:52,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12, 11, 12] total 29 [2018-01-25 05:34:52,157 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:34:52,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-25 05:34:52,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-25 05:34:52,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=513, Unknown=0, NotChecked=0, Total=812 [2018-01-25 05:34:52,157 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 20 states. [2018-01-25 05:34:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:34:52,264 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2018-01-25 05:34:52,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 05:34:52,264 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 78 [2018-01-25 05:34:52,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:34:52,265 INFO L225 Difference]: With dead ends: 126 [2018-01-25 05:34:52,265 INFO L226 Difference]: Without dead ends: 91 [2018-01-25 05:34:52,266 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 291 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:34:52,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-25 05:34:52,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-01-25 05:34:52,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-25 05:34:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-01-25 05:34:52,279 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 78 [2018-01-25 05:34:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:34:52,280 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-01-25 05:34:52,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-25 05:34:52,280 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-01-25 05:34:52,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-25 05:34:52,281 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:34:52,281 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] [2018-01-25 05:34:52,282 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:34:52,282 INFO L82 PathProgramCache]: Analyzing trace with hash 2069780427, now seen corresponding path program 3 times [2018-01-25 05:34:52,282 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:34:52,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:52,283 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:34:52,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:52,283 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:34:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:52,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:34:52,405 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:34:52,406 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:52,406 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:34:52,406 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:34:52,406 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:34:52,406 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:52,406 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:34:52,414 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 05:34:52,414 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 05:34:52,427 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:52,431 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:52,434 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:52,440 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:52,446 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:52,457 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:52,472 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:52,493 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:52,510 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:52,511 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:34:52,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:34:52,624 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:34:52,624 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:34:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-01-25 05:34:52,870 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:52,870 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:34:52,873 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 05:34:52,873 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 05:34:52,892 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:52,922 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:52,956 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:52,996 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:53,048 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:53,112 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:53,204 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:53,328 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:53,457 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:34:53,476 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:34:53,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:34:53,491 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:34:53,491 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:34:53,560 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:34:53,561 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:34:53,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15, 12, 13] total 36 [2018-01-25 05:34:53,562 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:34:53,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-25 05:34:53,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-25 05:34:53,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=842, Unknown=0, NotChecked=0, Total=1260 [2018-01-25 05:34:53,563 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 24 states. [2018-01-25 05:34:53,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:34:53,813 INFO L93 Difference]: Finished difference Result 138 states and 141 transitions. [2018-01-25 05:34:53,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 05:34:53,813 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 86 [2018-01-25 05:34:53,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:34:53,814 INFO L225 Difference]: With dead ends: 138 [2018-01-25 05:34:53,814 INFO L226 Difference]: Without dead ends: 99 [2018-01-25 05:34:53,815 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 317 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=457, Invalid=949, Unknown=0, NotChecked=0, Total=1406 [2018-01-25 05:34:53,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-25 05:34:53,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-01-25 05:34:53,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-25 05:34:53,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-01-25 05:34:53,826 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 86 [2018-01-25 05:34:53,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:34:53,826 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-01-25 05:34:53,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-25 05:34:53,826 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-01-25 05:34:53,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-01-25 05:34:53,828 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:34:53,828 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] [2018-01-25 05:34:53,828 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:34:53,828 INFO L82 PathProgramCache]: Analyzing trace with hash 67534827, now seen corresponding path program 4 times [2018-01-25 05:34:53,828 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:34:53,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:53,829 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:34:53,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:53,829 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:34:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:53,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:34:54,069 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:34:54,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:54,069 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:34:54,069 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:34:54,070 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:34:54,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:54,070 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:34:54,075 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-25 05:34:54,075 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-25 05:34:54,102 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:34:54,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:34:54,108 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:34:54,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:54,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:34:54,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2018-01-25 05:34:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 162 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:34:54,508 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:34:55,030 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:34:55,180 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:34:55,396 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:34:55,578 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:34:55,627 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:34:55,628 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:34:55,630 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:34:55,634 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:34:55,809 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:34:55,860 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:34:55,862 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:34:55,863 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:34:55,866 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:34:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 162 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:34:56,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:56,537 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:34:56,540 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-25 05:34:56,540 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-25 05:34:56,593 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:34:56,598 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:34:56,600 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:34:56,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:34:56,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:34:56,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 05:34:56,663 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 162 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:34:56,664 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:34:57,038 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:34:57,236 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:34:57,575 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:34:57,579 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:34:57,582 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:34:57,585 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:34:57,589 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:34:57,790 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:34:57,794 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:34:57,797 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:34:57,799 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:34:57,803 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:34:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 162 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:34:57,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:34:57,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 25, 26, 24, 25] total 63 [2018-01-25 05:34:57,911 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:34:57,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-25 05:34:57,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-25 05:34:57,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=3124, Unknown=0, NotChecked=0, Total=3906 [2018-01-25 05:34:57,912 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 37 states. [2018-01-25 05:34:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:34:58,474 INFO L93 Difference]: Finished difference Result 150 states and 153 transitions. [2018-01-25 05:34:58,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-25 05:34:58,474 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 94 [2018-01-25 05:34:58,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:34:58,475 INFO L225 Difference]: With dead ends: 150 [2018-01-25 05:34:58,475 INFO L226 Difference]: Without dead ends: 107 [2018-01-25 05:34:58,476 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 284 SyntacticMatches, 44 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4563 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1178, Invalid=4828, Unknown=0, NotChecked=0, Total=6006 [2018-01-25 05:34:58,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-25 05:34:58,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-01-25 05:34:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-25 05:34:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-01-25 05:34:58,485 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 94 [2018-01-25 05:34:58,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:34:58,486 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-01-25 05:34:58,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-25 05:34:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-01-25 05:34:58,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-25 05:34:58,487 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:34:58,487 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] [2018-01-25 05:34:58,487 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:34:58,487 INFO L82 PathProgramCache]: Analyzing trace with hash 306183947, now seen corresponding path program 5 times [2018-01-25 05:34:58,487 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:34:58,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:58,488 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:34:58,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:34:58,488 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:34:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:34:58,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:34:58,640 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:34:58,640 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:58,640 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:34:58,640 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:34:58,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:34:58,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:58,641 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:34:58,646 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-25 05:34:58,646 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:34:58,655 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:58,657 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:58,659 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:58,663 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:58,669 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:58,694 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:58,724 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:58,757 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:58,970 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:59,016 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:59,732 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:59,735 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:34:59,740 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:34:59,756 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:34:59,756 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:34:59,898 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:34:59,920 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:34:59,920 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:34:59,923 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-25 05:34:59,923 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:34:59,934 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:59,939 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:59,949 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:59,962 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:34:59,991 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:35:00,030 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:35:00,084 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:35:00,157 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:35:00,374 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:35:00,675 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:35:01,157 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:35:01,193 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:35:01,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:35:01,207 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:35:01,207 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:35:01,231 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:35:01,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:35:01,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13, 13, 13] total 27 [2018-01-25 05:35:01,233 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:35:01,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 05:35:01,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 05:35:01,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2018-01-25 05:35:01,234 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 16 states. [2018-01-25 05:35:01,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:35:01,401 INFO L93 Difference]: Finished difference Result 162 states and 165 transitions. [2018-01-25 05:35:01,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 05:35:01,402 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 102 [2018-01-25 05:35:01,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:35:01,402 INFO L225 Difference]: With dead ends: 162 [2018-01-25 05:35:01,402 INFO L226 Difference]: Without dead ends: 115 [2018-01-25 05:35:01,403 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 407 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:35:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-25 05:35:01,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-01-25 05:35:01,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-25 05:35:01,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-01-25 05:35:01,413 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 102 [2018-01-25 05:35:01,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:35:01,413 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-01-25 05:35:01,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 05:35:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-01-25 05:35:01,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-01-25 05:35:01,414 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:35:01,414 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] [2018-01-25 05:35:01,414 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:35:01,414 INFO L82 PathProgramCache]: Analyzing trace with hash -2043652821, now seen corresponding path program 6 times [2018-01-25 05:35:01,414 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:35:01,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:01,415 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:35:01,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:01,415 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:35:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:01,434 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:01,722 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:35:01,722 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:01,722 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:35:01,722 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:35:01,723 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:01,723 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:01,723 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:35:01,730 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-25 05:35:01,730 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-25 05:35:01,745 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:01,749 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:01,752 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:01,757 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:01,768 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:01,781 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:01,806 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:01,880 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:01,920 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:01,947 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:02,013 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:02,069 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:02,070 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:35:02,074 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:35:02,092 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:35:02,092 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:35:02,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:35:02,286 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:02,286 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:35:02,294 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-25 05:35:02,294 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-25 05:35:02,316 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:02,347 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:02,383 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:02,437 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:02,511 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:02,582 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:02,669 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:02,786 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:02,909 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:03,114 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:03,306 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:03,564 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:35:03,594 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:35:03,601 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:35:03,610 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:35:03,610 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:35:03,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:35:03,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:35:03,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14, 14, 14] total 29 [2018-01-25 05:35:03,632 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:35:03,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 05:35:03,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 05:35:03,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2018-01-25 05:35:03,632 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 17 states. [2018-01-25 05:35:03,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:35:03,820 INFO L93 Difference]: Finished difference Result 174 states and 177 transitions. [2018-01-25 05:35:03,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 05:35:03,820 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 110 [2018-01-25 05:35:03,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:35:03,821 INFO L225 Difference]: With dead ends: 174 [2018-01-25 05:35:03,821 INFO L226 Difference]: Without dead ends: 123 [2018-01-25 05:35:03,822 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=680, Invalid=960, Unknown=0, NotChecked=0, Total=1640 [2018-01-25 05:35:03,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-25 05:35:03,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-01-25 05:35:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-25 05:35:03,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-01-25 05:35:03,834 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 110 [2018-01-25 05:35:03,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:35:03,834 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-01-25 05:35:03,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 05:35:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-01-25 05:35:03,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-01-25 05:35:03,836 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:35:03,836 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] [2018-01-25 05:35:03,836 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:35:03,836 INFO L82 PathProgramCache]: Analyzing trace with hash -130219445, now seen corresponding path program 7 times [2018-01-25 05:35:03,836 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:35:03,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:03,837 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:35:03,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:03,837 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:35:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:03,858 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:04,045 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:35:04,045 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:04,045 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:35:04,045 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:35:04,045 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:04,045 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:04,046 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:35:04,052 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:35:04,052 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:35:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:04,088 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:35:04,253 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:35:04,253 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:35:04,564 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:35:04,585 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:04,585 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:35:04,588 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:35:04,589 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:35:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:04,658 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:35:04,679 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:35:04,679 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:35:04,784 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:35:04,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:35:04,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17, 16, 17] total 44 [2018-01-25 05:35:04,786 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:35:04,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-25 05:35:04,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-25 05:35:04,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=709, Invalid=1183, Unknown=0, NotChecked=0, Total=1892 [2018-01-25 05:35:04,787 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 30 states. [2018-01-25 05:35:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:35:04,965 INFO L93 Difference]: Finished difference Result 186 states and 189 transitions. [2018-01-25 05:35:04,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 05:35:04,966 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 118 [2018-01-25 05:35:04,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:35:04,966 INFO L225 Difference]: With dead ends: 186 [2018-01-25 05:35:04,966 INFO L226 Difference]: Without dead ends: 131 [2018-01-25 05:35:04,967 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 441 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:35:04,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-25 05:35:04,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-01-25 05:35:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-25 05:35:04,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-01-25 05:35:04,978 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 118 [2018-01-25 05:35:04,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:35:04,978 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-01-25 05:35:04,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-25 05:35:04,978 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-01-25 05:35:04,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-01-25 05:35:04,979 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:35:04,979 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] [2018-01-25 05:35:04,979 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:35:04,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1727297941, now seen corresponding path program 8 times [2018-01-25 05:35:04,980 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:35:04,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:04,980 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:35:04,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:04,980 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:35:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:04,997 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:05,242 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:35:05,243 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:05,273 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:35:05,273 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:35:05,273 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:05,274 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:05,274 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:35:05,279 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:35:05,279 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:35:05,295 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:35:05,312 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:35:05,316 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:35:05,319 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:35:05,453 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:35:05,453 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:35:05,777 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:35:05,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:05,798 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:35:05,800 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:35:05,801 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:35:05,820 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:35:05,875 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:35:05,901 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:35:05,908 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:35:05,931 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:35:05,931 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:35:06,073 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:35:06,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:35:06,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18, 17, 18] total 47 [2018-01-25 05:35:06,075 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:35:06,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-25 05:35:06,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-25 05:35:06,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=1350, Unknown=0, NotChecked=0, Total=2162 [2018-01-25 05:35:06,077 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 32 states. [2018-01-25 05:35:06,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:35:06,320 INFO L93 Difference]: Finished difference Result 198 states and 201 transitions. [2018-01-25 05:35:06,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 05:35:06,320 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 126 [2018-01-25 05:35:06,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:35:06,321 INFO L225 Difference]: With dead ends: 198 [2018-01-25 05:35:06,321 INFO L226 Difference]: Without dead ends: 139 [2018-01-25 05:35:06,322 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 471 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=858, Invalid=1398, Unknown=0, NotChecked=0, Total=2256 [2018-01-25 05:35:06,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-25 05:35:06,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-01-25 05:35:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 05:35:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-01-25 05:35:06,334 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 126 [2018-01-25 05:35:06,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:35:06,335 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-01-25 05:35:06,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-25 05:35:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-01-25 05:35:06,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-01-25 05:35:06,336 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:35:06,336 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] [2018-01-25 05:35:06,336 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:35:06,336 INFO L82 PathProgramCache]: Analyzing trace with hash 293691787, now seen corresponding path program 9 times [2018-01-25 05:35:06,336 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:35:06,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:06,337 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:35:06,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:06,337 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:35:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:06,352 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:06,645 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:35:06,646 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:06,646 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:35:06,646 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:35:06,646 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:06,646 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:06,646 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:35:06,652 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 05:35:06,652 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 05:35:06,670 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:06,674 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:06,680 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:06,685 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:06,690 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:06,706 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:06,719 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:06,744 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:06,766 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:06,787 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:06,837 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:06,961 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:07,060 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:07,163 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:07,716 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:07,718 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:35:07,723 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:35:07,763 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:35:07,763 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:35:07,989 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:35:08,013 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:08,014 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:35:08,017 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 05:35:08,017 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 05:35:08,051 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:08,104 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:08,164 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:08,235 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:08,299 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:08,365 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:08,461 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:08,593 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:08,732 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:08,919 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:09,169 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:09,501 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:09,824 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:10,252 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:10,756 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:35:10,801 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:35:10,810 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:35:10,968 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:35:10,968 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:35:11,333 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:35:11,335 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:35:11,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17, 18, 19] total 66 [2018-01-25 05:35:11,335 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:35:11,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-25 05:35:11,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-25 05:35:11,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1555, Invalid=2735, Unknown=0, NotChecked=0, Total=4290 [2018-01-25 05:35:11,343 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 20 states. [2018-01-25 05:35:11,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:35:11,463 INFO L93 Difference]: Finished difference Result 210 states and 213 transitions. [2018-01-25 05:35:11,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-25 05:35:11,463 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 134 [2018-01-25 05:35:11,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:35:11,464 INFO L225 Difference]: With dead ends: 210 [2018-01-25 05:35:11,464 INFO L226 Difference]: Without dead ends: 147 [2018-01-25 05:35:11,465 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 516 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:35:11,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-25 05:35:11,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2018-01-25 05:35:11,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-25 05:35:11,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-01-25 05:35:11,477 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 134 [2018-01-25 05:35:11,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:35:11,477 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-01-25 05:35:11,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-25 05:35:11,477 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-01-25 05:35:11,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-25 05:35:11,478 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:35:11,478 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] [2018-01-25 05:35:11,478 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:35:11,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1657017259, now seen corresponding path program 10 times [2018-01-25 05:35:11,479 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:35:11,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:11,480 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:35:11,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:35:11,480 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:35:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:35:11,497 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:11,979 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:35:11,979 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:11,979 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:35:11,979 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:35:11,979 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:11,979 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:11,979 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:35:11,985 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-25 05:35:11,985 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-25 05:35:12,025 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:35:12,029 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:35:12,031 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:12,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:12,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:35:12,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2018-01-25 05:35:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 450 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:12,751 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:35:13,253 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:35:13,305 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:13,306 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:13,308 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:13,310 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:35:13,360 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:13,361 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:13,363 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:13,365 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:35:13,603 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:35:13,672 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:13,674 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:13,676 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:14,079 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:35:14,138 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:14,141 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:14,144 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:14,148 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:35:14,225 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:14,228 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:14,230 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:14,234 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:35:14,528 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:35:14,814 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:35:14,896 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:14,897 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:14,899 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:15,157 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-25 05:35:15,223 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:15,225 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:15,226 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-25 05:35:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 450 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:16,087 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:35:16,112 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 30 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 30 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:35:16,115 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-25 05:35:16,115 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-25 05:35:16,185 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:35:16,192 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:35:16,194 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:16,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:35:16,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:35:16,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 05:35:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 450 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:35:16,284 INFO L314 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-01-25 05:35:16,556 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:35:16,556 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:35:16,559 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:35:16,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:35:16 BoogieIcfgContainer [2018-01-25 05:35:16,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:35:16,560 INFO L168 Benchmark]: Toolchain (without parser) took 43883.38 ms. Allocated memory was 300.9 MB in the beginning and 1.1 GB in the end (delta: 770.7 MB). Free memory was 261.0 MB in the beginning and 371.7 MB in the end (delta: -110.7 MB). Peak memory consumption was 660.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:35:16,561 INFO L168 Benchmark]: CDTParser took 0.18 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:35:16,561 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.07 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 249.6 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:35:16,561 INFO L168 Benchmark]: Boogie Preprocessor took 35.62 ms. Allocated memory is still 300.9 MB. Free memory was 249.6 MB in the beginning and 248.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-25 05:35:16,561 INFO L168 Benchmark]: RCFGBuilder took 265.66 ms. Allocated memory is still 300.9 MB. Free memory was 248.6 MB in the beginning and 230.1 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:35:16,562 INFO L168 Benchmark]: TraceAbstraction took 43379.73 ms. Allocated memory was 300.9 MB in the beginning and 1.1 GB in the end (delta: 770.7 MB). Free memory was 230.1 MB in the beginning and 371.7 MB in the end (delta: -141.6 MB). Peak memory consumption was 629.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:35:16,563 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.18 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 194.07 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 249.6 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.62 ms. Allocated memory is still 300.9 MB. Free memory was 249.6 MB in the beginning and 248.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 265.66 ms. Allocated memory is still 300.9 MB. Free memory was 248.6 MB in the beginning and 230.1 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 43379.73 ms. Allocated memory was 300.9 MB in the beginning and 1.1 GB in the end (delta: 770.7 MB). Free memory was 230.1 MB in the beginning and 371.7 MB in the end (delta: -141.6 MB). Peak memory consumption was 629.1 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) : 5.390427 RENAME_VARIABLES(MILLISECONDS) : 0.952696 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.618448 PROJECTAWAY(MILLISECONDS) : 0.098854 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.117892 DISJOIN(MILLISECONDS) : 0.452281 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.975305 ADD_EQUALITY(MILLISECONDS) : 0.052556 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016209 #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) : 10.989902 RENAME_VARIABLES(MILLISECONDS) : 1.424839 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 5.541372 PROJECTAWAY(MILLISECONDS) : 0.134540 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.060978 DISJOIN(MILLISECONDS) : 0.755298 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.457093 ADD_EQUALITY(MILLISECONDS) : 0.040311 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010882 #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 : 26 LocStat_MAX_WEQGRAPH_SIZE : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 389 LocStat_NO_SUPPORTING_DISEQUALITIES : 62 LocStat_NO_DISJUNCTIONS : -52 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 71 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 35 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 3.357136 RENAME_VARIABLES(MILLISECONDS) : 0.115677 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.018528 PROJECTAWAY(MILLISECONDS) : 0.049299 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.046246 DISJOIN(MILLISECONDS) : 0.312086 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.131078 ADD_EQUALITY(MILLISECONDS) : 0.014074 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009977 #CONJOIN_DISJUNCTIVE : 126 #RENAME_VARIABLES : 273 #UNFREEZE : 0 #CONJOIN : 230 #PROJECTAWAY : 200 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 27 #RENAME_VARIABLES_DISJUNCTIVE : 270 #ADD_EQUALITY : 74 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 * 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 143 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 143 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 143 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 143 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 143 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 143 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 143 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 143 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 143 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 143 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 143 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 143 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 143 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 143 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 143 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 143 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 143 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, 43.3s OverallTime, 20 OverallIterations, 16 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 466 SDtfs, 2671 SDslu, 2537 SDs, 0 SdLazy, 2858 SolverSat, 618 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4532 GetRequests, 3897 SyntacticMatches, 80 SemanticMatches, 555 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10801 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 8.5s 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, 9.4s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 3287 NumberOfCodeBlocks, 3225 NumberOfCodeBlocksAsserted, 140 NumberOfCheckSat, 5324 ConstructedInterpolants, 374 QuantifiedInterpolants, 2560860 SizeOfPredicates, 88 NumberOfNonLiveVariables, 6711 ConjunctsInSsa, 410 ConjunctsInUnsatCore, 73 InterpolantComputations, 7 PerfectInterpolantSequences, 9842/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-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-35-16-574.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-35-16-574.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-35-16-574.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-35-16-574.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-35-16-574.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_05-35-16-574.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_05-35-16-574.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-35-16-574.csv Completed graceful shutdown