./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --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 7adc5be84218941c02109a6f05aa2044beb278121fd387aba807705fdb759027 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:23:31,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:23:31,911 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 04:23:31,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:23:31,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:23:31,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:23:31,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:23:31,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:23:31,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:23:31,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:23:31,958 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:23:31,959 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:23:31,960 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:23:31,960 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:23:31,960 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:23:31,960 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:23:31,960 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:23:31,960 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:23:31,960 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:23:31,960 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:23:31,960 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:23:31,961 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:23:31,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:23:31,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:23:31,961 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:23:31,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:23:31,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:23:31,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:23:31,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:23:31,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:23:31,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:23:31,962 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:23:31,962 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:23:31,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:23:31,962 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:23:31,964 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:23:31,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:23:31,964 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:23:31,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:23:31,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:23:31,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:23:31,965 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:23:31,965 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:23:31,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:23:31,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:23:31,966 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:23:31,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:23:31,966 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 7adc5be84218941c02109a6f05aa2044beb278121fd387aba807705fdb759027 [2024-11-14 04:23:32,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:23:32,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:23:32,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:23:32,364 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:23:32,364 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:23:32,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c Unable to find full path for "g++" [2024-11-14 04:23:34,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:23:35,460 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:23:35,461 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c [2024-11-14 04:23:35,520 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/data/bf545cf47/d221b41634a04fc0bae86216b78dfacc/FLAG4c415a389 [2024-11-14 04:23:35,538 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/data/bf545cf47/d221b41634a04fc0bae86216b78dfacc [2024-11-14 04:23:35,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:23:35,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:23:35,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:23:35,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:23:35,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:23:35,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:23:35" (1/1) ... [2024-11-14 04:23:35,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87e6531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:35, skipping insertion in model container [2024-11-14 04:23:35,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:23:35" (1/1) ... [2024-11-14 04:23:35,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:23:38,185 WARN L250 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_c6101e5b-3948-44c9-aa50-5589a9606b1a/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[380323,380336] [2024-11-14 04:23:38,238 WARN L250 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_c6101e5b-3948-44c9-aa50-5589a9606b1a/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[383339,383352] [2024-11-14 04:23:38,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:23:38,455 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:23:39,911 WARN L250 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_c6101e5b-3948-44c9-aa50-5589a9606b1a/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[380323,380336] [2024-11-14 04:23:39,919 WARN L250 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_c6101e5b-3948-44c9-aa50-5589a9606b1a/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[383339,383352] [2024-11-14 04:23:39,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:23:40,060 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:23:40,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:40 WrapperNode [2024-11-14 04:23:40,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:23:40,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:23:40,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:23:40,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:23:40,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:40" (1/1) ... [2024-11-14 04:23:40,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:40" (1/1) ... [2024-11-14 04:23:40,807 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12574 [2024-11-14 04:23:40,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:23:40,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:23:40,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:23:40,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:23:40,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:40" (1/1) ... [2024-11-14 04:23:40,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:40" (1/1) ... [2024-11-14 04:23:40,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:40" (1/1) ... [2024-11-14 04:23:40,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:40" (1/1) ... [2024-11-14 04:23:41,233 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:40" (1/1) ... [2024-11-14 04:23:41,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:40" (1/1) ... [2024-11-14 04:23:41,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:40" (1/1) ... [2024-11-14 04:23:41,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:40" (1/1) ... [2024-11-14 04:23:41,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:23:41,597 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:23:41,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:23:41,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:23:41,600 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:40" (1/1) ... [2024-11-14 04:23:41,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:23:41,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:23:41,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:23:41,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:23:41,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:23:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-14 04:23:41,712 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-14 04:23:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-14 04:23:41,713 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-14 04:23:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-14 04:23:41,713 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-14 04:23:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-14 04:23:41,713 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-14 04:23:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-14 04:23:41,713 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-14 04:23:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-14 04:23:41,714 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-14 04:23:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:23:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-14 04:23:41,714 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-14 04:23:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:23:41,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:23:41,870 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:23:41,872 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:23:54,940 INFO L? ?]: Removed 1693 outVars from TransFormulas that were not future-live. [2024-11-14 04:23:54,940 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:23:58,005 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:23:58,006 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-14 04:23:58,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:23:58 BoogieIcfgContainer [2024-11-14 04:23:58,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:23:58,011 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:23:58,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:23:58,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:23:58,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:23:35" (1/3) ... [2024-11-14 04:23:58,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f01b224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:23:58, skipping insertion in model container [2024-11-14 04:23:58,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:23:40" (2/3) ... [2024-11-14 04:23:58,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f01b224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:23:58, skipping insertion in model container [2024-11-14 04:23:58,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:23:58" (3/3) ... [2024-11-14 04:23:58,022 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.01.cil-2.c [2024-11-14 04:23:58,045 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:23:58,047 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label45+token_ring.01.cil-2.c that has 8 procedures, 1718 locations, 1 initial locations, 5 loop locations, and 2 error locations. [2024-11-14 04:23:58,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:23:58,239 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@637731d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:23:58,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-14 04:23:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 1718 states, 1691 states have (on average 1.978119455943229) internal successors, (3345), 1696 states have internal predecessors, (3345), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-14 04:23:58,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 04:23:58,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:23:58,270 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:23:58,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:23:58,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:23:58,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2147133138, now seen corresponding path program 1 times [2024-11-14 04:23:58,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:23:58,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087655603] [2024-11-14 04:23:58,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:23:58,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:23:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:23:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:23:59,003 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:23:59,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087655603] [2024-11-14 04:23:59,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087655603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:23:59,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:23:59,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:23:59,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932618487] [2024-11-14 04:23:59,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:23:59,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:23:59,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:23:59,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:23:59,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:23:59,053 INFO L87 Difference]: Start difference. First operand has 1718 states, 1691 states have (on average 1.978119455943229) internal successors, (3345), 1696 states have internal predecessors, (3345), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-14 04:24:00,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:00,262 INFO L93 Difference]: Finished difference Result 3487 states and 6837 transitions. [2024-11-14 04:24:00,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:24:00,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2024-11-14 04:24:00,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:00,285 INFO L225 Difference]: With dead ends: 3487 [2024-11-14 04:24:00,285 INFO L226 Difference]: Without dead ends: 1768 [2024-11-14 04:24:00,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:24:00,298 INFO L432 NwaCegarLoop]: 3192 mSDtfsCounter, 3428 mSDsluCounter, 3136 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3428 SdHoareTripleChecker+Valid, 6328 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:00,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3428 Valid, 6328 Invalid, 568 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 04:24:00,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2024-11-14 04:24:00,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1767. [2024-11-14 04:24:00,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1725 states have (on average 1.9582608695652175) internal successors, (3378), 1729 states have internal predecessors, (3378), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-14 04:24:00,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 3432 transitions. [2024-11-14 04:24:00,522 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 3432 transitions. Word has length 35 [2024-11-14 04:24:00,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:00,523 INFO L471 AbstractCegarLoop]: Abstraction has 1767 states and 3432 transitions. [2024-11-14 04:24:00,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-14 04:24:00,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 3432 transitions. [2024-11-14 04:24:00,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-14 04:24:00,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:00,533 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:00,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:24:00,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:24:00,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:00,535 INFO L85 PathProgramCache]: Analyzing trace with hash 2082730191, now seen corresponding path program 1 times [2024-11-14 04:24:00,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:00,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447417286] [2024-11-14 04:24:00,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:00,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 04:24:01,251 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:01,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447417286] [2024-11-14 04:24:01,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447417286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:01,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:24:01,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 04:24:01,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021584630] [2024-11-14 04:24:01,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:01,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:24:01,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:01,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:24:01,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:24:01,256 INFO L87 Difference]: Start difference. First operand 1767 states and 3432 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-14 04:24:02,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:02,731 INFO L93 Difference]: Finished difference Result 2005 states and 3736 transitions. [2024-11-14 04:24:02,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 04:24:02,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 61 [2024-11-14 04:24:02,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:02,746 INFO L225 Difference]: With dead ends: 2005 [2024-11-14 04:24:02,746 INFO L226 Difference]: Without dead ends: 1885 [2024-11-14 04:24:02,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-14 04:24:02,751 INFO L432 NwaCegarLoop]: 3143 mSDtfsCounter, 3449 mSDsluCounter, 9326 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3459 SdHoareTripleChecker+Valid, 12469 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:02,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3459 Valid, 12469 Invalid, 1086 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [74 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 04:24:02,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1885 states. [2024-11-14 04:24:02,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1885 to 1871. [2024-11-14 04:24:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1797 states have (on average 1.929326655537006) internal successors, (3467), 1802 states have internal predecessors, (3467), 48 states have call successors, (48), 25 states have call predecessors, (48), 24 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-14 04:24:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 3561 transitions. [2024-11-14 04:24:02,885 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 3561 transitions. Word has length 61 [2024-11-14 04:24:02,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:02,887 INFO L471 AbstractCegarLoop]: Abstraction has 1871 states and 3561 transitions. [2024-11-14 04:24:02,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-14 04:24:02,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 3561 transitions. [2024-11-14 04:24:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-14 04:24:02,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:02,894 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:02,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 04:24:02,894 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:24:02,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:02,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1169294931, now seen corresponding path program 1 times [2024-11-14 04:24:02,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:02,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59401221] [2024-11-14 04:24:02,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:02,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:03,064 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 04:24:03,064 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:03,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59401221] [2024-11-14 04:24:03,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59401221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:03,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:24:03,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:24:03,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499742587] [2024-11-14 04:24:03,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:03,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:24:03,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:03,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:24:03,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:24:03,068 INFO L87 Difference]: Start difference. First operand 1871 states and 3561 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-14 04:24:03,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:03,810 INFO L93 Difference]: Finished difference Result 2047 states and 3785 transitions. [2024-11-14 04:24:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:24:03,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2024-11-14 04:24:03,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:03,828 INFO L225 Difference]: With dead ends: 2047 [2024-11-14 04:24:03,828 INFO L226 Difference]: Without dead ends: 1925 [2024-11-14 04:24:03,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:24:03,831 INFO L432 NwaCegarLoop]: 3166 mSDtfsCounter, 27 mSDsluCounter, 3134 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6300 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:03,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6300 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 04:24:03,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2024-11-14 04:24:03,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1895. [2024-11-14 04:24:03,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1895 states, 1817 states have (on average 1.922399559713814) internal successors, (3493), 1822 states have internal predecessors, (3493), 50 states have call successors, (50), 27 states have call predecessors, (50), 26 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-14 04:24:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 3591 transitions. [2024-11-14 04:24:03,947 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 3591 transitions. Word has length 63 [2024-11-14 04:24:03,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:03,948 INFO L471 AbstractCegarLoop]: Abstraction has 1895 states and 3591 transitions. [2024-11-14 04:24:03,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-14 04:24:03,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 3591 transitions. [2024-11-14 04:24:03,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-14 04:24:03,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:03,952 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:03,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 04:24:03,952 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:24:03,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:03,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1656771891, now seen corresponding path program 1 times [2024-11-14 04:24:03,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:03,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926523062] [2024-11-14 04:24:03,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:03,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:04,067 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-14 04:24:04,068 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:04,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926523062] [2024-11-14 04:24:04,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926523062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:04,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:24:04,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:24:04,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676316522] [2024-11-14 04:24:04,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:04,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:24:04,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:04,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:24:04,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:24:04,070 INFO L87 Difference]: Start difference. First operand 1895 states and 3591 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-14 04:24:04,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:04,703 INFO L93 Difference]: Finished difference Result 2269 states and 4069 transitions. [2024-11-14 04:24:04,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:24:04,704 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), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 79 [2024-11-14 04:24:04,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:04,720 INFO L225 Difference]: With dead ends: 2269 [2024-11-14 04:24:04,721 INFO L226 Difference]: Without dead ends: 2020 [2024-11-14 04:24:04,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:24:04,725 INFO L432 NwaCegarLoop]: 3173 mSDtfsCounter, 3332 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3332 SdHoareTripleChecker+Valid, 3242 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:04,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3332 Valid, 3242 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 04:24:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2024-11-14 04:24:04,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 2013. [2024-11-14 04:24:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2013 states, 1901 states have (on average 1.8905839032088374) internal successors, (3594), 1907 states have internal predecessors, (3594), 71 states have call successors, (71), 40 states have call predecessors, (71), 39 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-14 04:24:04,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 3734 transitions. [2024-11-14 04:24:04,831 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 3734 transitions. Word has length 79 [2024-11-14 04:24:04,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:04,832 INFO L471 AbstractCegarLoop]: Abstraction has 2013 states and 3734 transitions. [2024-11-14 04:24:04,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-14 04:24:04,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 3734 transitions. [2024-11-14 04:24:04,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-14 04:24:04,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:04,837 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1] [2024-11-14 04:24:04,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 04:24:04,837 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:24:04,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:04,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1840716197, now seen corresponding path program 1 times [2024-11-14 04:24:04,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:04,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260993500] [2024-11-14 04:24:04,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:04,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-14 04:24:05,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:05,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260993500] [2024-11-14 04:24:05,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260993500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:05,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913002096] [2024-11-14 04:24:05,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:05,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:24:05,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:24:05,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:24:05,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 04:24:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:05,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:24:05,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 04:24:05,395 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:24:05,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913002096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:05,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:24:05,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-14 04:24:05,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631680384] [2024-11-14 04:24:05,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:05,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:24:05,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:05,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:24:05,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:24:05,397 INFO L87 Difference]: Start difference. First operand 2013 states and 3734 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-14 04:24:06,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:06,110 INFO L93 Difference]: Finished difference Result 2267 states and 4070 transitions. [2024-11-14 04:24:06,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:24:06,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 91 [2024-11-14 04:24:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:06,124 INFO L225 Difference]: With dead ends: 2267 [2024-11-14 04:24:06,124 INFO L226 Difference]: Without dead ends: 2019 [2024-11-14 04:24:06,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:24:06,127 INFO L432 NwaCegarLoop]: 3159 mSDtfsCounter, 66 mSDsluCounter, 3126 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 6285 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:06,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 6285 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 04:24:06,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2024-11-14 04:24:06,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 2011. [2024-11-14 04:24:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2011 states, 1899 states have (on average 1.886255924170616) internal successors, (3582), 1905 states have internal predecessors, (3582), 71 states have call successors, (71), 40 states have call predecessors, (71), 39 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-14 04:24:06,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 3722 transitions. [2024-11-14 04:24:06,394 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 3722 transitions. Word has length 91 [2024-11-14 04:24:06,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:06,396 INFO L471 AbstractCegarLoop]: Abstraction has 2011 states and 3722 transitions. [2024-11-14 04:24:06,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-14 04:24:06,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 3722 transitions. [2024-11-14 04:24:06,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-14 04:24:06,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:06,399 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:06,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 04:24:06,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:24:06,600 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:24:06,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:06,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1242154821, now seen corresponding path program 1 times [2024-11-14 04:24:06,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:06,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409340675] [2024-11-14 04:24:06,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:06,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:06,883 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-14 04:24:06,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:06,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409340675] [2024-11-14 04:24:06,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409340675] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:06,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209666866] [2024-11-14 04:24:06,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:06,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:24:06,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:24:06,887 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:24:06,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 04:24:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:07,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 04:24:07,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:07,086 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 04:24:07,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:24:07,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209666866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:07,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:24:07,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-14 04:24:07,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144966556] [2024-11-14 04:24:07,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:07,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:24:07,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:07,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:24:07,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:24:07,090 INFO L87 Difference]: Start difference. First operand 2011 states and 3722 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-14 04:24:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:07,623 INFO L93 Difference]: Finished difference Result 2316 states and 4095 transitions. [2024-11-14 04:24:07,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:24:07,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 91 [2024-11-14 04:24:07,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:07,637 INFO L225 Difference]: With dead ends: 2316 [2024-11-14 04:24:07,637 INFO L226 Difference]: Without dead ends: 2072 [2024-11-14 04:24:07,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:24:07,640 INFO L432 NwaCegarLoop]: 3140 mSDtfsCounter, 3342 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3342 SdHoareTripleChecker+Valid, 3154 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:07,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3342 Valid, 3154 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 04:24:07,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2024-11-14 04:24:07,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 2072. [2024-11-14 04:24:07,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2072 states, 1950 states have (on average 1.8646153846153846) internal successors, (3636), 1956 states have internal predecessors, (3636), 73 states have call successors, (73), 48 states have call predecessors, (73), 47 states have return successors, (71), 68 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-14 04:24:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 3780 transitions. [2024-11-14 04:24:07,730 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 3780 transitions. Word has length 91 [2024-11-14 04:24:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:07,730 INFO L471 AbstractCegarLoop]: Abstraction has 2072 states and 3780 transitions. [2024-11-14 04:24:07,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-14 04:24:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 3780 transitions. [2024-11-14 04:24:07,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-14 04:24:07,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:07,733 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:07,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 04:24:07,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:24:07,934 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:24:07,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:07,935 INFO L85 PathProgramCache]: Analyzing trace with hash -53170168, now seen corresponding path program 1 times [2024-11-14 04:24:07,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:07,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233174434] [2024-11-14 04:24:07,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:07,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-14 04:24:08,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:08,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233174434] [2024-11-14 04:24:08,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233174434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:08,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981880003] [2024-11-14 04:24:08,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:08,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:24:08,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:24:08,170 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:24:08,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 04:24:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:08,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:24:08,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:08,358 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 04:24:08,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:24:08,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981880003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:08,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:24:08,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-14 04:24:08,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185797652] [2024-11-14 04:24:08,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:08,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:24:08,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:08,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:24:08,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:24:08,363 INFO L87 Difference]: Start difference. First operand 2072 states and 3780 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-14 04:24:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:09,025 INFO L93 Difference]: Finished difference Result 2648 states and 4464 transitions. [2024-11-14 04:24:09,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:24:09,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 92 [2024-11-14 04:24:09,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:09,036 INFO L225 Difference]: With dead ends: 2648 [2024-11-14 04:24:09,037 INFO L226 Difference]: Without dead ends: 2223 [2024-11-14 04:24:09,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:24:09,040 INFO L432 NwaCegarLoop]: 3149 mSDtfsCounter, 40 mSDsluCounter, 3117 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 6266 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:09,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 6266 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 04:24:09,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2024-11-14 04:24:09,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 2111. [2024-11-14 04:24:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2111 states, 1979 states have (on average 1.854977261243052) internal successors, (3671), 1986 states have internal predecessors, (3671), 78 states have call successors, (78), 53 states have call predecessors, (78), 52 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-14 04:24:09,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3825 transitions. [2024-11-14 04:24:09,148 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3825 transitions. Word has length 92 [2024-11-14 04:24:09,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:09,149 INFO L471 AbstractCegarLoop]: Abstraction has 2111 states and 3825 transitions. [2024-11-14 04:24:09,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-14 04:24:09,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3825 transitions. [2024-11-14 04:24:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-14 04:24:09,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:09,157 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:09,182 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 04:24:09,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-14 04:24:09,361 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:24:09,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:09,362 INFO L85 PathProgramCache]: Analyzing trace with hash -507588121, now seen corresponding path program 1 times [2024-11-14 04:24:09,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:09,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409756376] [2024-11-14 04:24:09,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:09,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:09,486 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-14 04:24:09,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:09,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409756376] [2024-11-14 04:24:09,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409756376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:09,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126612175] [2024-11-14 04:24:09,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:09,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:24:09,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:24:09,491 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:24:09,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 04:24:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:09,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 04:24:09,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 04:24:09,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:24:09,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126612175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:09,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:24:09,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-14 04:24:09,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613061618] [2024-11-14 04:24:09,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:09,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:24:09,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:09,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:24:09,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:24:09,667 INFO L87 Difference]: Start difference. First operand 2111 states and 3825 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-14 04:24:10,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:10,295 INFO L93 Difference]: Finished difference Result 2522 states and 4318 transitions. [2024-11-14 04:24:10,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:24:10,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 92 [2024-11-14 04:24:10,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:10,306 INFO L225 Difference]: With dead ends: 2522 [2024-11-14 04:24:10,306 INFO L226 Difference]: Without dead ends: 2216 [2024-11-14 04:24:10,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:24:10,309 INFO L432 NwaCegarLoop]: 3167 mSDtfsCounter, 43 mSDsluCounter, 3135 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 6302 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:10,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 6302 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 04:24:10,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2024-11-14 04:24:10,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2147. [2024-11-14 04:24:10,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2147 states, 2007 states have (on average 1.8470353761833582) internal successors, (3707), 2014 states have internal predecessors, (3707), 82 states have call successors, (82), 57 states have call predecessors, (82), 56 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-14 04:24:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 3869 transitions. [2024-11-14 04:24:10,401 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 3869 transitions. Word has length 92 [2024-11-14 04:24:10,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:10,401 INFO L471 AbstractCegarLoop]: Abstraction has 2147 states and 3869 transitions. [2024-11-14 04:24:10,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-14 04:24:10,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 3869 transitions. [2024-11-14 04:24:10,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-14 04:24:10,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:10,405 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:10,429 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 04:24:10,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-14 04:24:10,606 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:24:10,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1135543408, now seen corresponding path program 1 times [2024-11-14 04:24:10,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:10,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125338906] [2024-11-14 04:24:10,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:10,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-14 04:24:10,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:10,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125338906] [2024-11-14 04:24:10,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125338906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:10,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:24:10,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:24:10,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822990345] [2024-11-14 04:24:10,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:10,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:24:10,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:10,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:24:10,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:24:10,816 INFO L87 Difference]: Start difference. First operand 2147 states and 3869 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-14 04:24:11,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:11,734 INFO L93 Difference]: Finished difference Result 2928 states and 4804 transitions. [2024-11-14 04:24:11,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:24:11,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 94 [2024-11-14 04:24:11,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:11,747 INFO L225 Difference]: With dead ends: 2928 [2024-11-14 04:24:11,747 INFO L226 Difference]: Without dead ends: 2665 [2024-11-14 04:24:11,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:24:11,750 INFO L432 NwaCegarLoop]: 3189 mSDtfsCounter, 3406 mSDsluCounter, 3143 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3406 SdHoareTripleChecker+Valid, 6332 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:11,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3406 Valid, 6332 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 04:24:11,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2024-11-14 04:24:11,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2460. [2024-11-14 04:24:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2460 states, 2234 states have (on average 1.7815577439570278) internal successors, (3980), 2240 states have internal predecessors, (3980), 133 states have call successors, (133), 92 states have call predecessors, (133), 91 states have return successors, (131), 128 states have call predecessors, (131), 131 states have call successors, (131) [2024-11-14 04:24:11,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 4244 transitions. [2024-11-14 04:24:11,910 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 4244 transitions. Word has length 94 [2024-11-14 04:24:11,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:11,911 INFO L471 AbstractCegarLoop]: Abstraction has 2460 states and 4244 transitions. [2024-11-14 04:24:11,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-14 04:24:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 4244 transitions. [2024-11-14 04:24:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-14 04:24:11,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:11,918 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:11,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 04:24:11,918 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:24:11,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:11,922 INFO L85 PathProgramCache]: Analyzing trace with hash 670798560, now seen corresponding path program 1 times [2024-11-14 04:24:11,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:11,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321596954] [2024-11-14 04:24:11,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:11,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-14 04:24:12,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:24:12,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321596954] [2024-11-14 04:24:12,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321596954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:24:12,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825791781] [2024-11-14 04:24:12,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:12,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:24:12,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:24:12,219 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:24:12,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 04:24:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:24:12,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 04:24:12,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:24:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 04:24:12,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:24:12,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825791781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:24:12,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:24:12,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-14 04:24:12,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696714182] [2024-11-14 04:24:12,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:24:12,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:24:12,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:24:12,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:24:12,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-14 04:24:12,511 INFO L87 Difference]: Start difference. First operand 2460 states and 4244 transitions. Second operand has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-14 04:24:13,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:24:13,927 INFO L93 Difference]: Finished difference Result 2951 states and 4834 transitions. [2024-11-14 04:24:13,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:24:13,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 101 [2024-11-14 04:24:13,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:24:13,943 INFO L225 Difference]: With dead ends: 2951 [2024-11-14 04:24:13,943 INFO L226 Difference]: Without dead ends: 2447 [2024-11-14 04:24:13,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-14 04:24:13,946 INFO L432 NwaCegarLoop]: 3160 mSDtfsCounter, 37 mSDsluCounter, 12602 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 15762 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:24:13,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 15762 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 04:24:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2024-11-14 04:24:14,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 2422. [2024-11-14 04:24:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2422 states, 2207 states have (on average 1.7879474399637516) internal successors, (3946), 2213 states have internal predecessors, (3946), 126 states have call successors, (126), 88 states have call predecessors, (126), 87 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-14 04:24:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 4196 transitions. [2024-11-14 04:24:14,107 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 4196 transitions. Word has length 101 [2024-11-14 04:24:14,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:24:14,108 INFO L471 AbstractCegarLoop]: Abstraction has 2422 states and 4196 transitions. [2024-11-14 04:24:14,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-14 04:24:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 4196 transitions. [2024-11-14 04:24:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-14 04:24:14,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:24:14,113 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:14,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 04:24:14,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:24:14,317 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:24:14,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:24:14,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1228381098, now seen corresponding path program 1 times [2024-11-14 04:24:14,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:24:14,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241586134] [2024-11-14 04:24:14,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:24:14,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:24:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:24:14,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 04:24:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:24:14,417 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 04:24:14,417 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 04:24:14,418 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-14 04:24:14,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-14 04:24:14,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 04:24:14,426 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:24:14,572 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 04:24:14,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:24:14 BoogieIcfgContainer [2024-11-14 04:24:14,579 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 04:24:14,580 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 04:24:14,580 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 04:24:14,580 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 04:24:14,582 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:23:58" (3/4) ... [2024-11-14 04:24:14,583 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-14 04:24:14,740 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-14 04:24:14,740 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 04:24:14,741 INFO L158 Benchmark]: Toolchain (without parser) took 39198.61ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 85.0MB in the beginning and 991.8MB in the end (delta: -906.7MB). Peak memory consumption was 333.4MB. Max. memory is 16.1GB. [2024-11-14 04:24:14,742 INFO L158 Benchmark]: CDTParser took 1.33ms. Allocated memory is still 142.6MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:24:14,742 INFO L158 Benchmark]: CACSL2BoogieTranslator took 4518.02ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 84.8MB in the beginning and 60.7MB in the end (delta: 24.1MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. [2024-11-14 04:24:14,742 INFO L158 Benchmark]: Boogie Procedure Inliner took 745.55ms. Allocated memory was 201.3MB in the beginning and 218.1MB in the end (delta: 16.8MB). Free memory was 60.7MB in the beginning and 77.0MB in the end (delta: -16.2MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2024-11-14 04:24:14,743 INFO L158 Benchmark]: Boogie Preprocessor took 785.09ms. Allocated memory was 218.1MB in the beginning and 755.0MB in the end (delta: 536.9MB). Free memory was 77.0MB in the beginning and 579.3MB in the end (delta: -502.4MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2024-11-14 04:24:14,743 INFO L158 Benchmark]: RCFGBuilder took 16410.34ms. Allocated memory was 755.0MB in the beginning and 1.4GB in the end (delta: 629.1MB). Free memory was 579.3MB in the beginning and 999.6MB in the end (delta: -420.2MB). Peak memory consumption was 484.2MB. Max. memory is 16.1GB. [2024-11-14 04:24:14,744 INFO L158 Benchmark]: TraceAbstraction took 16568.10ms. Allocated memory is still 1.4GB. Free memory was 999.6MB in the beginning and 1.0GB in the end (delta: -4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:24:14,744 INFO L158 Benchmark]: Witness Printer took 160.36ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 991.8MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 04:24:14,746 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.33ms. Allocated memory is still 142.6MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 4518.02ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 84.8MB in the beginning and 60.7MB in the end (delta: 24.1MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 745.55ms. Allocated memory was 201.3MB in the beginning and 218.1MB in the end (delta: 16.8MB). Free memory was 60.7MB in the beginning and 77.0MB in the end (delta: -16.2MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 785.09ms. Allocated memory was 218.1MB in the beginning and 755.0MB in the end (delta: 536.9MB). Free memory was 77.0MB in the beginning and 579.3MB in the end (delta: -502.4MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. * RCFGBuilder took 16410.34ms. Allocated memory was 755.0MB in the beginning and 1.4GB in the end (delta: 629.1MB). Free memory was 579.3MB in the beginning and 999.6MB in the end (delta: -420.2MB). Peak memory consumption was 484.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16568.10ms. Allocated memory is still 1.4GB. Free memory was 999.6MB in the beginning and 1.0GB in the end (delta: -4.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 160.36ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 991.8MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11424] COND FALSE !(M_E == 0) [L11429] COND FALSE !(T1_E == 0) [L11434] COND FALSE !(E_M == 0) [L11439] COND FALSE !(E_1 == 0) [L11588] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) [L11589] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11452] COND FALSE !(M_E == 1) [L11457] COND FALSE !(T1_E == 1) [L11462] COND FALSE !(E_M == 1) [L11467] COND FALSE !(E_1 == 1) [L11590] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11593] COND TRUE 1 [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11208] COND TRUE 1 [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 [L11272] token += 1 [L11273] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) [L11506] RET activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) [L11227] COND TRUE tmp_var <= 5 [L11228] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11236] CALL error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 11088]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 1718 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17181 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17170 mSDsluCounter, 72440 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40802 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5663 IncrementalHoareTripleChecker+Invalid, 5765 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 31638 mSDtfsCounter, 5663 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 537 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2460occurred in iteration=9, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 471 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1363 NumberOfCodeBlocks, 1363 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1251 ConstructedInterpolants, 0 QuantifiedInterpolants, 1858 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1758 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 15 InterpolantComputations, 10 PerfectInterpolantSequences, 612/669 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-14 04:24:14,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6101e5b-3948-44c9-aa50-5589a9606b1a/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE