java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 13:02:08,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:02:08,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 13:02:08,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 13:02:08,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 13:02:08,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 13:02:08,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:02:08,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:02:08,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:02:08,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:02:08,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:02:08,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:02:08,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:02:08,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:02:08,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:02:08,187 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:02:08,188 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:02:08,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:02:08,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:02:08,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:02:08,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:02:08,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:02:08,196 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:02:08,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:02:08,199 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:02:08,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:02:08,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:02:08,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:02:08,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:02:08,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:02:08,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:02:08,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:02:08,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:02:08,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:02:08,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:02:08,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:02:08,206 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:02:08,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:02:08,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:02:08,207 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:02:08,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:02:08,209 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-05 13:02:08,224 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:02:08,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:02:08,224 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:02:08,224 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:02:08,225 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:02:08,225 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:02:08,226 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:02:08,226 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:02:08,226 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:02:08,226 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:02:08,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:02:08,227 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:02:08,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:02:08,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:02:08,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:02:08,228 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:02:08,228 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:02:08,228 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:02:08,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:02:08,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:02:08,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:02:08,229 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:02:08,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:02:08,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:02:08,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:02:08,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:02:08,230 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:02:08,230 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:02:08,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:02:08,230 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:02:08,260 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:02:08,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:02:08,276 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:02:08,278 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:02:08,278 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:02:08,279 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-09-05 13:02:08,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b389709/5d8847186b624b5d83c84f0802b5afbb/FLAGddaaf54b4 [2019-09-05 13:02:08,834 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:02:08,835 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-09-05 13:02:08,847 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b389709/5d8847186b624b5d83c84f0802b5afbb/FLAGddaaf54b4 [2019-09-05 13:02:09,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b389709/5d8847186b624b5d83c84f0802b5afbb [2019-09-05 13:02:09,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:02:09,193 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:02:09,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:02:09,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:02:09,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:02:09,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:02:09" (1/1) ... [2019-09-05 13:02:09,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d26bdcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:09, skipping insertion in model container [2019-09-05 13:02:09,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:02:09" (1/1) ... [2019-09-05 13:02:09,211 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:02:09,266 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:02:09,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:02:09,710 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:02:09,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:02:09,817 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:02:09,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:09 WrapperNode [2019-09-05 13:02:09,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:02:09,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:02:09,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:02:09,819 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:02:09,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:09" (1/1) ... [2019-09-05 13:02:09,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:09" (1/1) ... [2019-09-05 13:02:09,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:09" (1/1) ... [2019-09-05 13:02:09,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:09" (1/1) ... [2019-09-05 13:02:09,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:09" (1/1) ... [2019-09-05 13:02:09,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:09" (1/1) ... [2019-09-05 13:02:09,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:09" (1/1) ... [2019-09-05 13:02:09,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:02:09,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:02:09,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:02:09,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:02:09,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:09" (1/1) ... No working directory specified, using /storage/repos/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 [2019-09-05 13:02:09,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:02:09,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:02:09,974 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:02:09,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:02:09,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 13:02:09,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:02:09,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 13:02:09,975 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:02:09,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:02:09,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:02:10,851 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:02:10,852 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-05 13:02:10,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:02:10 BoogieIcfgContainer [2019-09-05 13:02:10,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:02:10,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:02:10,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:02:10,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:02:10,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 01:02:09" (1/3) ... [2019-09-05 13:02:10,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783873e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:02:10, skipping insertion in model container [2019-09-05 13:02:10,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:09" (2/3) ... [2019-09-05 13:02:10,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783873e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:02:10, skipping insertion in model container [2019-09-05 13:02:10,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:02:10" (3/3) ... [2019-09-05 13:02:10,862 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2019-09-05 13:02:10,872 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:02:10,880 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 13:02:10,898 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 13:02:10,928 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:02:10,928 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:02:10,928 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:02:10,929 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:02:10,929 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:02:10,929 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:02:10,929 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:02:10,929 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:02:10,950 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-09-05 13:02:10,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:10,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:10,970 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:10,971 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:10,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:10,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1537709744, now seen corresponding path program 1 times [2019-09-05 13:02:10,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:11,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:11,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:11,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:11,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:11,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:11,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 13:02:11,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:11,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:02:11,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:02:11,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:02:11,241 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2019-09-05 13:02:11,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:11,708 INFO L93 Difference]: Finished difference Result 149 states and 282 transitions. [2019-09-05 13:02:11,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:02:11,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-05 13:02:11,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:11,725 INFO L225 Difference]: With dead ends: 149 [2019-09-05 13:02:11,725 INFO L226 Difference]: Without dead ends: 145 [2019-09-05 13:02:11,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:02:11,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-05 13:02:11,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-09-05 13:02:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-05 13:02:11,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-09-05 13:02:11,820 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 143 [2019-09-05 13:02:11,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:11,820 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-09-05 13:02:11,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:02:11,821 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-09-05 13:02:11,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:11,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:11,825 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:11,827 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:11,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:11,828 INFO L82 PathProgramCache]: Analyzing trace with hash 470480343, now seen corresponding path program 1 times [2019-09-05 13:02:11,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:11,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:11,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:11,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:11,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:11,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:11,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:11,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 13:02:11,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:11,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:02:11,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:02:11,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:02:11,983 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-09-05 13:02:12,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:12,567 INFO L93 Difference]: Finished difference Result 277 states and 345 transitions. [2019-09-05 13:02:12,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:02:12,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-05 13:02:12,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:12,571 INFO L225 Difference]: With dead ends: 277 [2019-09-05 13:02:12,572 INFO L226 Difference]: Without dead ends: 277 [2019-09-05 13:02:12,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:02:12,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-05 13:02:12,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2019-09-05 13:02:12,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-05 13:02:12,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 345 transitions. [2019-09-05 13:02:12,590 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 345 transitions. Word has length 143 [2019-09-05 13:02:12,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:12,591 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 345 transitions. [2019-09-05 13:02:12,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:02:12,591 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 345 transitions. [2019-09-05 13:02:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:12,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:12,595 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:12,595 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:12,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:12,596 INFO L82 PathProgramCache]: Analyzing trace with hash 859387544, now seen corresponding path program 1 times [2019-09-05 13:02:12,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:12,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:12,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:12,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:12,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:12,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:12,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-05 13:02:12,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:12,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 13:02:12,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 13:02:12,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:02:12,814 INFO L87 Difference]: Start difference. First operand 277 states and 345 transitions. Second operand 7 states. [2019-09-05 13:02:13,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:13,579 INFO L93 Difference]: Finished difference Result 269 states and 333 transitions. [2019-09-05 13:02:13,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:02:13,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-09-05 13:02:13,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:13,581 INFO L225 Difference]: With dead ends: 269 [2019-09-05 13:02:13,581 INFO L226 Difference]: Without dead ends: 269 [2019-09-05 13:02:13,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:02:13,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-05 13:02:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-09-05 13:02:13,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-05 13:02:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 333 transitions. [2019-09-05 13:02:13,598 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 333 transitions. Word has length 143 [2019-09-05 13:02:13,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:13,599 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 333 transitions. [2019-09-05 13:02:13,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 13:02:13,599 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 333 transitions. [2019-09-05 13:02:13,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:13,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:13,604 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:13,604 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:13,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:13,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1284631305, now seen corresponding path program 1 times [2019-09-05 13:02:13,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:13,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:13,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:13,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:13,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:13,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:13,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-05 13:02:13,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:13,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 13:02:13,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 13:02:13,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:02:13,779 INFO L87 Difference]: Start difference. First operand 269 states and 333 transitions. Second operand 8 states. [2019-09-05 13:02:14,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:14,766 INFO L93 Difference]: Finished difference Result 267 states and 330 transitions. [2019-09-05 13:02:14,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 13:02:14,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 143 [2019-09-05 13:02:14,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:14,768 INFO L225 Difference]: With dead ends: 267 [2019-09-05 13:02:14,768 INFO L226 Difference]: Without dead ends: 267 [2019-09-05 13:02:14,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:02:14,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-05 13:02:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2019-09-05 13:02:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-05 13:02:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 330 transitions. [2019-09-05 13:02:14,779 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 330 transitions. Word has length 143 [2019-09-05 13:02:14,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:14,779 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 330 transitions. [2019-09-05 13:02:14,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 13:02:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 330 transitions. [2019-09-05 13:02:14,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:14,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:14,782 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:14,782 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:14,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:14,783 INFO L82 PathProgramCache]: Analyzing trace with hash 698919756, now seen corresponding path program 1 times [2019-09-05 13:02:14,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:14,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:14,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:14,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:14,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:14,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:14,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:14,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-05 13:02:14,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:14,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 13:02:14,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 13:02:14,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:02:14,909 INFO L87 Difference]: Start difference. First operand 267 states and 330 transitions. Second operand 9 states. [2019-09-05 13:02:15,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:15,744 INFO L93 Difference]: Finished difference Result 265 states and 327 transitions. [2019-09-05 13:02:15,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 13:02:15,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 143 [2019-09-05 13:02:15,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:15,748 INFO L225 Difference]: With dead ends: 265 [2019-09-05 13:02:15,748 INFO L226 Difference]: Without dead ends: 265 [2019-09-05 13:02:15,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:02:15,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-09-05 13:02:15,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2019-09-05 13:02:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-05 13:02:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 327 transitions. [2019-09-05 13:02:15,764 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 327 transitions. Word has length 143 [2019-09-05 13:02:15,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:15,764 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 327 transitions. [2019-09-05 13:02:15,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 13:02:15,765 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 327 transitions. [2019-09-05 13:02:15,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:15,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:15,767 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:15,768 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:15,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:15,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2054450191, now seen corresponding path program 1 times [2019-09-05 13:02:15,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:15,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:15,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:15,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:15,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:16,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:16,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-05 13:02:16,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:16,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 13:02:16,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 13:02:16,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-05 13:02:16,011 INFO L87 Difference]: Start difference. First operand 265 states and 327 transitions. Second operand 12 states. [2019-09-05 13:02:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:16,541 INFO L93 Difference]: Finished difference Result 259 states and 318 transitions. [2019-09-05 13:02:16,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 13:02:16,543 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2019-09-05 13:02:16,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:16,546 INFO L225 Difference]: With dead ends: 259 [2019-09-05 13:02:16,546 INFO L226 Difference]: Without dead ends: 259 [2019-09-05 13:02:16,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-05 13:02:16,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-09-05 13:02:16,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-09-05 13:02:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-05 13:02:16,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 318 transitions. [2019-09-05 13:02:16,554 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 318 transitions. Word has length 143 [2019-09-05 13:02:16,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:16,555 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 318 transitions. [2019-09-05 13:02:16,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 13:02:16,555 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 318 transitions. [2019-09-05 13:02:16,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:16,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:16,557 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:16,557 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:16,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:16,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1013609311, now seen corresponding path program 1 times [2019-09-05 13:02:16,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:16,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:16,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:16,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:16,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:16,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:16,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:16,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-05 13:02:16,730 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:16,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 13:02:16,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 13:02:16,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-05 13:02:16,732 INFO L87 Difference]: Start difference. First operand 259 states and 318 transitions. Second operand 14 states. [2019-09-05 13:02:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:17,677 INFO L93 Difference]: Finished difference Result 255 states and 312 transitions. [2019-09-05 13:02:17,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 13:02:17,677 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 143 [2019-09-05 13:02:17,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:17,680 INFO L225 Difference]: With dead ends: 255 [2019-09-05 13:02:17,680 INFO L226 Difference]: Without dead ends: 255 [2019-09-05 13:02:17,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-05 13:02:17,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-05 13:02:17,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2019-09-05 13:02:17,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-05 13:02:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 312 transitions. [2019-09-05 13:02:17,689 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 312 transitions. Word has length 143 [2019-09-05 13:02:17,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:17,689 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 312 transitions. [2019-09-05 13:02:17,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 13:02:17,689 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 312 transitions. [2019-09-05 13:02:17,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:17,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:17,691 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:17,692 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:17,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:17,692 INFO L82 PathProgramCache]: Analyzing trace with hash 560132216, now seen corresponding path program 1 times [2019-09-05 13:02:17,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:17,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:17,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:17,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:17,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:17,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:17,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-05 13:02:17,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:17,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 13:02:17,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 13:02:17,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-05 13:02:17,870 INFO L87 Difference]: Start difference. First operand 255 states and 312 transitions. Second operand 15 states. [2019-09-05 13:02:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:19,326 INFO L93 Difference]: Finished difference Result 253 states and 309 transitions. [2019-09-05 13:02:19,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 13:02:19,327 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 143 [2019-09-05 13:02:19,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:19,330 INFO L225 Difference]: With dead ends: 253 [2019-09-05 13:02:19,330 INFO L226 Difference]: Without dead ends: 253 [2019-09-05 13:02:19,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-05 13:02:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-09-05 13:02:19,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2019-09-05 13:02:19,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-05 13:02:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2019-09-05 13:02:19,337 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 143 [2019-09-05 13:02:19,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:19,337 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2019-09-05 13:02:19,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 13:02:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2019-09-05 13:02:19,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:19,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:19,340 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:19,340 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:19,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:19,340 INFO L82 PathProgramCache]: Analyzing trace with hash 752755852, now seen corresponding path program 1 times [2019-09-05 13:02:19,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:19,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:19,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:19,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:19,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:19,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:19,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:19,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-05 13:02:19,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:19,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 13:02:19,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 13:02:19,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-05 13:02:19,508 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand 17 states. [2019-09-05 13:02:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:21,146 INFO L93 Difference]: Finished difference Result 249 states and 303 transitions. [2019-09-05 13:02:21,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 13:02:21,146 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 143 [2019-09-05 13:02:21,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:21,149 INFO L225 Difference]: With dead ends: 249 [2019-09-05 13:02:21,149 INFO L226 Difference]: Without dead ends: 249 [2019-09-05 13:02:21,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-05 13:02:21,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-09-05 13:02:21,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2019-09-05 13:02:21,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-05 13:02:21,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 303 transitions. [2019-09-05 13:02:21,156 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 303 transitions. Word has length 143 [2019-09-05 13:02:21,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:21,157 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 303 transitions. [2019-09-05 13:02:21,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 13:02:21,157 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 303 transitions. [2019-09-05 13:02:21,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:21,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:21,159 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:21,159 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:21,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:21,160 INFO L82 PathProgramCache]: Analyzing trace with hash -553376648, now seen corresponding path program 1 times [2019-09-05 13:02:21,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:21,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:21,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:21,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:21,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:21,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:21,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-05 13:02:21,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:21,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 13:02:21,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 13:02:21,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-05 13:02:21,363 INFO L87 Difference]: Start difference. First operand 249 states and 303 transitions. Second operand 19 states. [2019-09-05 13:02:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:22,049 INFO L93 Difference]: Finished difference Result 245 states and 297 transitions. [2019-09-05 13:02:22,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 13:02:22,052 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 143 [2019-09-05 13:02:22,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:22,054 INFO L225 Difference]: With dead ends: 245 [2019-09-05 13:02:22,054 INFO L226 Difference]: Without dead ends: 245 [2019-09-05 13:02:22,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-05 13:02:22,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-09-05 13:02:22,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-09-05 13:02:22,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-05 13:02:22,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 297 transitions. [2019-09-05 13:02:22,060 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 297 transitions. Word has length 143 [2019-09-05 13:02:22,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:22,061 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 297 transitions. [2019-09-05 13:02:22,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 13:02:22,061 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 297 transitions. [2019-09-05 13:02:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:22,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:22,063 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:22,063 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:22,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:22,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1465640920, now seen corresponding path program 1 times [2019-09-05 13:02:22,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:22,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:22,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:22,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:22,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:22,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:22,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:22,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-05 13:02:22,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:22,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 13:02:22,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 13:02:22,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-05 13:02:22,364 INFO L87 Difference]: Start difference. First operand 245 states and 297 transitions. Second operand 23 states. [2019-09-05 13:02:23,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:23,150 INFO L93 Difference]: Finished difference Result 237 states and 285 transitions. [2019-09-05 13:02:23,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 13:02:23,151 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 143 [2019-09-05 13:02:23,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:23,153 INFO L225 Difference]: With dead ends: 237 [2019-09-05 13:02:23,153 INFO L226 Difference]: Without dead ends: 237 [2019-09-05 13:02:23,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-05 13:02:23,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-05 13:02:23,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-09-05 13:02:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-09-05 13:02:23,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 285 transitions. [2019-09-05 13:02:23,160 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 285 transitions. Word has length 143 [2019-09-05 13:02:23,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:23,160 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 285 transitions. [2019-09-05 13:02:23,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 13:02:23,161 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 285 transitions. [2019-09-05 13:02:23,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:23,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:23,162 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:23,163 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:23,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:23,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1149693335, now seen corresponding path program 1 times [2019-09-05 13:02:23,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:23,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:23,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:23,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:23,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:23,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:23,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:23,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-05 13:02:23,451 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:23,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 13:02:23,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 13:02:23,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-05 13:02:23,452 INFO L87 Difference]: Start difference. First operand 237 states and 285 transitions. Second operand 24 states. [2019-09-05 13:02:25,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:25,627 INFO L93 Difference]: Finished difference Result 235 states and 282 transitions. [2019-09-05 13:02:25,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 13:02:25,628 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 143 [2019-09-05 13:02:25,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:25,631 INFO L225 Difference]: With dead ends: 235 [2019-09-05 13:02:25,631 INFO L226 Difference]: Without dead ends: 235 [2019-09-05 13:02:25,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-05 13:02:25,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-05 13:02:25,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-09-05 13:02:25,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-09-05 13:02:25,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 282 transitions. [2019-09-05 13:02:25,638 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 282 transitions. Word has length 143 [2019-09-05 13:02:25,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:25,639 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 282 transitions. [2019-09-05 13:02:25,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 13:02:25,639 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 282 transitions. [2019-09-05 13:02:25,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:25,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:25,640 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:25,641 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:25,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:25,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1452778676, now seen corresponding path program 1 times [2019-09-05 13:02:25,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:25,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:25,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:25,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:25,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:25,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:25,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:25,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-05 13:02:25,923 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:25,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 13:02:25,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 13:02:25,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-05 13:02:25,925 INFO L87 Difference]: Start difference. First operand 235 states and 282 transitions. Second operand 25 states. [2019-09-05 13:02:26,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:26,812 INFO L93 Difference]: Finished difference Result 233 states and 279 transitions. [2019-09-05 13:02:26,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 13:02:26,813 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 143 [2019-09-05 13:02:26,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:26,815 INFO L225 Difference]: With dead ends: 233 [2019-09-05 13:02:26,815 INFO L226 Difference]: Without dead ends: 233 [2019-09-05 13:02:26,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-05 13:02:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-09-05 13:02:26,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2019-09-05 13:02:26,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-05 13:02:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 279 transitions. [2019-09-05 13:02:26,822 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 279 transitions. Word has length 143 [2019-09-05 13:02:26,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:26,822 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 279 transitions. [2019-09-05 13:02:26,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 13:02:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 279 transitions. [2019-09-05 13:02:26,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:26,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:26,824 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:26,824 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:26,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:26,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1738588719, now seen corresponding path program 1 times [2019-09-05 13:02:26,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:26,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:26,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:26,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:26,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:27,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:27,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:27,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-05 13:02:27,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:27,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 13:02:27,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 13:02:27,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-05 13:02:27,226 INFO L87 Difference]: Start difference. First operand 233 states and 279 transitions. Second operand 28 states. [2019-09-05 13:02:29,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:29,157 INFO L93 Difference]: Finished difference Result 227 states and 270 transitions. [2019-09-05 13:02:29,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 13:02:29,158 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 143 [2019-09-05 13:02:29,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:29,159 INFO L225 Difference]: With dead ends: 227 [2019-09-05 13:02:29,160 INFO L226 Difference]: Without dead ends: 227 [2019-09-05 13:02:29,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-05 13:02:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-05 13:02:29,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-09-05 13:02:29,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-05 13:02:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 270 transitions. [2019-09-05 13:02:29,167 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 270 transitions. Word has length 143 [2019-09-05 13:02:29,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:29,168 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 270 transitions. [2019-09-05 13:02:29,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 13:02:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 270 transitions. [2019-09-05 13:02:29,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:29,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:29,169 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:29,169 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:29,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:29,170 INFO L82 PathProgramCache]: Analyzing trace with hash -512972737, now seen corresponding path program 1 times [2019-09-05 13:02:29,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:29,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:29,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:29,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:29,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:29,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:29,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:29,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-05 13:02:29,623 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:29,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 13:02:29,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 13:02:29,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-05 13:02:29,625 INFO L87 Difference]: Start difference. First operand 227 states and 270 transitions. Second operand 30 states. [2019-09-05 13:02:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:32,252 INFO L93 Difference]: Finished difference Result 223 states and 264 transitions. [2019-09-05 13:02:32,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 13:02:32,252 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 143 [2019-09-05 13:02:32,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:32,254 INFO L225 Difference]: With dead ends: 223 [2019-09-05 13:02:32,254 INFO L226 Difference]: Without dead ends: 223 [2019-09-05 13:02:32,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-05 13:02:32,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-05 13:02:32,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-09-05 13:02:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-05 13:02:32,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 264 transitions. [2019-09-05 13:02:32,261 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 264 transitions. Word has length 143 [2019-09-05 13:02:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:32,262 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 264 transitions. [2019-09-05 13:02:32,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 13:02:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 264 transitions. [2019-09-05 13:02:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:32,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:32,263 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:32,264 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:32,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:32,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1207573688, now seen corresponding path program 1 times [2019-09-05 13:02:32,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:32,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:32,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:32,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:32,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:32,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:32,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:32,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-05 13:02:32,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:32,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 13:02:32,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 13:02:32,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-05 13:02:32,724 INFO L87 Difference]: Start difference. First operand 223 states and 264 transitions. Second operand 31 states. [2019-09-05 13:02:34,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:34,604 INFO L93 Difference]: Finished difference Result 221 states and 261 transitions. [2019-09-05 13:02:34,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 13:02:34,604 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 143 [2019-09-05 13:02:34,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:34,606 INFO L225 Difference]: With dead ends: 221 [2019-09-05 13:02:34,606 INFO L226 Difference]: Without dead ends: 221 [2019-09-05 13:02:34,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-05 13:02:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-05 13:02:34,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-09-05 13:02:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-05 13:02:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 261 transitions. [2019-09-05 13:02:34,612 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 261 transitions. Word has length 143 [2019-09-05 13:02:34,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:34,613 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 261 transitions. [2019-09-05 13:02:34,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 13:02:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 261 transitions. [2019-09-05 13:02:34,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:34,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:34,614 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:34,614 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:34,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:34,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1520258956, now seen corresponding path program 1 times [2019-09-05 13:02:34,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:34,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:34,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:34,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:34,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:35,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:35,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-05 13:02:35,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:35,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 13:02:35,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 13:02:35,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 13:02:35,259 INFO L87 Difference]: Start difference. First operand 221 states and 261 transitions. Second operand 33 states. [2019-09-05 13:02:37,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:37,993 INFO L93 Difference]: Finished difference Result 217 states and 255 transitions. [2019-09-05 13:02:37,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 13:02:37,993 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 143 [2019-09-05 13:02:37,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:37,995 INFO L225 Difference]: With dead ends: 217 [2019-09-05 13:02:37,995 INFO L226 Difference]: Without dead ends: 217 [2019-09-05 13:02:37,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 13:02:37,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-05 13:02:38,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2019-09-05 13:02:38,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-05 13:02:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 255 transitions. [2019-09-05 13:02:38,005 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 255 transitions. Word has length 143 [2019-09-05 13:02:38,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:38,006 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 255 transitions. [2019-09-05 13:02:38,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 13:02:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 255 transitions. [2019-09-05 13:02:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:38,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:38,007 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:38,007 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:38,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:38,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1702235704, now seen corresponding path program 1 times [2019-09-05 13:02:38,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:38,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:38,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:38,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:38,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:38,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:38,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2019-09-05 13:02:38,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:38,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 13:02:38,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 13:02:38,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 13:02:38,649 INFO L87 Difference]: Start difference. First operand 217 states and 255 transitions. Second operand 35 states. [2019-09-05 13:02:39,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:39,878 INFO L93 Difference]: Finished difference Result 213 states and 249 transitions. [2019-09-05 13:02:39,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 13:02:39,879 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 143 [2019-09-05 13:02:39,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:39,881 INFO L225 Difference]: With dead ends: 213 [2019-09-05 13:02:39,881 INFO L226 Difference]: Without dead ends: 213 [2019-09-05 13:02:39,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 13:02:39,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-05 13:02:39,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-09-05 13:02:39,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-05 13:02:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 249 transitions. [2019-09-05 13:02:39,887 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 249 transitions. Word has length 143 [2019-09-05 13:02:39,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:39,887 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 249 transitions. [2019-09-05 13:02:39,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 13:02:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 249 transitions. [2019-09-05 13:02:39,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:39,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:39,889 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:39,889 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:39,890 INFO L82 PathProgramCache]: Analyzing trace with hash -2011984104, now seen corresponding path program 1 times [2019-09-05 13:02:39,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:39,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:39,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:39,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:39,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:40,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:40,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2019-09-05 13:02:40,580 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:40,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 13:02:40,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 13:02:40,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 13:02:40,583 INFO L87 Difference]: Start difference. First operand 213 states and 249 transitions. Second operand 39 states. [2019-09-05 13:02:42,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:42,405 INFO L93 Difference]: Finished difference Result 205 states and 237 transitions. [2019-09-05 13:02:42,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-05 13:02:42,405 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 143 [2019-09-05 13:02:42,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:42,407 INFO L225 Difference]: With dead ends: 205 [2019-09-05 13:02:42,407 INFO L226 Difference]: Without dead ends: 205 [2019-09-05 13:02:42,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 13:02:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-05 13:02:42,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-09-05 13:02:42,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-05 13:02:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 237 transitions. [2019-09-05 13:02:42,412 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 237 transitions. Word has length 143 [2019-09-05 13:02:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:42,413 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 237 transitions. [2019-09-05 13:02:42,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 13:02:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 237 transitions. [2019-09-05 13:02:42,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:42,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:42,414 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:42,415 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:42,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:42,415 INFO L82 PathProgramCache]: Analyzing trace with hash 221232183, now seen corresponding path program 1 times [2019-09-05 13:02:42,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:42,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:42,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:42,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:42,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:43,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:43,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2019-09-05 13:02:43,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:43,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-05 13:02:43,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-05 13:02:43,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 13:02:43,110 INFO L87 Difference]: Start difference. First operand 205 states and 237 transitions. Second operand 40 states. [2019-09-05 13:02:45,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:45,005 INFO L93 Difference]: Finished difference Result 203 states and 234 transitions. [2019-09-05 13:02:45,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-05 13:02:45,005 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 143 [2019-09-05 13:02:45,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:45,007 INFO L225 Difference]: With dead ends: 203 [2019-09-05 13:02:45,007 INFO L226 Difference]: Without dead ends: 203 [2019-09-05 13:02:45,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 13:02:45,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-05 13:02:45,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-09-05 13:02:45,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-05 13:02:45,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 234 transitions. [2019-09-05 13:02:45,013 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 234 transitions. Word has length 143 [2019-09-05 13:02:45,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:45,013 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 234 transitions. [2019-09-05 13:02:45,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-05 13:02:45,014 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 234 transitions. [2019-09-05 13:02:45,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:45,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:45,015 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:45,015 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:45,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:45,015 INFO L82 PathProgramCache]: Analyzing trace with hash 500367692, now seen corresponding path program 1 times [2019-09-05 13:02:45,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:45,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:45,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:45,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:45,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:45,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:45,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:45,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2019-09-05 13:02:45,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:45,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-05 13:02:45,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-05 13:02:45,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 13:02:45,861 INFO L87 Difference]: Start difference. First operand 203 states and 234 transitions. Second operand 41 states. [2019-09-05 13:02:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:47,713 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2019-09-05 13:02:47,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-05 13:02:47,715 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 143 [2019-09-05 13:02:47,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:47,716 INFO L225 Difference]: With dead ends: 201 [2019-09-05 13:02:47,716 INFO L226 Difference]: Without dead ends: 201 [2019-09-05 13:02:47,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 13:02:47,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-05 13:02:47,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-09-05 13:02:47,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-05 13:02:47,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 231 transitions. [2019-09-05 13:02:47,722 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 231 transitions. Word has length 143 [2019-09-05 13:02:47,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:47,723 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 231 transitions. [2019-09-05 13:02:47,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-05 13:02:47,723 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2019-09-05 13:02:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:47,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:47,724 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:47,724 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:47,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:47,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1383526833, now seen corresponding path program 1 times [2019-09-05 13:02:47,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:47,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:47,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:47,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:47,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:48,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:48,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2019-09-05 13:02:48,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:48,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-05 13:02:48,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-05 13:02:48,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 13:02:48,483 INFO L87 Difference]: Start difference. First operand 201 states and 231 transitions. Second operand 44 states. [2019-09-05 13:02:50,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:50,152 INFO L93 Difference]: Finished difference Result 195 states and 222 transitions. [2019-09-05 13:02:50,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-05 13:02:50,155 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 143 [2019-09-05 13:02:50,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:50,156 INFO L225 Difference]: With dead ends: 195 [2019-09-05 13:02:50,156 INFO L226 Difference]: Without dead ends: 195 [2019-09-05 13:02:50,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 13:02:50,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-05 13:02:50,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-09-05 13:02:50,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-05 13:02:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 222 transitions. [2019-09-05 13:02:50,160 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 222 transitions. Word has length 143 [2019-09-05 13:02:50,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:50,161 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 222 transitions. [2019-09-05 13:02:50,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-05 13:02:50,161 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 222 transitions. [2019-09-05 13:02:50,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:50,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:50,162 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:50,162 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:50,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:50,163 INFO L82 PathProgramCache]: Analyzing trace with hash -595537121, now seen corresponding path program 1 times [2019-09-05 13:02:50,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:50,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:50,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:50,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:50,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:50,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:50,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:50,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2019-09-05 13:02:50,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:50,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-05 13:02:50,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-05 13:02:50,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 13:02:50,937 INFO L87 Difference]: Start difference. First operand 195 states and 222 transitions. Second operand 46 states. [2019-09-05 13:02:52,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:52,250 INFO L93 Difference]: Finished difference Result 191 states and 216 transitions. [2019-09-05 13:02:52,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-05 13:02:52,251 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 143 [2019-09-05 13:02:52,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:52,252 INFO L225 Difference]: With dead ends: 191 [2019-09-05 13:02:52,252 INFO L226 Difference]: Without dead ends: 191 [2019-09-05 13:02:52,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 13:02:52,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-05 13:02:52,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-09-05 13:02:52,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-05 13:02:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2019-09-05 13:02:52,257 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 143 [2019-09-05 13:02:52,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:52,258 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2019-09-05 13:02:52,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-05 13:02:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2019-09-05 13:02:52,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:52,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:52,259 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:52,259 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:52,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:52,260 INFO L82 PathProgramCache]: Analyzing trace with hash -830587144, now seen corresponding path program 1 times [2019-09-05 13:02:52,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:52,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:52,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:52,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:52,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:53,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:53,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2019-09-05 13:02:53,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:53,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-05 13:02:53,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-05 13:02:53,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 13:02:53,300 INFO L87 Difference]: Start difference. First operand 191 states and 216 transitions. Second operand 47 states. [2019-09-05 13:02:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:56,403 INFO L93 Difference]: Finished difference Result 189 states and 213 transitions. [2019-09-05 13:02:56,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-05 13:02:56,404 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 143 [2019-09-05 13:02:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:56,405 INFO L225 Difference]: With dead ends: 189 [2019-09-05 13:02:56,406 INFO L226 Difference]: Without dead ends: 189 [2019-09-05 13:02:56,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 13:02:56,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-05 13:02:56,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-09-05 13:02:56,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-05 13:02:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 213 transitions. [2019-09-05 13:02:56,411 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 213 transitions. Word has length 143 [2019-09-05 13:02:56,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:56,412 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 213 transitions. [2019-09-05 13:02:56,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-05 13:02:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 213 transitions. [2019-09-05 13:02:56,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:56,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:56,413 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:56,413 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:56,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:56,414 INFO L82 PathProgramCache]: Analyzing trace with hash -228626292, now seen corresponding path program 1 times [2019-09-05 13:02:56,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:56,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:56,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:56,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:56,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:57,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:57,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:57,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2019-09-05 13:02:57,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:57,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-05 13:02:57,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-05 13:02:57,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 13:02:57,505 INFO L87 Difference]: Start difference. First operand 189 states and 213 transitions. Second operand 49 states. [2019-09-05 13:02:59,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:59,687 INFO L93 Difference]: Finished difference Result 185 states and 207 transitions. [2019-09-05 13:02:59,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-05 13:02:59,687 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 143 [2019-09-05 13:02:59,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:59,689 INFO L225 Difference]: With dead ends: 185 [2019-09-05 13:02:59,689 INFO L226 Difference]: Without dead ends: 185 [2019-09-05 13:02:59,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 13:02:59,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-05 13:02:59,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-09-05 13:02:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-05 13:02:59,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2019-09-05 13:02:59,694 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 143 [2019-09-05 13:02:59,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:59,694 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2019-09-05 13:02:59,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-05 13:02:59,694 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2019-09-05 13:02:59,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:02:59,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:59,695 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:59,696 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:59,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:59,696 INFO L82 PathProgramCache]: Analyzing trace with hash 679538168, now seen corresponding path program 1 times [2019-09-05 13:02:59,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:59,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:59,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:59,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:59,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:00,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:03:00,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2019-09-05 13:03:00,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:03:00,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-05 13:03:00,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-05 13:03:00,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 13:03:00,605 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand 51 states. [2019-09-05 13:03:02,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:02,090 INFO L93 Difference]: Finished difference Result 181 states and 201 transitions. [2019-09-05 13:03:02,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-05 13:03:02,091 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 143 [2019-09-05 13:03:02,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:02,092 INFO L225 Difference]: With dead ends: 181 [2019-09-05 13:03:02,092 INFO L226 Difference]: Without dead ends: 181 [2019-09-05 13:03:02,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 13:03:02,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-05 13:03:02,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-09-05 13:03:02,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-05 13:03:02,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 201 transitions. [2019-09-05 13:03:02,098 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 201 transitions. Word has length 143 [2019-09-05 13:03:02,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:02,098 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 201 transitions. [2019-09-05 13:03:02,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-05 13:03:02,098 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 201 transitions. [2019-09-05 13:03:02,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:03:02,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:02,099 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:02,100 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:02,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:02,100 INFO L82 PathProgramCache]: Analyzing trace with hash -200266664, now seen corresponding path program 1 times [2019-09-05 13:03:02,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:02,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:02,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:02,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:02,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:03,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:03,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:03:03,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2019-09-05 13:03:03,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:03:03,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-05 13:03:03,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-05 13:03:03,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 13:03:03,203 INFO L87 Difference]: Start difference. First operand 181 states and 201 transitions. Second operand 53 states. [2019-09-05 13:03:04,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:04,166 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2019-09-05 13:03:04,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-05 13:03:04,166 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 143 [2019-09-05 13:03:04,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:04,167 INFO L225 Difference]: With dead ends: 147 [2019-09-05 13:03:04,168 INFO L226 Difference]: Without dead ends: 147 [2019-09-05 13:03:04,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 13:03:04,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-05 13:03:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2019-09-05 13:03:04,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-05 13:03:04,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-09-05 13:03:04,172 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 143 [2019-09-05 13:03:04,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:04,172 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-09-05 13:03:04,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-05 13:03:04,172 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-09-05 13:03:04,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:03:04,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:04,173 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:04,173 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:04,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:04,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1774383300, now seen corresponding path program 1 times [2019-09-05 13:03:04,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:04,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:04,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:04,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:04,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:06,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:06,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:03:06,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2019-09-05 13:03:06,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:03:06,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-05 13:03:06,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-05 13:03:06,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-05 13:03:06,055 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 70 states. [2019-09-05 13:03:07,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:07,994 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-09-05 13:03:07,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-05 13:03:07,994 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 143 [2019-09-05 13:03:07,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:07,996 INFO L225 Difference]: With dead ends: 147 [2019-09-05 13:03:07,996 INFO L226 Difference]: Without dead ends: 147 [2019-09-05 13:03:07,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-05 13:03:07,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-05 13:03:07,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-09-05 13:03:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-05 13:03:08,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-09-05 13:03:08,000 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2019-09-05 13:03:08,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:08,000 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-09-05 13:03:08,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-05 13:03:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-09-05 13:03:08,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-05 13:03:08,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:08,001 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:08,002 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:08,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:08,002 INFO L82 PathProgramCache]: Analyzing trace with hash -87860138, now seen corresponding path program 1 times [2019-09-05 13:03:08,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:08,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:08,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:08,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:08,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:09,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:09,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:09,877 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-09-05 13:03:09,879 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [15], [18], [22], [25], [29], [32], [36], [39], [43], [46], [50], [53], [57], [60], [64], [67], [71], [74], [78], [81], [85], [88], [92], [95], [99], [102], [106], [109], [113], [116], [120], [123], [127], [130], [134], [137], [141], [144], [148], [151], [155], [158], [162], [165], [169], [172], [176], [179], [183], [186], [190], [193], [197], [200], [204], [207], [211], [214], [218], [221], [225], [228], [232], [235], [239], [242], [246], [249], [253], [256], [260], [263], [267], [270], [274], [277], [281], [284], [288], [291], [295], [298], [302], [305], [309], [312], [316], [319], [323], [326], [330], [333], [337], [340], [344], [347], [351], [354], [358], [365], [372], [379], [386], [393], [400], [407], [414], [421], [428], [435], [442], [449], [456], [463], [470], [477], [483], [485], [488], [489], [492], [495], [498], [501], [504], [507], [510], [513], [516], [519], [522], [525], [528], [531], [534], [537], [540], [694], [695], [696] [2019-09-05 13:03:09,921 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:03:09,921 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:03:10,086 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:03:10,089 INFO L272 AbstractInterpreter]: Visited 145 different actions 165 times. Merged at 5 different actions 15 times. Widened at 1 different actions 2 times. Performed 298 root evaluator evaluations with a maximum evaluation depth of 4. Performed 298 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2019-09-05 13:03:10,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:10,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:03:10,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:10,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-09-05 13:03:10,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:10,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:03:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:10,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-05 13:03:10,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:10,283 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:14,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:14,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 102 [2019-09-05 13:03:14,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:14,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-05 13:03:14,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-05 13:03:14,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:14,300 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 71 states. [2019-09-05 13:03:17,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:17,143 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-09-05 13:03:17,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-05 13:03:17,143 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 145 [2019-09-05 13:03:17,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:17,145 INFO L225 Difference]: With dead ends: 149 [2019-09-05 13:03:17,146 INFO L226 Difference]: Without dead ends: 149 [2019-09-05 13:03:17,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 222 SyntacticMatches, 38 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1881 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:17,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-05 13:03:17,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-09-05 13:03:17,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-05 13:03:17,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-09-05 13:03:17,151 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2019-09-05 13:03:17,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:17,152 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-09-05 13:03:17,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-05 13:03:17,152 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-09-05 13:03:17,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-05 13:03:17,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:17,153 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:17,153 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:17,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:17,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1458227952, now seen corresponding path program 2 times [2019-09-05 13:03:17,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:17,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:17,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:17,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:17,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:19,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:19,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:19,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:19,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:19,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:19,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:19,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-09-05 13:03:19,124 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:03:19,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:03:19,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 13:03:19,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:19,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-05 13:03:19,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:19,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:19,234 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:22,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:22,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 102 [2019-09-05 13:03:22,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:22,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-05 13:03:22,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-05 13:03:22,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:22,441 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 72 states. [2019-09-05 13:03:25,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:25,308 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-09-05 13:03:25,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-05 13:03:25,314 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 147 [2019-09-05 13:03:25,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:25,316 INFO L225 Difference]: With dead ends: 151 [2019-09-05 13:03:25,316 INFO L226 Difference]: Without dead ends: 151 [2019-09-05 13:03:25,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 225 SyntacticMatches, 40 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:25,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-05 13:03:25,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-09-05 13:03:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-05 13:03:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2019-09-05 13:03:25,325 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2019-09-05 13:03:25,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:25,326 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2019-09-05 13:03:25,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-05 13:03:25,326 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2019-09-05 13:03:25,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-05 13:03:25,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:25,327 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:25,327 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:25,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:25,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1190198026, now seen corresponding path program 3 times [2019-09-05 13:03:25,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:25,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:25,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:25,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:25,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:27,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:27,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:27,150 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:27,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:27,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:27,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:03:27,161 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:03:27,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:03:27,212 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:03:27,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:27,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-05 13:03:27,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:27,260 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:27,261 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:30,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:30,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 102 [2019-09-05 13:03:30,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:30,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-05 13:03:30,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-05 13:03:30,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:30,554 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 73 states. [2019-09-05 13:03:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:33,414 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-09-05 13:03:33,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-05 13:03:33,415 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 149 [2019-09-05 13:03:33,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:33,416 INFO L225 Difference]: With dead ends: 153 [2019-09-05 13:03:33,416 INFO L226 Difference]: Without dead ends: 153 [2019-09-05 13:03:33,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 228 SyntacticMatches, 42 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:33,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-05 13:03:33,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2019-09-05 13:03:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-05 13:03:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-09-05 13:03:33,420 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2019-09-05 13:03:33,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:33,420 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-09-05 13:03:33,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-05 13:03:33,420 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-09-05 13:03:33,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-05 13:03:33,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:33,421 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:33,422 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:33,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:33,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1311476900, now seen corresponding path program 4 times [2019-09-05 13:03:33,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:33,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:33,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:33,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:33,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:35,343 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:35,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:35,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:35,344 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:35,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:35,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:35,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-09-05 13:03:35,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:35,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:03:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:35,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-05 13:03:35,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:35,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:35,451 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:38,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:38,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 102 [2019-09-05 13:03:38,622 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:38,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-05 13:03:38,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-05 13:03:38,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:38,625 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 74 states. [2019-09-05 13:03:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:41,477 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-09-05 13:03:41,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-05 13:03:41,478 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 151 [2019-09-05 13:03:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:41,479 INFO L225 Difference]: With dead ends: 155 [2019-09-05 13:03:41,479 INFO L226 Difference]: Without dead ends: 155 [2019-09-05 13:03:41,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 231 SyntacticMatches, 44 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2178 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:41,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-05 13:03:41,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-09-05 13:03:41,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-05 13:03:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-09-05 13:03:41,484 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2019-09-05 13:03:41,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:41,485 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-09-05 13:03:41,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-05 13:03:41,485 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-09-05 13:03:41,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-05 13:03:41,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:41,486 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:41,486 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:41,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:41,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1896357822, now seen corresponding path program 5 times [2019-09-05 13:03:41,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:41,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:41,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:41,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:41,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:43,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:43,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:43,541 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:43,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:43,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:43,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:03:43,555 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:03:43,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:03:43,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-05 13:03:43,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:43,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-05 13:03:43,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:43,646 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:47,026 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:47,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:47,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 102 [2019-09-05 13:03:47,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:47,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-05 13:03:47,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-05 13:03:47,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:47,034 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 75 states. [2019-09-05 13:03:48,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:48,625 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2019-09-05 13:03:48,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-05 13:03:48,626 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 153 [2019-09-05 13:03:48,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:48,627 INFO L225 Difference]: With dead ends: 157 [2019-09-05 13:03:48,627 INFO L226 Difference]: Without dead ends: 157 [2019-09-05 13:03:48,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 234 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:48,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-05 13:03:48,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-09-05 13:03:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-05 13:03:48,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-09-05 13:03:48,632 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2019-09-05 13:03:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:48,632 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-09-05 13:03:48,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-05 13:03:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-09-05 13:03:48,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-05 13:03:48,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:48,633 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:48,633 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:48,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:48,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1326208088, now seen corresponding path program 6 times [2019-09-05 13:03:48,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:48,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:48,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:48,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:48,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:50,695 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:50,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:50,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:50,696 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:50,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:50,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:50,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-09-05 13:03:50,717 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:03:50,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:03:50,768 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:03:50,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:50,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-05 13:03:50,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:50,808 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:50,808 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:54,035 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:54,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:54,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 102 [2019-09-05 13:03:54,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:54,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-05 13:03:54,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-05 13:03:54,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:54,045 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 76 states. [2019-09-05 13:03:56,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:56,908 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-09-05 13:03:56,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-05 13:03:56,909 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 155 [2019-09-05 13:03:56,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:56,910 INFO L225 Difference]: With dead ends: 159 [2019-09-05 13:03:56,910 INFO L226 Difference]: Without dead ends: 159 [2019-09-05 13:03:56,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 237 SyntacticMatches, 48 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:56,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-05 13:03:56,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-09-05 13:03:56,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-05 13:03:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-09-05 13:03:56,914 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2019-09-05 13:03:56,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:56,915 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2019-09-05 13:03:56,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-05 13:03:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2019-09-05 13:03:56,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-05 13:03:56,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:56,916 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:56,916 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:56,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:56,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1126839694, now seen corresponding path program 7 times [2019-09-05 13:03:56,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:56,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:56,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:56,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:56,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:59,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:59,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:59,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:59,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:59,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:59,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:03:59,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:59,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:03:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:59,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-05 13:03:59,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:59,170 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:59,170 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:02,379 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:02,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:02,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 102 [2019-09-05 13:04:02,383 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:02,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-05 13:04:02,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-05 13:04:02,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:02,386 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 77 states. [2019-09-05 13:04:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:04,159 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-09-05 13:04:04,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-05 13:04:04,159 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 157 [2019-09-05 13:04:04,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:04,161 INFO L225 Difference]: With dead ends: 161 [2019-09-05 13:04:04,161 INFO L226 Difference]: Without dead ends: 161 [2019-09-05 13:04:04,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 240 SyntacticMatches, 50 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2475 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:04,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-05 13:04:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-09-05 13:04:04,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-05 13:04:04,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-09-05 13:04:04,166 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2019-09-05 13:04:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:04,166 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-09-05 13:04:04,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-05 13:04:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-09-05 13:04:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-05 13:04:04,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:04,168 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:04:04,168 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:04,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:04,168 INFO L82 PathProgramCache]: Analyzing trace with hash -568712692, now seen corresponding path program 8 times [2019-09-05 13:04:04,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:04,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:04,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:04:04,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:04,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:06,264 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:06,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:06,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:06,265 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:06,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:06,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:06,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-09-05 13:04:06,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:04:06,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:04:06,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-05 13:04:06,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:04:06,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-05 13:04:06,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:06,385 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:09,579 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:09,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:09,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 102 [2019-09-05 13:04:09,588 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:09,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-05 13:04:09,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-05 13:04:09,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:09,590 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 78 states. [2019-09-05 13:04:12,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:12,463 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-09-05 13:04:12,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-05 13:04:12,463 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 159 [2019-09-05 13:04:12,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:12,465 INFO L225 Difference]: With dead ends: 163 [2019-09-05 13:04:12,465 INFO L226 Difference]: Without dead ends: 163 [2019-09-05 13:04:12,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 243 SyntacticMatches, 52 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2574 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:12,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-05 13:04:12,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-09-05 13:04:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-05 13:04:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-09-05 13:04:12,469 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2019-09-05 13:04:12,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:12,470 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2019-09-05 13:04:12,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-05 13:04:12,470 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2019-09-05 13:04:12,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-05 13:04:12,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:12,471 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:04:12,471 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:12,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:12,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1079575770, now seen corresponding path program 9 times [2019-09-05 13:04:12,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:12,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:12,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:04:12,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:12,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:15,466 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:15,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:15,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:15,467 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:15,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:15,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:15,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:04:15,477 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:04:15,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:04:15,541 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:04:15,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:04:15,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-05 13:04:15,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:15,583 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:18,853 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:18,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:18,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 102 [2019-09-05 13:04:18,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:18,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-05 13:04:18,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-05 13:04:18,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:18,859 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 79 states. [2019-09-05 13:04:21,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:21,778 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-09-05 13:04:21,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-05 13:04:21,779 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 161 [2019-09-05 13:04:21,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:21,780 INFO L225 Difference]: With dead ends: 165 [2019-09-05 13:04:21,780 INFO L226 Difference]: Without dead ends: 165 [2019-09-05 13:04:21,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 246 SyntacticMatches, 54 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:21,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-05 13:04:21,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-09-05 13:04:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-05 13:04:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-09-05 13:04:21,783 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2019-09-05 13:04:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:21,784 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2019-09-05 13:04:21,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-05 13:04:21,784 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2019-09-05 13:04:21,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-05 13:04:21,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:21,785 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:04:21,785 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:21,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:21,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1902245312, now seen corresponding path program 10 times [2019-09-05 13:04:21,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:21,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:21,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:04:21,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:21,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:23,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:23,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:23,987 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:23,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:23,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:23,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-09-05 13:04:23,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:04:23,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:04:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:24,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-05 13:04:24,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:24,087 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:27,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:27,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 102 [2019-09-05 13:04:27,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:27,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-05 13:04:27,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-05 13:04:27,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:27,499 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 80 states. [2019-09-05 13:04:29,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:29,924 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-09-05 13:04:29,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-05 13:04:29,924 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 163 [2019-09-05 13:04:29,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:29,926 INFO L225 Difference]: With dead ends: 167 [2019-09-05 13:04:29,926 INFO L226 Difference]: Without dead ends: 167 [2019-09-05 13:04:29,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 249 SyntacticMatches, 56 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2772 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:29,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-05 13:04:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-09-05 13:04:29,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-05 13:04:29,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-09-05 13:04:29,930 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2019-09-05 13:04:29,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:29,931 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-09-05 13:04:29,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-05 13:04:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-09-05 13:04:29,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-05 13:04:29,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:29,932 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:04:29,932 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:29,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:29,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1605848614, now seen corresponding path program 11 times [2019-09-05 13:04:29,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:29,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:29,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:04:29,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:29,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:32,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:32,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:32,164 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:32,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:32,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:32,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:04:32,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:04:32,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:04:32,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-05 13:04:32,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:04:32,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-05 13:04:32,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:32,303 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:35,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:35,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 102 [2019-09-05 13:04:35,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:35,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-05 13:04:35,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-05 13:04:35,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:35,556 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 81 states. [2019-09-05 13:04:38,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:38,109 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2019-09-05 13:04:38,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-05 13:04:38,110 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 165 [2019-09-05 13:04:38,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:38,112 INFO L225 Difference]: With dead ends: 169 [2019-09-05 13:04:38,112 INFO L226 Difference]: Without dead ends: 169 [2019-09-05 13:04:38,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 252 SyntacticMatches, 58 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2871 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:38,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-05 13:04:38,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2019-09-05 13:04:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-05 13:04:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2019-09-05 13:04:38,116 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2019-09-05 13:04:38,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:38,117 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2019-09-05 13:04:38,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-05 13:04:38,117 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2019-09-05 13:04:38,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-05 13:04:38,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:38,118 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:04:38,118 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:38,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:38,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1334784140, now seen corresponding path program 12 times [2019-09-05 13:04:38,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:38,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:38,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:04:38,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:38,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:40,433 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:40,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:40,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:40,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:40,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:40,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:40,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-09-05 13:04:40,451 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:04:40,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:04:40,505 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:04:40,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:04:40,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-05 13:04:40,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:40,541 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:43,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:43,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 102 [2019-09-05 13:04:43,845 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:43,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-05 13:04:43,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-05 13:04:43,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:43,846 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 82 states. [2019-09-05 13:04:46,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:46,771 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-09-05 13:04:46,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-05 13:04:46,772 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 167 [2019-09-05 13:04:46,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:46,773 INFO L225 Difference]: With dead ends: 171 [2019-09-05 13:04:46,773 INFO L226 Difference]: Without dead ends: 171 [2019-09-05 13:04:46,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 255 SyntacticMatches, 60 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2970 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-05 13:04:46,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-09-05 13:04:46,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-05 13:04:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2019-09-05 13:04:46,777 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2019-09-05 13:04:46,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:46,777 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2019-09-05 13:04:46,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-05 13:04:46,777 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2019-09-05 13:04:46,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-05 13:04:46,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:46,778 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:04:46,778 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:46,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:46,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1460137614, now seen corresponding path program 13 times [2019-09-05 13:04:46,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:46,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:46,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:04:46,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:46,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:49,585 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:49,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:49,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:49,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:49,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:49,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:49,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:04:49,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:04:49,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:04:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:49,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-05 13:04:49,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:49,691 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:52,968 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:52,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:52,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 102 [2019-09-05 13:04:52,972 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:52,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-05 13:04:52,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-05 13:04:52,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:52,973 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 83 states. [2019-09-05 13:04:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:55,877 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2019-09-05 13:04:55,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-05 13:04:55,878 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 169 [2019-09-05 13:04:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:55,879 INFO L225 Difference]: With dead ends: 173 [2019-09-05 13:04:55,879 INFO L226 Difference]: Without dead ends: 173 [2019-09-05 13:04:55,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 258 SyntacticMatches, 62 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3069 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:55,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-05 13:04:55,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-09-05 13:04:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-05 13:04:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-09-05 13:04:55,884 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2019-09-05 13:04:55,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:55,884 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-09-05 13:04:55,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-05 13:04:55,884 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-09-05 13:04:55,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-05 13:04:55,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:55,886 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:04:55,886 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:55,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:55,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1269584088, now seen corresponding path program 14 times [2019-09-05 13:04:55,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:55,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:55,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:04:55,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:55,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:58,281 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:58,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:58,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:58,281 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:58,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:58,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:58,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-09-05 13:04:58,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:04:58,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:04:58,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-05 13:04:58,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:04:58,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-05 13:04:58,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:58,405 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:58,406 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:01,710 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:01,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:01,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 102 [2019-09-05 13:05:01,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:01,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-05 13:05:01,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-05 13:05:01,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:01,716 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 84 states. [2019-09-05 13:05:03,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:03,351 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-09-05 13:05:03,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-05 13:05:03,352 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 171 [2019-09-05 13:05:03,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:03,354 INFO L225 Difference]: With dead ends: 175 [2019-09-05 13:05:03,354 INFO L226 Difference]: Without dead ends: 175 [2019-09-05 13:05:03,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 261 SyntacticMatches, 64 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3168 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:03,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-05 13:05:03,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-09-05 13:05:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-05 13:05:03,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2019-09-05 13:05:03,357 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2019-09-05 13:05:03,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:03,358 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2019-09-05 13:05:03,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-05 13:05:03,358 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2019-09-05 13:05:03,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-05 13:05:03,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:03,359 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:05:03,359 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:03,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:03,360 INFO L82 PathProgramCache]: Analyzing trace with hash -307121854, now seen corresponding path program 15 times [2019-09-05 13:05:03,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:03,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:03,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:05:03,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:03,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:06,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:06,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:06,060 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:06,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:06,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:06,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:05:06,070 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:05:06,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:05:06,125 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:05:06,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:05:06,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-05 13:05:06,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:06,162 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:06,162 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:09,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:09,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 102 [2019-09-05 13:05:09,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:09,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-05 13:05:09,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-05 13:05:09,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:09,454 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 85 states. [2019-09-05 13:05:12,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:12,372 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-09-05 13:05:12,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-05 13:05:12,372 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 173 [2019-09-05 13:05:12,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:12,374 INFO L225 Difference]: With dead ends: 177 [2019-09-05 13:05:12,374 INFO L226 Difference]: Without dead ends: 177 [2019-09-05 13:05:12,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 264 SyntacticMatches, 66 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3267 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:12,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-05 13:05:12,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-09-05 13:05:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-05 13:05:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-09-05 13:05:12,380 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2019-09-05 13:05:12,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:12,380 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-09-05 13:05:12,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-05 13:05:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-09-05 13:05:12,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-05 13:05:12,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:12,382 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:05:12,382 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:12,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:12,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1201116380, now seen corresponding path program 16 times [2019-09-05 13:05:12,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:12,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:12,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:05:12,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:12,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:15,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:15,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:15,223 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:15,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:15,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:15,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-09-05 13:05:15,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:05:15,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:05:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:15,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-05 13:05:15,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:15,336 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:18,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:18,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 102 [2019-09-05 13:05:18,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:18,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-05 13:05:18,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-05 13:05:18,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:18,793 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 86 states. [2019-09-05 13:05:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:21,062 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-09-05 13:05:21,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-05 13:05:21,062 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 175 [2019-09-05 13:05:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:21,064 INFO L225 Difference]: With dead ends: 179 [2019-09-05 13:05:21,064 INFO L226 Difference]: Without dead ends: 179 [2019-09-05 13:05:21,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 267 SyntacticMatches, 68 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3366 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:21,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-05 13:05:21,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-09-05 13:05:21,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-05 13:05:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-09-05 13:05:21,068 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2019-09-05 13:05:21,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:21,069 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-09-05 13:05:21,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-05 13:05:21,069 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-09-05 13:05:21,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-05 13:05:21,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:21,070 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:05:21,070 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:21,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:21,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1080886794, now seen corresponding path program 17 times [2019-09-05 13:05:21,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:21,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:21,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:05:21,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:21,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:23,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:23,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:23,750 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:23,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:23,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:23,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:05:23,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:05:23,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:05:23,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-05 13:05:23,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:05:23,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-05 13:05:23,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:23,905 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:27,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:27,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 102 [2019-09-05 13:05:27,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:27,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-05 13:05:27,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-05 13:05:27,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:27,312 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 87 states. [2019-09-05 13:05:28,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:28,991 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-09-05 13:05:28,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-05 13:05:28,991 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 177 [2019-09-05 13:05:28,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:28,992 INFO L225 Difference]: With dead ends: 181 [2019-09-05 13:05:28,992 INFO L226 Difference]: Without dead ends: 181 [2019-09-05 13:05:28,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 270 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3465 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:28,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-05 13:05:28,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-09-05 13:05:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-05 13:05:28,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2019-09-05 13:05:28,996 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2019-09-05 13:05:28,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:28,996 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2019-09-05 13:05:28,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-05 13:05:28,997 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2019-09-05 13:05:28,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-05 13:05:28,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:28,998 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:05:28,998 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:28,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:28,998 INFO L82 PathProgramCache]: Analyzing trace with hash 642351248, now seen corresponding path program 18 times [2019-09-05 13:05:28,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:28,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:28,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:05:28,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:28,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:31,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:31,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:31,597 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:31,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:31,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:31,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-09-05 13:05:31,617 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:05:31,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:05:31,676 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:05:31,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:05:31,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-05 13:05:31,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:31,716 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:31,716 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:35,019 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:35,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:35,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 102 [2019-09-05 13:05:35,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:35,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-05 13:05:35,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-05 13:05:35,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:35,026 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 88 states. [2019-09-05 13:05:37,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:37,174 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-09-05 13:05:37,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-05 13:05:37,174 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 179 [2019-09-05 13:05:37,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:37,175 INFO L225 Difference]: With dead ends: 183 [2019-09-05 13:05:37,176 INFO L226 Difference]: Without dead ends: 183 [2019-09-05 13:05:37,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 273 SyntacticMatches, 72 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:37,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-05 13:05:37,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-09-05 13:05:37,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-05 13:05:37,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-09-05 13:05:37,179 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2019-09-05 13:05:37,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:37,179 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-09-05 13:05:37,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-05 13:05:37,180 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-09-05 13:05:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-05 13:05:37,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:37,180 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:05:37,181 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:37,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:37,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1183266646, now seen corresponding path program 19 times [2019-09-05 13:05:37,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:37,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:37,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:05:37,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:37,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:39,832 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:39,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:39,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:39,832 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:39,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:39,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:39,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:05:39,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:05:39,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:05:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:39,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-05 13:05:39,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:39,947 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:43,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:43,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 102 [2019-09-05 13:05:43,313 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:43,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-05 13:05:43,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-05 13:05:43,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:43,315 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 89 states. [2019-09-05 13:05:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:45,389 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-09-05 13:05:45,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-05 13:05:45,390 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 181 [2019-09-05 13:05:45,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:45,391 INFO L225 Difference]: With dead ends: 185 [2019-09-05 13:05:45,391 INFO L226 Difference]: Without dead ends: 185 [2019-09-05 13:05:45,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 276 SyntacticMatches, 74 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3663 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-05 13:05:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-09-05 13:05:45,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-05 13:05:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-09-05 13:05:45,396 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2019-09-05 13:05:45,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:45,396 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2019-09-05 13:05:45,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-05 13:05:45,396 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2019-09-05 13:05:45,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-05 13:05:45,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:45,397 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:05:45,398 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:45,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:45,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1039561284, now seen corresponding path program 20 times [2019-09-05 13:05:45,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:45,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:45,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:05:45,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:45,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:48,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:48,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:48,114 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:48,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:48,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:48,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-09-05 13:05:48,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:05:48,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:05:48,206 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-05 13:05:48,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:05:48,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-05 13:05:48,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:48,238 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:51,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:51,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 102 [2019-09-05 13:05:51,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:51,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-05 13:05:51,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-05 13:05:51,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:51,581 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 90 states. [2019-09-05 13:05:53,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:53,237 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-09-05 13:05:53,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-05 13:05:53,238 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 183 [2019-09-05 13:05:53,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:53,239 INFO L225 Difference]: With dead ends: 187 [2019-09-05 13:05:53,239 INFO L226 Difference]: Without dead ends: 187 [2019-09-05 13:05:53,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 279 SyntacticMatches, 76 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3762 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:53,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-05 13:05:53,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-09-05 13:05:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-05 13:05:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-09-05 13:05:53,243 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2019-09-05 13:05:53,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:53,244 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-09-05 13:05:53,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-05 13:05:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-09-05 13:05:53,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-05 13:05:53,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:53,245 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:05:53,245 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:53,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:53,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1716511394, now seen corresponding path program 21 times [2019-09-05 13:05:53,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:53,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:53,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:05:53,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:53,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:56,086 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:56,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:56,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:56,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:56,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:56,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:56,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:05:56,097 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:05:56,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:05:56,157 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:05:56,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:05:56,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-05 13:05:56,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:56,220 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:59,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:59,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 102 [2019-09-05 13:05:59,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:59,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-05 13:05:59,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-05 13:05:59,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:59,832 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 91 states. [2019-09-05 13:06:02,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:02,714 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-09-05 13:06:02,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-05 13:06:02,715 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 185 [2019-09-05 13:06:02,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:02,716 INFO L225 Difference]: With dead ends: 189 [2019-09-05 13:06:02,716 INFO L226 Difference]: Without dead ends: 189 [2019-09-05 13:06:02,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 282 SyntacticMatches, 78 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3861 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:02,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-05 13:06:02,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2019-09-05 13:06:02,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-05 13:06:02,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2019-09-05 13:06:02,721 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2019-09-05 13:06:02,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:02,722 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2019-09-05 13:06:02,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-05 13:06:02,722 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2019-09-05 13:06:02,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-05 13:06:02,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:02,723 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:06:02,723 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:02,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:02,723 INFO L82 PathProgramCache]: Analyzing trace with hash -307533320, now seen corresponding path program 22 times [2019-09-05 13:06:02,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:02,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:02,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:06:02,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:02,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:05,593 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:05,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:05,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:05,593 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:05,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:05,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:05,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-09-05 13:06:05,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:06:05,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:06:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:05,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-05 13:06:05,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:05,710 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:09,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:09,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 102 [2019-09-05 13:06:09,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:09,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-05 13:06:09,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-05 13:06:09,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:09,117 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 92 states. [2019-09-05 13:06:12,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:12,062 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-09-05 13:06:12,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-05 13:06:12,063 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 187 [2019-09-05 13:06:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:12,064 INFO L225 Difference]: With dead ends: 191 [2019-09-05 13:06:12,064 INFO L226 Difference]: Without dead ends: 191 [2019-09-05 13:06:12,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 285 SyntacticMatches, 80 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-05 13:06:12,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-09-05 13:06:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-05 13:06:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-09-05 13:06:12,069 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2019-09-05 13:06:12,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:12,070 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2019-09-05 13:06:12,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-05 13:06:12,070 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2019-09-05 13:06:12,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-05 13:06:12,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:12,071 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:06:12,071 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:12,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:12,072 INFO L82 PathProgramCache]: Analyzing trace with hash 805697554, now seen corresponding path program 23 times [2019-09-05 13:06:12,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:12,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:12,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:06:12,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:12,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:15,002 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:15,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:15,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:15,003 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:15,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:15,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:15,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:06:15,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:06:15,015 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:06:15,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-05 13:06:15,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:06:15,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-05 13:06:15,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:15,131 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:15,131 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:18,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:18,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 102 [2019-09-05 13:06:18,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:18,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-05 13:06:18,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-05 13:06:18,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:18,571 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 93 states. [2019-09-05 13:06:20,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:20,778 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2019-09-05 13:06:20,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-05 13:06:20,779 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 189 [2019-09-05 13:06:20,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:20,781 INFO L225 Difference]: With dead ends: 193 [2019-09-05 13:06:20,782 INFO L226 Difference]: Without dead ends: 193 [2019-09-05 13:06:20,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 288 SyntacticMatches, 82 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4059 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:20,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-05 13:06:20,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2019-09-05 13:06:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-05 13:06:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2019-09-05 13:06:20,785 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2019-09-05 13:06:20,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:20,786 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2019-09-05 13:06:20,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-05 13:06:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2019-09-05 13:06:20,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-05 13:06:20,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:20,787 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:06:20,787 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:20,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:20,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1173710764, now seen corresponding path program 24 times [2019-09-05 13:06:20,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:20,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:20,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:06:20,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:20,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:23,803 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:23,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:23,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:23,804 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:23,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:23,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:23,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-09-05 13:06:23,814 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:06:23,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:06:23,878 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:06:23,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:06:23,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-05 13:06:23,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:23,927 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:23,927 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:27,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:27,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 102 [2019-09-05 13:06:27,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:27,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-05 13:06:27,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-05 13:06:27,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:27,447 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 94 states. [2019-09-05 13:06:29,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:29,872 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-09-05 13:06:29,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-05 13:06:29,873 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 191 [2019-09-05 13:06:29,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:29,874 INFO L225 Difference]: With dead ends: 195 [2019-09-05 13:06:29,875 INFO L226 Difference]: Without dead ends: 195 [2019-09-05 13:06:29,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 291 SyntacticMatches, 84 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4158 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:29,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-05 13:06:29,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-09-05 13:06:29,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-05 13:06:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2019-09-05 13:06:29,879 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2019-09-05 13:06:29,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:29,879 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2019-09-05 13:06:29,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-05 13:06:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2019-09-05 13:06:29,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-05 13:06:29,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:29,881 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:06:29,881 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:29,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:29,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1647879994, now seen corresponding path program 25 times [2019-09-05 13:06:29,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:29,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:29,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:06:29,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:29,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:32,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:32,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:32,963 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:32,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:32,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:32,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:06:32,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:06:32,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:06:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:33,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-05 13:06:33,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:33,072 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:33,073 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:36,488 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:36,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:36,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 102 [2019-09-05 13:06:36,498 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:36,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-05 13:06:36,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-05 13:06:36,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:36,500 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 95 states. [2019-09-05 13:06:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:39,481 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2019-09-05 13:06:39,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-05 13:06:39,481 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 193 [2019-09-05 13:06:39,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:39,483 INFO L225 Difference]: With dead ends: 197 [2019-09-05 13:06:39,483 INFO L226 Difference]: Without dead ends: 197 [2019-09-05 13:06:39,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 294 SyntacticMatches, 86 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4257 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:39,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-05 13:06:39,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-09-05 13:06:39,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-05 13:06:39,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-09-05 13:06:39,487 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2019-09-05 13:06:39,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:39,487 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-09-05 13:06:39,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-05 13:06:39,487 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-09-05 13:06:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-05 13:06:39,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:39,496 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:06:39,496 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:39,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:39,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1222732640, now seen corresponding path program 26 times [2019-09-05 13:06:39,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:39,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:39,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:06:39,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:39,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:42,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:42,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:42,561 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:42,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:42,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:42,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-09-05 13:06:42,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:06:42,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:06:42,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-05 13:06:42,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:06:42,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-05 13:06:42,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:42,808 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:46,297 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:46,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:46,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 102 [2019-09-05 13:06:46,301 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:46,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-05 13:06:46,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-05 13:06:46,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:46,303 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 96 states. [2019-09-05 13:06:49,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:49,291 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-09-05 13:06:49,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-05 13:06:49,292 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 195 [2019-09-05 13:06:49,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:49,293 INFO L225 Difference]: With dead ends: 199 [2019-09-05 13:06:49,293 INFO L226 Difference]: Without dead ends: 199 [2019-09-05 13:06:49,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 297 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4356 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-05 13:06:49,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-09-05 13:06:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-05 13:06:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2019-09-05 13:06:49,296 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2019-09-05 13:06:49,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:49,296 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2019-09-05 13:06:49,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-05 13:06:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2019-09-05 13:06:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-05 13:06:49,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:49,297 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:06:49,297 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:49,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:49,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1782497414, now seen corresponding path program 27 times [2019-09-05 13:06:49,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:49,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:49,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:06:49,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:49,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:52,411 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:52,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:52,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:52,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:52,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:52,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:52,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:06:52,424 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:06:52,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:06:52,486 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:06:52,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:06:52,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-05 13:06:52,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:52,542 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:56,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:56,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 102 [2019-09-05 13:06:56,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:56,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-05 13:06:56,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-05 13:06:56,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:56,042 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 97 states. [2019-09-05 13:06:59,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:59,029 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-09-05 13:06:59,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-05 13:06:59,029 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 197 [2019-09-05 13:06:59,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:59,031 INFO L225 Difference]: With dead ends: 201 [2019-09-05 13:06:59,031 INFO L226 Difference]: Without dead ends: 201 [2019-09-05 13:06:59,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 300 SyntacticMatches, 90 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:59,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-05 13:06:59,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-09-05 13:06:59,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-05 13:06:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2019-09-05 13:06:59,035 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 197 [2019-09-05 13:06:59,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:59,035 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2019-09-05 13:06:59,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-05 13:06:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2019-09-05 13:06:59,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-05 13:06:59,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:59,036 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:06:59,037 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:59,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:59,037 INFO L82 PathProgramCache]: Analyzing trace with hash 704410900, now seen corresponding path program 28 times [2019-09-05 13:06:59,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:59,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:59,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:06:59,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:59,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:07:02,290 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:07:02,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:07:02,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:07:02,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:07:02,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:07:02,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:07:02,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-09-05 13:07:02,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:07:02,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:07:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:07:02,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-05 13:07:02,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:07:02,413 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:07:02,413 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:07:05,847 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:07:05,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:07:05,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 102 [2019-09-05 13:07:05,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:07:05,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-05 13:07:05,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-05 13:07:05,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:07:05,858 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 98 states. [2019-09-05 13:07:08,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:07:08,852 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-09-05 13:07:08,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-05 13:07:08,852 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 199 [2019-09-05 13:07:08,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:07:08,854 INFO L225 Difference]: With dead ends: 203 [2019-09-05 13:07:08,854 INFO L226 Difference]: Without dead ends: 203 [2019-09-05 13:07:08,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 303 SyntacticMatches, 92 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4554 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:07:08,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-05 13:07:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-09-05 13:07:08,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-05 13:07:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-09-05 13:07:08,858 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 199 [2019-09-05 13:07:08,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:07:08,858 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-09-05 13:07:08,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-05 13:07:08,858 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-09-05 13:07:08,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-05 13:07:08,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:07:08,859 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:07:08,859 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:07:08,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:07:08,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1673483218, now seen corresponding path program 29 times [2019-09-05 13:07:08,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:07:08,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:07:08,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:07:08,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:07:08,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:07:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:07:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:07:12,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:07:12,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:07:12,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:07:12,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:07:12,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:07:12,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:07:12,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:07:12,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:07:12,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-05 13:07:12,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:07:12,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-05 13:07:12,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:07:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:07:12,271 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:07:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:07:15,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:07:15,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 102 [2019-09-05 13:07:15,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:07:15,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-05 13:07:15,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-05 13:07:15,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:07:15,649 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 99 states. [2019-09-05 13:07:17,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:07:17,621 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-09-05 13:07:17,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-05 13:07:17,622 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 201 [2019-09-05 13:07:17,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:07:17,623 INFO L225 Difference]: With dead ends: 205 [2019-09-05 13:07:17,623 INFO L226 Difference]: Without dead ends: 205 [2019-09-05 13:07:17,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 306 SyntacticMatches, 94 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4653 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:07:17,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-05 13:07:17,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2019-09-05 13:07:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-09-05 13:07:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2019-09-05 13:07:17,627 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 201 [2019-09-05 13:07:17,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:07:17,627 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2019-09-05 13:07:17,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-05 13:07:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2019-09-05 13:07:17,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-05 13:07:17,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:07:17,628 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:07:17,628 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:07:17,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:07:17,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1907129144, now seen corresponding path program 30 times [2019-09-05 13:07:17,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:07:17,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:07:17,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:07:17,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:07:17,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:07:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:07:21,062 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:07:21,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:07:21,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:07:21,063 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:07:21,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:07:21,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:07:21,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-09-05 13:07:21,075 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:07:21,075 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:07:21,142 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:07:21,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:07:21,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-05 13:07:21,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:07:21,199 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:07:21,200 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:07:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:07:24,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:07:24,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 102 [2019-09-05 13:07:24,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:07:24,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-05 13:07:24,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-05 13:07:24,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:07:24,583 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 100 states. [2019-09-05 13:07:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:07:27,605 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-09-05 13:07:27,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-05 13:07:27,606 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 203 [2019-09-05 13:07:27,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:07:27,607 INFO L225 Difference]: With dead ends: 207 [2019-09-05 13:07:27,607 INFO L226 Difference]: Without dead ends: 207 [2019-09-05 13:07:27,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 309 SyntacticMatches, 96 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4752 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:07:27,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-05 13:07:27,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-09-05 13:07:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-05 13:07:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-09-05 13:07:27,610 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 203 [2019-09-05 13:07:27,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:07:27,610 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-09-05 13:07:27,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-05 13:07:27,610 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-09-05 13:07:27,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-05 13:07:27,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:07:27,611 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:07:27,611 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:07:27,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:07:27,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1192402658, now seen corresponding path program 31 times [2019-09-05 13:07:27,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:07:27,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:07:27,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:07:27,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:07:27,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:07:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:07:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:07:31,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:07:31,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:07:31,001 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:07:31,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:07:31,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:07:31,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:07:31,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:07:31,012 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:07:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:07:31,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-05 13:07:31,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:07:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:07:31,126 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:07:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:07:34,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:07:34,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 102 [2019-09-05 13:07:34,518 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:07:34,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-05 13:07:34,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-05 13:07:34,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:07:34,519 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 101 states. [2019-09-05 13:07:37,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:07:37,512 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2019-09-05 13:07:37,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-05 13:07:37,512 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 205 [2019-09-05 13:07:37,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:07:37,514 INFO L225 Difference]: With dead ends: 209 [2019-09-05 13:07:37,514 INFO L226 Difference]: Without dead ends: 209 [2019-09-05 13:07:37,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 312 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4851 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:07:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-05 13:07:37,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-09-05 13:07:37,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-05 13:07:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-09-05 13:07:37,518 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 205 [2019-09-05 13:07:37,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:07:37,518 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2019-09-05 13:07:37,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-05 13:07:37,518 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2019-09-05 13:07:37,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-05 13:07:37,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:07:37,519 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:07:37,519 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:07:37,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:07:37,520 INFO L82 PathProgramCache]: Analyzing trace with hash -864839044, now seen corresponding path program 32 times [2019-09-05 13:07:37,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:07:37,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:07:37,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:07:37,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:07:37,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:07:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:07:40,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:07:40,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:07:40,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:07:40,977 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:07:40,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:07:40,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:07:40,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-09-05 13:07:40,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:07:40,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:07:41,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-05 13:07:41,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:07:41,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-05 13:07:41,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:07:41,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:07:41,144 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:07:44,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:07:44,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:07:44,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 102 [2019-09-05 13:07:44,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:07:44,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-05 13:07:44,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-05 13:07:44,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:07:44,556 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 102 states. [2019-09-05 13:07:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:07:47,542 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-09-05 13:07:47,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-05 13:07:47,543 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 207 [2019-09-05 13:07:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:07:47,544 INFO L225 Difference]: With dead ends: 210 [2019-09-05 13:07:47,544 INFO L226 Difference]: Without dead ends: 210 [2019-09-05 13:07:47,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 315 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:07:47,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-05 13:07:47,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-09-05 13:07:47,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-05 13:07:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2019-09-05 13:07:47,547 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 207 [2019-09-05 13:07:47,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:07:47,548 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2019-09-05 13:07:47,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-05 13:07:47,548 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2019-09-05 13:07:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-05 13:07:47,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:07:47,549 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:07:47,549 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:07:47,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:07:47,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2105808790, now seen corresponding path program 33 times [2019-09-05 13:07:47,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:07:47,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:07:47,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:07:47,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:07:47,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:07:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:07:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:07:49,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:07:49,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:07:49,518 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:07:49,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:07:49,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:07:49,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:07:49,529 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:07:49,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:07:49,594 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:07:49,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:07:49,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-05 13:07:49,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:07:49,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:07:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:07:49,836 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:07:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:07:50,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:07:50,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 55 [2019-09-05 13:07:50,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:07:50,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-05 13:07:50,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-05 13:07:50,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 13:07:50,106 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 55 states. [2019-09-05 13:07:51,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:07:51,969 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2019-09-05 13:07:51,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-05 13:07:51,970 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2019-09-05 13:07:51,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:07:51,971 INFO L225 Difference]: With dead ends: 214 [2019-09-05 13:07:51,971 INFO L226 Difference]: Without dead ends: 213 [2019-09-05 13:07:51,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 416 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 13:07:51,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-05 13:07:51,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-09-05 13:07:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-05 13:07:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2019-09-05 13:07:51,976 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 209 [2019-09-05 13:07:51,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:07:51,976 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2019-09-05 13:07:51,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-05 13:07:51,976 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2019-09-05 13:07:51,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-05 13:07:51,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:07:51,977 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:07:51,977 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:07:51,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:07:51,977 INFO L82 PathProgramCache]: Analyzing trace with hash 745125424, now seen corresponding path program 34 times [2019-09-05 13:07:51,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:07:51,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:07:51,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:07:51,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:07:51,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:07:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:07:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 1156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:07:53,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:07:53,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-09-05 13:07:53,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:07:53,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-05 13:07:53,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-05 13:07:53,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:07:53,101 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 52 states. [2019-09-05 13:07:53,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:07:53,445 INFO L93 Difference]: Finished difference Result 207 states and 206 transitions. [2019-09-05 13:07:53,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-05 13:07:53,446 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 211 [2019-09-05 13:07:53,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:07:53,446 INFO L225 Difference]: With dead ends: 207 [2019-09-05 13:07:53,446 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 13:07:53,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:07:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 13:07:53,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 13:07:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 13:07:53,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 13:07:53,448 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2019-09-05 13:07:53,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:07:53,448 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 13:07:53,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-05 13:07:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 13:07:53,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 13:07:53,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 01:07:53 BoogieIcfgContainer [2019-09-05 13:07:53,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 13:07:53,456 INFO L168 Benchmark]: Toolchain (without parser) took 344261.84 ms. Allocated memory was 132.6 MB in the beginning and 569.9 MB in the end (delta: 437.3 MB). Free memory was 88.1 MB in the beginning and 141.1 MB in the end (delta: -53.0 MB). Peak memory consumption was 384.3 MB. Max. memory is 7.1 GB. [2019-09-05 13:07:53,456 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 13:07:53,457 INFO L168 Benchmark]: CACSL2BoogieTranslator took 624.20 ms. Allocated memory was 132.6 MB in the beginning and 200.3 MB in the end (delta: 67.6 MB). Free memory was 87.9 MB in the beginning and 171.9 MB in the end (delta: -84.0 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. [2019-09-05 13:07:53,457 INFO L168 Benchmark]: Boogie Preprocessor took 90.28 ms. Allocated memory is still 200.3 MB. Free memory was 171.6 MB in the beginning and 169.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-09-05 13:07:53,458 INFO L168 Benchmark]: RCFGBuilder took 944.28 ms. Allocated memory is still 200.3 MB. Free memory was 169.0 MB in the beginning and 106.8 MB in the end (delta: 62.2 MB). Peak memory consumption was 62.2 MB. Max. memory is 7.1 GB. [2019-09-05 13:07:53,458 INFO L168 Benchmark]: TraceAbstraction took 342599.23 ms. Allocated memory was 200.3 MB in the beginning and 569.9 MB in the end (delta: 369.6 MB). Free memory was 106.1 MB in the beginning and 141.1 MB in the end (delta: -34.9 MB). Peak memory consumption was 334.7 MB. Max. memory is 7.1 GB. [2019-09-05 13:07:53,461 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 624.20 ms. Allocated memory was 132.6 MB in the beginning and 200.3 MB in the end (delta: 67.6 MB). Free memory was 87.9 MB in the beginning and 171.9 MB in the end (delta: -84.0 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 90.28 ms. Allocated memory is still 200.3 MB. Free memory was 171.6 MB in the beginning and 169.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 944.28 ms. Allocated memory is still 200.3 MB. Free memory was 169.0 MB in the beginning and 106.8 MB in the end (delta: 62.2 MB). Peak memory consumption was 62.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 342599.23 ms. Allocated memory was 200.3 MB in the beginning and 569.9 MB in the end (delta: 369.6 MB). Free memory was 106.1 MB in the beginning and 141.1 MB in the end (delta: -34.9 MB). Peak memory consumption was 334.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 439]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 149 locations, 1 error locations. SAFE Result, 342.5s OverallTime, 62 OverallIterations, 34 TraceHistogramMax, 125.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4132 SDtfs, 6117 SDslu, 24767 SDs, 0 SdLazy, 200781 SolverSat, 5721 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 99.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15340 GetRequests, 9066 SyntacticMatches, 2210 SemanticMatches, 4064 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109296 ImplicationChecksByTransitivity, 204.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 62 MinimizatonAttempts, 35 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 210.1s InterpolantComputationTime, 15897 NumberOfCodeBlocks, 15897 NumberOfCodeBlocksAsserted, 293 NumberOfCheckSat, 21610 ConstructedInterpolants, 0 QuantifiedInterpolants, 10648676 SizeOfPredicates, 35 NumberOfNonLiveVariables, 14454 ConjunctsInSsa, 2844 ConjunctsInUnsatCore, 128 InterpolantComputations, 29 PerfectInterpolantSequences, 1156/38743 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...