./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE --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 518acce2d3c6fcf7f85ccd842b876047f6f96eecf9e5395ea8bbd2907cbf9fc2 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-24 11:14:04,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-24 11:14:04,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-24 11:14:04,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-24 11:14:04,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-24 11:14:04,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-24 11:14:04,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-24 11:14:04,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-24 11:14:04,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-24 11:14:04,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-24 11:14:04,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-24 11:14:04,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-24 11:14:04,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-24 11:14:04,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-24 11:14:04,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-24 11:14:04,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-24 11:14:04,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-24 11:14:04,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-24 11:14:04,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-24 11:14:04,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-24 11:14:04,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-24 11:14:04,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-24 11:14:04,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-24 11:14:04,238 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-24 11:14:04,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-24 11:14:04,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-24 11:14:04,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-24 11:14:04,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-24 11:14:04,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-24 11:14:04,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-24 11:14:04,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-24 11:14:04,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-24 11:14:04,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-24 11:14:04,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-24 11:14:04,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-24 11:14:04,251 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-24 11:14:04,252 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-24 11:14:04,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-24 11:14:04,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-24 11:14:04,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-24 11:14:04,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-24 11:14:04,255 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-24 11:14:04,280 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-24 11:14:04,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-24 11:14:04,281 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-24 11:14:04,281 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-24 11:14:04,281 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-24 11:14:04,281 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-24 11:14:04,281 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-24 11:14:04,282 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-24 11:14:04,282 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-24 11:14:04,282 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-24 11:14:04,282 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-24 11:14:04,282 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-24 11:14:04,283 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-24 11:14:04,283 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-24 11:14:04,283 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-24 11:14:04,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-24 11:14:04,284 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-24 11:14:04,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-24 11:14:04,284 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-24 11:14:04,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-24 11:14:04,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-24 11:14:04,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-24 11:14:04,285 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-24 11:14:04,285 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-24 11:14:04,285 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-24 11:14:04,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-24 11:14:04,286 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-24 11:14:04,286 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-24 11:14:04,286 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-24 11:14:04,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-24 11:14:04,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 11:14:04,287 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-24 11:14:04,287 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-24 11:14:04,287 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-24 11:14:04,287 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-24 11:14:04,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-24 11:14:04,288 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-24 11:14:04,288 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-24 11:14:04,288 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-24 11:14:04,288 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_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/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_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE 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 -> 518acce2d3c6fcf7f85ccd842b876047f6f96eecf9e5395ea8bbd2907cbf9fc2 [2021-10-24 11:14:04,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-24 11:14:04,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-24 11:14:04,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-24 11:14:04,568 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-24 11:14:04,569 INFO L275 PluginConnector]: CDTParser initialized [2021-10-24 11:14:04,570 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-10-24 11:14:04,649 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/data/0412b0a32/eebf3654fb4e4349ad418a18537c1073/FLAGf82251e78 [2021-10-24 11:14:05,096 INFO L306 CDTParser]: Found 1 translation units. [2021-10-24 11:14:05,097 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-10-24 11:14:05,106 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/data/0412b0a32/eebf3654fb4e4349ad418a18537c1073/FLAGf82251e78 [2021-10-24 11:14:05,476 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/data/0412b0a32/eebf3654fb4e4349ad418a18537c1073 [2021-10-24 11:14:05,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-24 11:14:05,482 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-24 11:14:05,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-24 11:14:05,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-24 11:14:05,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-24 11:14:05,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:14:05" (1/1) ... [2021-10-24 11:14:05,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f722c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:05, skipping insertion in model container [2021-10-24 11:14:05,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:14:05" (1/1) ... [2021-10-24 11:14:05,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-24 11:14:05,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-24 11:14:05,702 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_a7e0922d-8ee1-40b7-9716-2de697f71c63/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[366,379] [2021-10-24 11:14:05,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 11:14:05,803 INFO L203 MainTranslator]: Completed pre-run [2021-10-24 11:14:05,816 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_a7e0922d-8ee1-40b7-9716-2de697f71c63/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[366,379] [2021-10-24 11:14:05,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 11:14:05,871 INFO L208 MainTranslator]: Completed translation [2021-10-24 11:14:05,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:05 WrapperNode [2021-10-24 11:14:05,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-24 11:14:05,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-24 11:14:05,873 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-24 11:14:05,873 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-24 11:14:05,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:05" (1/1) ... [2021-10-24 11:14:05,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:05" (1/1) ... [2021-10-24 11:14:05,936 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-24 11:14:05,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-24 11:14:05,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-24 11:14:05,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-24 11:14:05,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:05" (1/1) ... [2021-10-24 11:14:05,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:05" (1/1) ... [2021-10-24 11:14:05,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:05" (1/1) ... [2021-10-24 11:14:05,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:05" (1/1) ... [2021-10-24 11:14:05,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:05" (1/1) ... [2021-10-24 11:14:05,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:05" (1/1) ... [2021-10-24 11:14:05,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:05" (1/1) ... [2021-10-24 11:14:05,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-24 11:14:05,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-24 11:14:05,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-24 11:14:05,986 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-24 11:14:05,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:05" (1/1) ... [2021-10-24 11:14:06,006 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 11:14:06,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 11:14:06,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-24 11:14:06,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-24 11:14:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-24 11:14:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-24 11:14:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-24 11:14:06,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-24 11:14:07,290 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-24 11:14:07,290 INFO L299 CfgBuilder]: Removed 80 assume(true) statements. [2021-10-24 11:14:07,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:14:07 BoogieIcfgContainer [2021-10-24 11:14:07,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-24 11:14:07,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-24 11:14:07,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-24 11:14:07,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-24 11:14:07,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:14:05" (1/3) ... [2021-10-24 11:14:07,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41158666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:14:07, skipping insertion in model container [2021-10-24 11:14:07,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:14:05" (2/3) ... [2021-10-24 11:14:07,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41158666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:14:07, skipping insertion in model container [2021-10-24 11:14:07,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:14:07" (3/3) ... [2021-10-24 11:14:07,302 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2021-10-24 11:14:07,311 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-24 11:14:07,312 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-24 11:14:07,372 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-24 11:14:07,381 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-10-24 11:14:07,381 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-24 11:14:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 61 states have (on average 1.5901639344262295) internal successors, (97), 62 states have internal predecessors, (97), 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-10-24 11:14:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-24 11:14:07,409 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:14:07,410 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:14:07,410 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 11:14:07,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:14:07,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1223301241, now seen corresponding path program 1 times [2021-10-24 11:14:07,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:14:07,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865278765] [2021-10-24 11:14:07,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:14:07,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:14:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:14:07,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 11:14:07,622 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:14:07,623 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865278765] [2021-10-24 11:14:07,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865278765] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:14:07,624 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:14:07,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 11:14:07,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138295709] [2021-10-24 11:14:07,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 11:14:07,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:14:07,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 11:14:07,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 11:14:07,654 INFO L87 Difference]: Start difference. First operand has 63 states, 61 states have (on average 1.5901639344262295) internal successors, (97), 62 states have internal predecessors, (97), 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 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-10-24 11:14:07,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:14:07,851 INFO L93 Difference]: Finished difference Result 204 states and 311 transitions. [2021-10-24 11:14:07,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 11:14:07,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2021-10-24 11:14:07,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:14:07,871 INFO L225 Difference]: With dead ends: 204 [2021-10-24 11:14:07,871 INFO L226 Difference]: Without dead ends: 137 [2021-10-24 11:14:07,876 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 11:14:07,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-10-24 11:14:07,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2021-10-24 11:14:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.4065040650406504) internal successors, (173), 123 states have internal predecessors, (173), 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-10-24 11:14:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 173 transitions. [2021-10-24 11:14:07,926 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 173 transitions. Word has length 16 [2021-10-24 11:14:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:14:07,926 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 173 transitions. [2021-10-24 11:14:07,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-10-24 11:14:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 173 transitions. [2021-10-24 11:14:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-24 11:14:07,928 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:14:07,929 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:14:07,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-24 11:14:07,929 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 11:14:07,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:14:07,930 INFO L82 PathProgramCache]: Analyzing trace with hash 831093875, now seen corresponding path program 1 times [2021-10-24 11:14:07,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:14:07,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179406941] [2021-10-24 11:14:07,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:14:07,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:14:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:14:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 11:14:08,028 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:14:08,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179406941] [2021-10-24 11:14:08,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179406941] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:14:08,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:14:08,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 11:14:08,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792796242] [2021-10-24 11:14:08,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 11:14:08,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:14:08,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 11:14:08,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 11:14:08,034 INFO L87 Difference]: Start difference. First operand 124 states and 173 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-10-24 11:14:08,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:14:08,149 INFO L93 Difference]: Finished difference Result 354 states and 502 transitions. [2021-10-24 11:14:08,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 11:14:08,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2021-10-24 11:14:08,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:14:08,157 INFO L225 Difference]: With dead ends: 354 [2021-10-24 11:14:08,157 INFO L226 Difference]: Without dead ends: 237 [2021-10-24 11:14:08,159 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 11:14:08,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-10-24 11:14:08,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 187. [2021-10-24 11:14:08,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.4086021505376345) internal successors, (262), 186 states have internal predecessors, (262), 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-10-24 11:14:08,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 262 transitions. [2021-10-24 11:14:08,200 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 262 transitions. Word has length 23 [2021-10-24 11:14:08,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:14:08,200 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 262 transitions. [2021-10-24 11:14:08,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-10-24 11:14:08,202 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 262 transitions. [2021-10-24 11:14:08,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-24 11:14:08,205 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:14:08,227 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:14:08,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-24 11:14:08,228 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 11:14:08,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:14:08,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1180705076, now seen corresponding path program 1 times [2021-10-24 11:14:08,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:14:08,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540052797] [2021-10-24 11:14:08,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:14:08,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:14:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:14:08,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 11:14:08,373 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:14:08,373 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540052797] [2021-10-24 11:14:08,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540052797] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:14:08,374 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:14:08,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-24 11:14:08,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431106561] [2021-10-24 11:14:08,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 11:14:08,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:14:08,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 11:14:08,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 11:14:08,378 INFO L87 Difference]: Start difference. First operand 187 states and 262 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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-10-24 11:14:08,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:14:08,430 INFO L93 Difference]: Finished difference Result 419 states and 593 transitions. [2021-10-24 11:14:08,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 11:14:08,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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 24 [2021-10-24 11:14:08,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:14:08,434 INFO L225 Difference]: With dead ends: 419 [2021-10-24 11:14:08,434 INFO L226 Difference]: Without dead ends: 263 [2021-10-24 11:14:08,438 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 11:14:08,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-10-24 11:14:08,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 226. [2021-10-24 11:14:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.3955555555555557) internal successors, (314), 225 states have internal predecessors, (314), 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-10-24 11:14:08,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 314 transitions. [2021-10-24 11:14:08,478 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 314 transitions. Word has length 24 [2021-10-24 11:14:08,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:14:08,479 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 314 transitions. [2021-10-24 11:14:08,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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-10-24 11:14:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 314 transitions. [2021-10-24 11:14:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-24 11:14:08,486 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:14:08,486 INFO L512 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] [2021-10-24 11:14:08,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-24 11:14:08,487 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 11:14:08,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:14:08,488 INFO L82 PathProgramCache]: Analyzing trace with hash -925973290, now seen corresponding path program 1 times [2021-10-24 11:14:08,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:14:08,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131350148] [2021-10-24 11:14:08,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:14:08,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:14:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:14:08,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 11:14:08,590 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:14:08,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131350148] [2021-10-24 11:14:08,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131350148] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:14:08,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:14:08,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 11:14:08,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528762142] [2021-10-24 11:14:08,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 11:14:08,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:14:08,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 11:14:08,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 11:14:08,599 INFO L87 Difference]: Start difference. First operand 226 states and 314 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-10-24 11:14:08,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:14:08,637 INFO L93 Difference]: Finished difference Result 412 states and 586 transitions. [2021-10-24 11:14:08,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 11:14:08,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2021-10-24 11:14:08,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:14:08,640 INFO L225 Difference]: With dead ends: 412 [2021-10-24 11:14:08,640 INFO L226 Difference]: Without dead ends: 255 [2021-10-24 11:14:08,644 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 11:14:08,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-10-24 11:14:08,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 241. [2021-10-24 11:14:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.4083333333333334) internal successors, (338), 240 states have internal predecessors, (338), 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-10-24 11:14:08,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 338 transitions. [2021-10-24 11:14:08,665 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 338 transitions. Word has length 29 [2021-10-24 11:14:08,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:14:08,665 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 338 transitions. [2021-10-24 11:14:08,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-10-24 11:14:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 338 transitions. [2021-10-24 11:14:08,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-24 11:14:08,670 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:14:08,671 INFO L512 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] [2021-10-24 11:14:08,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-24 11:14:08,672 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 11:14:08,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:14:08,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1022905580, now seen corresponding path program 1 times [2021-10-24 11:14:08,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:14:08,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975395989] [2021-10-24 11:14:08,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:14:08,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:14:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:14:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 11:14:08,857 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:14:08,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975395989] [2021-10-24 11:14:08,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975395989] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:14:08,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:14:08,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 11:14:08,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19637836] [2021-10-24 11:14:08,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 11:14:08,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:14:08,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 11:14:08,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 11:14:08,860 INFO L87 Difference]: Start difference. First operand 241 states and 338 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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-10-24 11:14:08,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:14:08,902 INFO L93 Difference]: Finished difference Result 413 states and 588 transitions. [2021-10-24 11:14:08,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 11:14:08,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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 42 [2021-10-24 11:14:08,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:14:08,905 INFO L225 Difference]: With dead ends: 413 [2021-10-24 11:14:08,905 INFO L226 Difference]: Without dead ends: 241 [2021-10-24 11:14:08,906 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 11:14:08,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-10-24 11:14:08,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2021-10-24 11:14:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.3666666666666667) internal successors, (328), 240 states have internal predecessors, (328), 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-10-24 11:14:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 328 transitions. [2021-10-24 11:14:08,921 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 328 transitions. Word has length 42 [2021-10-24 11:14:08,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:14:08,922 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 328 transitions. [2021-10-24 11:14:08,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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-10-24 11:14:08,922 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 328 transitions. [2021-10-24 11:14:08,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-24 11:14:08,925 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:14:08,925 INFO L512 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] [2021-10-24 11:14:08,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-24 11:14:08,926 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 11:14:08,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:14:08,927 INFO L82 PathProgramCache]: Analyzing trace with hash -2131710005, now seen corresponding path program 1 times [2021-10-24 11:14:08,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:14:08,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570243901] [2021-10-24 11:14:08,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:14:08,927 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:14:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:14:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 11:14:08,994 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:14:08,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570243901] [2021-10-24 11:14:08,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570243901] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:14:08,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:14:08,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 11:14:08,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28439705] [2021-10-24 11:14:08,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 11:14:08,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:14:08,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 11:14:08,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 11:14:08,997 INFO L87 Difference]: Start difference. First operand 241 states and 328 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-10-24 11:14:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:14:09,043 INFO L93 Difference]: Finished difference Result 424 states and 581 transitions. [2021-10-24 11:14:09,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 11:14:09,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2021-10-24 11:14:09,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:14:09,048 INFO L225 Difference]: With dead ends: 424 [2021-10-24 11:14:09,048 INFO L226 Difference]: Without dead ends: 252 [2021-10-24 11:14:09,048 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 11:14:09,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-10-24 11:14:09,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 241. [2021-10-24 11:14:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.3) internal successors, (312), 240 states have internal predecessors, (312), 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-10-24 11:14:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 312 transitions. [2021-10-24 11:14:09,063 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 312 transitions. Word has length 42 [2021-10-24 11:14:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:14:09,065 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 312 transitions. [2021-10-24 11:14:09,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-10-24 11:14:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 312 transitions. [2021-10-24 11:14:09,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-24 11:14:09,067 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:14:09,067 INFO L512 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] [2021-10-24 11:14:09,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-24 11:14:09,067 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 11:14:09,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:14:09,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1413185279, now seen corresponding path program 1 times [2021-10-24 11:14:09,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:14:09,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399778344] [2021-10-24 11:14:09,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:14:09,074 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:14:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:14:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-24 11:14:09,158 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:14:09,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399778344] [2021-10-24 11:14:09,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399778344] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:14:09,159 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:14:09,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 11:14:09,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732712343] [2021-10-24 11:14:09,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 11:14:09,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:14:09,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 11:14:09,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 11:14:09,161 INFO L87 Difference]: Start difference. First operand 241 states and 312 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-10-24 11:14:09,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:14:09,239 INFO L93 Difference]: Finished difference Result 475 states and 618 transitions. [2021-10-24 11:14:09,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 11:14:09,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-10-24 11:14:09,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:14:09,242 INFO L225 Difference]: With dead ends: 475 [2021-10-24 11:14:09,242 INFO L226 Difference]: Without dead ends: 307 [2021-10-24 11:14:09,243 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 11:14:09,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-10-24 11:14:09,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 289. [2021-10-24 11:14:09,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.28125) internal successors, (369), 288 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:14:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 369 transitions. [2021-10-24 11:14:09,261 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 369 transitions. Word has length 43 [2021-10-24 11:14:09,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:14:09,262 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 369 transitions. [2021-10-24 11:14:09,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-10-24 11:14:09,262 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 369 transitions. [2021-10-24 11:14:09,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-24 11:14:09,263 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:14:09,264 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:14:09,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-24 11:14:09,264 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 11:14:09,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:14:09,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1833956338, now seen corresponding path program 1 times [2021-10-24 11:14:09,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:14:09,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979092118] [2021-10-24 11:14:09,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:14:09,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:14:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:14:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 11:14:09,309 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:14:09,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979092118] [2021-10-24 11:14:09,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979092118] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 11:14:09,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491807586] [2021-10-24 11:14:09,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:14:09,310 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 11:14:09,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 11:14:09,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 11:14:09,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-24 11:14:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:14:09,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-24 11:14:09,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 11:14:09,629 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-24 11:14:09,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 11:14:09,744 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-24 11:14:09,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491807586] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 11:14:09,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-24 11:14:09,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2021-10-24 11:14:09,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454387257] [2021-10-24 11:14:09,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 11:14:09,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:14:09,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 11:14:09,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-24 11:14:09,747 INFO L87 Difference]: Start difference. First operand 289 states and 369 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:14:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:14:09,790 INFO L93 Difference]: Finished difference Result 571 states and 731 transitions. [2021-10-24 11:14:09,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 11:14:09,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-10-24 11:14:09,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:14:09,793 INFO L225 Difference]: With dead ends: 571 [2021-10-24 11:14:09,793 INFO L226 Difference]: Without dead ends: 289 [2021-10-24 11:14:09,794 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.5ms TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-24 11:14:09,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-10-24 11:14:09,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2021-10-24 11:14:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.2395833333333333) internal successors, (357), 288 states have internal predecessors, (357), 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-10-24 11:14:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 357 transitions. [2021-10-24 11:14:09,813 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 357 transitions. Word has length 46 [2021-10-24 11:14:09,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:14:09,813 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 357 transitions. [2021-10-24 11:14:09,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:14:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 357 transitions. [2021-10-24 11:14:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-24 11:14:09,814 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:14:09,815 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:14:09,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-24 11:14:10,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 11:14:10,037 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 11:14:10,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:14:10,037 INFO L82 PathProgramCache]: Analyzing trace with hash 545761809, now seen corresponding path program 1 times [2021-10-24 11:14:10,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:14:10,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178994060] [2021-10-24 11:14:10,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:14:10,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:14:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:14:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 11:14:10,079 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:14:10,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178994060] [2021-10-24 11:14:10,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178994060] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-24 11:14:10,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981777392] [2021-10-24 11:14:10,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:14:10,080 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-24 11:14:10,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 11:14:10,081 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-24 11:14:10,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-24 11:14:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:14:10,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-24 11:14:10,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 11:14:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 11:14:10,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 11:14:10,421 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 11:14:10,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981777392] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 11:14:10,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-24 11:14:10,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-24 11:14:10,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481783948] [2021-10-24 11:14:10,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 11:14:10,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:14:10,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 11:14:10,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-24 11:14:10,425 INFO L87 Difference]: Start difference. First operand 289 states and 357 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-10-24 11:14:10,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:14:10,483 INFO L93 Difference]: Finished difference Result 655 states and 808 transitions. [2021-10-24 11:14:10,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 11:14:10,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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 46 [2021-10-24 11:14:10,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:14:10,487 INFO L225 Difference]: With dead ends: 655 [2021-10-24 11:14:10,487 INFO L226 Difference]: Without dead ends: 373 [2021-10-24 11:14:10,488 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-24 11:14:10,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-10-24 11:14:10,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 307. [2021-10-24 11:14:10,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.2483660130718954) internal successors, (382), 306 states have internal predecessors, (382), 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-10-24 11:14:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 382 transitions. [2021-10-24 11:14:10,510 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 382 transitions. Word has length 46 [2021-10-24 11:14:10,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:14:10,510 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 382 transitions. [2021-10-24 11:14:10,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-10-24 11:14:10,511 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 382 transitions. [2021-10-24 11:14:10,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-24 11:14:10,511 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:14:10,512 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:14:10,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-24 11:14:10,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-10-24 11:14:10,737 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 11:14:10,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:14:10,738 INFO L82 PathProgramCache]: Analyzing trace with hash -776347129, now seen corresponding path program 1 times [2021-10-24 11:14:10,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:14:10,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125984565] [2021-10-24 11:14:10,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:14:10,739 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:14:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:14:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-24 11:14:10,783 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:14:10,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125984565] [2021-10-24 11:14:10,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125984565] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:14:10,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:14:10,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 11:14:10,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304739977] [2021-10-24 11:14:10,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 11:14:10,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:14:10,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 11:14:10,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 11:14:10,785 INFO L87 Difference]: Start difference. First operand 307 states and 382 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-10-24 11:14:10,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:14:10,836 INFO L93 Difference]: Finished difference Result 550 states and 687 transitions. [2021-10-24 11:14:10,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 11:14:10,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 47 [2021-10-24 11:14:10,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:14:10,838 INFO L225 Difference]: With dead ends: 550 [2021-10-24 11:14:10,839 INFO L226 Difference]: Without dead ends: 250 [2021-10-24 11:14:10,839 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 11:14:10,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-10-24 11:14:10,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2021-10-24 11:14:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.1700404858299596) internal successors, (289), 247 states have internal predecessors, (289), 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-10-24 11:14:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 289 transitions. [2021-10-24 11:14:10,867 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 289 transitions. Word has length 47 [2021-10-24 11:14:10,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:14:10,868 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 289 transitions. [2021-10-24 11:14:10,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-10-24 11:14:10,868 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 289 transitions. [2021-10-24 11:14:10,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-24 11:14:10,870 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:14:10,870 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 11:14:10,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-24 11:14:10,871 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 11:14:10,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:14:10,871 INFO L82 PathProgramCache]: Analyzing trace with hash 213446167, now seen corresponding path program 1 times [2021-10-24 11:14:10,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:14:10,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560270801] [2021-10-24 11:14:10,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:14:10,872 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:14:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:14:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-24 11:14:11,003 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:14:11,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560270801] [2021-10-24 11:14:11,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560270801] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:14:11,004 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:14:11,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 11:14:11,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027455777] [2021-10-24 11:14:11,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 11:14:11,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:14:11,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 11:14:11,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 11:14:11,006 INFO L87 Difference]: Start difference. First operand 248 states and 289 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-10-24 11:14:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:14:11,051 INFO L93 Difference]: Finished difference Result 476 states and 556 transitions. [2021-10-24 11:14:11,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 11:14:11,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 48 [2021-10-24 11:14:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:14:11,055 INFO L225 Difference]: With dead ends: 476 [2021-10-24 11:14:11,056 INFO L226 Difference]: Without dead ends: 474 [2021-10-24 11:14:11,056 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 11:14:11,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-10-24 11:14:11,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 354. [2021-10-24 11:14:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.1756373937677054) internal successors, (415), 353 states have internal predecessors, (415), 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-10-24 11:14:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 415 transitions. [2021-10-24 11:14:11,086 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 415 transitions. Word has length 48 [2021-10-24 11:14:11,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:14:11,087 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 415 transitions. [2021-10-24 11:14:11,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-10-24 11:14:11,087 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 415 transitions. [2021-10-24 11:14:11,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-10-24 11:14:11,088 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 11:14:11,088 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 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] [2021-10-24 11:14:11,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-24 11:14:11,089 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-24 11:14:11,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 11:14:11,089 INFO L82 PathProgramCache]: Analyzing trace with hash -92010329, now seen corresponding path program 1 times [2021-10-24 11:14:11,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 11:14:11,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666125229] [2021-10-24 11:14:11,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 11:14:11,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 11:14:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 11:14:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-24 11:14:11,153 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 11:14:11,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666125229] [2021-10-24 11:14:11,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666125229] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 11:14:11,154 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 11:14:11,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 11:14:11,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919112198] [2021-10-24 11:14:11,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 11:14:11,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 11:14:11,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 11:14:11,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 11:14:11,156 INFO L87 Difference]: Start difference. First operand 354 states and 415 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:14:11,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 11:14:11,271 INFO L93 Difference]: Finished difference Result 592 states and 684 transitions. [2021-10-24 11:14:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 11:14:11,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-10-24 11:14:11,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 11:14:11,273 INFO L225 Difference]: With dead ends: 592 [2021-10-24 11:14:11,273 INFO L226 Difference]: Without dead ends: 0 [2021-10-24 11:14:11,274 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 11:14:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-24 11:14:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-24 11:14:11,275 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-10-24 11:14:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-24 11:14:11,275 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2021-10-24 11:14:11,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 11:14:11,275 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-24 11:14:11,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 11:14:11,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-24 11:14:11,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-24 11:14:11,279 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-24 11:14:11,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-24 11:14:11,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-24 11:14:11,287 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,361 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,380 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,388 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,390 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,562 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,580 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,613 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:11,624 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-24 11:14:13,176 INFO L857 garLoopResultBuilder]: For program point L135(lines 135 144) no Hoare annotation was computed. [2021-10-24 11:14:13,176 INFO L857 garLoopResultBuilder]: For program point L135-2(lines 135 144) no Hoare annotation was computed. [2021-10-24 11:14:13,176 INFO L857 garLoopResultBuilder]: For program point L36(lines 36 44) no Hoare annotation was computed. [2021-10-24 11:14:13,177 INFO L857 garLoopResultBuilder]: For program point L135-3(lines 135 144) no Hoare annotation was computed. [2021-10-24 11:14:13,177 INFO L857 garLoopResultBuilder]: For program point L135-5(lines 135 144) no Hoare annotation was computed. [2021-10-24 11:14:13,177 INFO L857 garLoopResultBuilder]: For program point L135-6(lines 135 144) no Hoare annotation was computed. [2021-10-24 11:14:13,177 INFO L857 garLoopResultBuilder]: For program point L135-8(lines 135 144) no Hoare annotation was computed. [2021-10-24 11:14:13,177 INFO L857 garLoopResultBuilder]: For program point L135-9(lines 135 144) no Hoare annotation was computed. [2021-10-24 11:14:13,177 INFO L857 garLoopResultBuilder]: For program point L135-11(lines 135 144) no Hoare annotation was computed. [2021-10-24 11:14:13,177 INFO L857 garLoopResultBuilder]: For program point L135-12(lines 135 144) no Hoare annotation was computed. [2021-10-24 11:14:13,177 INFO L857 garLoopResultBuilder]: For program point L135-14(lines 135 144) no Hoare annotation was computed. [2021-10-24 11:14:13,177 INFO L857 garLoopResultBuilder]: For program point L136(lines 136 141) no Hoare annotation was computed. [2021-10-24 11:14:13,177 INFO L857 garLoopResultBuilder]: For program point L136-1(lines 136 141) no Hoare annotation was computed. [2021-10-24 11:14:13,177 INFO L857 garLoopResultBuilder]: For program point L136-2(lines 136 141) no Hoare annotation was computed. [2021-10-24 11:14:13,178 INFO L857 garLoopResultBuilder]: For program point L136-3(lines 136 141) no Hoare annotation was computed. [2021-10-24 11:14:13,178 INFO L857 garLoopResultBuilder]: For program point L136-4(lines 136 141) no Hoare annotation was computed. [2021-10-24 11:14:13,178 INFO L857 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2021-10-24 11:14:13,178 INFO L853 garLoopResultBuilder]: At program point L40(lines 35 74) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (<= 2 ~E_M~0) (<= ~token~0 (+ ~local~0 1)) (= 2 ~t1_st~0) (= ~m_pc~0 1) (< ~local~0 ~token~0) (<= ~E_M~0 2)) [2021-10-24 11:14:13,178 INFO L857 garLoopResultBuilder]: For program point L207(lines 207 211) no Hoare annotation was computed. [2021-10-24 11:14:13,178 INFO L857 garLoopResultBuilder]: For program point L207-1(lines 202 240) no Hoare annotation was computed. [2021-10-24 11:14:13,179 INFO L853 garLoopResultBuilder]: At program point L439(lines 439 448) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse5 (= 2 ~t1_st~0)) (.cse8 (= ~m_st~0 2)) (.cse9 (= ~m_pc~0 1)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse6 (= ~m_pc~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse7 (<= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5 .cse9 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse9 (< ~local~0 ~token~0) .cse7) (and .cse1 .cse8 .cse3 .cse9 .cse10 .cse11 .cse12 .cse7) (and .cse1 .cse3 .cse4 (not .cse0) .cse6 .cse11 .cse12 .cse7))) [2021-10-24 11:14:13,179 INFO L853 garLoopResultBuilder]: At program point L439-1(lines 439 448) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse5 (= 2 ~t1_st~0)) (.cse8 (= ~m_st~0 2)) (.cse9 (= ~m_pc~0 1)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse6 (= ~m_pc~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse7 (<= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5 .cse9 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse9 (< ~local~0 ~token~0) .cse7) (and .cse1 .cse8 .cse3 .cse9 .cse10 .cse11 .cse12 .cse7) (and .cse1 .cse3 .cse4 (not .cse0) .cse6 .cse11 .cse12 .cse7))) [2021-10-24 11:14:13,180 INFO L853 garLoopResultBuilder]: At program point L241(lines 196 246) the Hoare annotation is: (let ((.cse7 (= ~m_st~0 2)) (.cse4 (= 2 ~t1_st~0)) (.cse8 (= ~m_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse5 (= ~m_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse6 (<= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse8 .cse9 .cse10 .cse6) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse8 (< ~local~0 ~token~0) .cse6) (and .cse0 .cse1 .cse7 .cse2 .cse4 .cse8 .cse6) (and .cse1 .cse2 .cse3 (not .cse0) .cse5 .cse9 .cse10 .cse6))) [2021-10-24 11:14:13,180 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-24 11:14:13,180 INFO L853 garLoopResultBuilder]: At program point L212(lines 202 240) the Hoare annotation is: (let ((.cse7 (= ~m_st~0 2)) (.cse4 (= 2 ~t1_st~0)) (.cse8 (= ~m_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse5 (= ~m_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse6 (<= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse8 .cse9 .cse10 .cse6) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse8 (< ~local~0 ~token~0) .cse6) (and .cse0 .cse1 .cse7 .cse2 .cse4 .cse8 .cse6) (and .cse1 .cse2 .cse3 (not .cse0) .cse5 .cse9 .cse10 .cse6))) [2021-10-24 11:14:13,180 INFO L853 garLoopResultBuilder]: At program point L146(lines 134 148) the Hoare annotation is: (and (<= 2 ~E_1~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~m_st~0 0) (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) (= ~m_pc~0 0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (<= ~E_M~0 2)) [2021-10-24 11:14:13,181 INFO L853 garLoopResultBuilder]: At program point L146-1(lines 134 148) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (<= ~token~0 ~local~0)) (.cse2 (<= ~local~0 ~token~0)) (.cse3 (<= ~E_M~0 2))) (or (and .cse0 (not (= ~t1_pc~0 1)) .cse1 .cse2 .cse3) (and .cse0 (= 2 ~t1_st~0) .cse1 .cse2 .cse3))) [2021-10-24 11:14:13,181 INFO L857 garLoopResultBuilder]: For program point L80(lines 80 88) no Hoare annotation was computed. [2021-10-24 11:14:13,181 INFO L853 garLoopResultBuilder]: At program point L146-2(lines 134 148) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~m_pc~0 1)) (.cse3 (< 0 ~t1_st~0))) (or (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse3 (< ~local~0 ~token~0)) (and .cse0 .cse1 (= ~m_st~0 2) .cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse3))) [2021-10-24 11:14:13,181 INFO L853 garLoopResultBuilder]: At program point L146-3(lines 134 148) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse5 (= 2 ~t1_st~0)) (.cse8 (= ~m_st~0 2)) (.cse9 (= ~m_pc~0 1)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse6 (= ~m_pc~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse7 (<= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5 .cse9 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse9 (< ~local~0 ~token~0) .cse7) (and .cse1 .cse8 .cse3 .cse9 .cse10 .cse11 .cse12 .cse7) (and .cse1 .cse3 .cse4 (not .cse0) .cse6 .cse11 .cse12 .cse7))) [2021-10-24 11:14:13,181 INFO L853 garLoopResultBuilder]: At program point L146-4(lines 134 148) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse5 (= 2 ~t1_st~0)) (.cse8 (= ~m_st~0 2)) (.cse9 (= ~m_pc~0 1)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse6 (= ~m_pc~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse7 (<= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5 .cse9 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse9 (< ~local~0 ~token~0) .cse7) (and .cse1 .cse8 .cse3 .cse9 .cse10 .cse11 .cse12 .cse7) (and .cse1 .cse3 .cse4 (not .cse0) .cse6 .cse11 .cse12 .cse7))) [2021-10-24 11:14:13,182 INFO L857 garLoopResultBuilder]: For program point L215(lines 215 222) no Hoare annotation was computed. [2021-10-24 11:14:13,182 INFO L857 garLoopResultBuilder]: For program point L116(lines 116 125) no Hoare annotation was computed. [2021-10-24 11:14:13,182 INFO L853 garLoopResultBuilder]: At program point L83(lines 83 87) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (< 0 ~t1_st~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (<= ~local~0 ~token~0)) (.cse5 (<= ~E_M~0 2))) (or (and .cse0 (= ~m_st~0 2) .cse1 (= ~m_pc~0 1) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ~m_st~0 0) (not (= ~t1_pc~0 1)) .cse2 (= ~m_pc~0 0) .cse3 .cse4 .cse5))) [2021-10-24 11:14:13,182 INFO L857 garLoopResultBuilder]: For program point L116-2(lines 116 125) no Hoare annotation was computed. [2021-10-24 11:14:13,182 INFO L857 garLoopResultBuilder]: For program point L116-3(lines 116 125) no Hoare annotation was computed. [2021-10-24 11:14:13,182 INFO L857 garLoopResultBuilder]: For program point L116-5(lines 116 125) no Hoare annotation was computed. [2021-10-24 11:14:13,183 INFO L857 garLoopResultBuilder]: For program point L116-6(lines 116 125) no Hoare annotation was computed. [2021-10-24 11:14:13,183 INFO L857 garLoopResultBuilder]: For program point L116-8(lines 116 125) no Hoare annotation was computed. [2021-10-24 11:14:13,183 INFO L857 garLoopResultBuilder]: For program point L116-9(lines 116 125) no Hoare annotation was computed. [2021-10-24 11:14:13,183 INFO L857 garLoopResultBuilder]: For program point L116-11(lines 116 125) no Hoare annotation was computed. [2021-10-24 11:14:13,183 INFO L857 garLoopResultBuilder]: For program point L116-12(lines 116 125) no Hoare annotation was computed. [2021-10-24 11:14:13,183 INFO L857 garLoopResultBuilder]: For program point L116-14(lines 116 125) no Hoare annotation was computed. [2021-10-24 11:14:13,183 INFO L857 garLoopResultBuilder]: For program point L117(lines 117 122) no Hoare annotation was computed. [2021-10-24 11:14:13,184 INFO L857 garLoopResultBuilder]: For program point L117-1(lines 117 122) no Hoare annotation was computed. [2021-10-24 11:14:13,184 INFO L857 garLoopResultBuilder]: For program point L117-2(lines 117 122) no Hoare annotation was computed. [2021-10-24 11:14:13,184 INFO L857 garLoopResultBuilder]: For program point L117-3(lines 117 122) no Hoare annotation was computed. [2021-10-24 11:14:13,184 INFO L857 garLoopResultBuilder]: For program point L117-4(lines 117 122) no Hoare annotation was computed. [2021-10-24 11:14:13,184 INFO L860 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-10-24 11:14:13,184 INFO L857 garLoopResultBuilder]: For program point L452(lines 452 456) no Hoare annotation was computed. [2021-10-24 11:14:13,185 INFO L853 garLoopResultBuilder]: At program point L420-1(lines 275 457) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse5 (= 2 ~t1_st~0)) (.cse8 (= ~m_st~0 2)) (.cse9 (= ~m_pc~0 1)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse6 (= ~m_pc~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse7 (<= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5 .cse9 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse9 (< ~local~0 ~token~0) .cse7) (and .cse1 .cse8 .cse3 .cse9 .cse10 .cse11 .cse12 .cse7) (and .cse1 .cse3 .cse4 (not .cse0) .cse6 .cse11 .cse12 .cse7))) [2021-10-24 11:14:13,185 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-24 11:14:13,185 INFO L853 garLoopResultBuilder]: At program point L91-1(lines 79 110) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= ~m_pc~0 1)) (.cse3 (<= ~E_M~0 2))) (or (and .cse0 (= ~m_st~0 2) .cse1 .cse2 .cse3) (and .cse0 .cse1 (= ~m_st~0 0) (= ~m_pc~0 0) .cse3) (and (= ~t1_pc~0 1) .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3))) [2021-10-24 11:14:13,185 INFO L853 garLoopResultBuilder]: At program point L226(lines 202 240) the Hoare annotation is: (let ((.cse7 (= ~m_st~0 2)) (.cse4 (= 2 ~t1_st~0)) (.cse8 (= ~m_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse5 (= ~m_pc~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse6 (<= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse8 .cse9 .cse10 .cse6) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse8 (< ~local~0 ~token~0) .cse6) (and .cse0 .cse1 .cse7 .cse2 .cse4 .cse8 .cse6) (and .cse1 .cse2 .cse3 (not .cse0) .cse5 .cse9 .cse10 .cse6))) [2021-10-24 11:14:13,186 INFO L853 garLoopResultBuilder]: At program point L127(lines 115 129) the Hoare annotation is: (and (<= 2 ~E_1~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~m_st~0 0) (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) (= ~m_pc~0 0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (<= ~E_M~0 2)) [2021-10-24 11:14:13,186 INFO L853 garLoopResultBuilder]: At program point L127-1(lines 115 129) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (<= ~token~0 ~local~0)) (.cse2 (<= ~local~0 ~token~0)) (.cse3 (<= ~E_M~0 2))) (or (and .cse0 (not (= ~t1_pc~0 1)) .cse1 .cse2 .cse3) (and .cse0 (= 2 ~t1_st~0) .cse1 .cse2 .cse3))) [2021-10-24 11:14:13,186 INFO L853 garLoopResultBuilder]: At program point L61(lines 35 74) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse5 (= 2 ~t1_st~0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (<= ~E_M~0 2))) (or (and .cse0 .cse1 (not .cse2) .cse3 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse4) (and .cse2 .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse5 (= ~m_pc~0 1) (< ~local~0 ~token~0) .cse4) (and .cse2 .cse0 .cse1 .cse5 .cse3 .cse4))) [2021-10-24 11:14:13,186 INFO L853 garLoopResultBuilder]: At program point L127-2(lines 115 129) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~m_pc~0 1)) (.cse3 (< 0 ~t1_st~0))) (or (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse3 (< ~local~0 ~token~0)) (and .cse0 .cse1 (= ~m_st~0 2) .cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse3))) [2021-10-24 11:14:13,186 INFO L853 garLoopResultBuilder]: At program point L127-3(lines 115 129) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse2 (= ~m_st~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse9 (= ~m_pc~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse7 (<= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse8 .cse4 .cse9 .cse7) (and .cse0 .cse1 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 (< ~local~0 ~token~0) .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse10 .cse11 .cse7) (and .cse1 .cse3 .cse8 (not .cse0) .cse9 .cse10 .cse11 .cse7))) [2021-10-24 11:14:13,187 INFO L853 garLoopResultBuilder]: At program point L127-4(lines 115 129) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse5 (= 2 ~t1_st~0)) (.cse8 (= ~m_st~0 2)) (.cse9 (= ~m_pc~0 1)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse6 (= ~m_pc~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse7 (<= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5 .cse9 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse9 (< ~local~0 ~token~0) .cse7) (and .cse1 .cse8 .cse3 .cse9 .cse10 .cse11 .cse12 .cse7) (and .cse1 .cse3 .cse4 (not .cse0) .cse6 .cse11 .cse12 .cse7))) [2021-10-24 11:14:13,187 INFO L860 garLoopResultBuilder]: At program point L458(lines 405 463) the Hoare annotation is: true [2021-10-24 11:14:13,187 INFO L857 garLoopResultBuilder]: For program point L229(lines 229 236) no Hoare annotation was computed. [2021-10-24 11:14:13,187 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-24 11:14:13,192 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-24 11:14:13,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:14:13 BoogieIcfgContainer [2021-10-24 11:14:13,229 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-24 11:14:13,229 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-24 11:14:13,229 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-24 11:14:13,229 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-24 11:14:13,230 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:14:07" (3/4) ... [2021-10-24 11:14:13,233 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-24 11:14:13,250 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 67 nodes and edges [2021-10-24 11:14:13,251 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2021-10-24 11:14:13,252 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-24 11:14:13,254 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-24 11:14:13,336 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/witness.graphml [2021-10-24 11:14:13,336 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-24 11:14:13,338 INFO L168 Benchmark]: Toolchain (without parser) took 7855.26 ms. Allocated memory was 113.2 MB in the beginning and 140.5 MB in the end (delta: 27.3 MB). Free memory was 78.3 MB in the beginning and 56.2 MB in the end (delta: 22.1 MB). Peak memory consumption was 48.6 MB. Max. memory is 16.1 GB. [2021-10-24 11:14:13,338 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 113.2 MB. Free memory was 87.0 MB in the beginning and 86.9 MB in the end (delta: 25.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-24 11:14:13,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.84 ms. Allocated memory is still 113.2 MB. Free memory was 78.1 MB in the beginning and 87.2 MB in the end (delta: -9.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-24 11:14:13,339 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.88 ms. Allocated memory is still 113.2 MB. Free memory was 87.2 MB in the beginning and 84.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-24 11:14:13,339 INFO L168 Benchmark]: Boogie Preprocessor took 47.28 ms. Allocated memory is still 113.2 MB. Free memory was 84.6 MB in the beginning and 82.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-24 11:14:13,340 INFO L168 Benchmark]: RCFGBuilder took 1307.96 ms. Allocated memory is still 113.2 MB. Free memory was 82.5 MB in the beginning and 82.6 MB in the end (delta: -85.5 kB). Peak memory consumption was 50.5 MB. Max. memory is 16.1 GB. [2021-10-24 11:14:13,340 INFO L168 Benchmark]: TraceAbstraction took 5933.96 ms. Allocated memory was 113.2 MB in the beginning and 140.5 MB in the end (delta: 27.3 MB). Free memory was 82.6 MB in the beginning and 64.6 MB in the end (delta: 18.1 MB). Peak memory consumption was 81.1 MB. Max. memory is 16.1 GB. [2021-10-24 11:14:13,341 INFO L168 Benchmark]: Witness Printer took 107.28 ms. Allocated memory is still 140.5 MB. Free memory was 64.6 MB in the beginning and 56.2 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-24 11:14:13,343 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.18 ms. Allocated memory is still 113.2 MB. Free memory was 87.0 MB in the beginning and 86.9 MB in the end (delta: 25.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 374.84 ms. Allocated memory is still 113.2 MB. Free memory was 78.1 MB in the beginning and 87.2 MB in the end (delta: -9.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 63.88 ms. Allocated memory is still 113.2 MB. Free memory was 87.2 MB in the beginning and 84.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 47.28 ms. Allocated memory is still 113.2 MB. Free memory was 84.6 MB in the beginning and 82.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1307.96 ms. Allocated memory is still 113.2 MB. Free memory was 82.5 MB in the beginning and 82.6 MB in the end (delta: -85.5 kB). Peak memory consumption was 50.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5933.96 ms. Allocated memory was 113.2 MB in the beginning and 140.5 MB in the end (delta: 27.3 MB). Free memory was 82.6 MB in the beginning and 64.6 MB in the end (delta: 18.1 MB). Peak memory consumption was 81.1 MB. Max. memory is 16.1 GB. * Witness Printer took 107.28 ms. Allocated memory is still 140.5 MB. Free memory was 64.6 MB in the beginning and 56.2 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 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.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: 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, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5821.2ms, OverallIterations: 12, TraceHistogramMax: 5, EmptinessCheckTime: 35.5ms, AutomataDifference: 996.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 1895.6ms, InitialAbstractionConstructionTime: 15.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1197 SDtfs, 826 SDslu, 962 SDs, 0 SdLazy, 314 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 359.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 108.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=354occurred in iteration=11, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 279.0ms AutomataMinimizationTime, 12 MinimizatonAttempts, 331 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 151 NumberOfFragments, 1713 HoareAnnotationTreeSize, 22 FomulaSimplifications, 5998 FormulaSimplificationTreeSizeReduction, 341.2ms HoareSimplificationTime, 22 FomulaSimplificationsInter, 1048 FormulaSimplificationTreeSizeReductionInter, 1540.1ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 83.2ms SsaConstructionTime, 394.1ms SatisfiabilityAnalysisTime, 1245.7ms InterpolantComputationTime, 576 NumberOfCodeBlocks, 576 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 652 ConstructedInterpolants, 0 QuantifiedInterpolants, 1303 SizeOfPredicates, 0 NumberOfNonLiveVariables, 453 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 215/217 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: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && 2 <= E_1) && __retres1 == 0) && 2 <= E_M) && m_st == 0) && 2 == t1_st) && m_pc == 0) && E_M <= 2) || ((((((((t1_pc == 1 && 2 <= E_1) && __retres1 == 0) && m_st == 2) && 2 <= E_M) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_M <= 2)) || ((((((((t1_pc == 1 && 2 <= E_1) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && m_pc == 1) && local < token) && E_M <= 2)) || (((((((2 <= E_1 && m_st == 2) && 2 <= E_M) && m_pc == 1) && __retres1 == 0) && token <= local) && local <= token) && E_M <= 2)) || (((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && !(t1_pc == 1)) && m_pc == 0) && token <= local) && local <= token) && E_M <= 2) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((2 <= E_1 && 2 <= E_M) && !(t1_pc == 1)) && m_pc == 0) && token <= local) && local <= token) && E_M <= 2) || (((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && m_pc == 1) && local < token) && E_M <= 2)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 == t1_st) && m_pc == 0) && E_M <= 2) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((((2 <= E_1 && m_st == 2) && 2 <= E_M) && m_pc == 1) && E_M <= 2) || ((((2 <= E_1 && 2 <= E_M) && m_st == 0) && m_pc == 0) && E_M <= 2)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && token <= local + 1) && m_pc == 1) && local < token) && E_M <= 2) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((2 <= E_1 && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && __retres1 == 0) && m_pc == 0) && token <= local) && local <= token) && E_M <= 2 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((2 <= E_M && !(t1_pc == 1)) && token <= local) && local <= token) && E_M <= 2) || ((((2 <= E_M && 2 == t1_st) && token <= local) && local <= token) && E_M <= 2) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((2 <= E_M && !(t1_pc == 1)) && token <= local) && local <= token) && E_M <= 2) || ((((2 <= E_M && 2 == t1_st) && token <= local) && local <= token) && E_M <= 2) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((2 <= E_1 && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && __retres1 == 0) && m_pc == 0) && token <= local) && local <= token) && E_M <= 2 - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 == t1_st) && m_pc == 0) && E_M <= 2) || ((((((2 <= E_1 && m_st == 2) && 2 <= E_M) && m_pc == 1) && token <= local) && local <= token) && E_M <= 2)) || (((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && m_pc == 1) && local < token) && E_M <= 2)) || ((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && 2 <= E_M) && 2 == t1_st) && m_pc == 1) && E_M <= 2)) || (((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && !(t1_pc == 1)) && m_pc == 0) && token <= local) && local <= token) && E_M <= 2) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: (((((((2 <= E_1 && m_st == 2) && 2 <= E_M) && m_pc == 1) && 0 < t1_st) && token <= local) && local <= token) && E_M <= 2) || ((((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && !(t1_pc == 1)) && 0 < t1_st) && m_pc == 0) && token <= local) && local <= token) && E_M <= 2) - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && 2 <= E_1) && __retres1 == 0) && 2 <= E_M) && m_st == 0) && 2 == t1_st) && m_pc == 0) && E_M <= 2) || ((((((((t1_pc == 1 && 2 <= E_1) && __retres1 == 0) && m_st == 2) && 2 <= E_M) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_M <= 2)) || ((((((((t1_pc == 1 && 2 <= E_1) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && m_pc == 1) && local < token) && E_M <= 2)) || (((((((2 <= E_1 && m_st == 2) && 2 <= E_M) && m_pc == 1) && __retres1 == 0) && token <= local) && local <= token) && E_M <= 2)) || (((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && !(t1_pc == 1)) && m_pc == 0) && token <= local) && local <= token) && E_M <= 2) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && 2 <= E_1) && __retres1 == 0) && 2 <= E_M) && m_st == 0) && 2 == t1_st) && m_pc == 0) && E_M <= 2) || ((((((((t1_pc == 1 && 2 <= E_1) && __retres1 == 0) && m_st == 2) && 2 <= E_M) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_M <= 2)) || ((((((((t1_pc == 1 && 2 <= E_1) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && m_pc == 1) && local < token) && E_M <= 2)) || (((((((2 <= E_1 && m_st == 2) && 2 <= E_M) && m_pc == 1) && __retres1 == 0) && token <= local) && local <= token) && E_M <= 2)) || (((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && !(t1_pc == 1)) && m_pc == 0) && token <= local) && local <= token) && E_M <= 2) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && 2 <= E_M) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_M <= 2) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 == t1_st) && m_pc == 0) && E_M <= 2)) || (((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && m_pc == 1) && local < token) && E_M <= 2)) || (((((((2 <= E_1 && m_st == 2) && 2 <= E_M) && m_pc == 1) && __retres1 == 0) && token <= local) && local <= token) && E_M <= 2)) || (((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && !(t1_pc == 1)) && m_pc == 0) && token <= local) && local <= token) && E_M <= 2) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 == t1_st) && m_pc == 0) && E_M <= 2) || ((((((2 <= E_1 && m_st == 2) && 2 <= E_M) && m_pc == 1) && token <= local) && local <= token) && E_M <= 2)) || (((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && m_pc == 1) && local < token) && E_M <= 2)) || ((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && 2 <= E_M) && 2 == t1_st) && m_pc == 1) && E_M <= 2)) || (((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && !(t1_pc == 1)) && m_pc == 0) && token <= local) && local <= token) && E_M <= 2) - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && 2 <= E_1) && __retres1 == 0) && 2 <= E_M) && m_st == 0) && 2 == t1_st) && m_pc == 0) && E_M <= 2) || ((((((((t1_pc == 1 && 2 <= E_1) && __retres1 == 0) && m_st == 2) && 2 <= E_M) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_M <= 2)) || ((((((((t1_pc == 1 && 2 <= E_1) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && m_pc == 1) && local < token) && E_M <= 2)) || (((((((2 <= E_1 && m_st == 2) && 2 <= E_M) && m_pc == 1) && __retres1 == 0) && token <= local) && local <= token) && E_M <= 2)) || (((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && !(t1_pc == 1)) && m_pc == 0) && token <= local) && local <= token) && E_M <= 2) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && 2 <= E_1) && __retres1 == 0) && 2 <= E_M) && m_st == 0) && 2 == t1_st) && m_pc == 0) && E_M <= 2) || ((((((((t1_pc == 1 && 2 <= E_1) && __retres1 == 0) && m_st == 2) && 2 <= E_M) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_M <= 2)) || ((((((((t1_pc == 1 && 2 <= E_1) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && m_pc == 1) && local < token) && E_M <= 2)) || (((((((2 <= E_1 && m_st == 2) && 2 <= E_M) && m_pc == 1) && __retres1 == 0) && token <= local) && local <= token) && E_M <= 2)) || (((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && !(t1_pc == 1)) && m_pc == 0) && token <= local) && local <= token) && E_M <= 2) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((t1_pc == 1 && 2 <= E_1) && token <= local + 1) && m_pc == 1) && 0 < t1_st) && local < token) || (((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && m_pc == 1) && __retres1 == 0) && 0 < t1_st) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 == t1_st) && m_pc == 0) && E_M <= 2) || ((((((2 <= E_1 && m_st == 2) && 2 <= E_M) && m_pc == 1) && token <= local) && local <= token) && E_M <= 2)) || (((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && m_pc == 1) && local < token) && E_M <= 2)) || ((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && 2 <= E_M) && 2 == t1_st) && m_pc == 1) && E_M <= 2)) || (((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && !(t1_pc == 1)) && m_pc == 0) && token <= local) && local <= token) && E_M <= 2) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((t1_pc == 1 && 2 <= E_1) && token <= local + 1) && m_pc == 1) && 0 < t1_st) && local < token) || (((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && m_pc == 1) && __retres1 == 0) && 0 < t1_st) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && 2 <= E_1) && __retres1 == 0) && 2 <= E_M) && m_st == 0) && 2 == t1_st) && m_pc == 0) && E_M <= 2) || ((((((((t1_pc == 1 && 2 <= E_1) && __retres1 == 0) && m_st == 2) && 2 <= E_M) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_M <= 2)) || ((((((((t1_pc == 1 && 2 <= E_1) && __retres1 == 0) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && m_pc == 1) && local < token) && E_M <= 2)) || (((((((2 <= E_1 && m_st == 2) && 2 <= E_M) && m_pc == 1) && __retres1 == 0) && token <= local) && local <= token) && E_M <= 2)) || (((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && !(t1_pc == 1)) && m_pc == 0) && token <= local) && local <= token) && E_M <= 2) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && token <= local + 1) && 2 == t1_st) && m_pc == 1) && local < token) && E_M <= 2 RESULT: Ultimate proved your program to be correct! [2021-10-24 11:14:13,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7e0922d-8ee1-40b7-9716-2de697f71c63/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...