./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix046.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2b123d9-cc1f-452d-a89c-473cac2e083a/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2b123d9-cc1f-452d-a89c-473cac2e083a/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2b123d9-cc1f-452d-a89c-473cac2e083a/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2b123d9-cc1f-452d-a89c-473cac2e083a/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix046.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2b123d9-cc1f-452d-a89c-473cac2e083a/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2b123d9-cc1f-452d-a89c-473cac2e083a/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 01:54:56,077 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 01:54:56,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 01:54:56,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 01:54:56,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 01:54:56,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 01:54:56,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 01:54:56,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 01:54:56,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 01:54:56,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 01:54:56,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 01:54:56,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 01:54:56,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 01:54:56,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 01:54:56,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 01:54:56,148 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 01:54:56,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 01:54:56,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 01:54:56,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 01:54:56,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 01:54:56,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 01:54:56,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 01:54:56,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 01:54:56,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 01:54:56,175 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 01:54:56,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 01:54:56,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 01:54:56,178 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 01:54:56,179 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 01:54:56,180 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 01:54:56,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 01:54:56,181 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 01:54:56,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 01:54:56,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 01:54:56,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 01:54:56,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 01:54:56,187 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 01:54:56,187 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 01:54:56,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 01:54:56,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 01:54:56,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 01:54:56,191 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2b123d9-cc1f-452d-a89c-473cac2e083a/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 01:54:56,226 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 01:54:56,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 01:54:56,227 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 01:54:56,228 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 01:54:56,228 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 01:54:56,229 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 01:54:56,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 01:54:56,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 01:54:56,230 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 01:54:56,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 01:54:56,232 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 01:54:56,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 01:54:56,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 01:54:56,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 01:54:56,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 01:54:56,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 01:54:56,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 01:54:56,234 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 01:54:56,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 01:54:56,234 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 01:54:56,235 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 01:54:56,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 01:54:56,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 01:54:56,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 01:54:56,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:54:56,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 01:54:56,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 01:54:56,237 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 01:54:56,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 01:54:56,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 01:54:56,238 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 01:54:56,238 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 01:54:56,238 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 01:54:56,239 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 01:54:56,239 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2b123d9-cc1f-452d-a89c-473cac2e083a/bin/uautomizer-QkZJyEgLgS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2b123d9-cc1f-452d-a89c-473cac2e083a/bin/uautomizer-QkZJyEgLgS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 [2022-11-23 01:54:56,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 01:54:56,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 01:54:56,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 01:54:56,583 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 01:54:56,584 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 01:54:56,585 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2b123d9-cc1f-452d-a89c-473cac2e083a/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/mix046.opt.i [2022-11-23 01:54:59,711 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 01:54:59,955 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 01:54:59,956 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2b123d9-cc1f-452d-a89c-473cac2e083a/sv-benchmarks/c/pthread-wmm/mix046.opt.i [2022-11-23 01:54:59,987 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2b123d9-cc1f-452d-a89c-473cac2e083a/bin/uautomizer-QkZJyEgLgS/data/d19dfa1c6/4b3bcaa828aa486e9332e4bc3d7648b4/FLAGf3ce1aeaa [2022-11-23 01:55:00,007 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2b123d9-cc1f-452d-a89c-473cac2e083a/bin/uautomizer-QkZJyEgLgS/data/d19dfa1c6/4b3bcaa828aa486e9332e4bc3d7648b4 [2022-11-23 01:55:00,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 01:55:00,011 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 01:55:00,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 01:55:00,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 01:55:00,020 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 01:55:00,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:55:00" (1/1) ... [2022-11-23 01:55:00,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f4636a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:00, skipping insertion in model container [2022-11-23 01:55:00,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:55:00" (1/1) ... [2022-11-23 01:55:00,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 01:55:00,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 01:55:00,239 WARN L237 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_f2b123d9-cc1f-452d-a89c-473cac2e083a/sv-benchmarks/c/pthread-wmm/mix046.opt.i[944,957] [2022-11-23 01:55:00,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:55:00,578 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 01:55:00,591 WARN L237 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_f2b123d9-cc1f-452d-a89c-473cac2e083a/sv-benchmarks/c/pthread-wmm/mix046.opt.i[944,957] [2022-11-23 01:55:00,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:55:00,704 INFO L208 MainTranslator]: Completed translation [2022-11-23 01:55:00,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:00 WrapperNode [2022-11-23 01:55:00,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 01:55:00,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 01:55:00,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 01:55:00,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 01:55:00,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:00" (1/1) ... [2022-11-23 01:55:00,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:00" (1/1) ... [2022-11-23 01:55:00,798 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2022-11-23 01:55:00,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 01:55:00,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 01:55:00,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 01:55:00,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 01:55:00,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:00" (1/1) ... [2022-11-23 01:55:00,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:00" (1/1) ... [2022-11-23 01:55:00,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:00" (1/1) ... [2022-11-23 01:55:00,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:00" (1/1) ... [2022-11-23 01:55:00,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:00" (1/1) ... [2022-11-23 01:55:00,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:00" (1/1) ... [2022-11-23 01:55:00,855 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:00" (1/1) ... [2022-11-23 01:55:00,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:00" (1/1) ... [2022-11-23 01:55:00,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 01:55:00,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 01:55:00,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 01:55:00,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 01:55:00,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:00" (1/1) ... [2022-11-23 01:55:00,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:55:00,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2b123d9-cc1f-452d-a89c-473cac2e083a/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:55:00,907 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2b123d9-cc1f-452d-a89c-473cac2e083a/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 01:55:00,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2b123d9-cc1f-452d-a89c-473cac2e083a/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 01:55:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 01:55:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 01:55:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 01:55:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 01:55:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 01:55:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 01:55:00,953 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 01:55:00,953 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 01:55:00,954 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 01:55:00,954 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 01:55:00,954 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 01:55:00,954 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 01:55:00,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 01:55:00,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 01:55:00,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 01:55:00,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 01:55:00,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 01:55:00,957 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 01:55:01,134 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 01:55:01,137 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 01:55:01,579 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 01:55:01,777 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 01:55:01,777 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 01:55:01,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:55:01 BoogieIcfgContainer [2022-11-23 01:55:01,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 01:55:01,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 01:55:01,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 01:55:01,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 01:55:01,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:55:00" (1/3) ... [2022-11-23 01:55:01,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18350a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:55:01, skipping insertion in model container [2022-11-23 01:55:01,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:55:00" (2/3) ... [2022-11-23 01:55:01,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18350a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:55:01, skipping insertion in model container [2022-11-23 01:55:01,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:55:01" (3/3) ... [2022-11-23 01:55:01,790 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.opt.i [2022-11-23 01:55:01,799 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 01:55:01,810 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 01:55:01,810 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 01:55:01,810 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 01:55:01,872 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 01:55:01,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-11-23 01:55:02,008 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-23 01:55:02,008 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:55:02,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-23 01:55:02,015 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-11-23 01:55:02,020 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-11-23 01:55:02,024 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 01:55:02,055 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 133 transitions, 278 flow [2022-11-23 01:55:02,058 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 133 transitions, 278 flow [2022-11-23 01:55:02,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 278 flow [2022-11-23 01:55:02,125 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-23 01:55:02,128 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:55:02,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-23 01:55:02,134 INFO L119 LiptonReduction]: Number of co-enabled transitions 3168 [2022-11-23 01:55:09,549 INFO L134 LiptonReduction]: Checked pairs total: 7829 [2022-11-23 01:55:09,549 INFO L136 LiptonReduction]: Total number of compositions: 120 [2022-11-23 01:55:09,578 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 01:55:09,588 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@672ac7ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 01:55:09,588 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-23 01:55:09,596 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-11-23 01:55:09,596 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 01:55:09,597 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:55:09,598 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:55:09,599 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 01:55:09,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:55:09,605 INFO L85 PathProgramCache]: Analyzing trace with hash 422581805, now seen corresponding path program 1 times [2022-11-23 01:55:09,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:55:09,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211288725] [2022-11-23 01:55:09,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:55:09,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:55:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:55:10,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:55:10,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:55:10,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211288725] [2022-11-23 01:55:10,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211288725] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:55:10,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:55:10,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 01:55:10,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410249411] [2022-11-23 01:55:10,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:55:10,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 01:55:10,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:55:10,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 01:55:10,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 01:55:10,288 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 257 [2022-11-23 01:55:10,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:10,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:55:10,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 257 [2022-11-23 01:55:10,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:55:11,066 INFO L130 PetriNetUnfolder]: 2594/3793 cut-off events. [2022-11-23 01:55:11,067 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-11-23 01:55:11,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7488 conditions, 3793 events. 2594/3793 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20164 event pairs, 518 based on Foata normal form. 0/3600 useless extension candidates. Maximal degree in co-relation 7476. Up to 2797 conditions per place. [2022-11-23 01:55:11,097 INFO L137 encePairwiseOnDemand]: 253/257 looper letters, 30 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2022-11-23 01:55:11,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 156 flow [2022-11-23 01:55:11,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 01:55:11,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 01:55:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2022-11-23 01:55:11,119 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5265888456549935 [2022-11-23 01:55:11,120 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2022-11-23 01:55:11,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2022-11-23 01:55:11,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:55:11,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2022-11-23 01:55:11,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:11,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:11,143 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:11,145 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 406 transitions. [2022-11-23 01:55:11,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 156 flow [2022-11-23 01:55:11,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-23 01:55:11,156 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2022-11-23 01:55:11,158 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-11-23 01:55:11,162 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-11-23 01:55:11,163 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2022-11-23 01:55:11,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:11,165 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:55:11,165 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:55:11,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 01:55:11,166 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 01:55:11,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:55:11,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1920687172, now seen corresponding path program 1 times [2022-11-23 01:55:11,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:55:11,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831941366] [2022-11-23 01:55:11,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:55:11,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:55:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:55:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:55:11,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:55:11,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831941366] [2022-11-23 01:55:11,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831941366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:55:11,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:55:11,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 01:55:11,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232009753] [2022-11-23 01:55:11,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:55:11,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 01:55:11,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:55:11,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 01:55:11,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 01:55:11,503 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 257 [2022-11-23 01:55:11,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:11,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:55:11,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 257 [2022-11-23 01:55:11,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:55:12,110 INFO L130 PetriNetUnfolder]: 2751/4031 cut-off events. [2022-11-23 01:55:12,110 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-11-23 01:55:12,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8157 conditions, 4031 events. 2751/4031 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21066 event pairs, 543 based on Foata normal form. 30/4051 useless extension candidates. Maximal degree in co-relation 8147. Up to 3508 conditions per place. [2022-11-23 01:55:12,142 INFO L137 encePairwiseOnDemand]: 253/257 looper letters, 35 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2022-11-23 01:55:12,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 176 flow [2022-11-23 01:55:12,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 01:55:12,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 01:55:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2022-11-23 01:55:12,144 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5214007782101168 [2022-11-23 01:55:12,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2022-11-23 01:55:12,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2022-11-23 01:55:12,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:55:12,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2022-11-23 01:55:12,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:12,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:12,150 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:12,150 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 402 transitions. [2022-11-23 01:55:12,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 176 flow [2022-11-23 01:55:12,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 01:55:12,153 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 79 flow [2022-11-23 01:55:12,154 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2022-11-23 01:55:12,155 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-11-23 01:55:12,155 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 79 flow [2022-11-23 01:55:12,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:12,156 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:55:12,156 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:55:12,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 01:55:12,157 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 01:55:12,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:55:12,157 INFO L85 PathProgramCache]: Analyzing trace with hash 588238620, now seen corresponding path program 1 times [2022-11-23 01:55:12,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:55:12,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035224691] [2022-11-23 01:55:12,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:55:12,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:55:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:55:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:55:12,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:55:12,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035224691] [2022-11-23 01:55:12,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035224691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:55:12,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:55:12,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 01:55:12,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568775626] [2022-11-23 01:55:12,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:55:12,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 01:55:12,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:55:12,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:55:12,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:55:12,732 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2022-11-23 01:55:12,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 79 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:12,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:55:12,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2022-11-23 01:55:12,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:55:13,779 INFO L130 PetriNetUnfolder]: 5255/7312 cut-off events. [2022-11-23 01:55:13,779 INFO L131 PetriNetUnfolder]: For 964/964 co-relation queries the response was YES. [2022-11-23 01:55:13,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16063 conditions, 7312 events. 5255/7312 cut-off events. For 964/964 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 34594 event pairs, 1343 based on Foata normal form. 240/7544 useless extension candidates. Maximal degree in co-relation 16052. Up to 4361 conditions per place. [2022-11-23 01:55:13,831 INFO L137 encePairwiseOnDemand]: 247/257 looper letters, 42 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2022-11-23 01:55:13,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 245 flow [2022-11-23 01:55:13,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 01:55:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 01:55:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2022-11-23 01:55:13,834 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4805447470817121 [2022-11-23 01:55:13,834 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 494 transitions. [2022-11-23 01:55:13,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 494 transitions. [2022-11-23 01:55:13,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:55:13,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 494 transitions. [2022-11-23 01:55:13,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:13,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:13,840 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:13,840 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 79 flow. Second operand 4 states and 494 transitions. [2022-11-23 01:55:13,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 245 flow [2022-11-23 01:55:13,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 01:55:13,844 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 158 flow [2022-11-23 01:55:13,844 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2022-11-23 01:55:13,845 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2022-11-23 01:55:13,845 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 158 flow [2022-11-23 01:55:13,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:13,846 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:55:13,846 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:55:13,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 01:55:13,847 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 01:55:13,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:55:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash -313620290, now seen corresponding path program 1 times [2022-11-23 01:55:13,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:55:13,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728241995] [2022-11-23 01:55:13,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:55:13,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:55:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:55:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:55:15,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:55:15,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728241995] [2022-11-23 01:55:15,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728241995] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:55:15,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:55:15,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:55:15,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076728768] [2022-11-23 01:55:15,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:55:15,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 01:55:15,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:55:15,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 01:55:15,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:55:15,228 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 257 [2022-11-23 01:55:15,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:15,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:55:15,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 257 [2022-11-23 01:55:15,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:55:16,696 INFO L130 PetriNetUnfolder]: 6565/9150 cut-off events. [2022-11-23 01:55:16,696 INFO L131 PetriNetUnfolder]: For 5846/5902 co-relation queries the response was YES. [2022-11-23 01:55:16,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25047 conditions, 9150 events. 6565/9150 cut-off events. For 5846/5902 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 44557 event pairs, 890 based on Foata normal form. 120/9254 useless extension candidates. Maximal degree in co-relation 25032. Up to 6569 conditions per place. [2022-11-23 01:55:16,790 INFO L137 encePairwiseOnDemand]: 248/257 looper letters, 66 selfloop transitions, 16 changer transitions 0/86 dead transitions. [2022-11-23 01:55:16,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 86 transitions, 510 flow [2022-11-23 01:55:16,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:55:16,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 01:55:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 635 transitions. [2022-11-23 01:55:16,795 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49416342412451364 [2022-11-23 01:55:16,795 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 635 transitions. [2022-11-23 01:55:16,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 635 transitions. [2022-11-23 01:55:16,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:55:16,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 635 transitions. [2022-11-23 01:55:16,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:16,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:16,802 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:16,802 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 158 flow. Second operand 5 states and 635 transitions. [2022-11-23 01:55:16,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 86 transitions, 510 flow [2022-11-23 01:55:16,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 86 transitions, 502 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-23 01:55:16,843 INFO L231 Difference]: Finished difference. Result has 48 places, 51 transitions, 291 flow [2022-11-23 01:55:16,844 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=48, PETRI_TRANSITIONS=51} [2022-11-23 01:55:16,846 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2022-11-23 01:55:16,846 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 51 transitions, 291 flow [2022-11-23 01:55:16,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:16,847 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:55:16,847 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:55:16,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 01:55:16,847 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 01:55:16,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:55:16,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1060224558, now seen corresponding path program 1 times [2022-11-23 01:55:16,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:55:16,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551188954] [2022-11-23 01:55:16,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:55:16,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:55:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:55:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:55:17,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:55:17,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551188954] [2022-11-23 01:55:17,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551188954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:55:17,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:55:17,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 01:55:17,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474335835] [2022-11-23 01:55:17,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:55:17,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 01:55:17,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:55:17,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 01:55:17,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-23 01:55:17,738 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 257 [2022-11-23 01:55:17,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 51 transitions, 291 flow. Second operand has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:17,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:55:17,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 257 [2022-11-23 01:55:17,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:55:19,878 INFO L130 PetriNetUnfolder]: 8789/12086 cut-off events. [2022-11-23 01:55:19,879 INFO L131 PetriNetUnfolder]: For 12090/12090 co-relation queries the response was YES. [2022-11-23 01:55:19,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39352 conditions, 12086 events. 8789/12086 cut-off events. For 12090/12090 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 58863 event pairs, 481 based on Foata normal form. 64/12150 useless extension candidates. Maximal degree in co-relation 39334. Up to 7323 conditions per place. [2022-11-23 01:55:19,979 INFO L137 encePairwiseOnDemand]: 245/257 looper letters, 95 selfloop transitions, 62 changer transitions 0/157 dead transitions. [2022-11-23 01:55:19,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 157 transitions, 1074 flow [2022-11-23 01:55:19,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 01:55:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 01:55:19,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 965 transitions. [2022-11-23 01:55:19,983 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4693579766536965 [2022-11-23 01:55:19,984 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 965 transitions. [2022-11-23 01:55:19,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 965 transitions. [2022-11-23 01:55:19,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:55:19,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 965 transitions. [2022-11-23 01:55:19,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.625) internal successors, (965), 8 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:19,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 257.0) internal successors, (2313), 9 states have internal predecessors, (2313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:19,992 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 257.0) internal successors, (2313), 9 states have internal predecessors, (2313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:19,992 INFO L175 Difference]: Start difference. First operand has 48 places, 51 transitions, 291 flow. Second operand 8 states and 965 transitions. [2022-11-23 01:55:19,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 157 transitions, 1074 flow [2022-11-23 01:55:20,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 157 transitions, 1074 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 01:55:20,005 INFO L231 Difference]: Finished difference. Result has 61 places, 102 transitions, 887 flow [2022-11-23 01:55:20,006 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=887, PETRI_PLACES=61, PETRI_TRANSITIONS=102} [2022-11-23 01:55:20,006 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2022-11-23 01:55:20,007 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 102 transitions, 887 flow [2022-11-23 01:55:20,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:20,007 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:55:20,008 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:55:20,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 01:55:20,008 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 01:55:20,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:55:20,009 INFO L85 PathProgramCache]: Analyzing trace with hash -860578876, now seen corresponding path program 2 times [2022-11-23 01:55:20,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:55:20,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762306670] [2022-11-23 01:55:20,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:55:20,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:55:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:55:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:55:20,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:55:20,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762306670] [2022-11-23 01:55:20,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762306670] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:55:20,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:55:20,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:55:20,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286298748] [2022-11-23 01:55:20,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:55:20,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 01:55:20,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:55:20,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 01:55:20,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:55:20,582 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 257 [2022-11-23 01:55:20,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 102 transitions, 887 flow. Second operand has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:20,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:55:20,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 257 [2022-11-23 01:55:20,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:55:22,632 INFO L130 PetriNetUnfolder]: 8057/11528 cut-off events. [2022-11-23 01:55:22,632 INFO L131 PetriNetUnfolder]: For 31446/31843 co-relation queries the response was YES. [2022-11-23 01:55:22,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45617 conditions, 11528 events. 8057/11528 cut-off events. For 31446/31843 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 63087 event pairs, 987 based on Foata normal form. 224/11664 useless extension candidates. Maximal degree in co-relation 45591. Up to 5025 conditions per place. [2022-11-23 01:55:22,750 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 76 selfloop transitions, 38 changer transitions 0/141 dead transitions. [2022-11-23 01:55:22,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 141 transitions, 1304 flow [2022-11-23 01:55:22,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 01:55:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 01:55:22,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 785 transitions. [2022-11-23 01:55:22,754 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5090791180285343 [2022-11-23 01:55:22,754 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 785 transitions. [2022-11-23 01:55:22,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 785 transitions. [2022-11-23 01:55:22,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:55:22,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 785 transitions. [2022-11-23 01:55:22,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:22,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:22,762 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:22,762 INFO L175 Difference]: Start difference. First operand has 61 places, 102 transitions, 887 flow. Second operand 6 states and 785 transitions. [2022-11-23 01:55:22,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 141 transitions, 1304 flow [2022-11-23 01:55:22,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 141 transitions, 1272 flow, removed 16 selfloop flow, removed 0 redundant places. [2022-11-23 01:55:22,827 INFO L231 Difference]: Finished difference. Result has 67 places, 106 transitions, 1002 flow [2022-11-23 01:55:22,827 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1002, PETRI_PLACES=67, PETRI_TRANSITIONS=106} [2022-11-23 01:55:22,830 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2022-11-23 01:55:22,830 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 106 transitions, 1002 flow [2022-11-23 01:55:22,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:22,831 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:55:22,831 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:55:22,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 01:55:22,831 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 01:55:22,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:55:22,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1960598919, now seen corresponding path program 1 times [2022-11-23 01:55:22,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:55:22,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105528521] [2022-11-23 01:55:22,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:55:22,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:55:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:55:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:55:24,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:55:24,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105528521] [2022-11-23 01:55:24,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105528521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:55:24,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:55:24,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 01:55:24,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176227512] [2022-11-23 01:55:24,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:55:24,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 01:55:24,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:55:24,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 01:55:24,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-23 01:55:24,135 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-11-23 01:55:24,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 106 transitions, 1002 flow. Second operand has 7 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:24,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:55:24,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-11-23 01:55:24,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:55:25,612 INFO L130 PetriNetUnfolder]: 7837/11212 cut-off events. [2022-11-23 01:55:25,612 INFO L131 PetriNetUnfolder]: For 38407/38724 co-relation queries the response was YES. [2022-11-23 01:55:25,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47157 conditions, 11212 events. 7837/11212 cut-off events. For 38407/38724 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 61087 event pairs, 979 based on Foata normal form. 168/11292 useless extension candidates. Maximal degree in co-relation 47128. Up to 4968 conditions per place. [2022-11-23 01:55:25,696 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 75 selfloop transitions, 30 changer transitions 0/132 dead transitions. [2022-11-23 01:55:25,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 132 transitions, 1314 flow [2022-11-23 01:55:25,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:55:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 01:55:25,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2022-11-23 01:55:25,699 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5011673151750973 [2022-11-23 01:55:25,699 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 644 transitions. [2022-11-23 01:55:25,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 644 transitions. [2022-11-23 01:55:25,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:55:25,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 644 transitions. [2022-11-23 01:55:25,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:25,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:25,704 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:25,704 INFO L175 Difference]: Start difference. First operand has 67 places, 106 transitions, 1002 flow. Second operand 5 states and 644 transitions. [2022-11-23 01:55:25,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 132 transitions, 1314 flow [2022-11-23 01:55:25,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 132 transitions, 1252 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-11-23 01:55:25,783 INFO L231 Difference]: Finished difference. Result has 67 places, 106 transitions, 1023 flow [2022-11-23 01:55:25,783 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1023, PETRI_PLACES=67, PETRI_TRANSITIONS=106} [2022-11-23 01:55:25,785 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2022-11-23 01:55:25,785 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 106 transitions, 1023 flow [2022-11-23 01:55:25,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:25,789 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:55:25,789 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:55:25,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 01:55:25,789 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 01:55:25,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:55:25,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1530378041, now seen corresponding path program 1 times [2022-11-23 01:55:25,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:55:25,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616261683] [2022-11-23 01:55:25,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:55:25,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:55:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:55:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:55:25,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:55:25,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616261683] [2022-11-23 01:55:25,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616261683] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:55:25,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:55:25,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 01:55:25,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741005112] [2022-11-23 01:55:25,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:55:25,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 01:55:25,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:55:25,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:55:25,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:55:26,008 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-11-23 01:55:26,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 106 transitions, 1023 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:26,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:55:26,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-11-23 01:55:26,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:55:27,312 INFO L130 PetriNetUnfolder]: 6334/9320 cut-off events. [2022-11-23 01:55:27,313 INFO L131 PetriNetUnfolder]: For 49105/50433 co-relation queries the response was YES. [2022-11-23 01:55:27,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39885 conditions, 9320 events. 6334/9320 cut-off events. For 49105/50433 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 56043 event pairs, 839 based on Foata normal form. 1516/10579 useless extension candidates. Maximal degree in co-relation 39856. Up to 5671 conditions per place. [2022-11-23 01:55:27,399 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 188 selfloop transitions, 9 changer transitions 28/255 dead transitions. [2022-11-23 01:55:27,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 255 transitions, 3009 flow [2022-11-23 01:55:27,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:55:27,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 01:55:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2022-11-23 01:55:27,403 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5089494163424124 [2022-11-23 01:55:27,403 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2022-11-23 01:55:27,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2022-11-23 01:55:27,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:55:27,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2022-11-23 01:55:27,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:27,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:27,410 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:27,410 INFO L175 Difference]: Start difference. First operand has 67 places, 106 transitions, 1023 flow. Second operand 5 states and 654 transitions. [2022-11-23 01:55:27,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 255 transitions, 3009 flow [2022-11-23 01:55:27,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 255 transitions, 2781 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-11-23 01:55:27,465 INFO L231 Difference]: Finished difference. Result has 69 places, 113 transitions, 1043 flow [2022-11-23 01:55:27,465 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1043, PETRI_PLACES=69, PETRI_TRANSITIONS=113} [2022-11-23 01:55:27,466 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2022-11-23 01:55:27,466 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 113 transitions, 1043 flow [2022-11-23 01:55:27,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:27,467 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:55:27,467 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:55:27,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 01:55:27,468 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 01:55:27,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:55:27,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1696063528, now seen corresponding path program 1 times [2022-11-23 01:55:27,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:55:27,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766186118] [2022-11-23 01:55:27,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:55:27,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:55:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:55:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:55:27,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:55:27,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766186118] [2022-11-23 01:55:27,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766186118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:55:27,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:55:27,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:55:27,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406867273] [2022-11-23 01:55:27,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:55:27,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:55:27,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:55:27,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:55:27,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:55:27,766 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-11-23 01:55:27,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 113 transitions, 1043 flow. Second operand has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:27,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:55:27,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-11-23 01:55:27,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:55:29,188 INFO L130 PetriNetUnfolder]: 5101/7736 cut-off events. [2022-11-23 01:55:29,188 INFO L131 PetriNetUnfolder]: For 42297/44388 co-relation queries the response was YES. [2022-11-23 01:55:29,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36978 conditions, 7736 events. 5101/7736 cut-off events. For 42297/44388 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 47944 event pairs, 314 based on Foata normal form. 1557/9081 useless extension candidates. Maximal degree in co-relation 36947. Up to 2606 conditions per place. [2022-11-23 01:55:29,253 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 280 selfloop transitions, 18 changer transitions 22/349 dead transitions. [2022-11-23 01:55:29,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 349 transitions, 3983 flow [2022-11-23 01:55:29,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 01:55:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 01:55:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 916 transitions. [2022-11-23 01:55:29,257 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.50917176209005 [2022-11-23 01:55:29,258 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 916 transitions. [2022-11-23 01:55:29,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 916 transitions. [2022-11-23 01:55:29,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:55:29,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 916 transitions. [2022-11-23 01:55:29,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.85714285714286) internal successors, (916), 7 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:29,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:29,272 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:29,272 INFO L175 Difference]: Start difference. First operand has 69 places, 113 transitions, 1043 flow. Second operand 7 states and 916 transitions. [2022-11-23 01:55:29,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 349 transitions, 3983 flow [2022-11-23 01:55:29,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 349 transitions, 3974 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-23 01:55:29,325 INFO L231 Difference]: Finished difference. Result has 77 places, 118 transitions, 1160 flow [2022-11-23 01:55:29,325 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1160, PETRI_PLACES=77, PETRI_TRANSITIONS=118} [2022-11-23 01:55:29,326 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 36 predicate places. [2022-11-23 01:55:29,326 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 118 transitions, 1160 flow [2022-11-23 01:55:29,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:29,330 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:55:29,330 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:55:29,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 01:55:29,332 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 01:55:29,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:55:29,332 INFO L85 PathProgramCache]: Analyzing trace with hash -309932688, now seen corresponding path program 1 times [2022-11-23 01:55:29,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:55:29,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683671130] [2022-11-23 01:55:29,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:55:29,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:55:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:55:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:55:29,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:55:29,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683671130] [2022-11-23 01:55:29,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683671130] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:55:29,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:55:29,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 01:55:29,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161155132] [2022-11-23 01:55:29,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:55:29,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 01:55:29,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:55:29,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 01:55:29,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 01:55:29,521 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 257 [2022-11-23 01:55:29,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 118 transitions, 1160 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:29,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:55:29,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 257 [2022-11-23 01:55:29,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:55:30,790 INFO L130 PetriNetUnfolder]: 7248/11281 cut-off events. [2022-11-23 01:55:30,790 INFO L131 PetriNetUnfolder]: For 61234/61929 co-relation queries the response was YES. [2022-11-23 01:55:30,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59758 conditions, 11281 events. 7248/11281 cut-off events. For 61234/61929 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 73280 event pairs, 2158 based on Foata normal form. 360/11474 useless extension candidates. Maximal degree in co-relation 59723. Up to 5337 conditions per place. [2022-11-23 01:55:30,854 INFO L137 encePairwiseOnDemand]: 254/257 looper letters, 96 selfloop transitions, 10 changer transitions 55/173 dead transitions. [2022-11-23 01:55:30,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 173 transitions, 1975 flow [2022-11-23 01:55:30,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 01:55:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 01:55:30,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-11-23 01:55:30,856 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.522697795071336 [2022-11-23 01:55:30,856 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2022-11-23 01:55:30,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2022-11-23 01:55:30,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:55:30,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2022-11-23 01:55:30,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:30,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:30,860 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:30,861 INFO L175 Difference]: Start difference. First operand has 77 places, 118 transitions, 1160 flow. Second operand 3 states and 403 transitions. [2022-11-23 01:55:30,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 173 transitions, 1975 flow [2022-11-23 01:55:31,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 173 transitions, 1879 flow, removed 34 selfloop flow, removed 3 redundant places. [2022-11-23 01:55:31,393 INFO L231 Difference]: Finished difference. Result has 77 places, 90 transitions, 829 flow [2022-11-23 01:55:31,394 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=829, PETRI_PLACES=77, PETRI_TRANSITIONS=90} [2022-11-23 01:55:31,394 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 36 predicate places. [2022-11-23 01:55:31,394 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 90 transitions, 829 flow [2022-11-23 01:55:31,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:31,395 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:55:31,395 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:55:31,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 01:55:31,396 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 01:55:31,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:55:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1399357226, now seen corresponding path program 1 times [2022-11-23 01:55:31,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:55:31,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931491483] [2022-11-23 01:55:31,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:55:31,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:55:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:55:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:55:31,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:55:31,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931491483] [2022-11-23 01:55:31,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931491483] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:55:31,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:55:31,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:55:31,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954917396] [2022-11-23 01:55:31,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:55:31,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:55:31,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:55:31,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:55:31,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:55:31,841 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 257 [2022-11-23 01:55:31,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 90 transitions, 829 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:31,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:55:31,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 257 [2022-11-23 01:55:31,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:55:33,532 INFO L130 PetriNetUnfolder]: 8657/13430 cut-off events. [2022-11-23 01:55:33,532 INFO L131 PetriNetUnfolder]: For 68704/68798 co-relation queries the response was YES. [2022-11-23 01:55:33,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68772 conditions, 13430 events. 8657/13430 cut-off events. For 68704/68798 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 88456 event pairs, 933 based on Foata normal form. 115/13527 useless extension candidates. Maximal degree in co-relation 68737. Up to 6352 conditions per place. [2022-11-23 01:55:33,610 INFO L137 encePairwiseOnDemand]: 245/257 looper letters, 114 selfloop transitions, 24 changer transitions 119/260 dead transitions. [2022-11-23 01:55:33,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 260 transitions, 2765 flow [2022-11-23 01:55:33,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 01:55:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 01:55:33,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 749 transitions. [2022-11-23 01:55:33,614 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48573281452658884 [2022-11-23 01:55:33,614 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 749 transitions. [2022-11-23 01:55:33,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 749 transitions. [2022-11-23 01:55:33,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:55:33,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 749 transitions. [2022-11-23 01:55:33,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:33,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:33,620 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:33,621 INFO L175 Difference]: Start difference. First operand has 77 places, 90 transitions, 829 flow. Second operand 6 states and 749 transitions. [2022-11-23 01:55:33,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 260 transitions, 2765 flow [2022-11-23 01:55:34,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 260 transitions, 2713 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-11-23 01:55:34,056 INFO L231 Difference]: Finished difference. Result has 84 places, 85 transitions, 900 flow [2022-11-23 01:55:34,056 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=900, PETRI_PLACES=84, PETRI_TRANSITIONS=85} [2022-11-23 01:55:34,056 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 43 predicate places. [2022-11-23 01:55:34,057 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 85 transitions, 900 flow [2022-11-23 01:55:34,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:34,057 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:55:34,057 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:55:34,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 01:55:34,058 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 01:55:34,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:55:34,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1968030816, now seen corresponding path program 2 times [2022-11-23 01:55:34,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:55:34,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860838282] [2022-11-23 01:55:34,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:55:34,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:55:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:55:34,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:55:34,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:55:34,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860838282] [2022-11-23 01:55:34,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860838282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:55:34,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:55:34,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 01:55:34,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961343121] [2022-11-23 01:55:34,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:55:34,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 01:55:34,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:55:34,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 01:55:34,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:55:34,300 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-11-23 01:55:34,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 85 transitions, 900 flow. Second operand has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:34,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:55:34,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-11-23 01:55:34,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:55:35,227 INFO L130 PetriNetUnfolder]: 3708/6133 cut-off events. [2022-11-23 01:55:35,227 INFO L131 PetriNetUnfolder]: For 42166/43586 co-relation queries the response was YES. [2022-11-23 01:55:35,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31503 conditions, 6133 events. 3708/6133 cut-off events. For 42166/43586 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 42216 event pairs, 239 based on Foata normal form. 1064/7043 useless extension candidates. Maximal degree in co-relation 31463. Up to 1761 conditions per place. [2022-11-23 01:55:35,254 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 178 selfloop transitions, 24 changer transitions 54/271 dead transitions. [2022-11-23 01:55:35,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 271 transitions, 3400 flow [2022-11-23 01:55:35,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 01:55:35,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 01:55:35,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1170 transitions. [2022-11-23 01:55:35,261 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5058365758754864 [2022-11-23 01:55:35,261 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1170 transitions. [2022-11-23 01:55:35,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1170 transitions. [2022-11-23 01:55:35,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:55:35,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1170 transitions. [2022-11-23 01:55:35,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 130.0) internal successors, (1170), 9 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:35,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:35,270 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:35,270 INFO L175 Difference]: Start difference. First operand has 84 places, 85 transitions, 900 flow. Second operand 9 states and 1170 transitions. [2022-11-23 01:55:35,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 271 transitions, 3400 flow [2022-11-23 01:55:35,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 271 transitions, 3367 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-23 01:55:35,420 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 938 flow [2022-11-23 01:55:35,420 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=938, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2022-11-23 01:55:35,421 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 51 predicate places. [2022-11-23 01:55:35,421 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 938 flow [2022-11-23 01:55:35,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:35,422 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:55:35,422 INFO L209 CegarLoopForPetriNet]: 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] [2022-11-23 01:55:35,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 01:55:35,422 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 01:55:35,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:55:35,423 INFO L85 PathProgramCache]: Analyzing trace with hash -36069072, now seen corresponding path program 1 times [2022-11-23 01:55:35,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:55:35,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133711328] [2022-11-23 01:55:35,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:55:35,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:55:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:55:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:55:35,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:55:35,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133711328] [2022-11-23 01:55:35,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133711328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:55:35,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:55:35,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:55:35,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66650896] [2022-11-23 01:55:35,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:55:35,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:55:35,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:55:35,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:55:35,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:55:35,881 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 257 [2022-11-23 01:55:35,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 938 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:35,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:55:35,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 257 [2022-11-23 01:55:35,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:55:37,152 INFO L130 PetriNetUnfolder]: 5030/8542 cut-off events. [2022-11-23 01:55:37,153 INFO L131 PetriNetUnfolder]: For 65307/65382 co-relation queries the response was YES. [2022-11-23 01:55:37,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50266 conditions, 8542 events. 5030/8542 cut-off events. For 65307/65382 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 60933 event pairs, 666 based on Foata normal form. 48/8547 useless extension candidates. Maximal degree in co-relation 50223. Up to 3282 conditions per place. [2022-11-23 01:55:37,206 INFO L137 encePairwiseOnDemand]: 246/257 looper letters, 154 selfloop transitions, 21 changer transitions 45/223 dead transitions. [2022-11-23 01:55:37,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 223 transitions, 2754 flow [2022-11-23 01:55:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 01:55:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 01:55:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 735 transitions. [2022-11-23 01:55:37,209 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4766536964980545 [2022-11-23 01:55:37,209 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 735 transitions. [2022-11-23 01:55:37,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 735 transitions. [2022-11-23 01:55:37,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:55:37,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 735 transitions. [2022-11-23 01:55:37,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:37,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:37,216 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:37,216 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 938 flow. Second operand 6 states and 735 transitions. [2022-11-23 01:55:37,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 223 transitions, 2754 flow [2022-11-23 01:55:37,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 223 transitions, 2417 flow, removed 128 selfloop flow, removed 4 redundant places. [2022-11-23 01:55:37,885 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 1014 flow [2022-11-23 01:55:37,885 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1014, PETRI_PLACES=96, PETRI_TRANSITIONS=90} [2022-11-23 01:55:37,886 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places. [2022-11-23 01:55:37,886 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 1014 flow [2022-11-23 01:55:37,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:37,887 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:55:37,887 INFO L209 CegarLoopForPetriNet]: 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] [2022-11-23 01:55:37,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 01:55:37,887 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 01:55:37,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:55:37,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2136170372, now seen corresponding path program 1 times [2022-11-23 01:55:37,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:55:37,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089939641] [2022-11-23 01:55:37,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:55:37,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:55:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:55:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:55:38,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:55:38,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089939641] [2022-11-23 01:55:38,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089939641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:55:38,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:55:38,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 01:55:38,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549272513] [2022-11-23 01:55:38,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:55:38,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 01:55:38,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:55:38,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 01:55:38,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 01:55:38,177 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-11-23 01:55:38,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 90 transitions, 1014 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:38,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 01:55:38,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-11-23 01:55:38,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 01:55:39,222 INFO L130 PetriNetUnfolder]: 3246/5539 cut-off events. [2022-11-23 01:55:39,223 INFO L131 PetriNetUnfolder]: For 37679/38495 co-relation queries the response was YES. [2022-11-23 01:55:39,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28476 conditions, 5539 events. 3246/5539 cut-off events. For 37679/38495 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 39067 event pairs, 197 based on Foata normal form. 592/5984 useless extension candidates. Maximal degree in co-relation 28429. Up to 1490 conditions per place. [2022-11-23 01:55:39,261 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 66 selfloop transitions, 27 changer transitions 174/272 dead transitions. [2022-11-23 01:55:39,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 272 transitions, 3668 flow [2022-11-23 01:55:39,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 01:55:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-23 01:55:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1405 transitions. [2022-11-23 01:55:39,266 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4969932790944464 [2022-11-23 01:55:39,266 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1405 transitions. [2022-11-23 01:55:39,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1405 transitions. [2022-11-23 01:55:39,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:55:39,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1405 transitions. [2022-11-23 01:55:39,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 127.72727272727273) internal successors, (1405), 11 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:39,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 257.0) internal successors, (3084), 12 states have internal predecessors, (3084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:39,276 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 257.0) internal successors, (3084), 12 states have internal predecessors, (3084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:39,277 INFO L175 Difference]: Start difference. First operand has 96 places, 90 transitions, 1014 flow. Second operand 11 states and 1405 transitions. [2022-11-23 01:55:39,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 272 transitions, 3668 flow [2022-11-23 01:55:39,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 272 transitions, 3541 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-11-23 01:55:39,490 INFO L231 Difference]: Finished difference. Result has 105 places, 54 transitions, 526 flow [2022-11-23 01:55:39,490 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=526, PETRI_PLACES=105, PETRI_TRANSITIONS=54} [2022-11-23 01:55:39,491 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places. [2022-11-23 01:55:39,491 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 54 transitions, 526 flow [2022-11-23 01:55:39,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:55:39,492 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 01:55:39,492 INFO L209 CegarLoopForPetriNet]: 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] [2022-11-23 01:55:39,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 01:55:39,492 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 01:55:39,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:55:39,493 INFO L85 PathProgramCache]: Analyzing trace with hash -247998784, now seen corresponding path program 1 times [2022-11-23 01:55:39,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:55:39,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278012918] [2022-11-23 01:55:39,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:55:39,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:55:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:55:39,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:55:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:55:39,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:55:39,645 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 01:55:39,647 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-23 01:55:39,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-23 01:55:39,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-23 01:55:39,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-23 01:55:39,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-23 01:55:39,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-23 01:55:39,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-23 01:55:39,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 01:55:39,654 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:55:39,662 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 01:55:39,662 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 01:55:39,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:55:39 BasicIcfg [2022-11-23 01:55:39,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 01:55:39,782 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 01:55:39,782 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 01:55:39,782 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 01:55:39,783 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:55:01" (3/4) ... [2022-11-23 01:55:39,786 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 01:55:39,911 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2b123d9-cc1f-452d-a89c-473cac2e083a/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 01:55:39,911 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 01:55:39,912 INFO L158 Benchmark]: Toolchain (without parser) took 39900.50ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 96.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 685.1MB. Max. memory is 16.1GB. [2022-11-23 01:55:39,912 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 86.4MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 01:55:39,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 689.51ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 73.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 01:55:39,913 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.68ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 70.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 01:55:39,913 INFO L158 Benchmark]: Boogie Preprocessor took 66.42ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 68.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 01:55:39,914 INFO L158 Benchmark]: RCFGBuilder took 913.92ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 68.4MB in the beginning and 132.3MB in the end (delta: -63.8MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2022-11-23 01:55:39,917 INFO L158 Benchmark]: TraceAbstraction took 37998.39ms. Allocated memory was 182.5MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 131.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 663.1MB. Max. memory is 16.1GB. [2022-11-23 01:55:39,917 INFO L158 Benchmark]: Witness Printer took 129.55ms. Allocated memory is still 1.9GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-23 01:55:39,919 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 86.4MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 689.51ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 73.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.68ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 70.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.42ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 68.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 913.92ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 68.4MB in the beginning and 132.3MB in the end (delta: -63.8MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * TraceAbstraction took 37998.39ms. Allocated memory was 182.5MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 131.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 663.1MB. Max. memory is 16.1GB. * Witness Printer took 129.55ms. Allocated memory is still 1.9GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5s, 144 PlacesBefore, 41 PlacesAfterwards, 133 TransitionsBefore, 29 TransitionsAfterwards, 3168 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 7829 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4131, independent: 3921, independent conditional: 0, independent unconditional: 3921, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2353, independent: 2285, independent conditional: 0, independent unconditional: 2285, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2353, independent: 2250, independent conditional: 0, independent unconditional: 2250, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 103, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 493, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 410, dependent conditional: 0, dependent unconditional: 410, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4131, independent: 1636, independent conditional: 0, independent unconditional: 1636, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 2353, unknown conditional: 0, unknown unconditional: 2353] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 217, Positive conditional cache size: 0, Positive unconditional cache size: 217, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1221; [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1221, ((void *)0), P0, ((void *)0))=-3, t1221={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1222; [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1222, ((void *)0), P1, ((void *)0))=-2, t1221={5:0}, t1222={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1223; [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1223, ((void *)0), P2, ((void *)0))=-1, t1221={5:0}, t1222={6:0}, t1223={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1224; [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1224, ((void *)0), P3, ((void *)0))=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 __unbuffered_p0_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=1, unknown-#in~expression-unknown=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 173 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 37.7s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 999 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 794 mSDsluCounter, 406 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 289 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1859 IncrementalHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 117 mSDtfsCounter, 1859 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1160occurred in iteration=9, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 1962 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 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! [2022-11-23 01:55:39,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2b123d9-cc1f-452d-a89c-473cac2e083a/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE