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/mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf -i ../../../trunk/examples/svcomp/memsafety/20051113-1.c_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 05:37:51,225 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 05:37:51,227 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 05:37:51,243 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 05:37:51,243 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 05:37:51,244 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 05:37:51,245 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 05:37:51,247 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 05:37:51,249 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 05:37:51,250 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 05:37:51,251 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 05:37:51,252 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 05:37:51,253 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 05:37:51,254 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 05:37:51,255 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 05:37:51,258 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 05:37:51,260 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 05:37:51,262 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 05:37:51,264 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 05:37:51,265 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 05:37:51,268 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 05:37:51,269 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 05:37:51,269 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 05:37:51,270 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 05:37:51,271 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 05:37:51,272 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 05:37:51,273 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 05:37:51,273 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 05:37:51,273 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 05:37:51,274 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 05:37:51,274 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 05:37:51,275 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf [2018-01-21 05:37:51,283 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 05:37:51,284 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 05:37:51,284 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 05:37:51,285 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 05:37:51,285 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 05:37:51,285 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 05:37:51,285 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 05:37:51,285 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 05:37:51,286 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 05:37:51,286 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 05:37:51,286 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 05:37:51,286 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 05:37:51,286 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 05:37:51,286 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 05:37:51,287 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 05:37:51,287 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 05:37:51,287 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 05:37:51,287 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 05:37:51,287 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 05:37:51,287 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 05:37:51,287 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 05:37:51,287 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 05:37:51,288 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 05:37:51,288 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 05:37:51,288 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 05:37:51,288 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 05:37:51,288 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 05:37:51,288 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 05:37:51,289 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 05:37:51,289 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 05:37:51,289 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 05:37:51,289 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 05:37:51,289 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 05:37:51,289 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 05:37:51,289 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 05:37:51,289 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 05:37:51,289 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 05:37:51,290 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 05:37:51,290 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 05:37:51,324 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 05:37:51,335 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 05:37:51,338 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 05:37:51,340 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 05:37:51,340 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 05:37:51,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/20051113-1.c_false-valid-memtrack.i [2018-01-21 05:37:51,512 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 05:37:51,517 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 05:37:51,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 05:37:51,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 05:37:51,523 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 05:37:51,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 05:37:51" (1/1) ... [2018-01-21 05:37:51,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df89b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:51, skipping insertion in model container [2018-01-21 05:37:51,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 05:37:51" (1/1) ... [2018-01-21 05:37:51,546 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 05:37:51,587 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 05:37:51,732 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 05:37:51,760 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 05:37:51,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:51 WrapperNode [2018-01-21 05:37:51,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 05:37:51,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 05:37:51,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 05:37:51,770 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 05:37:51,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:51" (1/1) ... [2018-01-21 05:37:51,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:51" (1/1) ... [2018-01-21 05:37:51,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:51" (1/1) ... [2018-01-21 05:37:51,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:51" (1/1) ... [2018-01-21 05:37:51,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:51" (1/1) ... [2018-01-21 05:37:51,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:51" (1/1) ... [2018-01-21 05:37:51,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:51" (1/1) ... [2018-01-21 05:37:51,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 05:37:51,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 05:37:51,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 05:37:51,805 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 05:37:51,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:51" (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-21 05:37:51,852 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 05:37:51,852 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 05:37:51,852 INFO L136 BoogieDeclarations]: Found implementation of procedure Sum [2018-01-21 05:37:51,852 INFO L136 BoogieDeclarations]: Found implementation of procedure Sum2 [2018-01-21 05:37:51,853 INFO L136 BoogieDeclarations]: Found implementation of procedure dummy_abort [2018-01-21 05:37:51,853 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 05:37:51,853 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 05:37:51,853 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 05:37:51,853 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 05:37:51,853 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 05:37:51,854 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 05:37:51,854 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-21 05:37:51,854 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-21 05:37:51,854 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-21 05:37:51,854 INFO L128 BoogieDeclarations]: Found specification of procedure Sum [2018-01-21 05:37:51,854 INFO L128 BoogieDeclarations]: Found specification of procedure Sum2 [2018-01-21 05:37:51,854 INFO L128 BoogieDeclarations]: Found specification of procedure dummy_abort [2018-01-21 05:37:51,855 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 05:37:51,855 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 05:37:51,855 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 05:37:52,077 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 05:37:52,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 05:37:52 BoogieIcfgContainer [2018-01-21 05:37:52,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 05:37:52,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 05:37:52,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 05:37:52,082 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 05:37:52,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 05:37:51" (1/3) ... [2018-01-21 05:37:52,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a6e9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 05:37:52, skipping insertion in model container [2018-01-21 05:37:52,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:51" (2/3) ... [2018-01-21 05:37:52,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a6e9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 05:37:52, skipping insertion in model container [2018-01-21 05:37:52,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 05:37:52" (3/3) ... [2018-01-21 05:37:52,087 INFO L105 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i [2018-01-21 05:37:52,094 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 05:37:52,100 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-21 05:37:52,139 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:37:52,139 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:37:52,139 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:37:52,139 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:37:52,139 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:37:52,140 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:37:52,140 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:37:52,140 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Sum2Err0EnsuresViolation======== [2018-01-21 05:37:52,140 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:37:52,158 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-21 05:37:52,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 05:37:52,166 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:52,167 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:37:52,167 INFO L371 AbstractCegarLoop]: === Iteration 1 === [Sum2Err0EnsuresViolation]=== [2018-01-21 05:37:52,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1865297126, now seen corresponding path program 1 times [2018-01-21 05:37:52,175 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:52,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:52,221 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:52,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:52,221 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:37:52,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:37:52,361 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-21 05:37:52,364 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:37:52,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 05:37:52,364 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:37:52,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 05:37:52,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 05:37:52,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:37:52,380 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-01-21 05:37:52,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:37:52,483 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-01-21 05:37:52,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 05:37:52,485 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-01-21 05:37:52,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:37:52,491 INFO L225 Difference]: With dead ends: 88 [2018-01-21 05:37:52,491 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 05:37:52,494 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:37:52,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 05:37:52,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 05:37:52,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 05:37:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 05:37:52,516 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-01-21 05:37:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:37:52,517 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 05:37:52,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 05:37:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 05:37:52,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 05:37:52,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 05:37:52,577 INFO L401 ceAbstractionStarter]: For program point Sum2FINAL(lines 658 666) no Hoare annotation was computed. [2018-01-21 05:37:52,577 INFO L401 ceAbstractionStarter]: For program point Sum2Err0EnsuresViolation(line 657) no Hoare annotation was computed. [2018-01-21 05:37:52,578 INFO L401 ceAbstractionStarter]: For program point L663(line 663) no Hoare annotation was computed. [2018-01-21 05:37:52,578 INFO L404 ceAbstractionStarter]: At program point L662''''(lines 662 664) the Hoare annotation is: true [2018-01-21 05:37:52,578 INFO L401 ceAbstractionStarter]: For program point L662(line 662) no Hoare annotation was computed. [2018-01-21 05:37:52,578 INFO L401 ceAbstractionStarter]: For program point L663'(line 663) no Hoare annotation was computed. [2018-01-21 05:37:52,578 INFO L401 ceAbstractionStarter]: For program point L662'(line 662) no Hoare annotation was computed. [2018-01-21 05:37:52,579 INFO L401 ceAbstractionStarter]: For program point L662'''''(lines 662 664) no Hoare annotation was computed. [2018-01-21 05:37:52,579 INFO L401 ceAbstractionStarter]: For program point L662'''(lines 662 664) no Hoare annotation was computed. [2018-01-21 05:37:52,579 INFO L404 ceAbstractionStarter]: At program point Sum2ENTRY(lines 658 666) the Hoare annotation is: true [2018-01-21 05:37:52,579 INFO L401 ceAbstractionStarter]: For program point Sum2EXIT(lines 658 666) no Hoare annotation was computed. [2018-01-21 05:37:52,579 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 686) no Hoare annotation was computed. [2018-01-21 05:37:52,579 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 686) no Hoare annotation was computed. [2018-01-21 05:37:52,579 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 686) the Hoare annotation is: true [2018-01-21 05:37:52,580 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 686) no Hoare annotation was computed. [2018-01-21 05:37:52,580 INFO L404 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-01-21 05:37:52,580 INFO L404 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-01-21 05:37:52,580 INFO L401 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-01-21 05:37:52,580 INFO L401 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-01-21 05:37:52,580 INFO L404 ceAbstractionStarter]: At program point dummy_abortFINAL(lines 667 669) the Hoare annotation is: true [2018-01-21 05:37:52,581 INFO L401 ceAbstractionStarter]: For program point dummy_abortEXIT(lines 667 669) no Hoare annotation was computed. [2018-01-21 05:37:52,581 INFO L401 ceAbstractionStarter]: For program point dummy_abortErr0EnsuresViolation(lines 667 669) no Hoare annotation was computed. [2018-01-21 05:37:52,581 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 686) the Hoare annotation is: true [2018-01-21 05:37:52,581 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 686) no Hoare annotation was computed. [2018-01-21 05:37:52,581 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 686) the Hoare annotation is: true [2018-01-21 05:37:52,581 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 686) no Hoare annotation was computed. [2018-01-21 05:37:52,581 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 686) no Hoare annotation was computed. [2018-01-21 05:37:52,582 INFO L401 ceAbstractionStarter]: For program point L652'''(lines 652 654) no Hoare annotation was computed. [2018-01-21 05:37:52,582 INFO L401 ceAbstractionStarter]: For program point L652(line 652) no Hoare annotation was computed. [2018-01-21 05:37:52,582 INFO L401 ceAbstractionStarter]: For program point L652'''''(lines 652 654) no Hoare annotation was computed. [2018-01-21 05:37:52,582 INFO L401 ceAbstractionStarter]: For program point SumEXIT(lines 648 656) no Hoare annotation was computed. [2018-01-21 05:37:52,582 INFO L401 ceAbstractionStarter]: For program point L652'(line 652) no Hoare annotation was computed. [2018-01-21 05:37:52,582 INFO L404 ceAbstractionStarter]: At program point L652''''(lines 652 654) the Hoare annotation is: true [2018-01-21 05:37:52,582 INFO L401 ceAbstractionStarter]: For program point L653(line 653) no Hoare annotation was computed. [2018-01-21 05:37:52,583 INFO L404 ceAbstractionStarter]: At program point SumENTRY(lines 648 656) the Hoare annotation is: true [2018-01-21 05:37:52,583 INFO L401 ceAbstractionStarter]: For program point SumErr0EnsuresViolation(line 647) no Hoare annotation was computed. [2018-01-21 05:37:52,583 INFO L401 ceAbstractionStarter]: For program point L653'(line 653) no Hoare annotation was computed. [2018-01-21 05:37:52,583 INFO L401 ceAbstractionStarter]: For program point SumFINAL(lines 648 656) no Hoare annotation was computed. [2018-01-21 05:37:52,583 INFO L404 ceAbstractionStarter]: At program point L681(line 681) the Hoare annotation is: true [2018-01-21 05:37:52,583 INFO L401 ceAbstractionStarter]: For program point L680(line 680) no Hoare annotation was computed. [2018-01-21 05:37:52,584 INFO L404 ceAbstractionStarter]: At program point L683(line 683) the Hoare annotation is: true [2018-01-21 05:37:52,584 INFO L401 ceAbstractionStarter]: For program point L682(line 682) no Hoare annotation was computed. [2018-01-21 05:37:52,584 INFO L401 ceAbstractionStarter]: For program point L682''(lines 682 683) no Hoare annotation was computed. [2018-01-21 05:37:52,584 INFO L401 ceAbstractionStarter]: For program point L672'(line 672) no Hoare annotation was computed. [2018-01-21 05:37:52,584 INFO L401 ceAbstractionStarter]: For program point L682'(lines 682 683) no Hoare annotation was computed. [2018-01-21 05:37:52,584 INFO L404 ceAbstractionStarter]: At program point L680'(lines 680 681) the Hoare annotation is: true [2018-01-21 05:37:52,584 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 670 686) no Hoare annotation was computed. [2018-01-21 05:37:52,584 INFO L401 ceAbstractionStarter]: For program point L674(line 674) no Hoare annotation was computed. [2018-01-21 05:37:52,585 INFO L401 ceAbstractionStarter]: For program point L673(line 673) no Hoare annotation was computed. [2018-01-21 05:37:52,585 INFO L404 ceAbstractionStarter]: At program point L672(line 672) the Hoare annotation is: true [2018-01-21 05:37:52,585 INFO L401 ceAbstractionStarter]: For program point L671(line 671) no Hoare annotation was computed. [2018-01-21 05:37:52,585 INFO L401 ceAbstractionStarter]: For program point L678(line 678) no Hoare annotation was computed. [2018-01-21 05:37:52,585 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 670 686) no Hoare annotation was computed. [2018-01-21 05:37:52,585 INFO L401 ceAbstractionStarter]: For program point L673'(line 673) no Hoare annotation was computed. [2018-01-21 05:37:52,586 INFO L401 ceAbstractionStarter]: For program point L677(line 677) no Hoare annotation was computed. [2018-01-21 05:37:52,586 INFO L401 ceAbstractionStarter]: For program point L676(line 676) no Hoare annotation was computed. [2018-01-21 05:37:52,586 INFO L401 ceAbstractionStarter]: For program point L675(line 675) no Hoare annotation was computed. [2018-01-21 05:37:52,596 INFO L404 ceAbstractionStarter]: At program point L679(line 679) the Hoare annotation is: true [2018-01-21 05:37:52,596 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 670 686) no Hoare annotation was computed. [2018-01-21 05:37:52,597 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 670 686) the Hoare annotation is: true [2018-01-21 05:37:52,602 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:37:52,602 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:37:52,602 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:37:52,602 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:37:52,602 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:37:52,603 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:37:52,603 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:37:52,603 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 05:37:52,603 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:37:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-21 05:37:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 05:37:52,606 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:52,606 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 05:37:52,606 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 05:37:52,607 INFO L82 PathProgramCache]: Analyzing trace with hash 128549, now seen corresponding path program 1 times [2018-01-21 05:37:52,607 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:52,608 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:52,608 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:52,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:52,609 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:37:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:37:52,634 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 05:37:52,638 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:37:52,644 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:37:52,644 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:37:52,644 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:37:52,644 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:37:52,644 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:37:52,644 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:37:52,645 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:37:52,645 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == dummy_abortErr0EnsuresViolation======== [2018-01-21 05:37:52,645 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:37:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-21 05:37:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 05:37:52,648 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:52,648 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:37:52,648 INFO L371 AbstractCegarLoop]: === Iteration 1 === [dummy_abortErr0EnsuresViolation]=== [2018-01-21 05:37:52,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1195103445, now seen corresponding path program 1 times [2018-01-21 05:37:52,648 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:52,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:52,649 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:52,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:52,649 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:37:52,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:37:52,690 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-21 05:37:52,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:37:52,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 05:37:52,691 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:37:52,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 05:37:52,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 05:37:52,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:37:52,692 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-01-21 05:37:52,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:37:52,700 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-01-21 05:37:52,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 05:37:52,700 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-01-21 05:37:52,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:37:52,701 INFO L225 Difference]: With dead ends: 88 [2018-01-21 05:37:52,701 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 05:37:52,702 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:37:52,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 05:37:52,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 05:37:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 05:37:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 05:37:52,703 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-21 05:37:52,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:37:52,703 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 05:37:52,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 05:37:52,704 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 05:37:52,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 05:37:52,706 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:37:52,706 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:37:52,706 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:37:52,706 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:37:52,706 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:37:52,706 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:37:52,707 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:37:52,707 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 05:37:52,707 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:37:52,709 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-21 05:37:52,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-21 05:37:52,711 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:52,711 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:37:52,711 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:37:52,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1502761729, now seen corresponding path program 1 times [2018-01-21 05:37:52,712 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:52,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:52,713 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:52,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:52,713 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:37:52,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:37:52,756 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-21 05:37:52,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:37:52,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 05:37:52,757 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:37:52,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 05:37:52,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 05:37:52,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:37:52,758 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-01-21 05:37:52,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:37:52,766 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-01-21 05:37:52,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 05:37:52,766 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 39 [2018-01-21 05:37:52,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:37:52,769 INFO L225 Difference]: With dead ends: 88 [2018-01-21 05:37:52,769 INFO L226 Difference]: Without dead ends: 54 [2018-01-21 05:37:52,770 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:37:52,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-21 05:37:52,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-21 05:37:52,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-21 05:37:52,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-21 05:37:52,788 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 39 [2018-01-21 05:37:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:37:52,789 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-21 05:37:52,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 05:37:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-21 05:37:52,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-21 05:37:52,791 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:52,791 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:37:52,791 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:37:52,791 INFO L82 PathProgramCache]: Analyzing trace with hash -809322687, now seen corresponding path program 1 times [2018-01-21 05:37:52,791 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:52,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:52,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:52,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:52,793 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:37:52,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:37:52,903 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-21 05:37:52,904 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:37:52,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 05:37:52,904 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:37:52,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 05:37:52,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 05:37:52,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 05:37:52,907 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 5 states. [2018-01-21 05:37:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:37:52,986 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-01-21 05:37:52,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 05:37:52,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-21 05:37:52,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:37:52,988 INFO L225 Difference]: With dead ends: 69 [2018-01-21 05:37:52,988 INFO L226 Difference]: Without dead ends: 64 [2018-01-21 05:37:52,989 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 05:37:52,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-21 05:37:52,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-01-21 05:37:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-21 05:37:52,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-21 05:37:52,999 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 43 [2018-01-21 05:37:53,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:37:53,000 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-21 05:37:53,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 05:37:53,000 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-21 05:37:53,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-21 05:37:53,002 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:53,002 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:37:53,002 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:37:53,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2078335056, now seen corresponding path program 1 times [2018-01-21 05:37:53,002 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:53,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:53,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:53,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:53,004 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:37:53,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:37:53,081 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-21 05:37:53,081 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:37:53,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 05:37:53,081 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:37:53,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 05:37:53,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 05:37:53,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 05:37:53,082 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 4 states. [2018-01-21 05:37:53,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:37:53,254 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-01-21 05:37:53,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 05:37:53,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-01-21 05:37:53,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:37:53,255 INFO L225 Difference]: With dead ends: 62 [2018-01-21 05:37:53,255 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 05:37:53,256 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 05:37:53,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 05:37:53,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 05:37:53,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 05:37:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 05:37:53,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-01-21 05:37:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:37:53,257 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 05:37:53,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 05:37:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 05:37:53,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 05:37:53,260 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:37:53,260 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:37:53,260 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:37:53,260 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:37:53,260 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:37:53,260 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:37:53,260 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:37:53,261 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == SumErr0EnsuresViolation======== [2018-01-21 05:37:53,261 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:37:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-21 05:37:53,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 05:37:53,264 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:53,264 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:37:53,264 INFO L371 AbstractCegarLoop]: === Iteration 1 === [SumErr0EnsuresViolation]=== [2018-01-21 05:37:53,264 INFO L82 PathProgramCache]: Analyzing trace with hash 112235281, now seen corresponding path program 1 times [2018-01-21 05:37:53,264 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:53,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:53,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:53,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:53,266 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:37:53,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:37:53,293 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-21 05:37:53,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:37:53,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 05:37:53,293 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:37:53,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 05:37:53,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 05:37:53,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:37:53,295 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-01-21 05:37:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:37:53,301 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-01-21 05:37:53,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 05:37:53,302 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-01-21 05:37:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:37:53,302 INFO L225 Difference]: With dead ends: 88 [2018-01-21 05:37:53,303 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 05:37:53,304 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:37:53,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 05:37:53,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 05:37:53,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 05:37:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 05:37:53,305 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-21 05:37:53,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:37:53,305 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 05:37:53,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 05:37:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 05:37:53,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 05:37:53,307 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:37:53,307 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:37:53,307 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:37:53,307 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:37:53,307 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:37:53,308 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:37:53,308 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:37:53,308 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 05:37:53,308 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:37:53,309 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-21 05:37:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 05:37:53,311 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:53,311 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:37:53,311 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 05:37:53,311 INFO L82 PathProgramCache]: Analyzing trace with hash -2005137936, now seen corresponding path program 1 times [2018-01-21 05:37:53,311 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:53,312 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:53,313 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:53,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:53,313 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:37:53,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:37:53,341 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-21 05:37:53,341 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:37:53,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 05:37:53,342 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:37:53,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 05:37:53,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 05:37:53,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:37:53,343 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-01-21 05:37:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:37:53,348 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-01-21 05:37:53,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 05:37:53,348 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-01-21 05:37:53,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:37:53,349 INFO L225 Difference]: With dead ends: 88 [2018-01-21 05:37:53,349 INFO L226 Difference]: Without dead ends: 52 [2018-01-21 05:37:53,350 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:37:53,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-21 05:37:53,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-21 05:37:53,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-21 05:37:53,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-21 05:37:53,357 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 37 [2018-01-21 05:37:53,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:37:53,357 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-21 05:37:53,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 05:37:53,357 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-21 05:37:53,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-21 05:37:53,358 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:53,359 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:37:53,359 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 05:37:53,359 INFO L82 PathProgramCache]: Analyzing trace with hash -336037328, now seen corresponding path program 1 times [2018-01-21 05:37:53,359 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:53,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:53,360 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:53,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:53,361 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:37:53,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:37:53,467 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-21 05:37:53,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:37:53,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 05:37:53,467 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:37:53,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 05:37:53,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 05:37:53,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 05:37:53,468 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-21 05:37:53,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:37:53,493 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-01-21 05:37:53,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 05:37:53,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-21 05:37:53,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:37:53,494 INFO L225 Difference]: With dead ends: 65 [2018-01-21 05:37:53,495 INFO L226 Difference]: Without dead ends: 62 [2018-01-21 05:37:53,495 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 05:37:53,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-21 05:37:53,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-01-21 05:37:53,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-21 05:37:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-01-21 05:37:53,500 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 41 [2018-01-21 05:37:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:37:53,500 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-01-21 05:37:53,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 05:37:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-01-21 05:37:53,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-21 05:37:53,501 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:53,501 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:37:53,501 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 05:37:53,501 INFO L82 PathProgramCache]: Analyzing trace with hash 609983231, now seen corresponding path program 1 times [2018-01-21 05:37:53,502 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:53,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:53,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:53,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:53,503 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:37:53,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:37:53,575 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-21 05:37:53,576 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:37:53,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 05:37:53,576 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:37:53,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 05:37:53,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 05:37:53,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 05:37:53,577 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 5 states. [2018-01-21 05:37:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:37:53,681 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-01-21 05:37:53,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 05:37:53,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-01-21 05:37:53,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:37:53,684 INFO L225 Difference]: With dead ends: 96 [2018-01-21 05:37:53,684 INFO L226 Difference]: Without dead ends: 69 [2018-01-21 05:37:53,685 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 05:37:53,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-21 05:37:53,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-01-21 05:37:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-21 05:37:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-01-21 05:37:53,693 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 44 [2018-01-21 05:37:53,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:37:53,693 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-01-21 05:37:53,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 05:37:53,694 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-01-21 05:37:53,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-21 05:37:53,695 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:53,695 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:37:53,695 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 05:37:53,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1680046266, now seen corresponding path program 1 times [2018-01-21 05:37:53,696 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:53,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:53,697 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:53,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:53,697 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:37:53,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:37:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 05:37:54,051 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:37:54,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 05:37:54,052 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:37:54,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 05:37:54,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 05:37:54,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-21 05:37:54,053 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 6 states. [2018-01-21 05:37:54,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:37:54,254 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-01-21 05:37:54,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 05:37:54,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-01-21 05:37:54,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:37:54,256 INFO L225 Difference]: With dead ends: 76 [2018-01-21 05:37:54,256 INFO L226 Difference]: Without dead ends: 65 [2018-01-21 05:37:54,256 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-21 05:37:54,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-21 05:37:54,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-01-21 05:37:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-21 05:37:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-21 05:37:54,262 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 47 [2018-01-21 05:37:54,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:37:54,265 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-21 05:37:54,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 05:37:54,265 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-21 05:37:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-21 05:37:54,266 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:54,266 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:37:54,266 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-21 05:37:54,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1025820889, now seen corresponding path program 1 times [2018-01-21 05:37:54,267 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:54,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:54,268 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:54,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:54,268 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:37:54,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:37:54,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 05:37:54,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:37:54,537 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 05:37:54,538 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-01-21 05:37:54,540 INFO L201 CegarAbsIntRunner]: [0], [4], [5], [8], [10], [11], [12], [14], [18], [19], [21], [27], [28], [29], [31], [35], [36], [39], [49], [50], [52], [53], [55], [56], [57], [58], [59], [60], [61], [62], [66], [72], [78], [80], [82], [83], [84], [90], [91], [92], [93], [94], [95], [96], [97], [100], [101], [102] [2018-01-21 05:37:54,597 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 05:37:54,597 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 05:37:55,975 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 05:37:55,977 INFO L268 AbstractInterpreter]: Visited 48 different actions 60 times. Merged at 11 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-01-21 05:37:55,994 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 05:37:55,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:37:55,994 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-21 05:37:56,005 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:56,005 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 05:37:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:37:56,048 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:37:56,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 05:37:56,085 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:37:56,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 05:37:56,293 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-21 05:37:56,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 12 [2018-01-21 05:37:56,293 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:37:56,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 05:37:56,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 05:37:56,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-01-21 05:37:56,295 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 4 states. [2018-01-21 05:37:56,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:37:56,330 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2018-01-21 05:37:56,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 05:37:56,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-01-21 05:37:56,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:37:56,331 INFO L225 Difference]: With dead ends: 115 [2018-01-21 05:37:56,332 INFO L226 Difference]: Without dead ends: 63 [2018-01-21 05:37:56,332 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-01-21 05:37:56,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-21 05:37:56,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-21 05:37:56,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-21 05:37:56,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-01-21 05:37:56,339 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 50 [2018-01-21 05:37:56,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:37:56,340 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-01-21 05:37:56,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 05:37:56,340 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-01-21 05:37:56,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-21 05:37:56,341 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:56,341 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:37:56,341 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-21 05:37:56,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1453151358, now seen corresponding path program 1 times [2018-01-21 05:37:56,342 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:56,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:56,343 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:56,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:56,343 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:37:56,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:37:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 05:37:56,635 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:37:56,635 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 05:37:56,635 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-01-21 05:37:56,635 INFO L201 CegarAbsIntRunner]: [0], [4], [5], [8], [10], [11], [12], [14], [18], [19], [21], [25], [27], [28], [29], [31], [35], [36], [39], [49], [50], [52], [53], [55], [56], [57], [58], [59], [60], [61], [62], [66], [72], [78], [80], [82], [83], [84], [90], [91], [92], [93], [94], [95], [96], [97], [100], [101], [102] [2018-01-21 05:37:56,637 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 05:37:56,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 05:38:00,459 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 05:38:00,459 INFO L268 AbstractInterpreter]: Visited 49 different actions 69 times. Merged at 14 different actions 17 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 20 variables. [2018-01-21 05:38:00,470 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 05:38:00,470 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:00,470 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 05:38:00,482 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:38:00,483 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 05:38:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:00,517 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 05:38:00,642 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:00,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 05:38:00,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:00,895 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 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 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 05:38:01,644 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:38:01,644 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 05:38:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:01,806 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 05:38:01,810 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 05:38:01,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 05:38:01,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 5, 5] total 14 [2018-01-21 05:38:01,845 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 05:38:01,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-21 05:38:01,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-21 05:38:01,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-01-21 05:38:01,845 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 11 states. [2018-01-21 05:38:02,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:38:02,039 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2018-01-21 05:38:02,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-21 05:38:02,039 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-01-21 05:38:02,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:38:02,040 INFO L225 Difference]: With dead ends: 118 [2018-01-21 05:38:02,040 INFO L226 Difference]: Without dead ends: 63 [2018-01-21 05:38:02,041 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 196 SyntacticMatches, 11 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-01-21 05:38:02,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-21 05:38:02,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2018-01-21 05:38:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-21 05:38:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-01-21 05:38:02,047 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 51 [2018-01-21 05:38:02,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:38:02,047 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-01-21 05:38:02,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-21 05:38:02,048 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-01-21 05:38:02,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-21 05:38:02,048 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:38:02,049 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:38:02,049 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-21 05:38:02,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1200306608, now seen corresponding path program 1 times [2018-01-21 05:38:02,049 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:38:02,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:02,050 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:38:02,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:02,051 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:38:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:02,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:38:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-21 05:38:02,368 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:02,368 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 05:38:02,368 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-01-21 05:38:02,369 INFO L201 CegarAbsIntRunner]: [0], [4], [5], [8], [10], [11], [12], [14], [18], [19], [21], [25], [27], [28], [31], [35], [36], [39], [41], [42], [43], [45], [49], [50], [52], [53], [55], [56], [57], [58], [59], [60], [61], [62], [69], [72], [78], [80], [82], [83], [84], [90], [91], [92], [93], [96], [97], [100], [101], [102] [2018-01-21 05:38:02,371 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 05:38:02,371 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 05:38:04,810 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 05:38:04,810 INFO L268 AbstractInterpreter]: Visited 50 different actions 81 times. Merged at 24 different actions 27 times. Never widened. Found 6 fixpoints after 5 different actions. Largest state had 20 variables. [2018-01-21 05:38:04,812 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 05:38:04,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:04,812 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 05:38:04,826 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:38:04,827 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 05:38:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:04,860 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-21 05:38:04,979 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-21 05:38:05,064 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:05,064 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 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 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 05:38:05,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:38:05,067 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 05:38:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:05,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-21 05:38:05,115 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:05,145 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-21 05:38:05,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 05:38:05,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6, 6, 6] total 17 [2018-01-21 05:38:05,147 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 05:38:05,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-21 05:38:05,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-21 05:38:05,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-01-21 05:38:05,147 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 13 states. [2018-01-21 05:38:05,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:38:05,380 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2018-01-21 05:38:05,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-21 05:38:05,380 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-01-21 05:38:05,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:38:05,381 INFO L225 Difference]: With dead ends: 121 [2018-01-21 05:38:05,381 INFO L226 Difference]: Without dead ends: 70 [2018-01-21 05:38:05,382 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 210 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-01-21 05:38:05,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-21 05:38:05,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-01-21 05:38:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-21 05:38:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-01-21 05:38:05,389 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 55 [2018-01-21 05:38:05,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:38:05,389 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-01-21 05:38:05,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-21 05:38:05,389 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-01-21 05:38:05,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-21 05:38:05,390 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:38:05,390 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:38:05,390 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-21 05:38:05,390 INFO L82 PathProgramCache]: Analyzing trace with hash -2066944597, now seen corresponding path program 2 times [2018-01-21 05:38:05,390 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:38:05,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:05,392 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:38:05,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:05,392 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:38:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:05,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:38:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-21 05:38:05,456 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:05,456 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 05:38:05,457 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 05:38:05,457 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 05:38:05,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:05,457 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 05:38:05,462 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 05:38:05,462 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 05:38:05,476 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:05,487 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:05,489 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:05,491 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:05,516 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-21 05:38:05,516 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-21 05:38:05,606 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:05,606 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 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 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 05:38:05,609 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 05:38:05,609 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 05:38:05,628 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:05,653 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:05,667 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:05,671 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:05,677 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-21 05:38:05,677 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-21 05:38:05,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 05:38:05,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 17 [2018-01-21 05:38:05,707 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 05:38:05,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-21 05:38:05,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-21 05:38:05,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-01-21 05:38:05,708 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 12 states. [2018-01-21 05:38:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:38:05,742 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2018-01-21 05:38:05,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 05:38:05,743 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-01-21 05:38:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:38:05,744 INFO L225 Difference]: With dead ends: 122 [2018-01-21 05:38:05,744 INFO L226 Difference]: Without dead ends: 68 [2018-01-21 05:38:05,744 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 236 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2018-01-21 05:38:05,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-21 05:38:05,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-21 05:38:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-21 05:38:05,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-01-21 05:38:05,750 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 62 [2018-01-21 05:38:05,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:38:05,751 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-01-21 05:38:05,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-21 05:38:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-01-21 05:38:05,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-21 05:38:05,752 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:38:05,752 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:38:05,752 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-21 05:38:05,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1647895852, now seen corresponding path program 3 times [2018-01-21 05:38:05,752 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:38:05,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:05,753 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 05:38:05,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:05,754 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:38:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:05,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:38:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-21 05:38:05,982 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:05,982 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 05:38:05,982 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 05:38:05,982 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 05:38:05,982 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:05,982 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 05:38:05,987 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-21 05:38:05,987 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-21 05:38:06,002 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 05:38:06,013 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 05:38:06,015 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:06,019 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:06,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 05:38:06,075 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-21 05:38:06,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-21 05:38:06,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 05:38:06,110 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-01-21 05:38:06,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-21 05:38:06,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-21 05:38:06,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-21 05:38:06,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-21 05:38:06,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-01-21 05:38:06,189 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,190 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,190 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,191 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,193 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,202 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,203 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,204 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,205 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,206 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,207 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-21 05:38:06,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-21 05:38:06,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-01-21 05:38:06,261 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,265 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-21 05:38:06,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-21 05:38:06,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-01-21 05:38:06,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,351 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,352 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,352 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,353 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,356 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,356 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,357 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,357 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,358 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,358 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,359 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,359 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,360 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,361 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,361 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-21 05:38:06,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-01-21 05:38:06,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2018-01-21 05:38:06,434 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,434 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,435 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,435 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,436 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,437 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,437 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,438 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,438 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,439 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,445 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,445 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,447 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,448 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,449 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,449 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:06,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-21 05:38:06,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-01-21 05:38:06,705 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-21 05:38:06,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:06,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:121, output treesize:1 [2018-01-21 05:38:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-21 05:38:06,755 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:07,007 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-21 05:38:07,036 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:07,036 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 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 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 05:38:07,042 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-21 05:38:07,042 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-21 05:38:07,065 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 05:38:07,094 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 05:38:07,121 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:07,127 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:07,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 05:38:07,137 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-21 05:38:07,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-21 05:38:07,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 05:38:07,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-01-21 05:38:07,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-21 05:38:07,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-21 05:38:07,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,180 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,180 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-21 05:38:07,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-21 05:38:07,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-01-21 05:38:07,216 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,216 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,222 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,223 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,223 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-21 05:38:07,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-21 05:38:07,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-01-21 05:38:07,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,256 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,256 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,261 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,261 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-21 05:38:07,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-21 05:38:07,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-01-21 05:38:07,299 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,302 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,302 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,303 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,304 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,304 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,305 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,305 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,306 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,306 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,307 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,308 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,308 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,309 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,309 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-21 05:38:07,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-01-21 05:38:07,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2018-01-21 05:38:07,367 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,367 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,370 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,370 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,371 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,374 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,374 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,375 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,375 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,376 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,376 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,377 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,377 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,378 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,378 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,381 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,381 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:07,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-21 05:38:07,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:07,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-01-21 05:38:07,502 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-21 05:38:07,502 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:07,619 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-21 05:38:07,621 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 05:38:07,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 7, 16, 7] total 28 [2018-01-21 05:38:07,621 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 05:38:07,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-21 05:38:07,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-21 05:38:07,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2018-01-21 05:38:07,622 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 22 states. [2018-01-21 05:38:08,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:38:08,060 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2018-01-21 05:38:08,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-21 05:38:08,060 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 63 [2018-01-21 05:38:08,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:38:08,061 INFO L225 Difference]: With dead ends: 135 [2018-01-21 05:38:08,061 INFO L226 Difference]: Without dead ends: 78 [2018-01-21 05:38:08,062 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 217 SyntacticMatches, 16 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2018-01-21 05:38:08,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-21 05:38:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2018-01-21 05:38:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-21 05:38:08,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-01-21 05:38:08,071 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 63 [2018-01-21 05:38:08,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:38:08,071 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-01-21 05:38:08,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-21 05:38:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-01-21 05:38:08,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-21 05:38:08,072 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:38:08,072 INFO L322 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:38:08,072 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-21 05:38:08,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1961550311, now seen corresponding path program 4 times [2018-01-21 05:38:08,073 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:38:08,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:08,074 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 05:38:08,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:08,074 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:38:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:08,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:38:08,358 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:08,359 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:08,359 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 05:38:08,359 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 05:38:08,359 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 05:38:08,359 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:08,359 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-21 05:38:08,378 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-21 05:38:08,378 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-21 05:38:08,426 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:08,428 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:08,516 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:08,516 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:08,637 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:08,637 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-21 05:38:08,640 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-21 05:38:08,640 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-21 05:38:08,697 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:08,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:08,707 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:08,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 05:38:08,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 23 [2018-01-21 05:38:08,739 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 05:38:08,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-21 05:38:08,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-21 05:38:08,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=320, Unknown=0, NotChecked=0, Total=506 [2018-01-21 05:38:08,740 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 16 states. [2018-01-21 05:38:08,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:38:08,785 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2018-01-21 05:38:08,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 05:38:08,786 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 70 [2018-01-21 05:38:08,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:38:08,786 INFO L225 Difference]: With dead ends: 136 [2018-01-21 05:38:08,787 INFO L226 Difference]: Without dead ends: 76 [2018-01-21 05:38:08,787 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 264 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=349, Unknown=0, NotChecked=0, Total=552 [2018-01-21 05:38:08,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-21 05:38:08,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-21 05:38:08,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-21 05:38:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-01-21 05:38:08,795 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 70 [2018-01-21 05:38:08,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:38:08,795 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-01-21 05:38:08,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-21 05:38:08,795 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-01-21 05:38:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-21 05:38:08,796 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:38:08,796 INFO L322 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:38:08,796 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-21 05:38:08,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1168255472, now seen corresponding path program 5 times [2018-01-21 05:38:08,797 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:38:08,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:08,797 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 05:38:08,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:08,798 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:38:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:08,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:38:08,903 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:08,903 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:08,903 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 05:38:08,903 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 05:38:08,904 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 05:38:08,904 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:08,904 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-21 05:38:08,910 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-21 05:38:08,911 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 05:38:08,918 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:08,929 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:08,933 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:08,943 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:08,945 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:08,947 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:08,985 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:09,103 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:09,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:09,124 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-21 05:38:09,127 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-21 05:38:09,127 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 05:38:09,136 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:09,141 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:09,152 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:09,195 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:09,211 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:09,215 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:09,226 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:09,226 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:09,271 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:09,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 05:38:09,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10] total 26 [2018-01-21 05:38:09,273 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 05:38:09,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-21 05:38:09,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-21 05:38:09,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=413, Unknown=0, NotChecked=0, Total=650 [2018-01-21 05:38:09,274 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 18 states. [2018-01-21 05:38:09,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:38:09,305 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-01-21 05:38:09,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-21 05:38:09,307 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 71 [2018-01-21 05:38:09,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:38:09,308 INFO L225 Difference]: With dead ends: 137 [2018-01-21 05:38:09,308 INFO L226 Difference]: Without dead ends: 77 [2018-01-21 05:38:09,308 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 266 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=256, Invalid=446, Unknown=0, NotChecked=0, Total=702 [2018-01-21 05:38:09,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-21 05:38:09,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-21 05:38:09,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-21 05:38:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-21 05:38:09,316 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 71 [2018-01-21 05:38:09,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:38:09,316 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-21 05:38:09,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-21 05:38:09,316 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-21 05:38:09,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-21 05:38:09,317 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:38:09,317 INFO L322 BasicCegarLoop]: trace histogram [7, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:38:09,317 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-21 05:38:09,318 INFO L82 PathProgramCache]: Analyzing trace with hash 592013063, now seen corresponding path program 6 times [2018-01-21 05:38:09,318 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:38:09,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:09,319 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 05:38:09,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:09,319 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:38:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:09,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:38:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:09,434 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:09,434 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 05:38:09,434 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 05:38:09,434 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 05:38:09,434 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:09,434 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-21 05:38:09,443 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-21 05:38:09,443 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-21 05:38:09,462 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 05:38:09,475 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 05:38:09,486 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 05:38:09,533 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 05:38:09,555 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 05:38:09,557 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:09,561 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:09,797 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:09,797 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:09,931 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:09,953 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:09,953 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-21 05:38:09,956 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-21 05:38:09,956 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-21 05:38:09,974 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 05:38:09,997 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 05:38:10,024 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 05:38:10,154 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 05:38:10,427 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-21 05:38:10,447 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:10,452 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:10,460 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:10,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 05:38:10,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 11] total 29 [2018-01-21 05:38:10,504 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 05:38:10,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-21 05:38:10,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-21 05:38:10,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=518, Unknown=0, NotChecked=0, Total=812 [2018-01-21 05:38:10,505 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 20 states. [2018-01-21 05:38:10,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:38:10,531 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-01-21 05:38:10,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-21 05:38:10,531 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2018-01-21 05:38:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:38:10,532 INFO L225 Difference]: With dead ends: 138 [2018-01-21 05:38:10,532 INFO L226 Difference]: Without dead ends: 78 [2018-01-21 05:38:10,532 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=555, Unknown=0, NotChecked=0, Total=870 [2018-01-21 05:38:10,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-21 05:38:10,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-21 05:38:10,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-21 05:38:10,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-01-21 05:38:10,537 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 72 [2018-01-21 05:38:10,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:38:10,537 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-01-21 05:38:10,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-21 05:38:10,538 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-01-21 05:38:10,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-21 05:38:10,538 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:38:10,538 INFO L322 BasicCegarLoop]: trace histogram [8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:38:10,539 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-21 05:38:10,539 INFO L82 PathProgramCache]: Analyzing trace with hash -674237200, now seen corresponding path program 7 times [2018-01-21 05:38:10,539 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:38:10,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:10,539 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 05:38:10,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:10,540 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:38:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:10,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:38:10,698 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:10,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:10,698 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 05:38:10,698 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 05:38:10,698 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 05:38:10,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:10,698 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-21 05:38:10,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:38:10,705 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 05:38:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:10,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:10,799 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:11,078 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:11,079 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-21 05:38:11,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:38:11,082 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 05:38:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:11,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:11,163 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:11,164 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:11,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 05:38:11,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12] total 32 [2018-01-21 05:38:11,234 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 05:38:11,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-21 05:38:11,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-21 05:38:11,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=635, Unknown=0, NotChecked=0, Total=992 [2018-01-21 05:38:11,235 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 22 states. [2018-01-21 05:38:11,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:38:11,345 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-01-21 05:38:11,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-21 05:38:11,346 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 73 [2018-01-21 05:38:11,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:38:11,346 INFO L225 Difference]: With dead ends: 139 [2018-01-21 05:38:11,347 INFO L226 Difference]: Without dead ends: 79 [2018-01-21 05:38:11,347 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 270 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=380, Invalid=676, Unknown=0, NotChecked=0, Total=1056 [2018-01-21 05:38:11,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-21 05:38:11,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-21 05:38:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-21 05:38:11,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-21 05:38:11,354 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 73 [2018-01-21 05:38:11,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:38:11,354 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-21 05:38:11,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-21 05:38:11,354 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-21 05:38:11,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-21 05:38:11,355 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:38:11,355 INFO L322 BasicCegarLoop]: trace histogram [9, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:38:11,355 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-21 05:38:11,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1273289689, now seen corresponding path program 8 times [2018-01-21 05:38:11,355 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:38:11,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:11,356 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:38:11,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:11,356 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:38:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:11,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:38:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:11,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:11,527 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 05:38:11,527 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 05:38:11,527 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 05:38:11,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:11,527 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-21 05:38:11,532 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 05:38:11,532 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 05:38:11,549 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:11,562 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:11,564 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:11,566 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:11,624 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:11,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:11,838 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-21 05:38:11,841 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 05:38:11,841 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 05:38:11,860 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:11,890 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:11,908 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:11,913 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:11,919 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:11,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 05:38:11,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13] total 35 [2018-01-21 05:38:11,974 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 05:38:11,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-21 05:38:11,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-21 05:38:11,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=764, Unknown=0, NotChecked=0, Total=1190 [2018-01-21 05:38:11,975 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 24 states. [2018-01-21 05:38:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:38:12,020 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2018-01-21 05:38:12,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-21 05:38:12,020 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-01-21 05:38:12,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:38:12,021 INFO L225 Difference]: With dead ends: 140 [2018-01-21 05:38:12,021 INFO L226 Difference]: Without dead ends: 80 [2018-01-21 05:38:12,022 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 272 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=451, Invalid=809, Unknown=0, NotChecked=0, Total=1260 [2018-01-21 05:38:12,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-21 05:38:12,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-21 05:38:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-21 05:38:12,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-01-21 05:38:12,027 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 74 [2018-01-21 05:38:12,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:38:12,027 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-01-21 05:38:12,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-21 05:38:12,027 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-01-21 05:38:12,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-21 05:38:12,027 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:38:12,028 INFO L322 BasicCegarLoop]: trace histogram [10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:38:12,028 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation]=== [2018-01-21 05:38:12,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1630919632, now seen corresponding path program 9 times [2018-01-21 05:38:12,028 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:38:12,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:12,028 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 05:38:12,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:12,029 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:38:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:12,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:38:12,157 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:12,157 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:12,157 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 05:38:12,157 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 05:38:12,157 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 05:38:12,157 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:12,158 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-21 05:38:12,163 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-21 05:38:12,163 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-21 05:38:12,176 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 05:38:12,186 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 05:38:12,200 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 05:38:12,202 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:12,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:12,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-21 05:38:12,222 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 10 treesize of output 9 [2018-01-21 05:38:12,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:12,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:12,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:12,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-21 05:38:12,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-21 05:38:12,240 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:12,241 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:12,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-21 05:38:12,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:12,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:12,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:12,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-21 05:38:12,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-01-21 05:38:12,266 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:12,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:12,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:12,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:12,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:12,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:12,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 88 [2018-01-21 05:38:12,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:12,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:12,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:12,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-01-21 05:38:12,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 48 [2018-01-21 05:38:12,634 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:12,634 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:12,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:12,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2018-01-21 05:38:12,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:12,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:12,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:12,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:3 [2018-01-21 05:38:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-01-21 05:38:12,688 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:13,160 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-21 05:38:13,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:1 [2018-01-21 05:38:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-01-21 05:38:13,193 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:13,194 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-21 05:38:13,197 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-21 05:38:13,197 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-21 05:38:13,228 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 05:38:13,257 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 05:38:13,356 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 05:38:13,392 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:13,401 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:13,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 05:38:13,407 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-21 05:38:13,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-21 05:38:13,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 05:38:13,463 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-01-21 05:38:13,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-21 05:38:13,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-21 05:38:13,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,509 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,509 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-21 05:38:13,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-21 05:38:13,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-01-21 05:38:13,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,577 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,577 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,578 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,579 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,581 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,582 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-21 05:38:13,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-21 05:38:13,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-01-21 05:38:13,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,643 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,646 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,646 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,647 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,647 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,649 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,649 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,650 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-21 05:38:13,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-21 05:38:13,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-01-21 05:38:13,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,728 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,729 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,729 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,730 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,730 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-21 05:38:13,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-01-21 05:38:13,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2018-01-21 05:38:13,820 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,821 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,821 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,824 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,827 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,827 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,828 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,829 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,829 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,830 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,831 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,831 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,832 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,832 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:13,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-21 05:38:13,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:13,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-01-21 05:38:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-01-21 05:38:14,409 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-01-21 05:38:14,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 05:38:14,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 12, 17, 8] total 57 [2018-01-21 05:38:14,786 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 05:38:14,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-21 05:38:14,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-21 05:38:14,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2893, Unknown=0, NotChecked=0, Total=3192 [2018-01-21 05:38:14,788 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 28 states. [2018-01-21 05:38:15,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:38:15,418 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2018-01-21 05:38:15,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-21 05:38:15,418 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 75 [2018-01-21 05:38:15,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:38:15,419 INFO L225 Difference]: With dead ends: 154 [2018-01-21 05:38:15,419 INFO L226 Difference]: Without dead ends: 94 [2018-01-21 05:38:15,421 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 245 SyntacticMatches, 13 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=373, Invalid=3787, Unknown=0, NotChecked=0, Total=4160 [2018-01-21 05:38:15,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-21 05:38:15,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-01-21 05:38:15,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-21 05:38:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-01-21 05:38:15,427 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 75 [2018-01-21 05:38:15,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:38:15,427 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-01-21 05:38:15,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-21 05:38:15,428 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-01-21 05:38:15,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-21 05:38:15,428 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:38:15,429 INFO L322 BasicCegarLoop]: trace histogram [11, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:38:15,429 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation]=== [2018-01-21 05:38:15,429 INFO L82 PathProgramCache]: Analyzing trace with hash 580128904, now seen corresponding path program 1 times [2018-01-21 05:38:15,429 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:38:15,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:15,430 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 05:38:15,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:15,430 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:38:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:15,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:38:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:15,610 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:15,611 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 05:38:15,611 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 80 with the following transitions: [2018-01-21 05:38:15,611 INFO L201 CegarAbsIntRunner]: [0], [4], [5], [8], [10], [11], [12], [14], [18], [19], [21], [25], [27], [28], [29], [31], [35], [36], [39], [41], [42], [43], [45], [49], [50], [52], [53], [55], [56], [57], [58], [59], [60], [61], [62], [69], [72], [75], [80], [82], [83], [84], [90], [91], [92], [93], [96], [97], [98], [99], [100], [101], [102] [2018-01-21 05:38:15,613 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 05:38:15,613 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 05:38:17,135 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 05:38:17,136 INFO L268 AbstractInterpreter]: Visited 53 different actions 84 times. Merged at 24 different actions 27 times. Never widened. Found 7 fixpoints after 6 different actions. Largest state had 20 variables. [2018-01-21 05:38:17,162 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 05:38:17,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:17,162 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-21 05:38:17,167 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:38:17,167 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 05:38:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:17,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:17,308 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:17,612 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:17,612 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-21 05:38:17,615 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:38:17,615 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 05:38:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:17,680 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:17,687 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:17,745 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 05:38:17,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15] total 41 [2018-01-21 05:38:17,746 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 05:38:17,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-21 05:38:17,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-21 05:38:17,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=1058, Unknown=0, NotChecked=0, Total=1640 [2018-01-21 05:38:17,747 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 28 states. [2018-01-21 05:38:17,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:38:17,792 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2018-01-21 05:38:17,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-21 05:38:17,793 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-01-21 05:38:17,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:38:17,793 INFO L225 Difference]: With dead ends: 164 [2018-01-21 05:38:17,794 INFO L226 Difference]: Without dead ends: 93 [2018-01-21 05:38:17,794 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 288 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=611, Invalid=1111, Unknown=0, NotChecked=0, Total=1722 [2018-01-21 05:38:17,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-21 05:38:17,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-01-21 05:38:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-21 05:38:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-01-21 05:38:17,803 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 79 [2018-01-21 05:38:17,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:38:17,803 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-01-21 05:38:17,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-21 05:38:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-01-21 05:38:17,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-21 05:38:17,804 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:38:17,804 INFO L322 BasicCegarLoop]: trace histogram [12, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:38:17,805 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation]=== [2018-01-21 05:38:17,805 INFO L82 PathProgramCache]: Analyzing trace with hash -50939265, now seen corresponding path program 2 times [2018-01-21 05:38:17,805 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:38:17,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:17,806 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:38:17,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:17,806 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:38:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:17,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:38:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:17,966 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:17,966 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 05:38:17,966 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 05:38:17,966 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 05:38:17,966 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:17,966 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-21 05:38:17,972 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 05:38:17,972 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 05:38:17,986 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:18,001 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:18,003 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:18,006 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:18,098 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:18,099 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:18,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:18,440 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-21 05:38:18,445 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 05:38:18,446 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 05:38:18,466 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:18,497 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:18,516 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:18,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:18,527 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:18,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 05:38:18,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16, 16, 16] total 44 [2018-01-21 05:38:18,586 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 05:38:18,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-21 05:38:18,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-21 05:38:18,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=1223, Unknown=0, NotChecked=0, Total=1892 [2018-01-21 05:38:18,587 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 30 states. [2018-01-21 05:38:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:38:18,626 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-01-21 05:38:18,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-21 05:38:18,626 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 80 [2018-01-21 05:38:18,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:38:18,627 INFO L225 Difference]: With dead ends: 165 [2018-01-21 05:38:18,627 INFO L226 Difference]: Without dead ends: 94 [2018-01-21 05:38:18,627 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 290 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=700, Invalid=1280, Unknown=0, NotChecked=0, Total=1980 [2018-01-21 05:38:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-21 05:38:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-01-21 05:38:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-21 05:38:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2018-01-21 05:38:18,634 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 80 [2018-01-21 05:38:18,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:38:18,634 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2018-01-21 05:38:18,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-21 05:38:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-01-21 05:38:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-21 05:38:18,635 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:38:18,635 INFO L322 BasicCegarLoop]: trace histogram [13, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:38:18,635 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation]=== [2018-01-21 05:38:18,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1860783976, now seen corresponding path program 3 times [2018-01-21 05:38:18,635 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:38:18,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:18,636 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 05:38:18,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:18,636 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:38:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:18,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:38:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-21 05:38:18,804 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:18,804 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 05:38:18,804 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 05:38:18,804 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 05:38:18,804 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:18,804 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-21 05:38:18,811 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-21 05:38:18,811 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-21 05:38:18,826 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 05:38:18,836 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 05:38:18,850 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 05:38:18,853 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:18,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:18,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 05:38:18,874 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-21 05:38:18,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:18,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:18,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:18,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-21 05:38:18,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 05:38:18,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:18,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:18,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-01-21 05:38:18,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:18,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:18,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:18,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-21 05:38:18,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-21 05:38:18,921 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:18,922 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:18,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:18,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:18,924 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:18,925 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:18,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-21 05:38:18,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:18,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:18,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:18,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-21 05:38:18,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-01-21 05:38:18,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:18,962 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:18,962 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:18,963 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:18,963 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:18,964 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:18,965 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:18,965 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:18,966 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:18,967 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:18,967 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:18,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:18,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-21 05:38:18,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:18,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:18,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:18,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-21 05:38:19,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-01-21 05:38:19,020 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,020 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,021 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,024 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,025 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,025 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,026 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-21 05:38:19,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:19,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:19,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:19,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-21 05:38:19,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-01-21 05:38:19,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,120 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,123 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,124 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,124 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,125 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,126 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,126 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,127 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,128 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,128 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,129 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,129 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-21 05:38:19,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:19,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:19,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:19,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-01-21 05:38:19,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2018-01-21 05:38:19,211 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,212 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,212 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,213 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,214 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,214 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,215 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,216 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,216 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,219 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,219 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,220 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,220 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,222 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,223 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,223 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,227 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:19,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-21 05:38:19,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:19,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:19,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:19,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-01-21 05:38:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-21 05:38:19,578 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-21 05:38:19,836 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:19,836 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-21 05:38:19,839 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-21 05:38:19,839 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-21 05:38:19,858 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 05:38:19,883 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 05:38:19,950 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-21 05:38:19,983 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:19,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:19,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 05:38:19,997 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-21 05:38:19,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:19,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:20,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:20,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-21 05:38:20,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 05:38:20,006 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,006 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-01-21 05:38:20,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:20,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:20,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:20,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-21 05:38:20,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-21 05:38:20,020 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,020 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,021 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,021 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-21 05:38:20,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:20,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:20,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:20,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-21 05:38:20,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-01-21 05:38:20,042 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,043 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,043 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,044 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,044 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,045 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,047 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,048 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,048 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,049 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-21 05:38:20,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:20,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:20,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:20,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-21 05:38:20,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-01-21 05:38:20,097 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,097 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,098 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,098 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,099 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,100 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,100 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,101 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,102 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,102 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,103 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,104 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,104 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,106 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,106 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-21 05:38:20,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:20,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:20,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:20,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-21 05:38:20,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-01-21 05:38:20,141 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,142 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,142 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,143 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,143 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,144 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,144 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,145 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,145 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-21 05:38:20,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:20,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:20,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:20,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-01-21 05:38:20,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2018-01-21 05:38:20,196 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,199 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,199 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,200 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,200 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,201 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,202 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,202 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,203 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,203 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,204 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,205 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,205 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,206 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,206 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,207 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,208 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,208 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,209 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,210 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,210 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,211 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,212 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,213 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,214 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 05:38:20,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-21 05:38:20,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:20,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:20,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:20,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-01-21 05:38:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-21 05:38:20,575 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-01-21 05:38:20,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 05:38:20,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 8, 17, 8] total 48 [2018-01-21 05:38:20,807 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 05:38:20,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-21 05:38:20,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-21 05:38:20,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1969, Unknown=0, NotChecked=0, Total=2256 [2018-01-21 05:38:20,808 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 32 states. [2018-01-21 05:38:21,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:38:21,465 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2018-01-21 05:38:21,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-21 05:38:21,465 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 81 [2018-01-21 05:38:21,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:38:21,466 INFO L225 Difference]: With dead ends: 178 [2018-01-21 05:38:21,466 INFO L226 Difference]: Without dead ends: 104 [2018-01-21 05:38:21,467 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 277 SyntacticMatches, 17 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1657 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=430, Invalid=3230, Unknown=0, NotChecked=0, Total=3660 [2018-01-21 05:38:21,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-21 05:38:21,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-01-21 05:38:21,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-21 05:38:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-01-21 05:38:21,475 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 81 [2018-01-21 05:38:21,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:38:21,476 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-01-21 05:38:21,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-21 05:38:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-01-21 05:38:21,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-21 05:38:21,476 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:38:21,477 INFO L322 BasicCegarLoop]: trace histogram [14, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:38:21,477 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation]=== [2018-01-21 05:38:21,477 INFO L82 PathProgramCache]: Analyzing trace with hash -777231677, now seen corresponding path program 4 times [2018-01-21 05:38:21,477 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:38:21,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:21,478 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 05:38:21,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:21,478 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:38:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:21,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:38:21,688 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-21 05:38:21,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:21,688 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 05:38:21,688 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 05:38:21,688 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 05:38:21,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:21,688 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-21 05:38:21,693 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-21 05:38:21,693 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-21 05:38:21,716 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:21,719 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-01-21 05:38:21,944 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:22,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2018-01-21 05:38:22,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2018-01-21 05:38:22,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-21 05:38:22,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-21 05:38:22,214 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:22,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-01-21 05:38:22,221 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:22,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 05:38:22,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 05:38:22,228 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2018-01-21 05:38:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-01-21 05:38:22,311 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:22,311 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-21 05:38:22,314 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-21 05:38:22,314 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-21 05:38:22,355 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:22,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:22,394 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-01-21 05:38:22,395 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:22,481 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-21 05:38:22,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:22,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 05:38:22,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:1 [2018-01-21 05:38:22,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2018-01-21 05:38:22,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-21 05:38:22,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:22,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-01-21 05:38:22,551 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 05:38:22,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2018-01-21 05:38:22,560 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-21 05:38:22,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 05:38:22,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 05:38:22,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2018-01-21 05:38:22,584 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 19 proven. 20 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-01-21 05:38:22,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 05:38:22,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 13, 14, 14] total 39 [2018-01-21 05:38:22,586 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 05:38:22,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-21 05:38:22,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-21 05:38:22,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1242, Unknown=0, NotChecked=0, Total=1482 [2018-01-21 05:38:22,587 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 30 states. [2018-01-21 05:38:31,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:38:31,162 INFO L93 Difference]: Finished difference Result 180 states and 192 transitions. [2018-01-21 05:38:31,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-21 05:38:31,162 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 88 [2018-01-21 05:38:31,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:38:31,163 INFO L225 Difference]: With dead ends: 180 [2018-01-21 05:38:31,163 INFO L226 Difference]: Without dead ends: 100 [2018-01-21 05:38:31,164 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 322 SyntacticMatches, 9 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2018-01-21 05:38:31,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-21 05:38:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-01-21 05:38:31,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-21 05:38:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2018-01-21 05:38:31,171 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 88 [2018-01-21 05:38:31,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:38:31,171 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2018-01-21 05:38:31,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-21 05:38:31,171 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2018-01-21 05:38:31,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-01-21 05:38:31,171 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:38:31,172 INFO L322 BasicCegarLoop]: trace histogram [15, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:38:31,172 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation]=== [2018-01-21 05:38:31,172 INFO L82 PathProgramCache]: Analyzing trace with hash -468179545, now seen corresponding path program 10 times [2018-01-21 05:38:31,172 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:38:31,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:31,173 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 05:38:31,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:31,173 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:38:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:31,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:38:31,398 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 05:38:31,398 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:31,399 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 05:38:31,399 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 05:38:31,399 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 05:38:31,399 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:31,399 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 05:38:31,404 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-21 05:38:31,404 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-21 05:38:31,484 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:31,487 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 05:38:31,643 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:32,070 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 05:38:32,090 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:32,090 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 32 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 32 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 05:38:32,093 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-21 05:38:32,094 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-21 05:38:32,210 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:32,216 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 05:38:32,229 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:32,329 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 05:38:32,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 05:38:32,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19, 19, 19] total 53 [2018-01-21 05:38:32,372 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 05:38:32,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-21 05:38:32,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-21 05:38:32,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=966, Invalid=1790, Unknown=0, NotChecked=0, Total=2756 [2018-01-21 05:38:32,373 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 36 states. [2018-01-21 05:38:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:38:32,464 INFO L93 Difference]: Finished difference Result 170 states and 180 transitions. [2018-01-21 05:38:32,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-21 05:38:32,465 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 92 [2018-01-21 05:38:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:38:32,465 INFO L225 Difference]: With dead ends: 170 [2018-01-21 05:38:32,465 INFO L226 Difference]: Without dead ends: 98 [2018-01-21 05:38:32,466 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 332 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1003, Invalid=1859, Unknown=0, NotChecked=0, Total=2862 [2018-01-21 05:38:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-21 05:38:32,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-21 05:38:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-21 05:38:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-01-21 05:38:32,473 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 92 [2018-01-21 05:38:32,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:38:32,473 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-01-21 05:38:32,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-21 05:38:32,474 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-01-21 05:38:32,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-21 05:38:32,474 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:38:32,474 INFO L322 BasicCegarLoop]: trace histogram [16, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:38:32,474 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation]=== [2018-01-21 05:38:32,475 INFO L82 PathProgramCache]: Analyzing trace with hash -804412144, now seen corresponding path program 11 times [2018-01-21 05:38:32,475 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:38:32,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:32,476 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 05:38:32,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:32,476 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:38:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:32,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:38:33,080 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 05:38:33,080 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:33,080 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 05:38:33,081 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 05:38:33,081 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 05:38:33,081 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:33,081 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 05:38:33,090 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-21 05:38:33,091 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 05:38:33,099 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:33,113 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:33,127 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:33,141 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:33,155 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:33,172 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:33,188 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:33,205 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:33,230 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:33,243 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:33,246 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:33,762 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 05:38:33,762 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 05:38:34,191 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 05:38:34,191 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 34 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 34 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 05:38:34,194 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-21 05:38:34,194 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 05:38:34,203 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:34,206 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:34,213 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:34,224 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:34,239 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:34,262 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:34,318 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:34,460 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:34,918 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 05:38:34,954 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 05:38:34,960 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 05:38:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 05:38:34,968 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 05:38:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-21 05:38:35,047 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 05:38:35,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20, 20, 20] total 56 [2018-01-21 05:38:35,048 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 05:38:35,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-21 05:38:35,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-21 05:38:35,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1077, Invalid=2003, Unknown=0, NotChecked=0, Total=3080 [2018-01-21 05:38:35,050 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 38 states. [2018-01-21 05:38:35,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:38:35,094 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2018-01-21 05:38:35,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-21 05:38:35,095 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 93 [2018-01-21 05:38:35,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:38:35,095 INFO L225 Difference]: With dead ends: 171 [2018-01-21 05:38:35,095 INFO L226 Difference]: Without dead ends: 99 [2018-01-21 05:38:35,097 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 334 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1116, Invalid=2076, Unknown=0, NotChecked=0, Total=3192 [2018-01-21 05:38:35,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-21 05:38:35,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-01-21 05:38:35,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-21 05:38:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2018-01-21 05:38:35,107 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 93 [2018-01-21 05:38:35,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:38:35,107 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2018-01-21 05:38:35,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-21 05:38:35,107 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2018-01-21 05:38:35,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-01-21 05:38:35,108 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:38:35,108 INFO L322 BasicCegarLoop]: trace histogram [17, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:38:35,108 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation]=== [2018-01-21 05:38:35,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1657279175, now seen corresponding path program 12 times [2018-01-21 05:38:35,109 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:38:35,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:35,110 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 05:38:35,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:38:35,110 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:38:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:38:35,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-01-21 05:38:35,280 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 05:38:35,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 05:38:35 BoogieIcfgContainer [2018-01-21 05:38:35,282 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 05:38:35,282 INFO L168 Benchmark]: Toolchain (without parser) took 43769.41 ms. Allocated memory was 304.6 MB in the beginning and 1.2 GB in the end (delta: 890.2 MB). Free memory was 262.9 MB in the beginning and 335.6 MB in the end (delta: -72.7 MB). Peak memory consumption was 817.5 MB. Max. memory is 5.3 GB. [2018-01-21 05:38:35,283 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 304.6 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 05:38:35,283 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.79 ms. Allocated memory is still 304.6 MB. Free memory was 261.9 MB in the beginning and 250.8 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-21 05:38:35,283 INFO L168 Benchmark]: Boogie Preprocessor took 35.26 ms. Allocated memory is still 304.6 MB. Free memory was 250.8 MB in the beginning and 248.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 05:38:35,284 INFO L168 Benchmark]: RCFGBuilder took 273.62 ms. Allocated memory is still 304.6 MB. Free memory was 248.8 MB in the beginning and 230.3 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-01-21 05:38:35,284 INFO L168 Benchmark]: TraceAbstraction took 43201.93 ms. Allocated memory was 304.6 MB in the beginning and 1.2 GB in the end (delta: 890.2 MB). Free memory was 230.3 MB in the beginning and 335.6 MB in the end (delta: -105.4 MB). Peak memory consumption was 784.9 MB. Max. memory is 5.3 GB. [2018-01-21 05:38:35,286 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 304.6 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 251.79 ms. Allocated memory is still 304.6 MB. Free memory was 261.9 MB in the beginning and 250.8 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.26 ms. Allocated memory is still 304.6 MB. Free memory was 250.8 MB in the beginning and 248.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 273.62 ms. Allocated memory is still 304.6 MB. Free memory was 248.8 MB in the beginning and 230.3 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 43201.93 ms. Allocated memory was 304.6 MB in the beginning and 1.2 GB in the end (delta: 890.2 MB). Free memory was 230.3 MB in the beginning and 335.6 MB in the end (delta: -105.4 MB). Peak memory consumption was 784.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 47 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 430 LocStat_NO_SUPPORTING_DISEQUALITIES : 88 LocStat_NO_DISJUNCTIONS : -94 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 60 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 60 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.539202 RENAME_VARIABLES(MILLISECONDS) : 0.115774 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.484840 PROJECTAWAY(MILLISECONDS) : 0.098935 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.104319 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.141396 ADD_EQUALITY(MILLISECONDS) : 0.017660 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.018258 #CONJOIN_DISJUNCTIVE : 83 #RENAME_VARIABLES : 150 #UNFREEZE : 0 #CONJOIN : 134 #PROJECTAWAY : 145 #ADD_WEAK_EQUALITY : 17 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 150 #ADD_EQUALITY : 75 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 47 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 430 LocStat_NO_SUPPORTING_DISEQUALITIES : 88 LocStat_NO_DISJUNCTIONS : -94 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 61 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 70 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 61 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.284558 RENAME_VARIABLES(MILLISECONDS) : 0.098366 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.251573 PROJECTAWAY(MILLISECONDS) : 0.070422 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.034395 DISJOIN(MILLISECONDS) : 0.363922 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.130250 ADD_EQUALITY(MILLISECONDS) : 0.010354 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009847 #CONJOIN_DISJUNCTIVE : 101 #RENAME_VARIABLES : 196 #UNFREEZE : 0 #CONJOIN : 170 #PROJECTAWAY : 179 #ADD_WEAK_EQUALITY : 19 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 196 #ADD_EQUALITY : 78 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 47 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 419 LocStat_NO_SUPPORTING_DISEQUALITIES : 90 LocStat_NO_DISJUNCTIONS : -94 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 60 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 74 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 60 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.224234 RENAME_VARIABLES(MILLISECONDS) : 0.060893 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.199123 PROJECTAWAY(MILLISECONDS) : 0.042860 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.051367 DISJOIN(MILLISECONDS) : 0.225670 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.074514 ADD_EQUALITY(MILLISECONDS) : 0.009066 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008469 #CONJOIN_DISJUNCTIVE : 113 #RENAME_VARIABLES : 218 #UNFREEZE : 0 #CONJOIN : 180 #PROJECTAWAY : 190 #ADD_WEAK_EQUALITY : 19 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 218 #ADD_EQUALITY : 82 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 50 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 438 LocStat_NO_SUPPORTING_DISEQUALITIES : 94 LocStat_NO_DISJUNCTIONS : -100 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 65 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 73 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 65 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.533211 RENAME_VARIABLES(MILLISECONDS) : 0.106145 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.515155 PROJECTAWAY(MILLISECONDS) : 0.086828 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.050555 DISJOIN(MILLISECONDS) : 0.179076 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.123777 ADD_EQUALITY(MILLISECONDS) : 0.008492 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007370 #CONJOIN_DISJUNCTIVE : 116 #RENAME_VARIABLES : 229 #UNFREEZE : 0 #CONJOIN : 189 #PROJECTAWAY : 203 #ADD_WEAK_EQUALITY : 19 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 229 #ADD_EQUALITY : 81 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 657]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: Sum2Err0EnsuresViolation CFG has 7 procedures, 60 locations, 6 error locations. SAFE Result, 0.4s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 21 PreInvPairs, 24 NumberOfFragments, 16 HoareAnnotationTreeSize, 21 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 961 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 7 procedures, 60 locations, 6 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 667]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: dummy_abortErr0EnsuresViolation CFG has 7 procedures, 60 locations, 6 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 784 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 7 procedures, 60 locations, 6 error locations. SAFE Result, 0.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 166 SDtfs, 31 SDslu, 178 SDs, 0 SdLazy, 67 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 8425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 647]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: SumErr0EnsuresViolation CFG has 7 procedures, 60 locations, 6 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 17, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 7 procedures, 60 locations, 6 error locations. TIMEOUT Result, 41.9s OverallTime, 22 OverallIterations, 17 TraceHistogramMax, 11.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1050 SDtfs, 368 SDslu, 9769 SDs, 0 SdLazy, 3005 SolverSat, 249 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5111 GetRequests, 4391 SyntacticMatches, 110 SemanticMatches, 610 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10365 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.2s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 24 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 3806 NumberOfCodeBlocks, 3728 NumberOfCodeBlocksAsserted, 104 NumberOfCheckSat, 6127 ConstructedInterpolants, 197 QuantifiedInterpolants, 1777004 SizeOfPredicates, 101 NumberOfNonLiveVariables, 6308 ConjunctsInSsa, 515 ConjunctsInUnsatCore, 87 InterpolantComputations, 6 PerfectInterpolantSequences, 2850/6101 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_05-38-35-301.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_05-38-35-301.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_05-38-35-301.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-21_05-38-35-301.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-21_05-38-35-301.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-21_05-38-35-301.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-21_05-38-35-301.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-21_05-38-35-301.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-21_05-38-35-301.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_05-38-35-301.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_05-38-35-301.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_05-38-35-301.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_05-38-35-301.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_05-38-35-301.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_05-38-35-301.csv Completed graceful shutdown