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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:24:20,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:24:20,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:24:20,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:24:20,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:24:20,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:24:20,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:24:20,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:24:20,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:24:20,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:24:20,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:24:20,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:24:20,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:24:20,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:24:20,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:24:20,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:24:20,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:24:20,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:24:20,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:24:20,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:24:20,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:24:20,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:24:20,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:24:20,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:24:20,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:24:20,376 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:24:20,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:24:20,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:24:20,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:24:20,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:24:20,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:24:20,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:24:20,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:24:20,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:24:20,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:24:20,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:24:20,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:24:20,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:24:20,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:24:20,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:24:20,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:24:20,388 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:24:20,420 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:24:20,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:24:20,424 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:24:20,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:24:20,425 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:24:20,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:24:20,425 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:24:20,425 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:24:20,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:24:20,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:24:20,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:24:20,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:24:20,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:24:20,426 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:24:20,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:24:20,427 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:24:20,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:24:20,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:24:20,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:24:20,428 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:24:20,429 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:24:20,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:24:20,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:24:20,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:24:20,429 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:24:20,430 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:24:20,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:24:20,430 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:24:20,430 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:24:20,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:24:20,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:24:20,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:24:20,738 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:24:20,739 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:24:20,739 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-15 01:24:20,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44a96312/c1c2227f4bdf47829b6657e1dd3121de/FLAG05711ed55 [2019-10-15 01:24:21,295 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:24:21,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-15 01:24:21,309 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44a96312/c1c2227f4bdf47829b6657e1dd3121de/FLAG05711ed55 [2019-10-15 01:24:21,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44a96312/c1c2227f4bdf47829b6657e1dd3121de [2019-10-15 01:24:21,631 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:24:21,633 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:24:21,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:24:21,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:24:21,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:24:21,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:24:21" (1/1) ... [2019-10-15 01:24:21,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ceb8032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:21, skipping insertion in model container [2019-10-15 01:24:21,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:24:21" (1/1) ... [2019-10-15 01:24:21,648 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:24:21,699 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:24:21,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:24:21,969 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:24:22,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:24:22,138 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:24:22,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:22 WrapperNode [2019-10-15 01:24:22,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:24:22,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:24:22,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:24:22,140 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:24:22,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:22" (1/1) ... [2019-10-15 01:24:22,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:22" (1/1) ... [2019-10-15 01:24:22,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:22" (1/1) ... [2019-10-15 01:24:22,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:22" (1/1) ... [2019-10-15 01:24:22,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:22" (1/1) ... [2019-10-15 01:24:22,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:22" (1/1) ... [2019-10-15 01:24:22,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:22" (1/1) ... [2019-10-15 01:24:22,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:24:22,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:24:22,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:24:22,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:24:22,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:22" (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-10-15 01:24:22,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:24:22,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:24:22,260 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-10-15 01:24:22,260 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-10-15 01:24:22,260 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-10-15 01:24:22,260 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-10-15 01:24:22,260 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-10-15 01:24:22,260 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-15 01:24:22,261 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-15 01:24:22,261 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-10-15 01:24:22,261 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-10-15 01:24:22,261 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-10-15 01:24:22,261 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-10-15 01:24:22,261 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:24:22,262 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-15 01:24:22,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:24:22,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:24:22,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:24:22,262 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:24:22,263 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:24:22,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:24:22,263 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:24:22,263 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-10-15 01:24:22,263 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-10-15 01:24:22,263 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-10-15 01:24:22,264 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-10-15 01:24:22,264 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-10-15 01:24:22,264 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:24:22,264 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:24:22,264 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-10-15 01:24:22,264 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-10-15 01:24:22,265 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-10-15 01:24:22,265 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-10-15 01:24:22,265 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:24:22,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:24:22,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:24:23,101 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:24:23,101 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-15 01:24:23,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:24:23 BoogieIcfgContainer [2019-10-15 01:24:23,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:24:23,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:24:23,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:24:23,107 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:24:23,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:24:21" (1/3) ... [2019-10-15 01:24:23,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a63068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:24:23, skipping insertion in model container [2019-10-15 01:24:23,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:22" (2/3) ... [2019-10-15 01:24:23,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a63068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:24:23, skipping insertion in model container [2019-10-15 01:24:23,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:24:23" (3/3) ... [2019-10-15 01:24:23,111 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-15 01:24:23,121 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:24:23,129 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:24:23,141 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:24:23,168 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:24:23,168 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:24:23,168 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:24:23,168 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:24:23,169 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:24:23,169 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:24:23,169 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:24:23,169 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:24:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2019-10-15 01:24:23,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:24:23,202 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:23,203 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:23,205 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:23,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:23,211 INFO L82 PathProgramCache]: Analyzing trace with hash -968101902, now seen corresponding path program 1 times [2019-10-15 01:24:23,220 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:23,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701320714] [2019-10-15 01:24:23,221 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:23,221 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:23,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:23,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701320714] [2019-10-15 01:24:23,508 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:23,509 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:23,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197467595] [2019-10-15 01:24:23,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:23,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:23,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:23,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:23,528 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2019-10-15 01:24:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:23,730 INFO L93 Difference]: Finished difference Result 419 states and 679 transitions. [2019-10-15 01:24:23,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:23,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-15 01:24:23,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:23,753 INFO L225 Difference]: With dead ends: 419 [2019-10-15 01:24:23,755 INFO L226 Difference]: Without dead ends: 213 [2019-10-15 01:24:23,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:23,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-15 01:24:23,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-10-15 01:24:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-15 01:24:23,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 314 transitions. [2019-10-15 01:24:23,831 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 314 transitions. Word has length 21 [2019-10-15 01:24:23,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:23,831 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 314 transitions. [2019-10-15 01:24:23,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:23,832 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 314 transitions. [2019-10-15 01:24:23,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:24:23,834 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:23,835 INFO L380 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] [2019-10-15 01:24:23,835 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:23,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:23,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1316040493, now seen corresponding path program 1 times [2019-10-15 01:24:23,836 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:23,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604731655] [2019-10-15 01:24:23,836 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:23,836 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:23,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:23,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604731655] [2019-10-15 01:24:23,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:23,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:23,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031375011] [2019-10-15 01:24:23,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:23,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:23,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:23,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:23,952 INFO L87 Difference]: Start difference. First operand 211 states and 314 transitions. Second operand 4 states. [2019-10-15 01:24:24,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:24,063 INFO L93 Difference]: Finished difference Result 429 states and 645 transitions. [2019-10-15 01:24:24,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:24,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-15 01:24:24,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:24,072 INFO L225 Difference]: With dead ends: 429 [2019-10-15 01:24:24,072 INFO L226 Difference]: Without dead ends: 227 [2019-10-15 01:24:24,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:24,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-10-15 01:24:24,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-10-15 01:24:24,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-10-15 01:24:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 330 transitions. [2019-10-15 01:24:24,119 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 330 transitions. Word has length 22 [2019-10-15 01:24:24,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:24,120 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 330 transitions. [2019-10-15 01:24:24,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 330 transitions. [2019-10-15 01:24:24,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:24:24,124 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:24,125 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:24,125 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:24,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:24,125 INFO L82 PathProgramCache]: Analyzing trace with hash 919864782, now seen corresponding path program 1 times [2019-10-15 01:24:24,126 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:24,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282196074] [2019-10-15 01:24:24,127 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:24,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282196074] [2019-10-15 01:24:24,235 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:24,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:24,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978823330] [2019-10-15 01:24:24,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:24,236 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:24,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:24,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:24,237 INFO L87 Difference]: Start difference. First operand 224 states and 330 transitions. Second operand 3 states. [2019-10-15 01:24:24,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:24,265 INFO L93 Difference]: Finished difference Result 461 states and 691 transitions. [2019-10-15 01:24:24,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:24,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-15 01:24:24,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:24,269 INFO L225 Difference]: With dead ends: 461 [2019-10-15 01:24:24,269 INFO L226 Difference]: Without dead ends: 253 [2019-10-15 01:24:24,271 INFO L600 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-10-15 01:24:24,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-10-15 01:24:24,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 226. [2019-10-15 01:24:24,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-10-15 01:24:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 332 transitions. [2019-10-15 01:24:24,299 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 332 transitions. Word has length 30 [2019-10-15 01:24:24,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:24,300 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 332 transitions. [2019-10-15 01:24:24,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 332 transitions. [2019-10-15 01:24:24,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-15 01:24:24,302 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:24,302 INFO L380 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] [2019-10-15 01:24:24,302 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:24,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:24,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1667611779, now seen corresponding path program 1 times [2019-10-15 01:24:24,303 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:24,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168401988] [2019-10-15 01:24:24,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,304 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:24,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:24,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168401988] [2019-10-15 01:24:24,366 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:24,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:24,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570848169] [2019-10-15 01:24:24,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:24,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:24,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:24,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:24,368 INFO L87 Difference]: Start difference. First operand 226 states and 332 transitions. Second operand 5 states. [2019-10-15 01:24:24,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:24,407 INFO L93 Difference]: Finished difference Result 438 states and 649 transitions. [2019-10-15 01:24:24,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:24,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-15 01:24:24,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:24,410 INFO L225 Difference]: With dead ends: 438 [2019-10-15 01:24:24,410 INFO L226 Difference]: Without dead ends: 234 [2019-10-15 01:24:24,414 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:24,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-15 01:24:24,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2019-10-15 01:24:24,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-15 01:24:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 336 transitions. [2019-10-15 01:24:24,440 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 336 transitions. Word has length 38 [2019-10-15 01:24:24,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:24,440 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 336 transitions. [2019-10-15 01:24:24,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 336 transitions. [2019-10-15 01:24:24,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-15 01:24:24,442 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:24,442 INFO L380 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] [2019-10-15 01:24:24,442 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:24,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:24,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1792772014, now seen corresponding path program 1 times [2019-10-15 01:24:24,443 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:24,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159432213] [2019-10-15 01:24:24,443 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,444 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:24,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:24,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159432213] [2019-10-15 01:24:24,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:24,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:24,498 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012359755] [2019-10-15 01:24:24,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:24,499 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:24,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:24,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:24,500 INFO L87 Difference]: Start difference. First operand 230 states and 336 transitions. Second operand 4 states. [2019-10-15 01:24:24,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:24,533 INFO L93 Difference]: Finished difference Result 399 states and 588 transitions. [2019-10-15 01:24:24,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:24,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-10-15 01:24:24,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:24,537 INFO L225 Difference]: With dead ends: 399 [2019-10-15 01:24:24,537 INFO L226 Difference]: Without dead ends: 226 [2019-10-15 01:24:24,538 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:24,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-15 01:24:24,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-10-15 01:24:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-10-15 01:24:24,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 327 transitions. [2019-10-15 01:24:24,551 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 327 transitions. Word has length 39 [2019-10-15 01:24:24,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:24,552 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 327 transitions. [2019-10-15 01:24:24,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 327 transitions. [2019-10-15 01:24:24,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 01:24:24,553 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:24,554 INFO L380 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] [2019-10-15 01:24:24,554 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:24,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:24,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1839866744, now seen corresponding path program 1 times [2019-10-15 01:24:24,555 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:24,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621407437] [2019-10-15 01:24:24,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:24:24,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621407437] [2019-10-15 01:24:24,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:24,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:24,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488867573] [2019-10-15 01:24:24,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:24,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:24,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:24,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:24,612 INFO L87 Difference]: Start difference. First operand 226 states and 327 transitions. Second operand 4 states. [2019-10-15 01:24:24,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:24,685 INFO L93 Difference]: Finished difference Result 448 states and 658 transitions. [2019-10-15 01:24:24,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:24,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-10-15 01:24:24,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:24,690 INFO L225 Difference]: With dead ends: 448 [2019-10-15 01:24:24,690 INFO L226 Difference]: Without dead ends: 245 [2019-10-15 01:24:24,692 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:24,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-15 01:24:24,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2019-10-15 01:24:24,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-15 01:24:24,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 346 transitions. [2019-10-15 01:24:24,719 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 346 transitions. Word has length 41 [2019-10-15 01:24:24,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:24,720 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 346 transitions. [2019-10-15 01:24:24,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:24,720 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 346 transitions. [2019-10-15 01:24:24,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 01:24:24,722 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:24,722 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:24,722 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:24,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:24,723 INFO L82 PathProgramCache]: Analyzing trace with hash 968772057, now seen corresponding path program 1 times [2019-10-15 01:24:24,723 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:24,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944266213] [2019-10-15 01:24:24,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:24:24,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944266213] [2019-10-15 01:24:24,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:24,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:24,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151432710] [2019-10-15 01:24:24,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:24,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:24,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:24,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:24,801 INFO L87 Difference]: Start difference. First operand 242 states and 346 transitions. Second operand 4 states. [2019-10-15 01:24:24,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:24,864 INFO L93 Difference]: Finished difference Result 468 states and 686 transitions. [2019-10-15 01:24:24,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:24,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-10-15 01:24:24,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:24,868 INFO L225 Difference]: With dead ends: 468 [2019-10-15 01:24:24,869 INFO L226 Difference]: Without dead ends: 251 [2019-10-15 01:24:24,871 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:24,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-15 01:24:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2019-10-15 01:24:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-15 01:24:24,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 354 transitions. [2019-10-15 01:24:24,897 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 354 transitions. Word has length 41 [2019-10-15 01:24:24,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:24,898 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 354 transitions. [2019-10-15 01:24:24,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 354 transitions. [2019-10-15 01:24:24,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:24:24,901 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:24,901 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:24,902 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:24,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:24,902 INFO L82 PathProgramCache]: Analyzing trace with hash -966374096, now seen corresponding path program 1 times [2019-10-15 01:24:24,902 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:24,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688032987] [2019-10-15 01:24:24,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:24:24,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688032987] [2019-10-15 01:24:24,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:24,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:24,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571391412] [2019-10-15 01:24:24,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:24,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:24,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:24,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:24,985 INFO L87 Difference]: Start difference. First operand 249 states and 354 transitions. Second operand 5 states. [2019-10-15 01:24:25,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:25,011 INFO L93 Difference]: Finished difference Result 467 states and 673 transitions. [2019-10-15 01:24:25,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:25,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-15 01:24:25,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:25,013 INFO L225 Difference]: With dead ends: 467 [2019-10-15 01:24:25,014 INFO L226 Difference]: Without dead ends: 251 [2019-10-15 01:24:25,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:25,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-15 01:24:25,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2019-10-15 01:24:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-15 01:24:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 353 transitions. [2019-10-15 01:24:25,026 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 353 transitions. Word has length 59 [2019-10-15 01:24:25,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:25,027 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 353 transitions. [2019-10-15 01:24:25,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 353 transitions. [2019-10-15 01:24:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 01:24:25,028 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:25,028 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:25,028 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:25,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:25,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1964020213, now seen corresponding path program 1 times [2019-10-15 01:24:25,029 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:25,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849029043] [2019-10-15 01:24:25,030 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,030 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:24:25,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849029043] [2019-10-15 01:24:25,093 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:25,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:25,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624261075] [2019-10-15 01:24:25,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:25,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:25,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:25,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:25,097 INFO L87 Difference]: Start difference. First operand 249 states and 353 transitions. Second operand 4 states. [2019-10-15 01:24:25,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:25,149 INFO L93 Difference]: Finished difference Result 481 states and 695 transitions. [2019-10-15 01:24:25,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:25,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-10-15 01:24:25,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:25,156 INFO L225 Difference]: With dead ends: 481 [2019-10-15 01:24:25,156 INFO L226 Difference]: Without dead ends: 270 [2019-10-15 01:24:25,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:25,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-10-15 01:24:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2019-10-15 01:24:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-15 01:24:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 374 transitions. [2019-10-15 01:24:25,174 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 374 transitions. Word has length 62 [2019-10-15 01:24:25,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:25,174 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 374 transitions. [2019-10-15 01:24:25,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:25,175 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 374 transitions. [2019-10-15 01:24:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-15 01:24:25,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:25,176 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:25,176 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:25,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:25,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2021002903, now seen corresponding path program 1 times [2019-10-15 01:24:25,176 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:25,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663847985] [2019-10-15 01:24:25,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-15 01:24:25,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663847985] [2019-10-15 01:24:25,253 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:25,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:25,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609075144] [2019-10-15 01:24:25,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:25,254 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:25,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:25,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:25,254 INFO L87 Difference]: Start difference. First operand 267 states and 374 transitions. Second operand 4 states. [2019-10-15 01:24:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:25,304 INFO L93 Difference]: Finished difference Result 488 states and 699 transitions. [2019-10-15 01:24:25,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:25,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-15 01:24:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:25,307 INFO L225 Difference]: With dead ends: 488 [2019-10-15 01:24:25,307 INFO L226 Difference]: Without dead ends: 261 [2019-10-15 01:24:25,309 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:25,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-10-15 01:24:25,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2019-10-15 01:24:25,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-10-15 01:24:25,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 360 transitions. [2019-10-15 01:24:25,322 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 360 transitions. Word has length 63 [2019-10-15 01:24:25,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:25,323 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 360 transitions. [2019-10-15 01:24:25,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 360 transitions. [2019-10-15 01:24:25,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-15 01:24:25,324 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:25,324 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:25,324 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:25,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:25,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1782318518, now seen corresponding path program 1 times [2019-10-15 01:24:25,325 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:25,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689344482] [2019-10-15 01:24:25,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-15 01:24:25,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689344482] [2019-10-15 01:24:25,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:25,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:25,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638799394] [2019-10-15 01:24:25,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:25,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:25,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:25,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:25,383 INFO L87 Difference]: Start difference. First operand 261 states and 360 transitions. Second operand 5 states. [2019-10-15 01:24:25,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:25,409 INFO L93 Difference]: Finished difference Result 475 states and 666 transitions. [2019-10-15 01:24:25,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:25,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-10-15 01:24:25,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:25,412 INFO L225 Difference]: With dead ends: 475 [2019-10-15 01:24:25,412 INFO L226 Difference]: Without dead ends: 263 [2019-10-15 01:24:25,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:25,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-10-15 01:24:25,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2019-10-15 01:24:25,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-10-15 01:24:25,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 359 transitions. [2019-10-15 01:24:25,427 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 359 transitions. Word has length 82 [2019-10-15 01:24:25,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:25,428 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 359 transitions. [2019-10-15 01:24:25,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 359 transitions. [2019-10-15 01:24:25,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-15 01:24:25,433 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:25,433 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-15 01:24:25,433 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:25,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:25,434 INFO L82 PathProgramCache]: Analyzing trace with hash 77251503, now seen corresponding path program 1 times [2019-10-15 01:24:25,434 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:25,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695248976] [2019-10-15 01:24:25,434 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,435 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:25,489 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-15 01:24:25,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695248976] [2019-10-15 01:24:25,490 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:25,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:25,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307303199] [2019-10-15 01:24:25,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:25,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:25,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:25,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:25,492 INFO L87 Difference]: Start difference. First operand 261 states and 359 transitions. Second operand 4 states. [2019-10-15 01:24:25,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:25,578 INFO L93 Difference]: Finished difference Result 464 states and 664 transitions. [2019-10-15 01:24:25,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:25,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-15 01:24:25,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:25,580 INFO L225 Difference]: With dead ends: 464 [2019-10-15 01:24:25,581 INFO L226 Difference]: Without dead ends: 259 [2019-10-15 01:24:25,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:25,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-10-15 01:24:25,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-10-15 01:24:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-10-15 01:24:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 355 transitions. [2019-10-15 01:24:25,595 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 355 transitions. Word has length 85 [2019-10-15 01:24:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:25,596 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 355 transitions. [2019-10-15 01:24:25,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 355 transitions. [2019-10-15 01:24:25,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-15 01:24:25,597 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:25,597 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-10-15 01:24:25,598 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:25,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:25,598 INFO L82 PathProgramCache]: Analyzing trace with hash -763139322, now seen corresponding path program 1 times [2019-10-15 01:24:25,598 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:25,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540561912] [2019-10-15 01:24:25,599 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,599 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-15 01:24:25,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540561912] [2019-10-15 01:24:25,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174732845] [2019-10-15 01:24:25,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:24:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:25,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:24:25,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:24:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-15 01:24:25,908 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:24:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-15 01:24:26,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [277972975] [2019-10-15 01:24:26,041 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 101 [2019-10-15 01:24:26,093 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:24:26,093 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:24:26,281 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:24:26,520 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-15 01:24:26,523 INFO L272 AbstractInterpreter]: Visited 56 different actions 205 times. Merged at 16 different actions 45 times. Never widened. Performed 959 root evaluator evaluations with a maximum evaluation depth of 5. Performed 959 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 1 different actions. Largest state had 89 variables. [2019-10-15 01:24:26,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:26,527 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-15 01:24:26,667 INFO L227 lantSequenceWeakener]: Weakened 77 states. On average, predicates are now at 93.62% of their original sizes. [2019-10-15 01:24:26,667 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-15 01:24:27,353 INFO L553 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-10-15 01:24:27,354 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-15 01:24:27,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:24:27,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [4, 4, 4] total 40 [2019-10-15 01:24:27,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214161822] [2019-10-15 01:24:27,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-15 01:24:27,356 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:27,357 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-15 01:24:27,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-15 01:24:27,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2019-10-15 01:24:27,358 INFO L87 Difference]: Start difference. First operand 259 states and 355 transitions. Second operand 35 states. [2019-10-15 01:24:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:38,090 INFO L93 Difference]: Finished difference Result 623 states and 867 transitions. [2019-10-15 01:24:38,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-15 01:24:38,090 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 100 [2019-10-15 01:24:38,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:38,094 INFO L225 Difference]: With dead ends: 623 [2019-10-15 01:24:38,094 INFO L226 Difference]: Without dead ends: 375 [2019-10-15 01:24:38,098 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=540, Invalid=5312, Unknown=0, NotChecked=0, Total=5852 [2019-10-15 01:24:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-15 01:24:38,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 307. [2019-10-15 01:24:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-15 01:24:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 405 transitions. [2019-10-15 01:24:38,127 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 405 transitions. Word has length 100 [2019-10-15 01:24:38,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:38,127 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 405 transitions. [2019-10-15 01:24:38,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-15 01:24:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 405 transitions. [2019-10-15 01:24:38,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-15 01:24:38,129 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:38,130 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:38,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:24:38,344 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:38,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:38,344 INFO L82 PathProgramCache]: Analyzing trace with hash -267545431, now seen corresponding path program 1 times [2019-10-15 01:24:38,345 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:38,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698953288] [2019-10-15 01:24:38,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:38,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:38,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-15 01:24:38,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698953288] [2019-10-15 01:24:38,455 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:38,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:38,456 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652782678] [2019-10-15 01:24:38,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:38,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:38,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:38,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:38,459 INFO L87 Difference]: Start difference. First operand 307 states and 405 transitions. Second operand 5 states. [2019-10-15 01:24:38,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:38,480 INFO L93 Difference]: Finished difference Result 479 states and 651 transitions. [2019-10-15 01:24:38,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:38,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-10-15 01:24:38,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:38,483 INFO L225 Difference]: With dead ends: 479 [2019-10-15 01:24:38,484 INFO L226 Difference]: Without dead ends: 307 [2019-10-15 01:24:38,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:38,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-15 01:24:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-10-15 01:24:38,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-15 01:24:38,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 400 transitions. [2019-10-15 01:24:38,499 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 400 transitions. Word has length 144 [2019-10-15 01:24:38,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:38,500 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 400 transitions. [2019-10-15 01:24:38,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:38,500 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 400 transitions. [2019-10-15 01:24:38,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:24:38,504 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:38,504 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:38,505 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:38,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:38,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1981470506, now seen corresponding path program 1 times [2019-10-15 01:24:38,505 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:38,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352932950] [2019-10-15 01:24:38,506 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:38,506 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:38,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:38,586 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 72 proven. 8 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-10-15 01:24:38,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352932950] [2019-10-15 01:24:38,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986033381] [2019-10-15 01:24:38,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:24:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:38,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:24:38,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:24:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-15 01:24:38,830 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:24:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-15 01:24:38,960 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:24:38,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2019-10-15 01:24:38,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074788365] [2019-10-15 01:24:38,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:38,963 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:38,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:38,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:24:38,964 INFO L87 Difference]: Start difference. First operand 307 states and 400 transitions. Second operand 3 states. [2019-10-15 01:24:38,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:38,990 INFO L93 Difference]: Finished difference Result 507 states and 677 transitions. [2019-10-15 01:24:38,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:38,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-15 01:24:38,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:38,994 INFO L225 Difference]: With dead ends: 507 [2019-10-15 01:24:38,995 INFO L226 Difference]: Without dead ends: 286 [2019-10-15 01:24:38,997 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:24:38,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-10-15 01:24:39,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2019-10-15 01:24:39,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-10-15 01:24:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 369 transitions. [2019-10-15 01:24:39,016 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 369 transitions. Word has length 153 [2019-10-15 01:24:39,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:39,017 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 369 transitions. [2019-10-15 01:24:39,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 369 transitions. [2019-10-15 01:24:39,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:24:39,021 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:39,021 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:39,233 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:24:39,234 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:39,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:39,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1947418555, now seen corresponding path program 1 times [2019-10-15 01:24:39,234 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:39,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733870741] [2019-10-15 01:24:39,234 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:39,235 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:39,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-15 01:24:39,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733870741] [2019-10-15 01:24:39,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:39,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:39,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60015121] [2019-10-15 01:24:39,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:39,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:39,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:39,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:39,313 INFO L87 Difference]: Start difference. First operand 286 states and 369 transitions. Second operand 4 states. [2019-10-15 01:24:39,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:39,342 INFO L93 Difference]: Finished difference Result 457 states and 617 transitions. [2019-10-15 01:24:39,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:39,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-15 01:24:39,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:39,345 INFO L225 Difference]: With dead ends: 457 [2019-10-15 01:24:39,345 INFO L226 Difference]: Without dead ends: 292 [2019-10-15 01:24:39,346 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:39,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-15 01:24:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2019-10-15 01:24:39,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-10-15 01:24:39,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 372 transitions. [2019-10-15 01:24:39,359 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 372 transitions. Word has length 161 [2019-10-15 01:24:39,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:39,359 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 372 transitions. [2019-10-15 01:24:39,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:39,359 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 372 transitions. [2019-10-15 01:24:39,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-15 01:24:39,361 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:39,361 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:39,362 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:39,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:39,362 INFO L82 PathProgramCache]: Analyzing trace with hash -243298260, now seen corresponding path program 1 times [2019-10-15 01:24:39,362 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:39,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150388498] [2019-10-15 01:24:39,363 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:39,363 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:39,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-15 01:24:39,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150388498] [2019-10-15 01:24:39,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:39,442 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:39,442 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642119812] [2019-10-15 01:24:39,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:39,443 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:39,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:39,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:39,444 INFO L87 Difference]: Start difference. First operand 290 states and 372 transitions. Second operand 4 states. [2019-10-15 01:24:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:39,476 INFO L93 Difference]: Finished difference Result 466 states and 624 transitions. [2019-10-15 01:24:39,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:39,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-10-15 01:24:39,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:39,479 INFO L225 Difference]: With dead ends: 466 [2019-10-15 01:24:39,479 INFO L226 Difference]: Without dead ends: 297 [2019-10-15 01:24:39,480 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:39,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-10-15 01:24:39,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2019-10-15 01:24:39,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-15 01:24:39,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 376 transitions. [2019-10-15 01:24:39,492 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 376 transitions. Word has length 173 [2019-10-15 01:24:39,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:39,493 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 376 transitions. [2019-10-15 01:24:39,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 376 transitions. [2019-10-15 01:24:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-15 01:24:39,495 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:39,495 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:39,496 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:39,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:39,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1314652604, now seen corresponding path program 1 times [2019-10-15 01:24:39,496 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:39,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365243099] [2019-10-15 01:24:39,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:39,497 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:39,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:39,578 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-10-15 01:24:39,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365243099] [2019-10-15 01:24:39,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:39,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:39,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372688181] [2019-10-15 01:24:39,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:39,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:39,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:39,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:39,582 INFO L87 Difference]: Start difference. First operand 295 states and 376 transitions. Second operand 4 states. [2019-10-15 01:24:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:39,612 INFO L93 Difference]: Finished difference Result 468 states and 622 transitions. [2019-10-15 01:24:39,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:39,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-10-15 01:24:39,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:39,616 INFO L225 Difference]: With dead ends: 468 [2019-10-15 01:24:39,616 INFO L226 Difference]: Without dead ends: 294 [2019-10-15 01:24:39,617 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:39,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-15 01:24:39,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2019-10-15 01:24:39,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-15 01:24:39,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 371 transitions. [2019-10-15 01:24:39,630 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 371 transitions. Word has length 186 [2019-10-15 01:24:39,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:39,630 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 371 transitions. [2019-10-15 01:24:39,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:39,631 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 371 transitions. [2019-10-15 01:24:39,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-15 01:24:39,633 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:39,633 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:24:39,633 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:39,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:39,634 INFO L82 PathProgramCache]: Analyzing trace with hash 507025156, now seen corresponding path program 1 times [2019-10-15 01:24:39,634 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:39,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055695928] [2019-10-15 01:24:39,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:39,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:39,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:39,729 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-10-15 01:24:39,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055695928] [2019-10-15 01:24:39,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:39,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:39,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835088356] [2019-10-15 01:24:39,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:39,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:39,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:39,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:39,732 INFO L87 Difference]: Start difference. First operand 294 states and 371 transitions. Second operand 4 states. [2019-10-15 01:24:39,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:39,752 INFO L93 Difference]: Finished difference Result 466 states and 612 transitions. [2019-10-15 01:24:39,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:39,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-10-15 01:24:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:39,755 INFO L225 Difference]: With dead ends: 466 [2019-10-15 01:24:39,755 INFO L226 Difference]: Without dead ends: 293 [2019-10-15 01:24:39,756 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:39,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-10-15 01:24:39,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2019-10-15 01:24:39,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-10-15 01:24:39,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 368 transitions. [2019-10-15 01:24:39,769 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 368 transitions. Word has length 199 [2019-10-15 01:24:39,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:39,769 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 368 transitions. [2019-10-15 01:24:39,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:39,769 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 368 transitions. [2019-10-15 01:24:39,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-15 01:24:39,772 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:39,772 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:24:39,772 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:39,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:39,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1935753462, now seen corresponding path program 1 times [2019-10-15 01:24:39,773 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:39,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416603205] [2019-10-15 01:24:39,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:39,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:39,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-10-15 01:24:39,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416603205] [2019-10-15 01:24:39,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:39,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:39,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44534545] [2019-10-15 01:24:39,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:39,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:39,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:39,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:39,918 INFO L87 Difference]: Start difference. First operand 293 states and 368 transitions. Second operand 4 states. [2019-10-15 01:24:40,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:40,196 INFO L93 Difference]: Finished difference Result 786 states and 1048 transitions. [2019-10-15 01:24:40,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:24:40,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-10-15 01:24:40,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:40,201 INFO L225 Difference]: With dead ends: 786 [2019-10-15 01:24:40,201 INFO L226 Difference]: Without dead ends: 614 [2019-10-15 01:24:40,202 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:40,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-15 01:24:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 476. [2019-10-15 01:24:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-10-15 01:24:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 628 transitions. [2019-10-15 01:24:40,224 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 628 transitions. Word has length 201 [2019-10-15 01:24:40,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:40,225 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 628 transitions. [2019-10-15 01:24:40,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 628 transitions. [2019-10-15 01:24:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-15 01:24:40,228 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:40,229 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:24:40,229 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:40,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:40,229 INFO L82 PathProgramCache]: Analyzing trace with hash -833946183, now seen corresponding path program 1 times [2019-10-15 01:24:40,230 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:40,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915902042] [2019-10-15 01:24:40,230 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:40,230 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:40,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-15 01:24:40,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915902042] [2019-10-15 01:24:40,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:40,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:40,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15158100] [2019-10-15 01:24:40,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:40,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:40,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:40,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:40,340 INFO L87 Difference]: Start difference. First operand 476 states and 628 transitions. Second operand 4 states. [2019-10-15 01:24:40,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:40,585 INFO L93 Difference]: Finished difference Result 1175 states and 1615 transitions. [2019-10-15 01:24:40,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:40,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-10-15 01:24:40,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:40,593 INFO L225 Difference]: With dead ends: 1175 [2019-10-15 01:24:40,594 INFO L226 Difference]: Without dead ends: 820 [2019-10-15 01:24:40,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-10-15 01:24:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 805. [2019-10-15 01:24:40,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-10-15 01:24:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1084 transitions. [2019-10-15 01:24:40,643 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1084 transitions. Word has length 236 [2019-10-15 01:24:40,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:40,644 INFO L462 AbstractCegarLoop]: Abstraction has 805 states and 1084 transitions. [2019-10-15 01:24:40,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1084 transitions. [2019-10-15 01:24:40,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-15 01:24:40,652 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:40,653 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:24:40,653 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:40,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:40,654 INFO L82 PathProgramCache]: Analyzing trace with hash -758669803, now seen corresponding path program 1 times [2019-10-15 01:24:40,654 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:40,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147919899] [2019-10-15 01:24:40,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:40,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:40,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-15 01:24:40,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147919899] [2019-10-15 01:24:40,803 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:40,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:40,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358617919] [2019-10-15 01:24:40,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:40,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:40,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:40,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:40,805 INFO L87 Difference]: Start difference. First operand 805 states and 1084 transitions. Second operand 4 states. [2019-10-15 01:24:41,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:41,075 INFO L93 Difference]: Finished difference Result 2153 states and 2978 transitions. [2019-10-15 01:24:41,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:41,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-10-15 01:24:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:41,088 INFO L225 Difference]: With dead ends: 2153 [2019-10-15 01:24:41,089 INFO L226 Difference]: Without dead ends: 1475 [2019-10-15 01:24:41,094 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:41,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2019-10-15 01:24:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1112. [2019-10-15 01:24:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2019-10-15 01:24:41,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1512 transitions. [2019-10-15 01:24:41,223 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1512 transitions. Word has length 237 [2019-10-15 01:24:41,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:41,225 INFO L462 AbstractCegarLoop]: Abstraction has 1112 states and 1512 transitions. [2019-10-15 01:24:41,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:41,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1512 transitions. [2019-10-15 01:24:41,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-15 01:24:41,230 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:41,230 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:24:41,230 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:41,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:41,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1887576620, now seen corresponding path program 1 times [2019-10-15 01:24:41,231 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:41,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032710130] [2019-10-15 01:24:41,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:41,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:41,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-15 01:24:41,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032710130] [2019-10-15 01:24:41,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:41,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:41,339 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058455020] [2019-10-15 01:24:41,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:41,341 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:41,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:41,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:41,342 INFO L87 Difference]: Start difference. First operand 1112 states and 1512 transitions. Second operand 4 states. [2019-10-15 01:24:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:41,601 INFO L93 Difference]: Finished difference Result 3101 states and 4301 transitions. [2019-10-15 01:24:41,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:41,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-10-15 01:24:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:41,614 INFO L225 Difference]: With dead ends: 3101 [2019-10-15 01:24:41,615 INFO L226 Difference]: Without dead ends: 2116 [2019-10-15 01:24:41,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:41,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-10-15 01:24:41,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1402. [2019-10-15 01:24:41,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-10-15 01:24:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1918 transitions. [2019-10-15 01:24:41,716 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1918 transitions. Word has length 238 [2019-10-15 01:24:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:41,717 INFO L462 AbstractCegarLoop]: Abstraction has 1402 states and 1918 transitions. [2019-10-15 01:24:41,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:41,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1918 transitions. [2019-10-15 01:24:41,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-15 01:24:41,726 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:41,726 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:24:41,727 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:41,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:41,727 INFO L82 PathProgramCache]: Analyzing trace with hash 163407378, now seen corresponding path program 1 times [2019-10-15 01:24:41,727 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:41,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017136244] [2019-10-15 01:24:41,727 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:41,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:41,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-10-15 01:24:41,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017136244] [2019-10-15 01:24:41,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658179791] [2019-10-15 01:24:41,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:24:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:42,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:24:42,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:24:42,244 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 96 proven. 8 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-10-15 01:24:42,245 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:24:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2019-10-15 01:24:42,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1381255572] [2019-10-15 01:24:42,443 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 239 [2019-10-15 01:24:42,454 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:24:42,454 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:24:42,471 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:24:42,619 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-15 01:24:42,620 INFO L272 AbstractInterpreter]: Visited 123 different actions 339 times. Merged at 21 different actions 69 times. Never widened. Performed 1694 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1694 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 4 fixpoints after 2 different actions. Largest state had 90 variables. [2019-10-15 01:24:42,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:42,620 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-15 01:24:42,845 INFO L227 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 84.41% of their original sizes. [2019-10-15 01:24:42,846 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-15 01:24:46,077 INFO L553 sIntCurrentIteration]: We unified 237 AI predicates to 237 [2019-10-15 01:24:46,077 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-15 01:24:46,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:24:46,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [76] imperfect sequences [7, 5, 5] total 84 [2019-10-15 01:24:46,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551110806] [2019-10-15 01:24:46,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-10-15 01:24:46,079 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:46,079 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-15 01:24:46,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-10-15 01:24:46,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=5304, Unknown=0, NotChecked=0, Total=5700 [2019-10-15 01:24:46,082 INFO L87 Difference]: Start difference. First operand 1402 states and 1918 transitions. Second operand 76 states.