./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e96a4dadf08c19b3d92d901d7f9116f0323f4fb1660ac2537112df0afe321751 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 02:23:22,109 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 02:23:22,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 02:23:22,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 02:23:22,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 02:23:22,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 02:23:22,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 02:23:22,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 02:23:22,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 02:23:22,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 02:23:22,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 02:23:22,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 02:23:22,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 02:23:22,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 02:23:22,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 02:23:22,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 02:23:22,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 02:23:22,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 02:23:22,231 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 02:23:22,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 02:23:22,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 02:23:22,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 02:23:22,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 02:23:22,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 02:23:22,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 02:23:22,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 02:23:22,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 02:23:22,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 02:23:22,270 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 02:23:22,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 02:23:22,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 02:23:22,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 02:23:22,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 02:23:22,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 02:23:22,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 02:23:22,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 02:23:22,280 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 02:23:22,280 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 02:23:22,281 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 02:23:22,282 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 02:23:22,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 02:23:22,284 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 02:23:22,328 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 02:23:22,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 02:23:22,330 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 02:23:22,330 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 02:23:22,330 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 02:23:22,331 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 02:23:22,331 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 02:23:22,331 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 02:23:22,331 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 02:23:22,332 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 02:23:22,332 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 02:23:22,332 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 02:23:22,333 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 02:23:22,333 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 02:23:22,333 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 02:23:22,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 02:23:22,334 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 02:23:22,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 02:23:22,335 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 02:23:22,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 02:23:22,336 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 02:23:22,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 02:23:22,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 02:23:22,336 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 02:23:22,337 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 02:23:22,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 02:23:22,337 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 02:23:22,338 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 02:23:22,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 02:23:22,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 02:23:22,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:23:22,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 02:23:22,339 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 02:23:22,340 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 02:23:22,340 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 02:23:22,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 02:23:22,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 02:23:22,343 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 02:23:22,343 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 02:23:22,344 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e96a4dadf08c19b3d92d901d7f9116f0323f4fb1660ac2537112df0afe321751 [2021-11-07 02:23:22,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 02:23:22,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 02:23:22,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 02:23:22,727 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 02:23:22,728 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 02:23:22,729 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2021-11-07 02:23:22,811 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/data/0d62f3311/2be01e47cbf542c2b5d1d61510e52003/FLAGad9edaf0b [2021-11-07 02:23:23,391 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 02:23:23,392 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2021-11-07 02:23:23,405 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/data/0d62f3311/2be01e47cbf542c2b5d1d61510e52003/FLAGad9edaf0b [2021-11-07 02:23:23,720 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/data/0d62f3311/2be01e47cbf542c2b5d1d61510e52003 [2021-11-07 02:23:23,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 02:23:23,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 02:23:23,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 02:23:23,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 02:23:23,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 02:23:23,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:23:23" (1/1) ... [2021-11-07 02:23:23,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610e23d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:23, skipping insertion in model container [2021-11-07 02:23:23,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:23:23" (1/1) ... [2021-11-07 02:23:23,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 02:23:23,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 02:23:24,036 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/sv-benchmarks/c/systemc/token_ring.03.cil-1.c[671,684] [2021-11-07 02:23:24,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:23:24,163 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 02:23:24,188 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/sv-benchmarks/c/systemc/token_ring.03.cil-1.c[671,684] [2021-11-07 02:23:24,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:23:24,282 INFO L208 MainTranslator]: Completed translation [2021-11-07 02:23:24,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:24 WrapperNode [2021-11-07 02:23:24,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 02:23:24,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 02:23:24,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 02:23:24,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 02:23:24,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:24" (1/1) ... [2021-11-07 02:23:24,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:24" (1/1) ... [2021-11-07 02:23:24,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 02:23:24,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 02:23:24,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 02:23:24,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 02:23:24,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:24" (1/1) ... [2021-11-07 02:23:24,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:24" (1/1) ... [2021-11-07 02:23:24,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:24" (1/1) ... [2021-11-07 02:23:24,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:24" (1/1) ... [2021-11-07 02:23:24,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:24" (1/1) ... [2021-11-07 02:23:24,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:24" (1/1) ... [2021-11-07 02:23:24,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:24" (1/1) ... [2021-11-07 02:23:24,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 02:23:24,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 02:23:24,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 02:23:24,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 02:23:24,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:24" (1/1) ... [2021-11-07 02:23:24,508 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:23:24,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:23:24,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 02:23:24,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 02:23:24,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 02:23:24,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 02:23:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 02:23:24,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 02:23:27,229 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 02:23:27,230 INFO L299 CfgBuilder]: Removed 132 assume(true) statements. [2021-11-07 02:23:27,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:23:27 BoogieIcfgContainer [2021-11-07 02:23:27,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 02:23:27,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 02:23:27,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 02:23:27,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 02:23:27,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:23:23" (1/3) ... [2021-11-07 02:23:27,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131e7b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:23:27, skipping insertion in model container [2021-11-07 02:23:27,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:23:24" (2/3) ... [2021-11-07 02:23:27,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131e7b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:23:27, skipping insertion in model container [2021-11-07 02:23:27,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:23:27" (3/3) ... [2021-11-07 02:23:27,246 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2021-11-07 02:23:27,254 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 02:23:27,254 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-07 02:23:27,319 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 02:23:27,328 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 02:23:27,328 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-07 02:23:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 147 states have (on average 1.5714285714285714) internal successors, (231), 149 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:27,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 02:23:27,361 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:27,362 INFO L513 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] [2021-11-07 02:23:27,362 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:27,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:27,370 INFO L85 PathProgramCache]: Analyzing trace with hash 145982027, now seen corresponding path program 1 times [2021-11-07 02:23:27,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:27,382 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716391788] [2021-11-07 02:23:27,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:27,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:27,608 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:27,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716391788] [2021-11-07 02:23:27,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716391788] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:27,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:27,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 02:23:27,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125568205] [2021-11-07 02:23:27,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:27,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:27,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:27,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:27,640 INFO L87 Difference]: Start difference. First operand has 150 states, 147 states have (on average 1.5714285714285714) internal successors, (231), 149 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:27,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:27,763 INFO L93 Difference]: Finished difference Result 415 states and 637 transitions. [2021-11-07 02:23:27,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:27,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-07 02:23:27,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:27,783 INFO L225 Difference]: With dead ends: 415 [2021-11-07 02:23:27,783 INFO L226 Difference]: Without dead ends: 263 [2021-11-07 02:23:27,787 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:27,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-11-07 02:23:27,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 249. [2021-11-07 02:23:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 247 states have (on average 1.4939271255060729) internal successors, (369), 248 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 369 transitions. [2021-11-07 02:23:27,860 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 369 transitions. Word has length 22 [2021-11-07 02:23:27,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:27,884 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 369 transitions. [2021-11-07 02:23:27,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 369 transitions. [2021-11-07 02:23:27,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-07 02:23:27,893 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:27,894 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-07 02:23:27,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 02:23:27,894 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:27,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:27,896 INFO L85 PathProgramCache]: Analyzing trace with hash -18284837, now seen corresponding path program 1 times [2021-11-07 02:23:27,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:27,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608508593] [2021-11-07 02:23:27,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:27,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 02:23:27,992 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:27,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608508593] [2021-11-07 02:23:27,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608508593] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:27,993 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:27,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:27,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760370971] [2021-11-07 02:23:27,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:27,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:27,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:27,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:27,996 INFO L87 Difference]: Start difference. First operand 249 states and 369 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:28,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:28,189 INFO L93 Difference]: Finished difference Result 789 states and 1161 transitions. [2021-11-07 02:23:28,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:28,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-07 02:23:28,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:28,202 INFO L225 Difference]: With dead ends: 789 [2021-11-07 02:23:28,202 INFO L226 Difference]: Without dead ends: 549 [2021-11-07 02:23:28,209 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:28,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2021-11-07 02:23:28,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 435. [2021-11-07 02:23:28,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 433 states have (on average 1.466512702078522) internal successors, (635), 434 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:28,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 635 transitions. [2021-11-07 02:23:28,275 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 635 transitions. Word has length 43 [2021-11-07 02:23:28,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:28,276 INFO L470 AbstractCegarLoop]: Abstraction has 435 states and 635 transitions. [2021-11-07 02:23:28,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:28,277 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 635 transitions. [2021-11-07 02:23:28,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-07 02:23:28,281 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:28,282 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-07 02:23:28,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 02:23:28,282 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:28,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:28,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1783101446, now seen corresponding path program 1 times [2021-11-07 02:23:28,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:28,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042791122] [2021-11-07 02:23:28,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:28,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:28,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 02:23:28,400 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:28,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042791122] [2021-11-07 02:23:28,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042791122] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:28,401 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:28,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:28,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041487555] [2021-11-07 02:23:28,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:28,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:28,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:28,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:28,404 INFO L87 Difference]: Start difference. First operand 435 states and 635 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:28,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:28,573 INFO L93 Difference]: Finished difference Result 1382 states and 2002 transitions. [2021-11-07 02:23:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:28,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-07 02:23:28,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:28,581 INFO L225 Difference]: With dead ends: 1382 [2021-11-07 02:23:28,581 INFO L226 Difference]: Without dead ends: 959 [2021-11-07 02:23:28,583 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:28,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2021-11-07 02:23:28,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 770. [2021-11-07 02:23:28,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 768 states have (on average 1.4401041666666667) internal successors, (1106), 769 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:28,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1106 transitions. [2021-11-07 02:23:28,632 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1106 transitions. Word has length 43 [2021-11-07 02:23:28,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:28,633 INFO L470 AbstractCegarLoop]: Abstraction has 770 states and 1106 transitions. [2021-11-07 02:23:28,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:28,634 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1106 transitions. [2021-11-07 02:23:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-07 02:23:28,639 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:28,639 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-07 02:23:28,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 02:23:28,640 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:28,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:28,641 INFO L85 PathProgramCache]: Analyzing trace with hash -69053030, now seen corresponding path program 1 times [2021-11-07 02:23:28,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:28,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829804422] [2021-11-07 02:23:28,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:28,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:28,800 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:28,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829804422] [2021-11-07 02:23:28,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829804422] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:28,801 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:28,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:28,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018561773] [2021-11-07 02:23:28,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:28,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:28,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:28,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:28,807 INFO L87 Difference]: Start difference. First operand 770 states and 1106 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:28,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:28,921 INFO L93 Difference]: Finished difference Result 2218 states and 3170 transitions. [2021-11-07 02:23:28,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:28,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-07 02:23:28,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:28,933 INFO L225 Difference]: With dead ends: 2218 [2021-11-07 02:23:28,933 INFO L226 Difference]: Without dead ends: 1453 [2021-11-07 02:23:28,935 INFO L786 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 [2021-11-07 02:23:28,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2021-11-07 02:23:29,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1369. [2021-11-07 02:23:29,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1367 states have (on average 1.415508412582297) internal successors, (1935), 1368 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1935 transitions. [2021-11-07 02:23:29,026 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1935 transitions. Word has length 43 [2021-11-07 02:23:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:29,027 INFO L470 AbstractCegarLoop]: Abstraction has 1369 states and 1935 transitions. [2021-11-07 02:23:29,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1935 transitions. [2021-11-07 02:23:29,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-07 02:23:29,031 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:29,031 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-07 02:23:29,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 02:23:29,032 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:29,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:29,033 INFO L85 PathProgramCache]: Analyzing trace with hash 592280761, now seen corresponding path program 1 times [2021-11-07 02:23:29,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:29,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115758977] [2021-11-07 02:23:29,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:29,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:29,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:29,164 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:29,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115758977] [2021-11-07 02:23:29,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115758977] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:29,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:29,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:29,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066329013] [2021-11-07 02:23:29,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:29,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:29,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:29,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:29,177 INFO L87 Difference]: Start difference. First operand 1369 states and 1935 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:29,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:29,502 INFO L93 Difference]: Finished difference Result 4753 states and 6761 transitions. [2021-11-07 02:23:29,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:29,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-07 02:23:29,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:29,530 INFO L225 Difference]: With dead ends: 4753 [2021-11-07 02:23:29,530 INFO L226 Difference]: Without dead ends: 3397 [2021-11-07 02:23:29,533 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:29,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3397 states. [2021-11-07 02:23:29,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3397 to 2549. [2021-11-07 02:23:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2549 states, 2547 states have (on average 1.408323517864154) internal successors, (3587), 2548 states have internal predecessors, (3587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 3587 transitions. [2021-11-07 02:23:29,724 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 3587 transitions. Word has length 43 [2021-11-07 02:23:29,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:29,726 INFO L470 AbstractCegarLoop]: Abstraction has 2549 states and 3587 transitions. [2021-11-07 02:23:29,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:29,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 3587 transitions. [2021-11-07 02:23:29,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-07 02:23:29,732 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:29,733 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-07 02:23:29,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 02:23:29,734 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:29,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:29,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1608512578, now seen corresponding path program 1 times [2021-11-07 02:23:29,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:29,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817056975] [2021-11-07 02:23:29,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:29,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:29,895 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:29,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817056975] [2021-11-07 02:23:29,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817056975] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:29,896 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:29,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:29,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235209121] [2021-11-07 02:23:29,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:29,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:29,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:29,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:29,899 INFO L87 Difference]: Start difference. First operand 2549 states and 3587 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:30,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:30,096 INFO L93 Difference]: Finished difference Result 4421 states and 6361 transitions. [2021-11-07 02:23:30,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:30,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-07 02:23:30,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:30,149 INFO L225 Difference]: With dead ends: 4421 [2021-11-07 02:23:30,150 INFO L226 Difference]: Without dead ends: 2945 [2021-11-07 02:23:30,153 INFO L786 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 [2021-11-07 02:23:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2021-11-07 02:23:30,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2785. [2021-11-07 02:23:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2785 states, 2783 states have (on average 1.4297520661157024) internal successors, (3979), 2784 states have internal predecessors, (3979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:30,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 3979 transitions. [2021-11-07 02:23:30,351 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 3979 transitions. Word has length 44 [2021-11-07 02:23:30,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:30,352 INFO L470 AbstractCegarLoop]: Abstraction has 2785 states and 3979 transitions. [2021-11-07 02:23:30,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:30,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 3979 transitions. [2021-11-07 02:23:30,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-07 02:23:30,362 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:30,363 INFO L513 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:30,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 02:23:30,363 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:30,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:30,364 INFO L85 PathProgramCache]: Analyzing trace with hash -808314589, now seen corresponding path program 1 times [2021-11-07 02:23:30,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:30,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337156075] [2021-11-07 02:23:30,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:30,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:30,542 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:30,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337156075] [2021-11-07 02:23:30,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337156075] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:30,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:30,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:30,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708781048] [2021-11-07 02:23:30,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:30,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:30,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:30,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:30,546 INFO L87 Difference]: Start difference. First operand 2785 states and 3979 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:30,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:30,773 INFO L93 Difference]: Finished difference Result 4697 states and 6753 transitions. [2021-11-07 02:23:30,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:30,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-07 02:23:30,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:30,796 INFO L225 Difference]: With dead ends: 4697 [2021-11-07 02:23:30,797 INFO L226 Difference]: Without dead ends: 2985 [2021-11-07 02:23:30,800 INFO L786 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 [2021-11-07 02:23:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2021-11-07 02:23:30,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2785. [2021-11-07 02:23:30,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2785 states, 2783 states have (on average 1.393819619116062) internal successors, (3879), 2784 states have internal predecessors, (3879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:30,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 3879 transitions. [2021-11-07 02:23:30,994 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 3879 transitions. Word has length 63 [2021-11-07 02:23:30,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:30,996 INFO L470 AbstractCegarLoop]: Abstraction has 2785 states and 3879 transitions. [2021-11-07 02:23:30,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 3879 transitions. [2021-11-07 02:23:31,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-07 02:23:31,005 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:31,005 INFO L513 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:31,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 02:23:31,007 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:31,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:31,008 INFO L85 PathProgramCache]: Analyzing trace with hash 782080388, now seen corresponding path program 1 times [2021-11-07 02:23:31,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:31,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945175489] [2021-11-07 02:23:31,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:31,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 02:23:31,138 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:31,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945175489] [2021-11-07 02:23:31,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945175489] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:31,139 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:31,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:31,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342450335] [2021-11-07 02:23:31,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:31,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:31,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:31,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:31,141 INFO L87 Difference]: Start difference. First operand 2785 states and 3879 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:31,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:31,636 INFO L93 Difference]: Finished difference Result 9805 states and 13685 transitions. [2021-11-07 02:23:31,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:31,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-07 02:23:31,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:31,688 INFO L225 Difference]: With dead ends: 9805 [2021-11-07 02:23:31,688 INFO L226 Difference]: Without dead ends: 7033 [2021-11-07 02:23:31,696 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:31,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7033 states. [2021-11-07 02:23:32,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7033 to 5153. [2021-11-07 02:23:32,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5153 states, 5151 states have (on average 1.3789555426130848) internal successors, (7103), 5152 states have internal predecessors, (7103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 7103 transitions. [2021-11-07 02:23:32,094 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 7103 transitions. Word has length 63 [2021-11-07 02:23:32,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:32,094 INFO L470 AbstractCegarLoop]: Abstraction has 5153 states and 7103 transitions. [2021-11-07 02:23:32,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 7103 transitions. [2021-11-07 02:23:32,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-07 02:23:32,108 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:32,108 INFO L513 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:32,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 02:23:32,109 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:32,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:32,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1682839698, now seen corresponding path program 1 times [2021-11-07 02:23:32,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:32,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050490378] [2021-11-07 02:23:32,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:32,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:32,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:32,255 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:32,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050490378] [2021-11-07 02:23:32,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050490378] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:23:32,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812105569] [2021-11-07 02:23:32,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:32,260 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:23:32,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:23:32,264 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:23:32,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 02:23:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:32,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 02:23:32,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:23:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 02:23:32,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:23:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 02:23:33,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812105569] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:33,055 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:23:33,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2021-11-07 02:23:33,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650997338] [2021-11-07 02:23:33,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:33,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:33,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:33,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:23:33,061 INFO L87 Difference]: Start difference. First operand 5153 states and 7103 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:33,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:33,592 INFO L93 Difference]: Finished difference Result 14633 states and 20099 transitions. [2021-11-07 02:23:33,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:33,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-07 02:23:33,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:33,676 INFO L225 Difference]: With dead ends: 14633 [2021-11-07 02:23:33,677 INFO L226 Difference]: Without dead ends: 9493 [2021-11-07 02:23:33,733 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:23:33,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9493 states. [2021-11-07 02:23:34,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9493 to 9489. [2021-11-07 02:23:34,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9489 states, 9487 states have (on average 1.3609149362285233) internal successors, (12911), 9488 states have internal predecessors, (12911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9489 states to 9489 states and 12911 transitions. [2021-11-07 02:23:34,389 INFO L78 Accepts]: Start accepts. Automaton has 9489 states and 12911 transitions. Word has length 64 [2021-11-07 02:23:34,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:34,390 INFO L470 AbstractCegarLoop]: Abstraction has 9489 states and 12911 transitions. [2021-11-07 02:23:34,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:34,391 INFO L276 IsEmpty]: Start isEmpty. Operand 9489 states and 12911 transitions. [2021-11-07 02:23:34,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-07 02:23:34,424 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:34,424 INFO L513 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:34,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 02:23:34,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-07 02:23:34,651 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:34,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:34,652 INFO L85 PathProgramCache]: Analyzing trace with hash -297112618, now seen corresponding path program 1 times [2021-11-07 02:23:34,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:34,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425589067] [2021-11-07 02:23:34,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:34,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:34,758 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:34,758 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:34,758 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425589067] [2021-11-07 02:23:34,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425589067] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:34,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:34,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:23:34,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526902240] [2021-11-07 02:23:34,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:34,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:34,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:34,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:34,768 INFO L87 Difference]: Start difference. First operand 9489 states and 12911 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:35,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:35,377 INFO L93 Difference]: Finished difference Result 19509 states and 27022 transitions. [2021-11-07 02:23:35,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:23:35,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-07 02:23:35,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:35,410 INFO L225 Difference]: With dead ends: 19509 [2021-11-07 02:23:35,410 INFO L226 Difference]: Without dead ends: 10033 [2021-11-07 02:23:35,427 INFO L786 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 [2021-11-07 02:23:35,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10033 states. [2021-11-07 02:23:35,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10033 to 7378. [2021-11-07 02:23:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7378 states, 7376 states have (on average 1.3817787418655099) internal successors, (10192), 7377 states have internal predecessors, (10192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7378 states to 7378 states and 10192 transitions. [2021-11-07 02:23:35,986 INFO L78 Accepts]: Start accepts. Automaton has 7378 states and 10192 transitions. Word has length 65 [2021-11-07 02:23:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:35,988 INFO L470 AbstractCegarLoop]: Abstraction has 7378 states and 10192 transitions. [2021-11-07 02:23:35,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:35,989 INFO L276 IsEmpty]: Start isEmpty. Operand 7378 states and 10192 transitions. [2021-11-07 02:23:36,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-07 02:23:36,010 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:36,010 INFO L513 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:36,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 02:23:36,011 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:36,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:36,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1466130951, now seen corresponding path program 1 times [2021-11-07 02:23:36,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:36,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018682472] [2021-11-07 02:23:36,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:36,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:36,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:36,114 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:36,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018682472] [2021-11-07 02:23:36,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018682472] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:36,115 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:36,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:36,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016063857] [2021-11-07 02:23:36,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:36,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:36,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:36,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:36,117 INFO L87 Difference]: Start difference. First operand 7378 states and 10192 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:36,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:36,577 INFO L93 Difference]: Finished difference Result 14742 states and 20370 transitions. [2021-11-07 02:23:36,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:36,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-07 02:23:36,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:36,601 INFO L225 Difference]: With dead ends: 14742 [2021-11-07 02:23:36,602 INFO L226 Difference]: Without dead ends: 7378 [2021-11-07 02:23:36,618 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:36,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7378 states. [2021-11-07 02:23:37,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7378 to 7378. [2021-11-07 02:23:37,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7378 states, 7376 states have (on average 1.3644251626898047) internal successors, (10064), 7377 states have internal predecessors, (10064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7378 states to 7378 states and 10064 transitions. [2021-11-07 02:23:37,160 INFO L78 Accepts]: Start accepts. Automaton has 7378 states and 10064 transitions. Word has length 67 [2021-11-07 02:23:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:37,161 INFO L470 AbstractCegarLoop]: Abstraction has 7378 states and 10064 transitions. [2021-11-07 02:23:37,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:37,162 INFO L276 IsEmpty]: Start isEmpty. Operand 7378 states and 10064 transitions. [2021-11-07 02:23:37,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-07 02:23:37,190 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:37,190 INFO L513 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:37,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 02:23:37,191 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:37,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:37,191 INFO L85 PathProgramCache]: Analyzing trace with hash 492641992, now seen corresponding path program 1 times [2021-11-07 02:23:37,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:37,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381612420] [2021-11-07 02:23:37,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:37,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:37,260 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:37,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381612420] [2021-11-07 02:23:37,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381612420] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:37,261 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:37,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:37,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368316439] [2021-11-07 02:23:37,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:37,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:37,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:37,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:37,265 INFO L87 Difference]: Start difference. First operand 7378 states and 10064 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:37,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:37,655 INFO L93 Difference]: Finished difference Result 12500 states and 17114 transitions. [2021-11-07 02:23:37,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:37,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-07 02:23:37,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:37,673 INFO L225 Difference]: With dead ends: 12500 [2021-11-07 02:23:37,673 INFO L226 Difference]: Without dead ends: 5136 [2021-11-07 02:23:37,686 INFO L786 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 [2021-11-07 02:23:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5136 states. [2021-11-07 02:23:38,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5136 to 5075. [2021-11-07 02:23:38,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5075 states, 5073 states have (on average 1.3303765030553913) internal successors, (6749), 5074 states have internal predecessors, (6749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5075 states to 5075 states and 6749 transitions. [2021-11-07 02:23:38,072 INFO L78 Accepts]: Start accepts. Automaton has 5075 states and 6749 transitions. Word has length 67 [2021-11-07 02:23:38,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:38,072 INFO L470 AbstractCegarLoop]: Abstraction has 5075 states and 6749 transitions. [2021-11-07 02:23:38,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:38,073 INFO L276 IsEmpty]: Start isEmpty. Operand 5075 states and 6749 transitions. [2021-11-07 02:23:38,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-07 02:23:38,086 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:38,087 INFO L513 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:38,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 02:23:38,087 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:38,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:38,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1162155612, now seen corresponding path program 1 times [2021-11-07 02:23:38,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:38,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666526538] [2021-11-07 02:23:38,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:38,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:38,293 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:38,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666526538] [2021-11-07 02:23:38,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666526538] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:23:38,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983800421] [2021-11-07 02:23:38,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:38,295 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:23:38,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:23:38,296 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:23:38,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 02:23:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:38,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-07 02:23:38,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:23:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:38,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:23:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:39,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983800421] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:39,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:23:39,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 4] imperfect sequences [8] total 16 [2021-11-07 02:23:39,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978104496] [2021-11-07 02:23:39,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 02:23:39,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:39,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 02:23:39,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-11-07 02:23:39,139 INFO L87 Difference]: Start difference. First operand 5075 states and 6749 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:40,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:40,692 INFO L93 Difference]: Finished difference Result 15501 states and 20919 transitions. [2021-11-07 02:23:40,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-07 02:23:40,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-11-07 02:23:40,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:40,724 INFO L225 Difference]: With dead ends: 15501 [2021-11-07 02:23:40,724 INFO L226 Difference]: Without dead ends: 10464 [2021-11-07 02:23:40,735 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=1315, Unknown=0, NotChecked=0, Total=1640 [2021-11-07 02:23:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10464 states. [2021-11-07 02:23:41,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10464 to 5917. [2021-11-07 02:23:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5917 states, 5915 states have (on average 1.3425190194420964) internal successors, (7941), 5916 states have internal predecessors, (7941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:41,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5917 states to 5917 states and 7941 transitions. [2021-11-07 02:23:41,128 INFO L78 Accepts]: Start accepts. Automaton has 5917 states and 7941 transitions. Word has length 68 [2021-11-07 02:23:41,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:41,128 INFO L470 AbstractCegarLoop]: Abstraction has 5917 states and 7941 transitions. [2021-11-07 02:23:41,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:41,129 INFO L276 IsEmpty]: Start isEmpty. Operand 5917 states and 7941 transitions. [2021-11-07 02:23:41,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-07 02:23:41,145 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:41,145 INFO L513 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:41,197 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 02:23:41,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:23:41,359 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:41,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:41,360 INFO L85 PathProgramCache]: Analyzing trace with hash 722196968, now seen corresponding path program 1 times [2021-11-07 02:23:41,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:41,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206551979] [2021-11-07 02:23:41,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:41,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:41,416 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:41,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206551979] [2021-11-07 02:23:41,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206551979] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:41,417 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:41,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:41,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517367351] [2021-11-07 02:23:41,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:41,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:41,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:41,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:41,422 INFO L87 Difference]: Start difference. First operand 5917 states and 7941 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:41,757 INFO L93 Difference]: Finished difference Result 10408 states and 14018 transitions. [2021-11-07 02:23:41,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:41,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-07 02:23:41,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:41,771 INFO L225 Difference]: With dead ends: 10408 [2021-11-07 02:23:41,771 INFO L226 Difference]: Without dead ends: 4529 [2021-11-07 02:23:41,780 INFO L786 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 [2021-11-07 02:23:41,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4529 states. [2021-11-07 02:23:42,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4529 to 4460. [2021-11-07 02:23:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4460 states, 4458 states have (on average 1.310228802153432) internal successors, (5841), 4459 states have internal predecessors, (5841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4460 states to 4460 states and 5841 transitions. [2021-11-07 02:23:42,079 INFO L78 Accepts]: Start accepts. Automaton has 4460 states and 5841 transitions. Word has length 70 [2021-11-07 02:23:42,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:42,080 INFO L470 AbstractCegarLoop]: Abstraction has 4460 states and 5841 transitions. [2021-11-07 02:23:42,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 4460 states and 5841 transitions. [2021-11-07 02:23:42,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-07 02:23:42,091 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:42,091 INFO L513 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:42,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 02:23:42,092 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:42,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:42,092 INFO L85 PathProgramCache]: Analyzing trace with hash -418154743, now seen corresponding path program 1 times [2021-11-07 02:23:42,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:42,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330318637] [2021-11-07 02:23:42,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:42,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:42,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:42,174 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:42,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330318637] [2021-11-07 02:23:42,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330318637] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:23:42,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332326041] [2021-11-07 02:23:42,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:42,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:23:42,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:23:42,177 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:23:42,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-07 02:23:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:42,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-07 02:23:42,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:23:42,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:42,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:23:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:43,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332326041] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:43,151 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:23:43,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 4] imperfect sequences [4] total 13 [2021-11-07 02:23:43,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340348806] [2021-11-07 02:23:43,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 02:23:43,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:43,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 02:23:43,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:23:43,154 INFO L87 Difference]: Start difference. First operand 4460 states and 5841 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:44,726 INFO L93 Difference]: Finished difference Result 9201 states and 12020 transitions. [2021-11-07 02:23:44,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-07 02:23:44,728 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-07 02:23:44,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:44,751 INFO L225 Difference]: With dead ends: 9201 [2021-11-07 02:23:44,752 INFO L226 Difference]: Without dead ends: 6780 [2021-11-07 02:23:44,759 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2021-11-07 02:23:44,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6780 states. [2021-11-07 02:23:45,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6780 to 4291. [2021-11-07 02:23:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4291 states, 4289 states have (on average 1.314525530426673) internal successors, (5638), 4290 states have internal predecessors, (5638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:45,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4291 states to 4291 states and 5638 transitions. [2021-11-07 02:23:45,135 INFO L78 Accepts]: Start accepts. Automaton has 4291 states and 5638 transitions. Word has length 70 [2021-11-07 02:23:45,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:45,135 INFO L470 AbstractCegarLoop]: Abstraction has 4291 states and 5638 transitions. [2021-11-07 02:23:45,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:45,136 INFO L276 IsEmpty]: Start isEmpty. Operand 4291 states and 5638 transitions. [2021-11-07 02:23:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-07 02:23:45,149 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:45,149 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-11-07 02:23:45,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-07 02:23:45,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-07 02:23:45,367 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:45,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:45,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2339251, now seen corresponding path program 1 times [2021-11-07 02:23:45,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:45,368 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356952101] [2021-11-07 02:23:45,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:45,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:45,453 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:45,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356952101] [2021-11-07 02:23:45,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356952101] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:23:45,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300548802] [2021-11-07 02:23:45,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:45,454 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:23:45,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:23:45,456 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:23:45,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-07 02:23:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:45,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 02:23:45,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:23:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:45,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:23:46,154 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:46,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300548802] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:46,154 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:23:46,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-11-07 02:23:46,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375935461] [2021-11-07 02:23:46,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:46,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:46,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:46,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:23:46,158 INFO L87 Difference]: Start difference. First operand 4291 states and 5638 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:46,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:46,493 INFO L93 Difference]: Finished difference Result 8525 states and 11235 transitions. [2021-11-07 02:23:46,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:46,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-07 02:23:46,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:46,508 INFO L225 Difference]: With dead ends: 8525 [2021-11-07 02:23:46,508 INFO L226 Difference]: Without dead ends: 5014 [2021-11-07 02:23:46,516 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:23:46,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5014 states. [2021-11-07 02:23:46,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5014 to 4505. [2021-11-07 02:23:46,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4505 states, 4503 states have (on average 1.3177881412391739) internal successors, (5934), 4504 states have internal predecessors, (5934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4505 states to 4505 states and 5934 transitions. [2021-11-07 02:23:46,916 INFO L78 Accepts]: Start accepts. Automaton has 4505 states and 5934 transitions. Word has length 72 [2021-11-07 02:23:46,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:46,917 INFO L470 AbstractCegarLoop]: Abstraction has 4505 states and 5934 transitions. [2021-11-07 02:23:46,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 4505 states and 5934 transitions. [2021-11-07 02:23:46,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-07 02:23:46,929 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:46,929 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-11-07 02:23:46,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-07 02:23:47,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-07 02:23:47,155 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:47,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:47,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1884591447, now seen corresponding path program 1 times [2021-11-07 02:23:47,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:47,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601501581] [2021-11-07 02:23:47,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:47,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:47,214 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:47,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601501581] [2021-11-07 02:23:47,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601501581] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:23:47,215 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176423752] [2021-11-07 02:23:47,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:47,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:23:47,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:23:47,216 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:23:47,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-07 02:23:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:47,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 02:23:47,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:23:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:47,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:23:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:47,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176423752] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:47,967 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:23:47,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-11-07 02:23:47,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368908021] [2021-11-07 02:23:47,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:47,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:47,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:47,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:23:47,970 INFO L87 Difference]: Start difference. First operand 4505 states and 5934 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:48,423 INFO L93 Difference]: Finished difference Result 8441 states and 11156 transitions. [2021-11-07 02:23:48,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:48,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-07 02:23:48,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:48,436 INFO L225 Difference]: With dead ends: 8441 [2021-11-07 02:23:48,436 INFO L226 Difference]: Without dead ends: 5165 [2021-11-07 02:23:48,443 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:23:48,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2021-11-07 02:23:48,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 4593. [2021-11-07 02:23:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4593 states, 4591 states have (on average 1.3245480287519058) internal successors, (6081), 4592 states have internal predecessors, (6081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4593 states to 4593 states and 6081 transitions. [2021-11-07 02:23:48,806 INFO L78 Accepts]: Start accepts. Automaton has 4593 states and 6081 transitions. Word has length 72 [2021-11-07 02:23:48,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:48,806 INFO L470 AbstractCegarLoop]: Abstraction has 4593 states and 6081 transitions. [2021-11-07 02:23:48,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 6081 transitions. [2021-11-07 02:23:48,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-07 02:23:48,818 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:48,818 INFO L513 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:48,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-07 02:23:49,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:23:49,035 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:49,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:49,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1547638558, now seen corresponding path program 1 times [2021-11-07 02:23:49,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:49,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323941487] [2021-11-07 02:23:49,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:49,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:49,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:49,141 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:49,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323941487] [2021-11-07 02:23:49,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323941487] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:23:49,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134794262] [2021-11-07 02:23:49,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:49,143 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:23:49,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:23:49,179 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:23:49,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-07 02:23:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:49,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-07 02:23:49,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:23:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:49,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:23:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:50,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134794262] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-07 02:23:50,490 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-11-07 02:23:50,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 6] total 11 [2021-11-07 02:23:50,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812944266] [2021-11-07 02:23:50,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:50,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:50,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:50,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:23:50,494 INFO L87 Difference]: Start difference. First operand 4593 states and 6081 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:51,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:51,049 INFO L93 Difference]: Finished difference Result 9908 states and 13252 transitions. [2021-11-07 02:23:51,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:51,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-07 02:23:51,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:51,065 INFO L225 Difference]: With dead ends: 9908 [2021-11-07 02:23:51,065 INFO L226 Difference]: Without dead ends: 6720 [2021-11-07 02:23:51,073 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:23:51,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6720 states. [2021-11-07 02:23:51,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6720 to 4593. [2021-11-07 02:23:51,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4593 states, 4591 states have (on average 1.309082988455674) internal successors, (6010), 4592 states have internal predecessors, (6010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4593 states to 4593 states and 6010 transitions. [2021-11-07 02:23:51,553 INFO L78 Accepts]: Start accepts. Automaton has 4593 states and 6010 transitions. Word has length 72 [2021-11-07 02:23:51,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:51,554 INFO L470 AbstractCegarLoop]: Abstraction has 4593 states and 6010 transitions. [2021-11-07 02:23:51,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 6010 transitions. [2021-11-07 02:23:51,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-07 02:23:51,561 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:51,561 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-11-07 02:23:51,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-07 02:23:51,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-07 02:23:51,762 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:51,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:51,763 INFO L85 PathProgramCache]: Analyzing trace with hash -999086944, now seen corresponding path program 1 times [2021-11-07 02:23:51,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:51,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080975846] [2021-11-07 02:23:51,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:51,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-07 02:23:51,822 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:51,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080975846] [2021-11-07 02:23:51,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080975846] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:51,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:51,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:51,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155255756] [2021-11-07 02:23:51,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:51,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:51,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:51,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:51,826 INFO L87 Difference]: Start difference. First operand 4593 states and 6010 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:52,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:52,430 INFO L93 Difference]: Finished difference Result 11115 states and 14591 transitions. [2021-11-07 02:23:52,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:52,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-07 02:23:52,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:52,444 INFO L225 Difference]: With dead ends: 11115 [2021-11-07 02:23:52,444 INFO L226 Difference]: Without dead ends: 6536 [2021-11-07 02:23:52,454 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:52,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6536 states. [2021-11-07 02:23:52,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6536 to 5711. [2021-11-07 02:23:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5711 states, 5709 states have (on average 1.279033105622701) internal successors, (7302), 5710 states have internal predecessors, (7302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5711 states to 5711 states and 7302 transitions. [2021-11-07 02:23:52,891 INFO L78 Accepts]: Start accepts. Automaton has 5711 states and 7302 transitions. Word has length 72 [2021-11-07 02:23:52,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:52,891 INFO L470 AbstractCegarLoop]: Abstraction has 5711 states and 7302 transitions. [2021-11-07 02:23:52,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:52,892 INFO L276 IsEmpty]: Start isEmpty. Operand 5711 states and 7302 transitions. [2021-11-07 02:23:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-07 02:23:52,901 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:52,901 INFO L513 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:52,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 02:23:52,902 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:52,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:52,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1837118174, now seen corresponding path program 1 times [2021-11-07 02:23:52,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:52,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560739909] [2021-11-07 02:23:52,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:52,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:52,983 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:52,983 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560739909] [2021-11-07 02:23:52,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560739909] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:23:52,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120464520] [2021-11-07 02:23:52,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:52,984 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:23:52,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:23:52,987 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:23:53,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-07 02:23:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:53,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-07 02:23:53,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:23:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:53,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:23:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:54,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120464520] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-07 02:23:54,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-11-07 02:23:54,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 5] total 13 [2021-11-07 02:23:54,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049850100] [2021-11-07 02:23:54,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:23:54,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:54,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:23:54,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:23:54,310 INFO L87 Difference]: Start difference. First operand 5711 states and 7302 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:54,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:54,953 INFO L93 Difference]: Finished difference Result 10522 states and 13502 transitions. [2021-11-07 02:23:54,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:23:54,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-07 02:23:54,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:54,964 INFO L225 Difference]: With dead ends: 10522 [2021-11-07 02:23:54,965 INFO L226 Difference]: Without dead ends: 5956 [2021-11-07 02:23:54,972 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-07 02:23:54,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2021-11-07 02:23:55,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 5227. [2021-11-07 02:23:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5227 states, 5225 states have (on average 1.256267942583732) internal successors, (6564), 5226 states have internal predecessors, (6564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:55,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5227 states to 5227 states and 6564 transitions. [2021-11-07 02:23:55,465 INFO L78 Accepts]: Start accepts. Automaton has 5227 states and 6564 transitions. Word has length 73 [2021-11-07 02:23:55,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:55,465 INFO L470 AbstractCegarLoop]: Abstraction has 5227 states and 6564 transitions. [2021-11-07 02:23:55,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:55,466 INFO L276 IsEmpty]: Start isEmpty. Operand 5227 states and 6564 transitions. [2021-11-07 02:23:55,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-07 02:23:55,472 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:55,472 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:55,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-07 02:23:55,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:23:55,695 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:55,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:55,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1387638095, now seen corresponding path program 1 times [2021-11-07 02:23:55,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:55,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71536641] [2021-11-07 02:23:55,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:55,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:55,767 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:55,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71536641] [2021-11-07 02:23:55,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71536641] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:55,768 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:55,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:55,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363157847] [2021-11-07 02:23:55,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:23:55,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:55,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:23:55,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:23:55,774 INFO L87 Difference]: Start difference. First operand 5227 states and 6564 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:56,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:56,130 INFO L93 Difference]: Finished difference Result 8040 states and 10176 transitions. [2021-11-07 02:23:56,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:23:56,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-07 02:23:56,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:56,137 INFO L225 Difference]: With dead ends: 8040 [2021-11-07 02:23:56,137 INFO L226 Difference]: Without dead ends: 3474 [2021-11-07 02:23:56,143 INFO L786 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 [2021-11-07 02:23:56,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2021-11-07 02:23:56,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 3433. [2021-11-07 02:23:56,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3433 states, 3431 states have (on average 1.2212183037015447) internal successors, (4190), 3432 states have internal predecessors, (4190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:56,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 4190 transitions. [2021-11-07 02:23:56,557 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 4190 transitions. Word has length 73 [2021-11-07 02:23:56,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:56,558 INFO L470 AbstractCegarLoop]: Abstraction has 3433 states and 4190 transitions. [2021-11-07 02:23:56,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 4190 transitions. [2021-11-07 02:23:56,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-07 02:23:56,564 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:56,564 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:56,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 02:23:56,565 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:56,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:56,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1619134672, now seen corresponding path program 1 times [2021-11-07 02:23:56,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:56,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796388939] [2021-11-07 02:23:56,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:56,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 02:23:56,668 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:56,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796388939] [2021-11-07 02:23:56,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796388939] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:56,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:56,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:23:56,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257007383] [2021-11-07 02:23:56,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:56,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:56,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:56,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:56,673 INFO L87 Difference]: Start difference. First operand 3433 states and 4190 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:57,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:57,105 INFO L93 Difference]: Finished difference Result 6132 states and 7504 transitions. [2021-11-07 02:23:57,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:57,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-07 02:23:57,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:57,118 INFO L225 Difference]: With dead ends: 6132 [2021-11-07 02:23:57,118 INFO L226 Difference]: Without dead ends: 3448 [2021-11-07 02:23:57,123 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3448 states. [2021-11-07 02:23:57,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3448 to 3433. [2021-11-07 02:23:57,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3433 states, 3431 states have (on average 1.1993587875255027) internal successors, (4115), 3432 states have internal predecessors, (4115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:57,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 4115 transitions. [2021-11-07 02:23:57,431 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 4115 transitions. Word has length 73 [2021-11-07 02:23:57,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:57,431 INFO L470 AbstractCegarLoop]: Abstraction has 3433 states and 4115 transitions. [2021-11-07 02:23:57,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 4115 transitions. [2021-11-07 02:23:57,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-07 02:23:57,435 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:57,435 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:23:57,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-07 02:23:57,436 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:57,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:57,436 INFO L85 PathProgramCache]: Analyzing trace with hash -984762331, now seen corresponding path program 1 times [2021-11-07 02:23:57,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:57,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806636790] [2021-11-07 02:23:57,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:57,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:57,503 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:23:57,503 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:57,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806636790] [2021-11-07 02:23:57,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806636790] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:57,504 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:23:57,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:23:57,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586477466] [2021-11-07 02:23:57,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:57,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:57,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:57,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:57,506 INFO L87 Difference]: Start difference. First operand 3433 states and 4115 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:57,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:57,948 INFO L93 Difference]: Finished difference Result 6673 states and 7986 transitions. [2021-11-07 02:23:57,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:57,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-07 02:23:57,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:57,954 INFO L225 Difference]: With dead ends: 6673 [2021-11-07 02:23:57,955 INFO L226 Difference]: Without dead ends: 3989 [2021-11-07 02:23:57,958 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:23:57,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3989 states. [2021-11-07 02:23:58,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3989 to 3326. [2021-11-07 02:23:58,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3326 states, 3324 states have (on average 1.1850180505415162) internal successors, (3939), 3325 states have internal predecessors, (3939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3326 states and 3939 transitions. [2021-11-07 02:23:58,177 INFO L78 Accepts]: Start accepts. Automaton has 3326 states and 3939 transitions. Word has length 75 [2021-11-07 02:23:58,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:58,178 INFO L470 AbstractCegarLoop]: Abstraction has 3326 states and 3939 transitions. [2021-11-07 02:23:58,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:58,178 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 3939 transitions. [2021-11-07 02:23:58,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-07 02:23:58,182 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:58,182 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-11-07 02:23:58,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-07 02:23:58,183 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:23:58,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:23:58,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1356948123, now seen corresponding path program 1 times [2021-11-07 02:23:58,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:23:58,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657997632] [2021-11-07 02:23:58,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:58,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:23:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 02:23:58,242 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:23:58,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657997632] [2021-11-07 02:23:58,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657997632] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:23:58,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216172641] [2021-11-07 02:23:58,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:23:58,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:23:58,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:23:58,249 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:23:58,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-07 02:23:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:23:58,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 02:23:58,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:23:59,020 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 02:23:59,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:23:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 02:23:59,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216172641] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:23:59,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:23:59,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [3] total 5 [2021-11-07 02:23:59,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414764421] [2021-11-07 02:23:59,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:23:59,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:23:59,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:23:59,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:59,324 INFO L87 Difference]: Start difference. First operand 3326 states and 3939 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:59,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:23:59,604 INFO L93 Difference]: Finished difference Result 6329 states and 7479 transitions. [2021-11-07 02:23:59,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:23:59,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-07 02:23:59,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:23:59,609 INFO L225 Difference]: With dead ends: 6329 [2021-11-07 02:23:59,609 INFO L226 Difference]: Without dead ends: 3432 [2021-11-07 02:23:59,612 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:23:59,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2021-11-07 02:23:59,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 3326. [2021-11-07 02:23:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3326 states, 3324 states have (on average 1.1594464500601684) internal successors, (3854), 3325 states have internal predecessors, (3854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:59,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3326 states and 3854 transitions. [2021-11-07 02:23:59,871 INFO L78 Accepts]: Start accepts. Automaton has 3326 states and 3854 transitions. Word has length 93 [2021-11-07 02:23:59,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:23:59,871 INFO L470 AbstractCegarLoop]: Abstraction has 3326 states and 3854 transitions. [2021-11-07 02:23:59,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:23:59,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 3854 transitions. [2021-11-07 02:23:59,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-07 02:23:59,874 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:23:59,874 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-11-07 02:23:59,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-07 02:24:00,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:24:00,095 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:24:00,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:00,096 INFO L85 PathProgramCache]: Analyzing trace with hash 264210218, now seen corresponding path program 1 times [2021-11-07 02:24:00,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:00,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584071943] [2021-11-07 02:24:00,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:00,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:24:00,235 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:00,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584071943] [2021-11-07 02:24:00,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584071943] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:00,235 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:00,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:24:00,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854726790] [2021-11-07 02:24:00,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:24:00,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:00,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:24:00,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:24:00,238 INFO L87 Difference]: Start difference. First operand 3326 states and 3854 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:00,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:00,621 INFO L93 Difference]: Finished difference Result 7121 states and 8178 transitions. [2021-11-07 02:24:00,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:24:00,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-11-07 02:24:00,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:00,627 INFO L225 Difference]: With dead ends: 7121 [2021-11-07 02:24:00,627 INFO L226 Difference]: Without dead ends: 4250 [2021-11-07 02:24:00,631 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:24:00,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4250 states. [2021-11-07 02:24:00,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4250 to 3626. [2021-11-07 02:24:00,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3626 states, 3624 states have (on average 1.1321743929359824) internal successors, (4103), 3625 states have internal predecessors, (4103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:00,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 3626 states and 4103 transitions. [2021-11-07 02:24:00,915 INFO L78 Accepts]: Start accepts. Automaton has 3626 states and 4103 transitions. Word has length 96 [2021-11-07 02:24:00,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:00,915 INFO L470 AbstractCegarLoop]: Abstraction has 3626 states and 4103 transitions. [2021-11-07 02:24:00,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:00,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3626 states and 4103 transitions. [2021-11-07 02:24:00,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-07 02:24:00,919 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:00,919 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-11-07 02:24:00,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-07 02:24:00,919 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:24:00,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:00,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1294994603, now seen corresponding path program 1 times [2021-11-07 02:24:00,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:00,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591956769] [2021-11-07 02:24:00,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:00,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:24:01,055 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 02:24:01,056 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:24:01,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591956769] [2021-11-07 02:24:01,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591956769] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:24:01,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:24:01,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 02:24:01,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865615452] [2021-11-07 02:24:01,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:24:01,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:24:01,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:24:01,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:24:01,059 INFO L87 Difference]: Start difference. First operand 3626 states and 4103 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:02,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:24:02,133 INFO L93 Difference]: Finished difference Result 12269 states and 13912 transitions. [2021-11-07 02:24:02,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:24:02,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2021-11-07 02:24:02,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:24:02,147 INFO L225 Difference]: With dead ends: 12269 [2021-11-07 02:24:02,147 INFO L226 Difference]: Without dead ends: 10253 [2021-11-07 02:24:02,151 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:24:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10253 states. [2021-11-07 02:24:02,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10253 to 6562. [2021-11-07 02:24:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6562 states, 6560 states have (on average 1.1327743902439025) internal successors, (7431), 6561 states have internal predecessors, (7431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6562 states to 6562 states and 7431 transitions. [2021-11-07 02:24:02,779 INFO L78 Accepts]: Start accepts. Automaton has 6562 states and 7431 transitions. Word has length 118 [2021-11-07 02:24:02,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:24:02,780 INFO L470 AbstractCegarLoop]: Abstraction has 6562 states and 7431 transitions. [2021-11-07 02:24:02,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:24:02,781 INFO L276 IsEmpty]: Start isEmpty. Operand 6562 states and 7431 transitions. [2021-11-07 02:24:02,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-07 02:24:02,786 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:24:02,787 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-11-07 02:24:02,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-07 02:24:02,787 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:24:02,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:24:02,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1490143722, now seen corresponding path program 1 times [2021-11-07 02:24:02,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:24:02,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018520088] [2021-11-07 02:24:02,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:24:02,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:24:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 02:24:02,836 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 02:24:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 02:24:02,965 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 02:24:02,966 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 02:24:02,967 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:02,969 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:24:02,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-07 02:24:02,974 INFO L731 BasicCegarLoop]: Path program 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] [2021-11-07 02:24:02,978 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 02:24:03,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:24:03 BoogieIcfgContainer [2021-11-07 02:24:03,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 02:24:03,208 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 02:24:03,208 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 02:24:03,208 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 02:24:03,209 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:23:27" (3/4) ... [2021-11-07 02:24:03,211 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 02:24:03,412 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 02:24:03,413 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 02:24:03,414 INFO L168 Benchmark]: Toolchain (without parser) took 39688.37 ms. Allocated memory was 98.6 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 58.5 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 294.4 MB. Max. memory is 16.1 GB. [2021-11-07 02:24:03,415 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 98.6 MB. Free memory is still 75.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 02:24:03,416 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.54 ms. Allocated memory is still 98.6 MB. Free memory was 58.3 MB in the beginning and 69.4 MB in the end (delta: -11.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-07 02:24:03,416 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.69 ms. Allocated memory is still 98.6 MB. Free memory was 69.4 MB in the beginning and 65.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-07 02:24:03,417 INFO L168 Benchmark]: Boogie Preprocessor took 113.86 ms. Allocated memory is still 98.6 MB. Free memory was 65.5 MB in the beginning and 62.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-07 02:24:03,417 INFO L168 Benchmark]: RCFGBuilder took 2739.39 ms. Allocated memory was 98.6 MB in the beginning and 127.9 MB in the end (delta: 29.4 MB). Free memory was 62.3 MB in the beginning and 68.7 MB in the end (delta: -6.4 MB). Peak memory consumption was 51.6 MB. Max. memory is 16.1 GB. [2021-11-07 02:24:03,418 INFO L168 Benchmark]: TraceAbstraction took 35970.64 ms. Allocated memory was 127.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 68.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 249.8 MB. Max. memory is 16.1 GB. [2021-11-07 02:24:03,418 INFO L168 Benchmark]: Witness Printer took 204.87 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-11-07 02:24:03,421 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 98.6 MB. Free memory is still 75.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 556.54 ms. Allocated memory is still 98.6 MB. Free memory was 58.3 MB in the beginning and 69.4 MB in the end (delta: -11.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 94.69 ms. Allocated memory is still 98.6 MB. Free memory was 69.4 MB in the beginning and 65.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 113.86 ms. Allocated memory is still 98.6 MB. Free memory was 65.5 MB in the beginning and 62.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2739.39 ms. Allocated memory was 98.6 MB in the beginning and 127.9 MB in the end (delta: 29.4 MB). Free memory was 62.3 MB in the beginning and 68.7 MB in the end (delta: -6.4 MB). Peak memory consumption was 51.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 35970.64 ms. Allocated memory was 127.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 68.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 249.8 MB. Max. memory is 16.1 GB. * Witness Printer took 204.87 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int t3_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int t3_st ; [L32] int m_i ; [L33] int t1_i ; [L34] int t2_i ; [L35] int t3_i ; [L36] int M_E = 2; [L37] int T1_E = 2; [L38] int T2_E = 2; [L39] int T3_E = 2; [L40] int E_M = 2; [L41] int E_1 = 2; [L42] int E_2 = 2; [L43] int E_3 = 2; [L49] int token ; [L51] int local ; [L735] int __retres1 ; [L648] m_i = 1 [L649] t1_i = 1 [L650] t2_i = 1 [L651] t3_i = 1 [L676] int kernel_st ; [L677] int tmp ; [L678] int tmp___0 ; [L682] kernel_st = 0 [L304] COND TRUE m_i == 1 [L305] m_st = 0 [L309] COND TRUE t1_i == 1 [L310] t1_st = 0 [L314] COND TRUE t2_i == 1 [L315] t2_st = 0 [L319] COND TRUE t3_i == 1 [L320] t3_st = 0 [L441] COND FALSE !(M_E == 0) [L446] COND FALSE !(T1_E == 0) [L451] COND FALSE !(T2_E == 0) [L456] COND FALSE !(T3_E == 0) [L461] COND FALSE !(E_M == 0) [L466] COND FALSE !(E_1 == 0) [L471] COND FALSE !(E_2 == 0) [L476] COND FALSE !(E_3 == 0) [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L217] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L220] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L230] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L232] return (__retres1); [L541] tmp = is_master_triggered() [L543] COND FALSE !(\read(tmp)) [L236] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L239] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L249] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L251] return (__retres1); [L549] tmp___0 = is_transmit1_triggered() [L551] COND FALSE !(\read(tmp___0)) [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L258] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L268] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L270] return (__retres1); [L557] tmp___1 = is_transmit2_triggered() [L559] COND FALSE !(\read(tmp___1)) [L274] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L277] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L287] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L289] return (__retres1); [L565] tmp___2 = is_transmit3_triggered() [L567] COND FALSE !(\read(tmp___2)) [L489] COND FALSE !(M_E == 1) [L494] COND FALSE !(T1_E == 1) [L499] COND FALSE !(T2_E == 1) [L504] COND FALSE !(T3_E == 1) [L509] COND FALSE !(E_M == 1) [L514] COND FALSE !(E_1 == 1) [L519] COND FALSE !(E_2 == 1) [L524] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L690] COND TRUE 1 [L693] kernel_st = 1 [L360] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L364] COND TRUE 1 [L329] int __retres1 ; [L332] COND TRUE m_st == 0 [L333] __retres1 = 1 [L355] return (__retres1); [L367] tmp = exists_runnable_thread() [L369] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L374] COND TRUE m_st == 0 [L375] int tmp_ndt_1; [L376] tmp_ndt_1 = __VERIFIER_nondet_int() [L377] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L388] COND TRUE t1_st == 0 [L389] int tmp_ndt_2; [L390] tmp_ndt_2 = __VERIFIER_nondet_int() [L391] COND TRUE \read(tmp_ndt_2) [L393] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L112] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L123] COND TRUE 1 [L125] t1_pc = 1 [L126] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L402] COND TRUE t2_st == 0 [L403] int tmp_ndt_3; [L404] tmp_ndt_3 = __VERIFIER_nondet_int() [L405] COND TRUE \read(tmp_ndt_3) [L407] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L148] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L159] COND TRUE 1 [L161] t2_pc = 1 [L162] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L416] COND TRUE t3_st == 0 [L417] int tmp_ndt_4; [L418] tmp_ndt_4 = __VERIFIER_nondet_int() [L419] COND TRUE \read(tmp_ndt_4) [L421] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L184] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L195] COND TRUE 1 [L197] t3_pc = 1 [L198] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L364] COND TRUE 1 [L329] int __retres1 ; [L332] COND TRUE m_st == 0 [L333] __retres1 = 1 [L355] return (__retres1); [L367] tmp = exists_runnable_thread() [L369] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L374] COND TRUE m_st == 0 [L375] int tmp_ndt_1; [L376] tmp_ndt_1 = __VERIFIER_nondet_int() [L377] COND TRUE \read(tmp_ndt_1) [L379] m_st = 1 [L54] int tmp_var = __VERIFIER_nondet_int(); [L56] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L67] COND TRUE 1 [L70] token = __VERIFIER_nondet_int() [L71] local = token [L72] E_1 = 1 [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L217] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L220] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L230] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L232] return (__retres1); [L541] tmp = is_master_triggered() [L543] COND FALSE !(\read(tmp)) [L236] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L239] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L240] COND TRUE E_1 == 1 [L241] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L251] return (__retres1); [L549] tmp___0 = is_transmit1_triggered() [L551] COND TRUE \read(tmp___0) [L552] t1_st = 0 [L255] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L258] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L259] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L268] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L270] return (__retres1); [L557] tmp___1 = is_transmit2_triggered() [L559] COND FALSE !(\read(tmp___1)) [L274] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L277] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L278] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L287] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L289] return (__retres1); [L565] tmp___2 = is_transmit3_triggered() [L567] COND FALSE !(\read(tmp___2)) [L74] E_1 = 2 [L75] m_pc = 1 [L76] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L388] COND TRUE t1_st == 0 [L389] int tmp_ndt_2; [L390] tmp_ndt_2 = __VERIFIER_nondet_int() [L391] COND TRUE \read(tmp_ndt_2) [L393] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L112] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L115] COND TRUE t1_pc == 1 [L131] token += 1 [L132] E_2 = 1 [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L217] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L220] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L221] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L230] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L232] return (__retres1); [L541] tmp = is_master_triggered() [L543] COND FALSE !(\read(tmp)) [L236] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L239] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L240] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L249] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L251] return (__retres1); [L549] tmp___0 = is_transmit1_triggered() [L551] COND FALSE !(\read(tmp___0)) [L255] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L258] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L259] COND TRUE E_2 == 1 [L260] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L270] return (__retres1); [L557] tmp___1 = is_transmit2_triggered() [L559] COND TRUE \read(tmp___1) [L560] t2_st = 0 [L274] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L277] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L278] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L287] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L289] return (__retres1); [L565] tmp___2 = is_transmit3_triggered() [L567] COND FALSE !(\read(tmp___2)) [L134] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L123] COND TRUE 1 [L125] t1_pc = 1 [L126] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L402] COND TRUE t2_st == 0 [L403] int tmp_ndt_3; [L404] tmp_ndt_3 = __VERIFIER_nondet_int() [L405] COND TRUE \read(tmp_ndt_3) [L407] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L148] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L151] COND TRUE t2_pc == 1 [L167] token += 1 [L168] E_3 = 1 [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L217] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L220] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L221] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L230] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L232] return (__retres1); [L541] tmp = is_master_triggered() [L543] COND FALSE !(\read(tmp)) [L236] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L239] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L240] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L249] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L251] return (__retres1); [L549] tmp___0 = is_transmit1_triggered() [L551] COND FALSE !(\read(tmp___0)) [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L258] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L259] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L268] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L270] return (__retres1); [L557] tmp___1 = is_transmit2_triggered() [L559] COND FALSE !(\read(tmp___1)) [L274] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L277] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L278] COND TRUE E_3 == 1 [L279] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L289] return (__retres1); [L565] tmp___2 = is_transmit3_triggered() [L567] COND TRUE \read(tmp___2) [L568] t3_st = 0 [L170] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L159] COND TRUE 1 [L161] t2_pc = 1 [L162] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L416] COND TRUE t3_st == 0 [L417] int tmp_ndt_4; [L418] tmp_ndt_4 = __VERIFIER_nondet_int() [L419] COND TRUE \read(tmp_ndt_4) [L421] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L184] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L187] COND TRUE t3_pc == 1 [L203] token += 1 [L204] E_M = 1 [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L217] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L220] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L221] COND TRUE E_M == 1 [L222] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L232] return (__retres1); [L541] tmp = is_master_triggered() [L543] COND TRUE \read(tmp) [L544] m_st = 0 [L236] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L239] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L240] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L249] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L251] return (__retres1); [L549] tmp___0 = is_transmit1_triggered() [L551] COND FALSE !(\read(tmp___0)) [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L258] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L259] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L268] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L270] return (__retres1); [L557] tmp___1 = is_transmit2_triggered() [L559] COND FALSE !(\read(tmp___1)) [L274] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L277] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L278] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L287] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L289] return (__retres1); [L565] tmp___2 = is_transmit3_triggered() [L567] COND FALSE !(\read(tmp___2)) [L206] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L195] COND TRUE 1 [L197] t3_pc = 1 [L198] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L364] COND TRUE 1 [L329] int __retres1 ; [L332] COND TRUE m_st == 0 [L333] __retres1 = 1 [L355] return (__retres1); [L367] tmp = exists_runnable_thread() [L369] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L374] COND TRUE m_st == 0 [L375] int tmp_ndt_1; [L376] tmp_ndt_1 = __VERIFIER_nondet_int() [L377] COND TRUE \read(tmp_ndt_1) [L379] m_st = 1 [L54] int tmp_var = __VERIFIER_nondet_int(); [L56] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L59] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L81] COND FALSE !(token != local + 3) [L86] COND TRUE tmp_var <= 5 [L87] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L92] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L93] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L94] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L20] reach_error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] - UnprovableResult [Line: 20]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 35.6s, OverallIterations: 27, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6771 SDtfs, 8057 SDslu, 9263 SDs, 0 SdLazy, 1544 SolverSat, 356 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1372 GetRequests, 1223 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9489occurred in iteration=9, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 23216 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 2429 NumberOfCodeBlocks, 2429 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2850 ConstructedInterpolants, 0 QuantifiedInterpolants, 6882 SizeOfPredicates, 26 NumberOfNonLiveVariables, 2906 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 42 InterpolantComputations, 32 PerfectInterpolantSequences, 520/548 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-07 02:24:03,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823a6922-4b17-43d5-b677-4c8f1cca1b0e/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE