./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.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_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/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_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/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_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/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 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 02:21:44,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 02:21:44,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 02:21:44,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 02:21:44,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 02:21:44,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 02:21:44,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 02:21:44,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 02:21:44,250 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 02:21:44,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 02:21:44,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 02:21:44,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 02:21:44,254 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 02:21:44,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 02:21:44,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 02:21:44,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 02:21:44,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 02:21:44,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 02:21:44,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 02:21:44,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 02:21:44,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 02:21:44,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 02:21:44,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 02:21:44,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 02:21:44,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 02:21:44,292 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 02:21:44,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 02:21:44,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 02:21:44,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 02:21:44,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 02:21:44,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 02:21:44,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 02:21:44,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 02:21:44,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 02:21:44,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 02:21:44,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 02:21:44,306 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 02:21:44,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 02:21:44,307 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 02:21:44,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 02:21:44,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 02:21:44,310 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 02:21:44,355 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 02:21:44,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 02:21:44,356 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 02:21:44,356 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 02:21:44,356 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 02:21:44,356 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 02:21:44,356 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 02:21:44,356 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 02:21:44,356 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 02:21:44,357 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 02:21:44,357 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 02:21:44,357 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 02:21:44,357 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 02:21:44,357 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 02:21:44,358 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 02:21:44,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 02:21:44,358 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 02:21:44,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 02:21:44,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 02:21:44,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 02:21:44,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 02:21:44,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 02:21:44,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 02:21:44,359 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 02:21:44,359 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 02:21:44,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 02:21:44,360 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 02:21:44,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 02:21:44,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 02:21:44,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 02:21:44,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:21:44,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 02:21:44,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 02:21:44,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 02:21:44,361 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 02:21:44,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 02:21:44,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 02:21:44,362 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 02:21:44,362 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 02:21:44,362 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_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/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_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/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 -> 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd [2021-11-07 02:21:44,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 02:21:44,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 02:21:44,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 02:21:44,694 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 02:21:44,695 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 02:21:44,696 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2021-11-07 02:21:44,789 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/data/751b4d914/888131243b7c46d5aa6863034d4060e2/FLAG439926541 [2021-11-07 02:21:45,327 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 02:21:45,327 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2021-11-07 02:21:45,348 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/data/751b4d914/888131243b7c46d5aa6863034d4060e2/FLAG439926541 [2021-11-07 02:21:45,666 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/data/751b4d914/888131243b7c46d5aa6863034d4060e2 [2021-11-07 02:21:45,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 02:21:45,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 02:21:45,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 02:21:45,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 02:21:45,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 02:21:45,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:21:45" (1/1) ... [2021-11-07 02:21:45,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35209ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:45, skipping insertion in model container [2021-11-07 02:21:45,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:21:45" (1/1) ... [2021-11-07 02:21:45,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 02:21:45,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 02:21:46,210 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_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[671,684] [2021-11-07 02:21:46,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:21:46,357 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 02:21:46,390 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_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[671,684] [2021-11-07 02:21:46,475 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:21:46,517 INFO L208 MainTranslator]: Completed translation [2021-11-07 02:21:46,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:46 WrapperNode [2021-11-07 02:21:46,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 02:21:46,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 02:21:46,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 02:21:46,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 02:21:46,534 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:21:46" (1/1) ... [2021-11-07 02:21:46,574 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:21:46" (1/1) ... [2021-11-07 02:21:46,659 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 02:21:46,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 02:21:46,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 02:21:46,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 02:21:46,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:46" (1/1) ... [2021-11-07 02:21:46,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:46" (1/1) ... [2021-11-07 02:21:46,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:46" (1/1) ... [2021-11-07 02:21:46,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:46" (1/1) ... [2021-11-07 02:21:46,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:46" (1/1) ... [2021-11-07 02:21:46,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:46" (1/1) ... [2021-11-07 02:21:46,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:46" (1/1) ... [2021-11-07 02:21:46,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 02:21:46,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 02:21:46,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 02:21:46,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 02:21:46,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:46" (1/1) ... [2021-11-07 02:21:46,763 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:21:46,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:21:46,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 02:21:46,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 02:21:46,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 02:21:46,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 02:21:46,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 02:21:46,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 02:21:48,474 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 02:21:48,474 INFO L299 CfgBuilder]: Removed 103 assume(true) statements. [2021-11-07 02:21:48,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:21:48 BoogieIcfgContainer [2021-11-07 02:21:48,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 02:21:48,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 02:21:48,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 02:21:48,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 02:21:48,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:21:45" (1/3) ... [2021-11-07 02:21:48,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd8a622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:21:48, skipping insertion in model container [2021-11-07 02:21:48,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:21:46" (2/3) ... [2021-11-07 02:21:48,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd8a622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:21:48, skipping insertion in model container [2021-11-07 02:21:48,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:21:48" (3/3) ... [2021-11-07 02:21:48,485 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2021-11-07 02:21:48,491 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 02:21:48,491 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 02:21:48,541 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 02:21:48,547 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:21:48,547 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 02:21:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 98 states have (on average 1.5714285714285714) internal successors, (154), 99 states have internal predecessors, (154), 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:21:48,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 02:21:48,571 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:48,572 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:21:48,572 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:48,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:48,578 INFO L85 PathProgramCache]: Analyzing trace with hash 127805936, now seen corresponding path program 1 times [2021-11-07 02:21:48,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:48,590 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170139570] [2021-11-07 02:21:48,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:48,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:48,789 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:21:48,790 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:48,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170139570] [2021-11-07 02:21:48,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170139570] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:48,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:21:48,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 02:21:48,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674265373] [2021-11-07 02:21:48,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:21:48,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:48,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:21:48,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:21:48,829 INFO L87 Difference]: Start difference. First operand has 100 states, 98 states have (on average 1.5714285714285714) internal successors, (154), 99 states have internal predecessors, (154), 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 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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:21:48,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:48,921 INFO L93 Difference]: Finished difference Result 275 states and 422 transitions. [2021-11-07 02:21:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:21:48,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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 19 [2021-11-07 02:21:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:48,935 INFO L225 Difference]: With dead ends: 275 [2021-11-07 02:21:48,935 INFO L226 Difference]: Without dead ends: 173 [2021-11-07 02:21:48,939 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:21:48,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-11-07 02:21:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 163. [2021-11-07 02:21:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4753086419753085) internal successors, (239), 162 states have internal predecessors, (239), 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:21:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2021-11-07 02:21:48,995 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 19 [2021-11-07 02:21:48,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:48,996 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2021-11-07 02:21:48,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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:21:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2021-11-07 02:21:48,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 02:21:48,999 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:48,999 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] [2021-11-07 02:21:49,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 02:21:49,000 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:49,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:49,001 INFO L85 PathProgramCache]: Analyzing trace with hash 815560849, now seen corresponding path program 1 times [2021-11-07 02:21:49,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:49,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033726525] [2021-11-07 02:21:49,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:49,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:49,078 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:21:49,078 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:49,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033726525] [2021-11-07 02:21:49,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033726525] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:49,079 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:21:49,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:21:49,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416434535] [2021-11-07 02:21:49,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:21:49,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:49,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:21:49,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:21:49,109 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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:21:49,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:49,279 INFO L93 Difference]: Finished difference Result 514 states and 747 transitions. [2021-11-07 02:21:49,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:21:49,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 36 [2021-11-07 02:21:49,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:49,284 INFO L225 Difference]: With dead ends: 514 [2021-11-07 02:21:49,284 INFO L226 Difference]: Without dead ends: 356 [2021-11-07 02:21:49,286 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:21:49,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-11-07 02:21:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 279. [2021-11-07 02:21:49,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.4388489208633093) internal successors, (400), 278 states have internal predecessors, (400), 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:21:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 400 transitions. [2021-11-07 02:21:49,343 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 400 transitions. Word has length 36 [2021-11-07 02:21:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:49,344 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 400 transitions. [2021-11-07 02:21:49,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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:21:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 400 transitions. [2021-11-07 02:21:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 02:21:49,347 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:49,347 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] [2021-11-07 02:21:49,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 02:21:49,348 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:49,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:49,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1734535472, now seen corresponding path program 1 times [2021-11-07 02:21:49,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:49,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396411673] [2021-11-07 02:21:49,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:49,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:49,440 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:21:49,440 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:49,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396411673] [2021-11-07 02:21:49,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396411673] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:49,441 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:21:49,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:21:49,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29366040] [2021-11-07 02:21:49,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:21:49,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:49,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:21:49,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:21:49,444 INFO L87 Difference]: Start difference. First operand 279 states and 400 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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:21:49,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:49,622 INFO L93 Difference]: Finished difference Result 877 states and 1246 transitions. [2021-11-07 02:21:49,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:21:49,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2021-11-07 02:21:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:49,632 INFO L225 Difference]: With dead ends: 877 [2021-11-07 02:21:49,636 INFO L226 Difference]: Without dead ends: 606 [2021-11-07 02:21:49,639 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:21:49,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2021-11-07 02:21:49,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 484. [2021-11-07 02:21:49,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 1.4057971014492754) internal successors, (679), 483 states have internal predecessors, (679), 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:21:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 679 transitions. [2021-11-07 02:21:49,727 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 679 transitions. Word has length 36 [2021-11-07 02:21:49,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:49,728 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 679 transitions. [2021-11-07 02:21:49,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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:21:49,730 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 679 transitions. [2021-11-07 02:21:49,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 02:21:49,738 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:49,739 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] [2021-11-07 02:21:49,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 02:21:49,740 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:49,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:49,741 INFO L85 PathProgramCache]: Analyzing trace with hash 455210737, now seen corresponding path program 1 times [2021-11-07 02:21:49,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:49,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292159274] [2021-11-07 02:21:49,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:49,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:49,843 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:21:49,843 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:49,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292159274] [2021-11-07 02:21:49,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292159274] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:49,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:21:49,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:21:49,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368372123] [2021-11-07 02:21:49,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:21:49,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:49,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:21:49,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:21:49,846 INFO L87 Difference]: Start difference. First operand 484 states and 679 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:21:49,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:49,931 INFO L93 Difference]: Finished difference Result 844 states and 1214 transitions. [2021-11-07 02:21:49,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:21:49,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2021-11-07 02:21:49,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:49,938 INFO L225 Difference]: With dead ends: 844 [2021-11-07 02:21:49,938 INFO L226 Difference]: Without dead ends: 568 [2021-11-07 02:21:49,943 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:21:49,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-11-07 02:21:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 532. [2021-11-07 02:21:49,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 531 states have (on average 1.4293785310734464) internal successors, (759), 531 states have internal predecessors, (759), 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:21:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 759 transitions. [2021-11-07 02:21:49,989 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 759 transitions. Word has length 36 [2021-11-07 02:21:49,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:49,991 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 759 transitions. [2021-11-07 02:21:49,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:21:49,991 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 759 transitions. [2021-11-07 02:21:49,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-07 02:21:49,998 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:49,999 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] [2021-11-07 02:21:49,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 02:21:49,999 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:50,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:50,000 INFO L85 PathProgramCache]: Analyzing trace with hash 246943416, now seen corresponding path program 1 times [2021-11-07 02:21:50,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:50,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555215997] [2021-11-07 02:21:50,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:50,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:50,152 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:21:50,153 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:50,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555215997] [2021-11-07 02:21:50,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555215997] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:50,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:21:50,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:21:50,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459082359] [2021-11-07 02:21:50,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:21:50,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:50,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:21:50,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:21:50,155 INFO L87 Difference]: Start difference. First operand 532 states and 759 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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:21:50,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:50,311 INFO L93 Difference]: Finished difference Result 1822 states and 2614 transitions. [2021-11-07 02:21:50,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:21:50,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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 52 [2021-11-07 02:21:50,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:50,321 INFO L225 Difference]: With dead ends: 1822 [2021-11-07 02:21:50,321 INFO L226 Difference]: Without dead ends: 1300 [2021-11-07 02:21:50,322 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:21:50,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2021-11-07 02:21:50,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 966. [2021-11-07 02:21:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 1.4124352331606218) internal successors, (1363), 965 states have internal predecessors, (1363), 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:21:50,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1363 transitions. [2021-11-07 02:21:50,408 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1363 transitions. Word has length 52 [2021-11-07 02:21:50,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:50,411 INFO L470 AbstractCegarLoop]: Abstraction has 966 states and 1363 transitions. [2021-11-07 02:21:50,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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:21:50,412 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1363 transitions. [2021-11-07 02:21:50,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-07 02:21:50,415 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:50,415 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] [2021-11-07 02:21:50,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 02:21:50,415 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:50,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:50,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1996522868, now seen corresponding path program 1 times [2021-11-07 02:21:50,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:50,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859187478] [2021-11-07 02:21:50,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:50,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:50,549 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:21:50,553 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:50,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859187478] [2021-11-07 02:21:50,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859187478] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:50,553 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:21:50,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 02:21:50,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345331277] [2021-11-07 02:21:50,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:21:50,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:50,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:21:50,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:21:50,558 INFO L87 Difference]: Start difference. First operand 966 states and 1363 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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:21:50,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:50,804 INFO L93 Difference]: Finished difference Result 2464 states and 3474 transitions. [2021-11-07 02:21:50,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 02:21:50,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 53 [2021-11-07 02:21:50,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:50,815 INFO L225 Difference]: With dead ends: 2464 [2021-11-07 02:21:50,815 INFO L226 Difference]: Without dead ends: 1508 [2021-11-07 02:21:50,818 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-07 02:21:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2021-11-07 02:21:50,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1144. [2021-11-07 02:21:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.4234470691163605) internal successors, (1627), 1143 states have internal predecessors, (1627), 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:21:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1627 transitions. [2021-11-07 02:21:50,900 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1627 transitions. Word has length 53 [2021-11-07 02:21:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:50,901 INFO L470 AbstractCegarLoop]: Abstraction has 1144 states and 1627 transitions. [2021-11-07 02:21:50,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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:21:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1627 transitions. [2021-11-07 02:21:50,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-07 02:21:50,905 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:50,905 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] [2021-11-07 02:21:50,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 02:21:50,906 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:50,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:50,906 INFO L85 PathProgramCache]: Analyzing trace with hash -712090376, now seen corresponding path program 1 times [2021-11-07 02:21:50,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:50,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418782946] [2021-11-07 02:21:50,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:50,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:51,046 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:21:51,048 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:51,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418782946] [2021-11-07 02:21:51,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418782946] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:51,050 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:21:51,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:21:51,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943423486] [2021-11-07 02:21:51,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:21:51,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:51,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:21:51,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:21:51,053 INFO L87 Difference]: Start difference. First operand 1144 states and 1627 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:21:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:51,156 INFO L93 Difference]: Finished difference Result 1927 states and 2751 transitions. [2021-11-07 02:21:51,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:21:51,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2021-11-07 02:21:51,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:51,166 INFO L225 Difference]: With dead ends: 1927 [2021-11-07 02:21:51,166 INFO L226 Difference]: Without dead ends: 1216 [2021-11-07 02:21:51,168 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:21:51,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2021-11-07 02:21:51,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1144. [2021-11-07 02:21:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.3832020997375327) internal successors, (1581), 1143 states have internal predecessors, (1581), 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:21:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1581 transitions. [2021-11-07 02:21:51,253 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1581 transitions. Word has length 54 [2021-11-07 02:21:51,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:51,256 INFO L470 AbstractCegarLoop]: Abstraction has 1144 states and 1581 transitions. [2021-11-07 02:21:51,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:21:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1581 transitions. [2021-11-07 02:21:51,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-07 02:21:51,260 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:51,261 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] [2021-11-07 02:21:51,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 02:21:51,261 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:51,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:51,262 INFO L85 PathProgramCache]: Analyzing trace with hash 261398583, now seen corresponding path program 1 times [2021-11-07 02:21:51,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:51,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865205729] [2021-11-07 02:21:51,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:51,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:51,378 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:21:51,379 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:51,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865205729] [2021-11-07 02:21:51,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865205729] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:51,380 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:21:51,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:21:51,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129150710] [2021-11-07 02:21:51,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:21:51,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:51,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:21:51,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:21:51,382 INFO L87 Difference]: Start difference. First operand 1144 states and 1581 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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:21:51,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:51,583 INFO L93 Difference]: Finished difference Result 2462 states and 3405 transitions. [2021-11-07 02:21:51,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 02:21:51,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 54 [2021-11-07 02:21:51,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:51,591 INFO L225 Difference]: With dead ends: 2462 [2021-11-07 02:21:51,591 INFO L226 Difference]: Without dead ends: 1328 [2021-11-07 02:21:51,593 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 02:21:51,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2021-11-07 02:21:51,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1177. [2021-11-07 02:21:51,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1176 states have (on average 1.3639455782312926) internal successors, (1604), 1176 states have internal predecessors, (1604), 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:21:51,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1604 transitions. [2021-11-07 02:21:51,672 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1604 transitions. Word has length 54 [2021-11-07 02:21:51,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:51,672 INFO L470 AbstractCegarLoop]: Abstraction has 1177 states and 1604 transitions. [2021-11-07 02:21:51,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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:21:51,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1604 transitions. [2021-11-07 02:21:51,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-07 02:21:51,676 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:51,676 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] [2021-11-07 02:21:51,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 02:21:51,677 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:51,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:51,677 INFO L85 PathProgramCache]: Analyzing trace with hash 769962834, now seen corresponding path program 1 times [2021-11-07 02:21:51,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:51,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910559094] [2021-11-07 02:21:51,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:51,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:51,792 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:21:51,792 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:51,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910559094] [2021-11-07 02:21:51,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910559094] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:51,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:21:51,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:21:51,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358341694] [2021-11-07 02:21:51,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:21:51,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:51,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:21:51,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:21:51,803 INFO L87 Difference]: Start difference. First operand 1177 states and 1604 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:21:52,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:52,023 INFO L93 Difference]: Finished difference Result 2539 states and 3437 transitions. [2021-11-07 02:21:52,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:21:52,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2021-11-07 02:21:52,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:52,034 INFO L225 Difference]: With dead ends: 2539 [2021-11-07 02:21:52,034 INFO L226 Difference]: Without dead ends: 1373 [2021-11-07 02:21:52,038 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:21:52,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2021-11-07 02:21:52,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1177. [2021-11-07 02:21:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1176 states have (on average 1.346938775510204) internal successors, (1584), 1176 states have internal predecessors, (1584), 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:21:52,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1584 transitions. [2021-11-07 02:21:52,144 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1584 transitions. Word has length 58 [2021-11-07 02:21:52,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:52,145 INFO L470 AbstractCegarLoop]: Abstraction has 1177 states and 1584 transitions. [2021-11-07 02:21:52,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:21:52,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1584 transitions. [2021-11-07 02:21:52,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-07 02:21:52,149 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:52,149 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] [2021-11-07 02:21:52,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 02:21:52,150 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:52,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:52,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1910314545, now seen corresponding path program 1 times [2021-11-07 02:21:52,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:52,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941951838] [2021-11-07 02:21:52,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:52,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:52,208 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:21:52,210 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:52,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941951838] [2021-11-07 02:21:52,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941951838] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:52,211 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:21:52,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:21:52,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380258888] [2021-11-07 02:21:52,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:21:52,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:52,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:21:52,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:21:52,213 INFO L87 Difference]: Start difference. First operand 1177 states and 1584 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:21:52,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:52,293 INFO L93 Difference]: Finished difference Result 1993 states and 2690 transitions. [2021-11-07 02:21:52,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:21:52,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2021-11-07 02:21:52,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:52,299 INFO L225 Difference]: With dead ends: 1993 [2021-11-07 02:21:52,299 INFO L226 Difference]: Without dead ends: 827 [2021-11-07 02:21:52,301 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:21:52,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2021-11-07 02:21:52,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 812. [2021-11-07 02:21:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 1.2959309494451294) internal successors, (1051), 811 states have internal predecessors, (1051), 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:21:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1051 transitions. [2021-11-07 02:21:52,364 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1051 transitions. Word has length 58 [2021-11-07 02:21:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:52,366 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1051 transitions. [2021-11-07 02:21:52,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:21:52,366 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1051 transitions. [2021-11-07 02:21:52,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-07 02:21:52,370 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:52,370 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] [2021-11-07 02:21:52,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 02:21:52,370 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:52,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:52,371 INFO L85 PathProgramCache]: Analyzing trace with hash -584961446, now seen corresponding path program 1 times [2021-11-07 02:21:52,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:52,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998347462] [2021-11-07 02:21:52,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:52,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:52,567 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:21:52,567 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:52,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998347462] [2021-11-07 02:21:52,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998347462] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:21:52,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200350903] [2021-11-07 02:21:52,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:52,569 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:21:52,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:21:52,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:21:52,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 02:21:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:52,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-07 02:21:52,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:21:53,004 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:21:53,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:21:53,521 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:21:53,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200350903] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-07 02:21:53,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-11-07 02:21:53,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 6] total 15 [2021-11-07 02:21:53,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523466788] [2021-11-07 02:21:53,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:21:53,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:53,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:21:53,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-11-07 02:21:53,524 INFO L87 Difference]: Start difference. First operand 812 states and 1051 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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:21:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:53,645 INFO L93 Difference]: Finished difference Result 1939 states and 2534 transitions. [2021-11-07 02:21:53,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:21:53,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2021-11-07 02:21:53,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:53,652 INFO L225 Difference]: With dead ends: 1939 [2021-11-07 02:21:53,653 INFO L226 Difference]: Without dead ends: 1159 [2021-11-07 02:21:53,654 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-11-07 02:21:53,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2021-11-07 02:21:53,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 947. [2021-11-07 02:21:53,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 946 states have (on average 1.291754756871036) internal successors, (1222), 946 states have internal predecessors, (1222), 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:21:53,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1222 transitions. [2021-11-07 02:21:53,746 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1222 transitions. Word has length 59 [2021-11-07 02:21:53,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:53,747 INFO L470 AbstractCegarLoop]: Abstraction has 947 states and 1222 transitions. [2021-11-07 02:21:53,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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:21:53,747 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1222 transitions. [2021-11-07 02:21:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-07 02:21:53,749 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:53,749 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] [2021-11-07 02:21:53,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 02:21:53,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-07 02:21:53,974 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:53,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:53,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1655385125, now seen corresponding path program 1 times [2021-11-07 02:21:53,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:53,975 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538282508] [2021-11-07 02:21:53,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:53,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:54,014 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:21:54,015 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:54,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538282508] [2021-11-07 02:21:54,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538282508] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:54,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:21:54,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:21:54,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061521189] [2021-11-07 02:21:54,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:21:54,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:54,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:21:54,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:21:54,017 INFO L87 Difference]: Start difference. First operand 947 states and 1222 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:21:54,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:54,090 INFO L93 Difference]: Finished difference Result 1575 states and 2038 transitions. [2021-11-07 02:21:54,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:21:54,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2021-11-07 02:21:54,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:54,094 INFO L225 Difference]: With dead ends: 1575 [2021-11-07 02:21:54,094 INFO L226 Difference]: Without dead ends: 660 [2021-11-07 02:21:54,096 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:21:54,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-11-07 02:21:54,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 647. [2021-11-07 02:21:54,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.2352941176470589) internal successors, (798), 646 states have internal predecessors, (798), 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:21:54,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 798 transitions. [2021-11-07 02:21:54,144 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 798 transitions. Word has length 59 [2021-11-07 02:21:54,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:54,145 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 798 transitions. [2021-11-07 02:21:54,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:21:54,145 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 798 transitions. [2021-11-07 02:21:54,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-07 02:21:54,147 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:54,147 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] [2021-11-07 02:21:54,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 02:21:54,147 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:54,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:54,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1829835973, now seen corresponding path program 1 times [2021-11-07 02:21:54,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:54,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725542687] [2021-11-07 02:21:54,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:54,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:54,273 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:21:54,274 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:54,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725542687] [2021-11-07 02:21:54,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725542687] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:21:54,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255893860] [2021-11-07 02:21:54,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:54,275 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:21:54,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:21:54,278 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:21:54,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 02:21:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:54,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-07 02:21:54,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:21:54,744 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:21:54,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:21:55,304 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:21:55,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255893860] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:55,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:21:55,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 5] imperfect sequences [8] total 13 [2021-11-07 02:21:55,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863758699] [2021-11-07 02:21:55,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 02:21:55,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:55,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 02:21:55,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-11-07 02:21:55,307 INFO L87 Difference]: Start difference. First operand 647 states and 798 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 6 states have internal predecessors, (104), 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:21:55,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:55,590 INFO L93 Difference]: Finished difference Result 1984 states and 2425 transitions. [2021-11-07 02:21:55,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 02:21:55,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 6 states have internal predecessors, (104), 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 60 [2021-11-07 02:21:55,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:55,598 INFO L225 Difference]: With dead ends: 1984 [2021-11-07 02:21:55,598 INFO L226 Difference]: Without dead ends: 1427 [2021-11-07 02:21:55,601 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-11-07 02:21:55,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2021-11-07 02:21:55,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 968. [2021-11-07 02:21:55,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 967 states have (on average 1.2326783867631852) internal successors, (1192), 967 states have internal predecessors, (1192), 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:21:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1192 transitions. [2021-11-07 02:21:55,710 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1192 transitions. Word has length 60 [2021-11-07 02:21:55,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:55,710 INFO L470 AbstractCegarLoop]: Abstraction has 968 states and 1192 transitions. [2021-11-07 02:21:55,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 6 states have internal predecessors, (104), 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:21:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1192 transitions. [2021-11-07 02:21:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-07 02:21:55,714 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:55,714 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:21:55,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 02:21:55,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-07 02:21:55,930 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:55,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:55,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1118116210, now seen corresponding path program 1 times [2021-11-07 02:21:55,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:55,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224586577] [2021-11-07 02:21:55,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:55,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:21:56,087 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:56,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224586577] [2021-11-07 02:21:56,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224586577] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:21:56,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718108851] [2021-11-07 02:21:56,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:56,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:21:56,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:21:56,089 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:21:56,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-07 02:21:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:56,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 02:21:56,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:21:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:21:56,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:21:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:21:56,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718108851] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:56,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:21:56,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-11-07 02:21:56,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111605842] [2021-11-07 02:21:56,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:21:56,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:56,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:21:56,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 02:21:56,644 INFO L87 Difference]: Start difference. First operand 968 states and 1192 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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:21:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:56,780 INFO L93 Difference]: Finished difference Result 1778 states and 2184 transitions. [2021-11-07 02:21:56,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:21:56,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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 60 [2021-11-07 02:21:56,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:56,787 INFO L225 Difference]: With dead ends: 1778 [2021-11-07 02:21:56,787 INFO L226 Difference]: Without dead ends: 1175 [2021-11-07 02:21:56,788 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 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:21:56,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2021-11-07 02:21:56,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 993. [2021-11-07 02:21:56,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 992 states have (on average 1.2449596774193548) internal successors, (1235), 992 states have internal predecessors, (1235), 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:21:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1235 transitions. [2021-11-07 02:21:56,869 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1235 transitions. Word has length 60 [2021-11-07 02:21:56,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:56,870 INFO L470 AbstractCegarLoop]: Abstraction has 993 states and 1235 transitions. [2021-11-07 02:21:56,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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:21:56,870 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1235 transitions. [2021-11-07 02:21:56,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-07 02:21:56,872 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:56,872 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:21:56,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-07 02:21:57,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:21:57,090 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:57,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:57,091 INFO L85 PathProgramCache]: Analyzing trace with hash 396377463, now seen corresponding path program 1 times [2021-11-07 02:21:57,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:57,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003329979] [2021-11-07 02:21:57,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:57,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 02:21:57,122 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:57,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003329979] [2021-11-07 02:21:57,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003329979] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:57,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:21:57,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:21:57,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72321045] [2021-11-07 02:21:57,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:21:57,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:57,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:21:57,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:21:57,124 INFO L87 Difference]: Start difference. First operand 993 states and 1235 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:21:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:57,241 INFO L93 Difference]: Finished difference Result 2268 states and 2855 transitions. [2021-11-07 02:21:57,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:21:57,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 60 [2021-11-07 02:21:57,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:57,249 INFO L225 Difference]: With dead ends: 2268 [2021-11-07 02:21:57,249 INFO L226 Difference]: Without dead ends: 1286 [2021-11-07 02:21:57,251 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:21:57,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2021-11-07 02:21:57,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1112. [2021-11-07 02:21:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 1111 states have (on average 1.2502250225022502) internal successors, (1389), 1111 states have internal predecessors, (1389), 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:21:57,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1389 transitions. [2021-11-07 02:21:57,350 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1389 transitions. Word has length 60 [2021-11-07 02:21:57,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:57,350 INFO L470 AbstractCegarLoop]: Abstraction has 1112 states and 1389 transitions. [2021-11-07 02:21:57,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:21:57,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1389 transitions. [2021-11-07 02:21:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-07 02:21:57,353 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:57,353 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:21:57,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 02:21:57,353 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:57,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:57,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1883276906, now seen corresponding path program 1 times [2021-11-07 02:21:57,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:57,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224059218] [2021-11-07 02:21:57,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:57,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:57,429 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 02:21:57,429 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:57,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224059218] [2021-11-07 02:21:57,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224059218] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 02:21:57,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590116896] [2021-11-07 02:21:57,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:57,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 02:21:57,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:21:57,431 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 02:21:57,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-07 02:21:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:57,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 02:21:57,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 02:21:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-07 02:21:57,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 02:21:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-07 02:21:58,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590116896] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:58,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 02:21:58,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [4] total 6 [2021-11-07 02:21:58,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959203256] [2021-11-07 02:21:58,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:21:58,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:58,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:21:58,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:21:58,084 INFO L87 Difference]: Start difference. First operand 1112 states and 1389 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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:21:58,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:58,194 INFO L93 Difference]: Finished difference Result 1663 states and 2076 transitions. [2021-11-07 02:21:58,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:21:58,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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 61 [2021-11-07 02:21:58,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:58,201 INFO L225 Difference]: With dead ends: 1663 [2021-11-07 02:21:58,201 INFO L226 Difference]: Without dead ends: 1138 [2021-11-07 02:21:58,202 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:21:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2021-11-07 02:21:58,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 749. [2021-11-07 02:21:58,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 748 states have (on average 1.231283422459893) internal successors, (921), 748 states have internal predecessors, (921), 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:21:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 921 transitions. [2021-11-07 02:21:58,280 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 921 transitions. Word has length 61 [2021-11-07 02:21:58,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:58,280 INFO L470 AbstractCegarLoop]: Abstraction has 749 states and 921 transitions. [2021-11-07 02:21:58,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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:21:58,281 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 921 transitions. [2021-11-07 02:21:58,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-07 02:21:58,282 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:58,283 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] [2021-11-07 02:21:58,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-07 02:21:58,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-07 02:21:58,509 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:58,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:58,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1706313670, now seen corresponding path program 1 times [2021-11-07 02:21:58,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:58,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030619265] [2021-11-07 02:21:58,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:58,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 02:21:58,594 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:58,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030619265] [2021-11-07 02:21:58,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030619265] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:58,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:21:58,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 02:21:58,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838468815] [2021-11-07 02:21:58,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:21:58,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:58,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:21:58,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:21:58,597 INFO L87 Difference]: Start difference. First operand 749 states and 921 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 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:21:58,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:58,825 INFO L93 Difference]: Finished difference Result 1418 states and 1712 transitions. [2021-11-07 02:21:58,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 02:21:58,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 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 61 [2021-11-07 02:21:58,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:58,832 INFO L225 Difference]: With dead ends: 1418 [2021-11-07 02:21:58,832 INFO L226 Difference]: Without dead ends: 611 [2021-11-07 02:21:58,834 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-11-07 02:21:58,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-11-07 02:21:58,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 449. [2021-11-07 02:21:58,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.1741071428571428) internal successors, (526), 448 states have internal predecessors, (526), 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:21:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 526 transitions. [2021-11-07 02:21:58,887 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 526 transitions. Word has length 61 [2021-11-07 02:21:58,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:58,888 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 526 transitions. [2021-11-07 02:21:58,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 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:21:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 526 transitions. [2021-11-07 02:21:58,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-07 02:21:58,889 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:58,890 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:21:58,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 02:21:58,890 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:58,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:58,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1151056088, now seen corresponding path program 1 times [2021-11-07 02:21:58,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:58,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710293741] [2021-11-07 02:21:58,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:58,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:58,942 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:21:58,942 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:58,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710293741] [2021-11-07 02:21:58,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710293741] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:58,942 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:21:58,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:21:58,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919270253] [2021-11-07 02:21:58,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:21:58,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:58,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:21:58,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:21:58,944 INFO L87 Difference]: Start difference. First operand 449 states and 526 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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:21:59,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:59,062 INFO L93 Difference]: Finished difference Result 822 states and 952 transitions. [2021-11-07 02:21:59,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:21:59,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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 62 [2021-11-07 02:21:59,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:59,065 INFO L225 Difference]: With dead ends: 822 [2021-11-07 02:21:59,066 INFO L226 Difference]: Without dead ends: 497 [2021-11-07 02:21:59,066 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:21:59,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2021-11-07 02:21:59,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 439. [2021-11-07 02:21:59,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 1.1575342465753424) internal successors, (507), 438 states have internal predecessors, (507), 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:21:59,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 507 transitions. [2021-11-07 02:21:59,114 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 507 transitions. Word has length 62 [2021-11-07 02:21:59,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:59,114 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 507 transitions. [2021-11-07 02:21:59,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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:21:59,114 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 507 transitions. [2021-11-07 02:21:59,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-07 02:21:59,116 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:59,116 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:21:59,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 02:21:59,116 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:59,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:59,117 INFO L85 PathProgramCache]: Analyzing trace with hash -2028892843, now seen corresponding path program 1 times [2021-11-07 02:21:59,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:59,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85545542] [2021-11-07 02:21:59,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:59,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:59,247 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:21:59,247 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:59,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85545542] [2021-11-07 02:21:59,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85545542] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:59,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:21:59,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:21:59,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035453240] [2021-11-07 02:21:59,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:21:59,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:59,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:21:59,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:21:59,250 INFO L87 Difference]: Start difference. First operand 439 states and 507 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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:21:59,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:59,446 INFO L93 Difference]: Finished difference Result 1300 states and 1494 transitions. [2021-11-07 02:21:59,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:21:59,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 79 [2021-11-07 02:21:59,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:59,453 INFO L225 Difference]: With dead ends: 1300 [2021-11-07 02:21:59,453 INFO L226 Difference]: Without dead ends: 1004 [2021-11-07 02:21:59,454 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:21:59,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2021-11-07 02:21:59,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 770. [2021-11-07 02:21:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 1.165149544863459) internal successors, (896), 769 states have internal predecessors, (896), 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:21:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 896 transitions. [2021-11-07 02:21:59,554 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 896 transitions. Word has length 79 [2021-11-07 02:21:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:59,554 INFO L470 AbstractCegarLoop]: Abstraction has 770 states and 896 transitions. [2021-11-07 02:21:59,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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:21:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 896 transitions. [2021-11-07 02:21:59,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-07 02:21:59,557 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:59,557 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:21:59,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 02:21:59,557 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:59,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:59,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1210349135, now seen corresponding path program 1 times [2021-11-07 02:21:59,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:59,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709220452] [2021-11-07 02:21:59,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:59,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-11-07 02:21:59,622 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:59,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709220452] [2021-11-07 02:21:59,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709220452] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:59,622 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:21:59,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:21:59,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870591882] [2021-11-07 02:21:59,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:21:59,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:59,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:21:59,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:21:59,624 INFO L87 Difference]: Start difference. First operand 770 states and 896 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:21:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:21:59,742 INFO L93 Difference]: Finished difference Result 1179 states and 1370 transitions. [2021-11-07 02:21:59,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:21:59,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 100 [2021-11-07 02:21:59,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:21:59,746 INFO L225 Difference]: With dead ends: 1179 [2021-11-07 02:21:59,747 INFO L226 Difference]: Without dead ends: 563 [2021-11-07 02:21:59,748 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:21:59,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-11-07 02:21:59,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 537. [2021-11-07 02:21:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.1679104477611941) internal successors, (626), 536 states have internal predecessors, (626), 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:21:59,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 626 transitions. [2021-11-07 02:21:59,812 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 626 transitions. Word has length 100 [2021-11-07 02:21:59,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:21:59,812 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 626 transitions. [2021-11-07 02:21:59,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:21:59,813 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 626 transitions. [2021-11-07 02:21:59,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-07 02:21:59,815 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:21:59,815 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:21:59,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-07 02:21:59,815 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 02:21:59,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:21:59,816 INFO L85 PathProgramCache]: Analyzing trace with hash 767568621, now seen corresponding path program 1 times [2021-11-07 02:21:59,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:21:59,816 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619610079] [2021-11-07 02:21:59,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:21:59,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:21:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:21:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-07 02:21:59,907 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:21:59,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619610079] [2021-11-07 02:21:59,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619610079] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:21:59,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:21:59,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:21:59,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428465479] [2021-11-07 02:21:59,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:21:59,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:21:59,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:21:59,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:21:59,910 INFO L87 Difference]: Start difference. First operand 537 states and 626 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:22:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:22:00,030 INFO L93 Difference]: Finished difference Result 812 states and 936 transitions. [2021-11-07 02:22:00,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:22:00,030 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 101 [2021-11-07 02:22:00,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:22:00,031 INFO L225 Difference]: With dead ends: 812 [2021-11-07 02:22:00,031 INFO L226 Difference]: Without dead ends: 0 [2021-11-07 02:22:00,032 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:22:00,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-07 02:22:00,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-07 02:22:00,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:22:00,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-07 02:22:00,033 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2021-11-07 02:22:00,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:22:00,034 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-07 02:22:00,034 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:22:00,034 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-07 02:22:00,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-07 02:22:00,037 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:22:00,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 02:22:00,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-07 02:22:00,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:00,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:00,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:00,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:00,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:00,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:00,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:00,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:00,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:00,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:00,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:00,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:00,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:00,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:00,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:01,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:01,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:01,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:01,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:01,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:01,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:01,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:01,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:01,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:01,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:01,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:01,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:01,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:01,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:01,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:01,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:01,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:02,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 02:22:08,234 INFO L853 garLoopResultBuilder]: At program point L334(lines 275 339) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ~E_2~0 2)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (= ~E_M~0 2)) (.cse7 (= ~E_1~0 2))) (or (and .cse0 .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~token~0 ~local~0) .cse7))) [2021-11-07 02:22:08,235 INFO L857 garLoopResultBuilder]: For program point L204(lines 204 213) no Hoare annotation was computed. [2021-11-07 02:22:08,235 INFO L857 garLoopResultBuilder]: For program point L204-2(lines 204 213) no Hoare annotation was computed. [2021-11-07 02:22:08,235 INFO L857 garLoopResultBuilder]: For program point L204-3(lines 204 213) no Hoare annotation was computed. [2021-11-07 02:22:08,236 INFO L853 garLoopResultBuilder]: At program point L105-1(lines 93 124) the Hoare annotation is: (let ((.cse1 (= ~t2_pc~0 1))) (let ((.cse16 (+ ~local~0 1)) (.cse5 (= ~token~0 ~local~0)) (.cse12 (= ~m_pc~0 1)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (= ~E_2~0 2)) (.cse11 (not (= ~m_st~0 0))) (.cse4 (= ~E_M~0 2)) (.cse8 (= 0 ~t2_st~0)) (.cse9 (not .cse1)) (.cse6 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse7 (= ~E_1~0 2))) (let ((.cse0 (= 2 ~t2_st~0)) (.cse15 (or (and .cse12 .cse10 .cse2 (= ~m_st~0 ~E_1~0) .cse4 (not (= ~t1_st~0 0)) .cse8 .cse5 .cse9 .cse6 .cse7) (and (= ~t1_pc~0 1) .cse12 .cse10 .cse2 .cse11 .cse4 .cse8 .cse9 .cse6 .cse7))) (.cse3 (= ~m_pc~0 0)) (.cse13 (<= ~token~0 .cse16)) (.cse14 (<= .cse16 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse8 .cse5 .cse9 .cse6 .cse7) (and .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse12 .cse2 .cse11 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse14 .cse15) (and .cse15 .cse5) (and .cse1 .cse2 .cse11 .cse3 .cse4 (<= 2 ~t2_st~0) .cse6 .cse7) (and .cse2 .cse11 .cse3 .cse4 .cse8 .cse9 .cse6 .cse7) (and .cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse1 .cse12 .cse10 .cse14 .cse2 .cse11 .cse4 .cse8 .cse6 .cse7))))) [2021-11-07 02:22:08,236 INFO L857 garLoopResultBuilder]: For program point L204-5(lines 204 213) no Hoare annotation was computed. [2021-11-07 02:22:08,236 INFO L857 garLoopResultBuilder]: For program point L204-6(lines 204 213) no Hoare annotation was computed. [2021-11-07 02:22:08,236 INFO L857 garLoopResultBuilder]: For program point L204-8(lines 204 213) no Hoare annotation was computed. [2021-11-07 02:22:08,236 INFO L857 garLoopResultBuilder]: For program point L204-9(lines 204 213) no Hoare annotation was computed. [2021-11-07 02:22:08,237 INFO L857 garLoopResultBuilder]: For program point L204-11(lines 204 213) no Hoare annotation was computed. [2021-11-07 02:22:08,237 INFO L857 garLoopResultBuilder]: For program point L204-12(lines 204 213) no Hoare annotation was computed. [2021-11-07 02:22:08,237 INFO L857 garLoopResultBuilder]: For program point L204-14(lines 204 213) no Hoare annotation was computed. [2021-11-07 02:22:08,237 INFO L857 garLoopResultBuilder]: For program point L204-15(lines 204 213) no Hoare annotation was computed. [2021-11-07 02:22:08,237 INFO L857 garLoopResultBuilder]: For program point L204-17(lines 204 213) no Hoare annotation was computed. [2021-11-07 02:22:08,237 INFO L857 garLoopResultBuilder]: For program point L205(lines 205 210) no Hoare annotation was computed. [2021-11-07 02:22:08,238 INFO L857 garLoopResultBuilder]: For program point L205-1(lines 205 210) no Hoare annotation was computed. [2021-11-07 02:22:08,238 INFO L857 garLoopResultBuilder]: For program point L205-2(lines 205 210) no Hoare annotation was computed. [2021-11-07 02:22:08,238 INFO L857 garLoopResultBuilder]: For program point L205-3(lines 205 210) no Hoare annotation was computed. [2021-11-07 02:22:08,238 INFO L857 garLoopResultBuilder]: For program point L205-4(lines 205 210) no Hoare annotation was computed. [2021-11-07 02:22:08,238 INFO L857 garLoopResultBuilder]: For program point L205-5(lines 205 210) no Hoare annotation was computed. [2021-11-07 02:22:08,239 INFO L853 garLoopResultBuilder]: At program point L305(lines 281 333) the Hoare annotation is: (let ((.cse16 (= ~t1_st~0 0)) (.cse13 (= ~t2_pc~0 1)) (.cse21 (+ ~local~0 1)) (.cse0 (= ~t1_pc~0 1))) (let ((.cse15 (not .cse0)) (.cse17 (<= ~token~0 .cse21)) (.cse19 (<= .cse21 ~token~0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= 0 ~t2_st~0)) (.cse9 (not .cse13)) (.cse4 (not (= ~m_st~0 0))) (.cse6 (not .cse16)) (.cse20 (<= 2 ~t2_st~0)) (.cse1 (= ~m_pc~0 1)) (.cse14 (= 2 ~t2_st~0)) (.cse18 (= 2 ~t1_st~0)) (.cse3 (= ~E_2~0 2)) (.cse12 (= ~m_pc~0 0)) (.cse5 (= ~E_M~0 2)) (.cse8 (= ~token~0 ~local~0)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse12 .cse5 .cse10 .cse11) (and .cse14 .cse15 .cse16 .cse13 .cse3 .cse12 .cse5 .cse8 .cse10 .cse11) (and .cse15 .cse16 .cse3 .cse12 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse17 .cse18 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse13 .cse1 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11) (and .cse0 .cse14 .cse13 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11) (and .cse15 .cse16 .cse13 .cse3 .cse4 .cse12 .cse5 .cse20 .cse10 .cse11) (and .cse14 .cse16 .cse13 .cse1 .cse3 .cse4 .cse5 .cse8 .cse10 .cse11) (and .cse0 .cse18 .cse3 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse17 .cse18 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse14 .cse18 .cse13 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10 .cse11) (and .cse16 .cse1 .cse2 .cse3 (= ~m_st~0 ~E_1~0) .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse13 .cse3 .cse4 .cse12 .cse5 .cse6 .cse20 .cse10 .cse11) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= ~token~0 (+ 2 ~local~0)) .cse14 .cse18 .cse13 .cse1 .cse3 (< .cse21 ~token~0) .cse5 .cse10 .cse11) (and .cse0 .cse14 .cse18 .cse13 .cse3 .cse12 .cse5 .cse8 .cse10 .cse11)))) [2021-11-07 02:22:08,239 INFO L853 garLoopResultBuilder]: At program point L141-1(lines 129 160) the Hoare annotation is: (let ((.cse16 (= ~t1_st~0 0)) (.cse0 (= ~t1_pc~0 1))) (let ((.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~t2_pc~0 1)) (.cse15 (not .cse0)) (.cse14 (= ~token~0 ~local~0)) (.cse10 (= 2 ~t1_st~0)) (.cse11 (= ~m_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse12 (+ ~local~0 1)) (.cse13 (< 0 ~t2_st~0)) (.cse3 (= ~E_2~0 2)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse17 (not .cse16)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 (<= ~token~0 (+ 2 ~local~0)) .cse10 .cse1 .cse11 .cse3 (< .cse12 ~token~0) .cse6 .cse7 .cse8) (and .cse0 .cse10 .cse13 .cse3 .cse5 .cse6 .cse14 .cse7 .cse8) (and .cse15 .cse16 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse11 .cse2 .cse3 .cse4 .cse6 .cse17 .cse14 .cse7 .cse8) (and .cse0 .cse9 .cse10 .cse1 .cse11 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8) (and (or (and .cse16 .cse13 .cse11 .cse2 .cse3 (= ~m_st~0 ~E_1~0) .cse6 .cse7 .cse8) (and .cse16 .cse1 .cse11 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8)) .cse14) (and .cse15 .cse16 .cse13 .cse3 .cse5 .cse6 .cse14 .cse7 .cse8) (and .cse0 (<= ~token~0 .cse12) .cse10 .cse13 .cse11 .cse2 (<= .cse12 ~token~0) .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8)))) [2021-11-07 02:22:08,240 INFO L853 garLoopResultBuilder]: At program point L75(lines 49 88) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse12 (= ~t2_pc~0 1))) (let ((.cse6 (= 0 ~t2_st~0)) (.cse8 (not .cse12)) (.cse13 (not .cse0)) (.cse14 (= ~t1_st~0 0)) (.cse11 (= 2 ~t2_st~0)) (.cse1 (= 2 ~t1_st~0)) (.cse2 (= ~E_2~0 2)) (.cse3 (not (= ~m_st~0 0))) (.cse4 (= ~m_pc~0 0)) (.cse5 (= ~E_M~0 2)) (.cse7 (= ~token~0 ~local~0)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= ~token~0 (+ 2 ~local~0)) .cse11 .cse1 .cse12 (= ~m_pc~0 1) .cse2 .cse3 (< (+ ~local~0 1) ~token~0) .cse5 .cse9 .cse10) (and .cse13 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse13 .cse14 .cse12 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10) (and .cse0 .cse11 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10)))) [2021-11-07 02:22:08,240 INFO L853 garLoopResultBuilder]: At program point L572(lines 572 581) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~token~0 ~local~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-11-07 02:22:08,240 INFO L853 garLoopResultBuilder]: At program point L572-1(lines 572 581) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~token~0 ~local~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-11-07 02:22:08,241 INFO L857 garLoopResultBuilder]: For program point L308(lines 308 315) no Hoare annotation was computed. [2021-11-07 02:22:08,241 INFO L853 garLoopResultBuilder]: At program point L177(lines 165 179) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (= ~m_pc~0 ~t2_pc~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~m_pc~0 0) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2021-11-07 02:22:08,241 INFO L853 garLoopResultBuilder]: At program point L177-1(lines 165 179) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1)) (.cse14 (= ~t2_pc~0 1))) (let ((.cse5 (= ~m_pc~0 0)) (.cse7 (= 0 ~t2_st~0)) (.cse9 (not .cse14)) (.cse0 (not .cse11)) (.cse1 (= ~t1_st~0 0)) (.cse13 (= 2 ~t2_st~0)) (.cse12 (= 2 ~t1_st~0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (= ~E_2~0 2)) (.cse4 (not (= ~m_st~0 0))) (.cse6 (= ~E_M~0 2)) (.cse8 (= ~token~0 ~local~0)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse13 .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 .cse6 .cse8 .cse10) (and .cse11 .cse13 .cse12 .cse14 .cse2 .cse3 .cse4 .cse6 .cse8 .cse10)))) [2021-11-07 02:22:08,242 INFO L853 garLoopResultBuilder]: At program point L177-2(lines 165 179) the Hoare annotation is: (let ((.cse12 (+ ~local~0 1))) (let ((.cse3 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~E_2~0 1)) (.cse2 (<= ~token~0 .cse12)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (<= .cse12 ~token~0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ~E_M~0 2)) (.cse9 (not (= ~t1_st~0 0))) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse5 .cse7 (= ~m_pc~0 0) .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~t2_st~0) .cse10 .cse11)))) [2021-11-07 02:22:08,242 INFO L853 garLoopResultBuilder]: At program point L177-3(lines 165 179) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t1_st~0)) (.cse2 (< 0 ~t2_st~0)) (.cse3 (= ~t2_pc~0 1)) (.cse4 (= ~m_pc~0 1)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (not (= ~E_M~0 0))) (.cse6 (= ~E_2~0 2)) (.cse10 (not (= ~m_st~0 0))) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 (<= ~token~0 (+ 2 ~local~0)) .cse1 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse2 .cse3 .cse4 .cse5 .cse6 (< (+ ~local~0 1) ~token~0) .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse9 .cse5 .cse6 .cse10 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse10 .cse7 .cse8))) [2021-11-07 02:22:08,242 INFO L853 garLoopResultBuilder]: At program point L177-4(lines 165 179) the Hoare annotation is: (let ((.cse1 (= 2 ~t2_st~0)) (.cse3 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t2_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~token~0 ~local~0) .cse8) (and .cse0 .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8))) [2021-11-07 02:22:08,243 INFO L853 garLoopResultBuilder]: At program point L177-5(lines 165 179) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~token~0 ~local~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-11-07 02:22:08,243 INFO L853 garLoopResultBuilder]: At program point L215(lines 203 217) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (= ~m_pc~0 ~t2_pc~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~m_pc~0 0) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) [2021-11-07 02:22:08,243 INFO L853 garLoopResultBuilder]: At program point L215-1(lines 203 217) the Hoare annotation is: (let ((.cse13 (= ~t2_pc~0 1))) (let ((.cse4 (= ~m_pc~0 0)) (.cse6 (= 0 ~t2_st~0)) (.cse8 (not .cse13)) (.cse0 (= ~t1_st~0 0)) (.cse11 (= ~t1_pc~0 1)) (.cse12 (= 2 ~t2_st~0)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (= ~E_2~0 2)) (.cse3 (not (= ~m_st~0 0))) (.cse5 (= ~E_M~0 2)) (.cse7 (= ~token~0 ~local~0)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse12 .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse7 .cse9 .cse10) (and .cse11 .cse12 .cse13 .cse1 .cse2 .cse3 .cse5 .cse7 .cse9 .cse10)))) [2021-11-07 02:22:08,243 INFO L853 garLoopResultBuilder]: At program point L215-2(lines 203 217) the Hoare annotation is: (let ((.cse11 (+ ~local~0 1))) (let ((.cse2 (<= ~token~0 .cse11)) (.cse3 (= ~m_pc~0 1)) (.cse5 (<= .cse11 ~token~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~E_2~0 1)) (.cse8 (= ~t2_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~t2_st~0) (not .cse8) .cse9 .cse10 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse8 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse8 .cse4 .cse6 (= ~m_pc~0 0) .cse7 .cse9 .cse10)))) [2021-11-07 02:22:08,244 INFO L853 garLoopResultBuilder]: At program point L215-3(lines 203 217) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= 2 ~t1_st~0)) (.cse3 (< 0 ~t2_st~0)) (.cse4 (= ~t2_pc~0 1)) (.cse5 (= ~m_pc~0 1)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~E_M~0 0))) (.cse7 (= ~E_2~0 2)) (.cse11 (not (= ~m_st~0 0))) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse9 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< (+ ~local~0 1) ~token~0) .cse8 .cse9) (and .cse0 .cse3 .cse4 .cse10 .cse6 .cse7 .cse11 (= ~m_pc~0 0) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse11 .cse8 .cse9))) [2021-11-07 02:22:08,244 INFO L853 garLoopResultBuilder]: At program point L215-4(lines 203 217) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~token~0 ~local~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-11-07 02:22:08,244 INFO L857 garLoopResultBuilder]: For program point L50(lines 50 58) no Hoare annotation was computed. [2021-11-07 02:22:08,245 INFO L853 garLoopResultBuilder]: At program point L215-5(lines 203 217) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~token~0 ~local~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-11-07 02:22:08,245 INFO L860 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-11-07 02:22:08,245 INFO L857 garLoopResultBuilder]: For program point L185(lines 185 194) no Hoare annotation was computed. [2021-11-07 02:22:08,245 INFO L857 garLoopResultBuilder]: For program point L185-2(lines 185 194) no Hoare annotation was computed. [2021-11-07 02:22:08,245 INFO L857 garLoopResultBuilder]: For program point L185-3(lines 185 194) no Hoare annotation was computed. [2021-11-07 02:22:08,245 INFO L857 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2021-11-07 02:22:08,246 INFO L857 garLoopResultBuilder]: For program point L185-5(lines 185 194) no Hoare annotation was computed. [2021-11-07 02:22:08,246 INFO L857 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2021-11-07 02:22:08,246 INFO L857 garLoopResultBuilder]: For program point L185-6(lines 185 194) no Hoare annotation was computed. [2021-11-07 02:22:08,246 INFO L857 garLoopResultBuilder]: For program point L185-8(lines 185 194) no Hoare annotation was computed. [2021-11-07 02:22:08,246 INFO L857 garLoopResultBuilder]: For program point L185-9(lines 185 194) no Hoare annotation was computed. [2021-11-07 02:22:08,247 INFO L857 garLoopResultBuilder]: For program point L185-11(lines 185 194) no Hoare annotation was computed. [2021-11-07 02:22:08,247 INFO L857 garLoopResultBuilder]: For program point L185-12(lines 185 194) no Hoare annotation was computed. [2021-11-07 02:22:08,247 INFO L857 garLoopResultBuilder]: For program point L185-14(lines 185 194) no Hoare annotation was computed. [2021-11-07 02:22:08,247 INFO L857 garLoopResultBuilder]: For program point L185-15(lines 185 194) no Hoare annotation was computed. [2021-11-07 02:22:08,247 INFO L857 garLoopResultBuilder]: For program point L185-17(lines 185 194) no Hoare annotation was computed. [2021-11-07 02:22:08,247 INFO L857 garLoopResultBuilder]: For program point L186(lines 186 191) no Hoare annotation was computed. [2021-11-07 02:22:08,248 INFO L857 garLoopResultBuilder]: For program point L186-1(lines 186 191) no Hoare annotation was computed. [2021-11-07 02:22:08,248 INFO L857 garLoopResultBuilder]: For program point L186-2(lines 186 191) no Hoare annotation was computed. [2021-11-07 02:22:08,248 INFO L857 garLoopResultBuilder]: For program point L186-3(lines 186 191) no Hoare annotation was computed. [2021-11-07 02:22:08,248 INFO L853 garLoopResultBuilder]: At program point L54(lines 49 88) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= ~token~0 (+ 2 ~local~0)) (= 2 ~t2_st~0) (= 2 ~t1_st~0) (= ~t2_pc~0 1) (= ~m_pc~0 1) (= ~E_2~0 2) (not (= ~m_st~0 0)) (< (+ ~local~0 1) ~token~0) (= ~E_M~0 2) (not (= ULTIMATE.start_eval_~tmp~0 0)) (= ~E_1~0 2)) [2021-11-07 02:22:08,249 INFO L857 garLoopResultBuilder]: For program point L186-4(lines 186 191) no Hoare annotation was computed. [2021-11-07 02:22:08,249 INFO L857 garLoopResultBuilder]: For program point L186-5(lines 186 191) no Hoare annotation was computed. [2021-11-07 02:22:08,249 INFO L853 garLoopResultBuilder]: At program point L319(lines 281 333) the Hoare annotation is: (let ((.cse17 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse16 (= ~t1_st~0 0)) (.cse19 (+ ~local~0 1))) (let ((.cse18 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse21 (<= ~token~0 .cse19)) (.cse22 (<= .cse19 ~token~0)) (.cse1 (= ~m_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not (= ~m_st~0 0))) (.cse6 (not .cse16)) (.cse20 (<= 2 ~t2_st~0)) (.cse15 (not .cse0)) (.cse7 (= 0 ~t2_st~0)) (.cse9 (not .cse17)) (.cse14 (= 2 ~t2_st~0)) (.cse13 (= 2 ~t1_st~0)) (.cse3 (= ~E_2~0 2)) (.cse12 (= ~m_pc~0 0)) (.cse5 (= ~E_M~0 2)) (.cse8 (= ~token~0 ~local~0)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse13 .cse3 .cse12 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse14 .cse15 .cse16 .cse17 .cse3 .cse12 .cse5 .cse8 .cse10 .cse11) (and .cse0 .cse18 .cse14 .cse13 .cse17 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse18 (<= ~token~0 (+ 2 ~local~0)) .cse14 .cse13 .cse17 .cse1 .cse3 (< .cse19 ~token~0) .cse5 .cse11) (and .cse0 .cse14 .cse17 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse11) (and .cse0 .cse14 .cse17 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11) (and .cse15 .cse16 .cse17 .cse3 .cse4 .cse12 .cse5 .cse20 .cse10 .cse11) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse12 .cse5 .cse11) (and .cse14 .cse16 .cse17 .cse1 .cse3 .cse4 .cse5 .cse8 .cse10 .cse11) (and .cse0 .cse21 .cse13 .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse21 .cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse17 .cse1 .cse22 .cse3 .cse4 .cse5 .cse7 .cse10 .cse11) (and .cse0 .cse14 .cse13 .cse17 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10 .cse11) (and .cse16 .cse1 .cse2 .cse3 (= ~m_st~0 ~E_1~0) .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse17 .cse3 .cse4 .cse12 .cse5 .cse6 .cse20 .cse10 .cse11) (and .cse15 .cse16 .cse3 .cse12 .cse5 .cse7 .cse8 .cse9 .cse11) (and .cse0 .cse14 .cse13 .cse17 .cse3 .cse12 .cse5 .cse8 .cse10 .cse11)))) [2021-11-07 02:22:08,249 INFO L857 garLoopResultBuilder]: For program point L286(lines 286 290) no Hoare annotation was computed. [2021-11-07 02:22:08,250 INFO L857 garLoopResultBuilder]: For program point L286-1(lines 281 333) no Hoare annotation was computed. [2021-11-07 02:22:08,250 INFO L857 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2021-11-07 02:22:08,250 INFO L853 garLoopResultBuilder]: At program point L553-1(lines 378 590) the Hoare annotation is: (let ((.cse11 (= ~m_pc~0 0)) (.cse8 (= ~token~0 ~local~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse9 (= ~E_1~0 2)) (.cse10 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse11 .cse7 .cse9) (and (not .cse0) (= ~t1_st~0 0) .cse5 .cse11 .cse7 (= 0 ~t2_st~0) .cse8 (not .cse2) .cse9 .cse10) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10))) [2021-11-07 02:22:08,250 INFO L857 garLoopResultBuilder]: For program point L322(lines 322 329) no Hoare annotation was computed. [2021-11-07 02:22:08,251 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-07 02:22:08,251 INFO L853 garLoopResultBuilder]: At program point L291(lines 281 333) the Hoare annotation is: (let ((.cse17 (= ~t1_st~0 0)) (.cse13 (= ~t2_pc~0 1)) (.cse21 (+ ~local~0 1)) (.cse0 (= ~t1_pc~0 1))) (let ((.cse16 (not .cse0)) (.cse19 (<= ~token~0 .cse21)) (.cse20 (<= .cse21 ~token~0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= 0 ~t2_st~0)) (.cse9 (not .cse13)) (.cse4 (not (= ~m_st~0 0))) (.cse6 (not .cse17)) (.cse18 (<= 2 ~t2_st~0)) (.cse1 (= ~m_pc~0 1)) (.cse15 (= 2 ~t2_st~0)) (.cse14 (= 2 ~t1_st~0)) (.cse3 (= ~E_2~0 2)) (.cse12 (= ~m_pc~0 0)) (.cse5 (= ~E_M~0 2)) (.cse8 (= ~token~0 ~local~0)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse12 .cse5 .cse10 .cse11) (and .cse0 .cse14 .cse3 .cse12 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse15 .cse14 .cse13 .cse1 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse15 .cse16 .cse17 .cse13 .cse3 .cse12 .cse5 .cse8 .cse10 .cse11) (and .cse16 .cse17 .cse3 .cse12 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse16 .cse17 .cse13 .cse3 .cse4 .cse12 .cse5 .cse18 .cse10 .cse11) (and .cse15 .cse17 .cse13 .cse1 .cse3 .cse4 .cse5 .cse8 .cse10 .cse11) (and .cse0 .cse19 .cse14 .cse1 .cse2 .cse20 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse15 .cse13 .cse1 .cse3 .cse4 .cse5 .cse8 .cse10 .cse11) (and .cse0 .cse19 .cse14 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse13 .cse1 .cse20 .cse3 .cse4 .cse5 .cse7 .cse10 .cse11) (and .cse17 .cse1 .cse2 .cse3 (= ~m_st~0 ~E_1~0) .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse13 .cse3 .cse4 .cse12 .cse5 .cse6 .cse18 .cse10 .cse11) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= ~token~0 (+ 2 ~local~0)) .cse15 .cse14 .cse13 .cse1 .cse3 (< .cse21 ~token~0) .cse5 .cse10 .cse11) (and .cse0 .cse15 .cse14 .cse13 .cse3 .cse12 .cse5 .cse8 .cse10 .cse11)))) [2021-11-07 02:22:08,251 INFO L857 garLoopResultBuilder]: For program point L94(lines 94 102) no Hoare annotation was computed. [2021-11-07 02:22:08,251 INFO L860 garLoopResultBuilder]: At program point L591(lines 538 596) the Hoare annotation is: true [2021-11-07 02:22:08,252 INFO L857 garLoopResultBuilder]: For program point L294(lines 294 301) no Hoare annotation was computed. [2021-11-07 02:22:08,252 INFO L853 garLoopResultBuilder]: At program point L196(lines 184 198) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (= ~m_pc~0 ~t2_pc~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~m_pc~0 0) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2021-11-07 02:22:08,252 INFO L853 garLoopResultBuilder]: At program point L196-1(lines 184 198) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1)) (.cse14 (= ~t2_pc~0 1))) (let ((.cse5 (= ~m_pc~0 0)) (.cse7 (= 0 ~t2_st~0)) (.cse9 (not .cse14)) (.cse0 (not .cse11)) (.cse1 (= ~t1_st~0 0)) (.cse13 (= 2 ~t2_st~0)) (.cse12 (= 2 ~t1_st~0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (= ~E_2~0 2)) (.cse4 (not (= ~m_st~0 0))) (.cse6 (= ~E_M~0 2)) (.cse8 (= ~token~0 ~local~0)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse13 .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 .cse6 .cse8 .cse10) (and .cse11 .cse13 .cse12 .cse14 .cse2 .cse3 .cse4 .cse6 .cse8 .cse10)))) [2021-11-07 02:22:08,252 INFO L853 garLoopResultBuilder]: At program point L196-2(lines 184 198) the Hoare annotation is: (let ((.cse12 (+ ~local~0 1))) (let ((.cse3 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~E_2~0 1)) (.cse2 (<= ~token~0 .cse12)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (<= .cse12 ~token~0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ~E_M~0 2)) (.cse9 (not (= ~t1_st~0 0))) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse5 .cse7 (= ~m_pc~0 0) .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~t2_st~0) .cse10 .cse11)))) [2021-11-07 02:22:08,253 INFO L857 garLoopResultBuilder]: For program point L130(lines 130 138) no Hoare annotation was computed. [2021-11-07 02:22:08,253 INFO L853 garLoopResultBuilder]: At program point L97(lines 97 101) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1)) (.cse2 (= ~t2_pc~0 1))) (let ((.cse0 (= 2 ~t2_st~0)) (.cse14 (= 0 ~t2_st~0)) (.cse15 (not .cse2)) (.cse10 (= ~m_pc~0 1)) (.cse7 (= ~token~0 ~local~0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (not .cse12)) (.cse3 (= ~E_2~0 2)) (.cse11 (not (= ~m_st~0 0))) (.cse4 (= ~m_pc~0 0)) (.cse5 (= ~E_M~0 2)) (.cse6 (not (= ~t1_st~0 0))) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse9 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse10 .cse3 .cse11 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse12 .cse10 .cse13 .cse3 .cse11 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse15 .cse8 .cse9) (and .cse10 .cse13 .cse3 (= ~m_st~0 ~E_1~0) .cse5 .cse6 .cse14 .cse7 .cse15 .cse8 .cse9) (and .cse12 .cse2 .cse10 .cse3 .cse11 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse12 .cse2 .cse13 .cse3 .cse11 .cse4 .cse5 .cse6 .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 (<= 2 ~t2_st~0) .cse8 .cse9)))) [2021-11-07 02:22:08,253 INFO L853 garLoopResultBuilder]: At program point L196-3(lines 184 198) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= 2 ~t1_st~0)) (.cse3 (< 0 ~t2_st~0)) (.cse4 (= ~t2_pc~0 1)) (.cse5 (= ~m_pc~0 1)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~E_M~0 0))) (.cse7 (= ~E_2~0 2)) (.cse11 (not (= ~m_st~0 0))) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse9 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse3 .cse4 .cse5 .cse6 .cse7 (< (+ ~local~0 1) ~token~0) .cse8 .cse9) (and .cse0 .cse3 .cse4 .cse10 .cse6 .cse7 .cse11 (= ~m_pc~0 0) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse11 .cse8 .cse9))) [2021-11-07 02:22:08,254 INFO L853 garLoopResultBuilder]: At program point L196-4(lines 184 198) the Hoare annotation is: (let ((.cse1 (= 2 ~t2_st~0)) (.cse3 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t2_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2))) (or (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~token~0 ~local~0) .cse8) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8))) [2021-11-07 02:22:08,254 INFO L853 garLoopResultBuilder]: At program point L196-5(lines 184 198) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~token~0 ~local~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-11-07 02:22:08,254 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2021-11-07 02:22:08,254 INFO L857 garLoopResultBuilder]: For program point L166(lines 166 175) no Hoare annotation was computed. [2021-11-07 02:22:08,255 INFO L853 garLoopResultBuilder]: At program point L133(lines 133 137) the Hoare annotation is: (let ((.cse17 (= ~t2_pc~0 1)) (.cse18 (+ ~local~0 1)) (.cse0 (= ~t1_st~0 0))) (let ((.cse16 (not .cse0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (<= ~token~0 .cse18)) (.cse12 (= 2 ~t1_st~0)) (.cse2 (= ~m_pc~0 1)) (.cse13 (<= .cse18 ~token~0)) (.cse14 (not (= ~m_st~0 0))) (.cse10 (= ~t1_pc~0 1)) (.cse1 (< 0 ~t2_st~0)) (.cse4 (= ~E_2~0 2)) (.cse15 (= ~m_pc~0 0)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~token~0 ~local~0)) (.cse7 (not .cse17)) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse9 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_st~0 ~E_1~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse1 .cse2 .cse3 .cse13 .cse4 .cse14 .cse5 .cse7 .cse8 .cse9) (and .cse10 .cse12 .cse1 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse4 .cse14 .cse15 .cse5 .cse16 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse17 .cse3 .cse4 .cse14 .cse15 .cse5 .cse8 .cse9) (and .cse10 .cse11 .cse12 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse1 .cse17 .cse2 .cse13 .cse4 .cse14 .cse5 .cse8 .cse9) (and (not .cse10) .cse0 .cse1 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2021-11-07 02:22:08,255 INFO L857 garLoopResultBuilder]: For program point L166-2(lines 166 175) no Hoare annotation was computed. [2021-11-07 02:22:08,255 INFO L857 garLoopResultBuilder]: For program point L166-3(lines 166 175) no Hoare annotation was computed. [2021-11-07 02:22:08,255 INFO L857 garLoopResultBuilder]: For program point L166-5(lines 166 175) no Hoare annotation was computed. [2021-11-07 02:22:08,255 INFO L857 garLoopResultBuilder]: For program point L166-6(lines 166 175) no Hoare annotation was computed. [2021-11-07 02:22:08,255 INFO L857 garLoopResultBuilder]: For program point L166-8(lines 166 175) no Hoare annotation was computed. [2021-11-07 02:22:08,256 INFO L857 garLoopResultBuilder]: For program point L166-9(lines 166 175) no Hoare annotation was computed. [2021-11-07 02:22:08,256 INFO L857 garLoopResultBuilder]: For program point L166-11(lines 166 175) no Hoare annotation was computed. [2021-11-07 02:22:08,256 INFO L857 garLoopResultBuilder]: For program point L166-12(lines 166 175) no Hoare annotation was computed. [2021-11-07 02:22:08,256 INFO L857 garLoopResultBuilder]: For program point L166-14(lines 166 175) no Hoare annotation was computed. [2021-11-07 02:22:08,256 INFO L857 garLoopResultBuilder]: For program point L166-15(lines 166 175) no Hoare annotation was computed. [2021-11-07 02:22:08,256 INFO L857 garLoopResultBuilder]: For program point L166-17(lines 166 175) no Hoare annotation was computed. [2021-11-07 02:22:08,257 INFO L857 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2021-11-07 02:22:08,257 INFO L857 garLoopResultBuilder]: For program point L167-1(lines 167 172) no Hoare annotation was computed. [2021-11-07 02:22:08,257 INFO L857 garLoopResultBuilder]: For program point L167-2(lines 167 172) no Hoare annotation was computed. [2021-11-07 02:22:08,257 INFO L857 garLoopResultBuilder]: For program point L167-3(lines 167 172) no Hoare annotation was computed. [2021-11-07 02:22:08,257 INFO L857 garLoopResultBuilder]: For program point L167-4(lines 167 172) no Hoare annotation was computed. [2021-11-07 02:22:08,258 INFO L857 garLoopResultBuilder]: For program point L167-5(lines 167 172) no Hoare annotation was computed. [2021-11-07 02:22:08,261 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] [2021-11-07 02:22:08,263 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 02:22:08,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:22:08 BoogieIcfgContainer [2021-11-07 02:22:08,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 02:22:08,336 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 02:22:08,337 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 02:22:08,337 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 02:22:08,337 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:21:48" (3/4) ... [2021-11-07 02:22:08,340 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-07 02:22:08,363 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 107 nodes and edges [2021-11-07 02:22:08,371 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2021-11-07 02:22:08,373 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-11-07 02:22:08,374 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-07 02:22:08,539 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 02:22:08,539 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 02:22:08,541 INFO L168 Benchmark]: Toolchain (without parser) took 22864.80 ms. Allocated memory was 92.3 MB in the beginning and 343.9 MB in the end (delta: 251.7 MB). Free memory was 57.4 MB in the beginning and 252.0 MB in the end (delta: -194.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 16.1 GB. [2021-11-07 02:22:08,542 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 92.3 MB. Free memory was 64.7 MB in the beginning and 64.7 MB in the end (delta: 29.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 02:22:08,543 INFO L168 Benchmark]: CACSL2BoogieTranslator took 839.97 ms. Allocated memory is still 92.3 MB. Free memory was 57.2 MB in the beginning and 64.8 MB in the end (delta: -7.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 02:22:08,544 INFO L168 Benchmark]: Boogie Procedure Inliner took 148.69 ms. Allocated memory is still 92.3 MB. Free memory was 64.8 MB in the beginning and 61.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 02:22:08,544 INFO L168 Benchmark]: Boogie Preprocessor took 82.91 ms. Allocated memory is still 92.3 MB. Free memory was 61.7 MB in the beginning and 59.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-07 02:22:08,545 INFO L168 Benchmark]: RCFGBuilder took 1724.89 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 58.9 MB in the beginning and 67.1 MB in the end (delta: -8.1 MB). Peak memory consumption was 33.8 MB. Max. memory is 16.1 GB. [2021-11-07 02:22:08,545 INFO L168 Benchmark]: TraceAbstraction took 19857.28 ms. Allocated memory was 111.1 MB in the beginning and 343.9 MB in the end (delta: 232.8 MB). Free memory was 66.6 MB in the beginning and 267.7 MB in the end (delta: -201.1 MB). Peak memory consumption was 162.0 MB. Max. memory is 16.1 GB. [2021-11-07 02:22:08,545 INFO L168 Benchmark]: Witness Printer took 202.69 ms. Allocated memory is still 343.9 MB. Free memory was 267.7 MB in the beginning and 252.0 MB in the end (delta: 15.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-11-07 02:22:08,547 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.25 ms. Allocated memory is still 92.3 MB. Free memory was 64.7 MB in the beginning and 64.7 MB in the end (delta: 29.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 839.97 ms. Allocated memory is still 92.3 MB. Free memory was 57.2 MB in the beginning and 64.8 MB in the end (delta: -7.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 148.69 ms. Allocated memory is still 92.3 MB. Free memory was 64.8 MB in the beginning and 61.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 82.91 ms. Allocated memory is still 92.3 MB. Free memory was 61.7 MB in the beginning and 59.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1724.89 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 58.9 MB in the beginning and 67.1 MB in the end (delta: -8.1 MB). Peak memory consumption was 33.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 19857.28 ms. Allocated memory was 111.1 MB in the beginning and 343.9 MB in the end (delta: 232.8 MB). Free memory was 66.6 MB in the beginning and 267.7 MB in the end (delta: -201.1 MB). Peak memory consumption was 162.0 MB. Max. memory is 16.1 GB. * Witness Printer took 202.69 ms. Allocated memory is still 343.9 MB. Free memory was 267.7 MB in the beginning and 252.0 MB in the end (delta: 15.7 MB). Peak memory consumption was 16.8 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 - PositiveResult [Line: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3262 SDtfs, 4462 SDslu, 4256 SDs, 0 SdLazy, 907 SolverSat, 283 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 607 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1177occurred in iteration=8, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 3286 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 301 NumberOfFragments, 5614 HoareAnnotationTreeSize, 33 FomulaSimplifications, 216924 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 33 FomulaSimplificationsInter, 30687 FormulaSimplificationTreeSizeReductionInter, 5.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1458 NumberOfCodeBlocks, 1458 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1669 ConstructedInterpolants, 0 QuantifiedInterpolants, 4701 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1185 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 29 InterpolantComputations, 24 PerfectInterpolantSequences, 414/432 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((t1_st == 0 && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && __retres1 == 0) || ((((((((((t1_pc == 1 && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && __retres1 == 0)) || (((((((((2 == t2_st && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && !(tmp == 0)) && __retres1 == 0)) || (((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && !(tmp == 0)) && __retres1 == 0) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((((2 == t2_st && !(t1_pc == 1)) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local) && !(tmp == 0)) && E_1 == 2) || (((((((((2 == t2_st && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token == local) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token == local) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((m_pc == 1 && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token == local) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_st == 0 && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t1_st) && 0 < t2_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 0 < t2_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 0 < t2_st) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && __retres1 == 1) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && 0 < t2_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) || (((((((((t1_pc == 1 && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t1_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token == local) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((2 == t2_st && t1_st == 0) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_st == 0 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token == local) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 538]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t1_st) && __retres1 == 1) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && local + 1 < token) && !(tmp == 0)) && E_1 == 2) || (((((((((t1_pc == 1 && 0 < t2_st) && t2_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((t1_pc == 1 && 2 == t1_st) && 0 < t2_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && token == local) && !(tmp == 0)) && E_1 == 2)) || ((((((((!(t1_pc == 1) && t1_st == 0) && 0 < t2_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token == local) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_st == 0 && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((t1_st == 0 && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) && token == local)) || ((((((((!(t1_pc == 1) && t1_st == 0) && 0 < t2_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && token == local) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((t1_pc == 1 && 0 < t2_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && local + 1 < token) && !(tmp == 0)) && E_1 == 2) || (((((((((t1_pc == 1 && 0 < t2_st) && t2_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) || (((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && E_1 == 2)) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && E_1 == 2) || (((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2)) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) || (((((((((t1_pc == 1 && E_2 == 1) && t2_pc == 1) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && __retres1 == 0) || (((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((t1_pc == 1 && E_2 == 1) && t2_pc == 1) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((m_pc == t1_pc && m_pc == t2_pc) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token == local) && E_1 == 2 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 378]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && E_1 == 2) && __retres1 == 0)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) || (((((((((t1_pc == 1 && E_2 == 1) && t2_pc == 1) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((((!(t1_pc == 1) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) || ((((((((((t1_pc == 1 && 2 == t1_st) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0))) || (((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && !(tmp == 0))) || (((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && !(tmp == 0)) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && 2 == t1_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) || ((((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token == local) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token == local) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((((((((2 == t2_st && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token == local) && !(tmp == 0)) && E_1 == 2) || (((((((E_2 == 2 && m_pc == 0) && E_M == 2) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((t2_pc == 1 && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((2 == t2_st && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && !(tmp == 0)) && E_1 == 2)) || ((token <= local + 1 && local + 1 <= token) && (((((((((((m_pc == 1 && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) || (((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)))) || ((((((((((((m_pc == 1 && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) || (((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) && token == local)) || (((((((t2_pc == 1 && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((E_2 == 2 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((token <= local + 1 && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) || (((((((((t1_pc == 1 && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token == local) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token == local) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((2 == t2_st && t1_st == 0) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_st == 0 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token == local) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((((m_pc == t1_pc && m_pc == t2_pc) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token == local) && E_1 == 2 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((m_pc == t1_pc && m_pc == t2_pc) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token == local) && E_1 == 2) && __retres1 == 0 - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) || ((((((t1_pc == 1 && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || ((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && E_1 == 2) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && token <= 2 + local) && 2 == t1_st) && __retres1 == 1) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && local + 1 < token) && !(tmp == 0)) && E_1 == 2) || (((((((((t1_pc == 1 && 0 < t2_st) && t2_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((((((((!(t1_pc == 1) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) || ((((((((((t1_pc == 1 && 2 == t1_st) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0))) || (((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && !(tmp == 0))) || (((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && !(tmp == 0)) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) || (((((((((t1_pc == 1 && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t1_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token == local) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2)) || ((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && local + 1 < token) && E_M == 2) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token == local) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((2 == t2_st && t1_st == 0) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token == local) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_st == 0 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token == local) && !(t2_pc == 1)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token == local) && !(tmp == 0)) && E_1 == 2) RESULT: Ultimate proved your program to be correct! [2021-11-07 02:22:08,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d019a1e0-ef52-49a7-a821-54d7e2f0ceaf/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 Result: TRUE