./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:54:54,103 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:54:54,188 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 02:54:54,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:54:54,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:54:54,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:54:54,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:54:54,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:54:54,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:54:54,245 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:54:54,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:54:54,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:54:54,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:54:54,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:54:54,247 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:54:54,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:54:54,247 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:54:54,248 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:54:54,248 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:54:54,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:54:54,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:54:54,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:54:54,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:54:54,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:54:54,249 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:54:54,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:54:54,249 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:54:54,249 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:54:54,249 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:54:54,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:54:54,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:54:54,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:54:54,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:54:54,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:54:54,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:54:54,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:54:54,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:54:54,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:54:54,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:54:54,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:54:54,252 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:54:54,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:54:54,252 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:54:54,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:54:54,252 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:54:54,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:54:54,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:54:54,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:54:54,253 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf [2024-11-28 02:54:54,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:54:54,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:54:54,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:54:54,598 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:54:54,598 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:54:54,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2024-11-28 02:54:58,531 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/data/8be2cfc75/a83be89cbdfa4b708f60c17e1b3d0656/FLAGb509fd538 [2024-11-28 02:54:58,934 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:54:58,935 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2024-11-28 02:54:58,950 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/data/8be2cfc75/a83be89cbdfa4b708f60c17e1b3d0656/FLAGb509fd538 [2024-11-28 02:54:59,002 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/data/8be2cfc75/a83be89cbdfa4b708f60c17e1b3d0656 [2024-11-28 02:54:59,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:54:59,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:54:59,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:54:59,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:54:59,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:54:59,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:54:59" (1/1) ... [2024-11-28 02:54:59,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9e3dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:59, skipping insertion in model container [2024-11-28 02:54:59,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:54:59" (1/1) ... [2024-11-28 02:54:59,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:54:59,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c[2249,2262] [2024-11-28 02:54:59,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:54:59,367 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:54:59,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c[2249,2262] [2024-11-28 02:54:59,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:54:59,410 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:54:59,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:59 WrapperNode [2024-11-28 02:54:59,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:54:59,412 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:54:59,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:54:59,413 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:54:59,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:59" (1/1) ... [2024-11-28 02:54:59,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:59" (1/1) ... [2024-11-28 02:54:59,458 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2024-11-28 02:54:59,458 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:54:59,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:54:59,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:54:59,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:54:59,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:59" (1/1) ... [2024-11-28 02:54:59,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:59" (1/1) ... [2024-11-28 02:54:59,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:59" (1/1) ... [2024-11-28 02:54:59,503 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-28 02:54:59,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:59" (1/1) ... [2024-11-28 02:54:59,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:59" (1/1) ... [2024-11-28 02:54:59,517 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:59" (1/1) ... [2024-11-28 02:54:59,518 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:59" (1/1) ... [2024-11-28 02:54:59,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:59" (1/1) ... [2024-11-28 02:54:59,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:59" (1/1) ... [2024-11-28 02:54:59,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:59" (1/1) ... [2024-11-28 02:54:59,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:54:59,536 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:54:59,537 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:54:59,537 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:54:59,538 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:59" (1/1) ... [2024-11-28 02:54:59,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:54:59,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:54:59,582 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:54:59,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:54:59,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:54:59,619 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-28 02:54:59,620 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-28 02:54:59,620 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-28 02:54:59,620 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-28 02:54:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:54:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:54:59,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:54:59,623 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 02:54:59,747 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:54:59,749 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:55:00,051 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 02:55:00,051 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:55:00,301 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:55:00,301 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 02:55:00,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:55:00 BoogieIcfgContainer [2024-11-28 02:55:00,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:55:00,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:55:00,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:55:00,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:55:00,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:54:59" (1/3) ... [2024-11-28 02:55:00,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b69106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:55:00, skipping insertion in model container [2024-11-28 02:55:00,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:59" (2/3) ... [2024-11-28 02:55:00,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b69106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:55:00, skipping insertion in model container [2024-11-28 02:55:00,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:55:00" (3/3) ... [2024-11-28 02:55:00,320 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2024-11-28 02:55:00,341 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:55:00,345 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2.wvr.c that has 3 procedures, 29 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-28 02:55:00,345 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 02:55:00,414 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-28 02:55:00,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 78 flow [2024-11-28 02:55:00,530 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2024-11-28 02:55:00,536 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-28 02:55:00,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 4/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2024-11-28 02:55:00,545 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 78 flow [2024-11-28 02:55:00,551 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 29 transitions, 70 flow [2024-11-28 02:55:00,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:55:00,593 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@534739a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:55:00,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-28 02:55:00,623 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 02:55:00,623 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-11-28 02:55:00,623 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-28 02:55:00,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:00,624 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:00,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-28 02:55:00,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:00,632 INFO L85 PathProgramCache]: Analyzing trace with hash 29857077, now seen corresponding path program 1 times [2024-11-28 02:55:00,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:00,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263956653] [2024-11-28 02:55:00,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:00,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:01,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:01,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263956653] [2024-11-28 02:55:01,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263956653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:01,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:01,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:55:01,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104557130] [2024-11-28 02:55:01,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:01,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:55:01,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:01,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:55:01,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:55:01,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2024-11-28 02:55:01,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:01,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:01,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2024-11-28 02:55:01,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:01,455 INFO L124 PetriNetUnfolderBase]: 146/286 cut-off events. [2024-11-28 02:55:01,456 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-28 02:55:01,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 286 events. 146/286 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1137 event pairs, 12 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 458. Up to 186 conditions per place. [2024-11-28 02:55:01,463 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 21 selfloop transitions, 7 changer transitions 1/40 dead transitions. [2024-11-28 02:55:01,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 159 flow [2024-11-28 02:55:01,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:55:01,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:55:01,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2024-11-28 02:55:01,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2024-11-28 02:55:01,487 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 70 flow. Second operand 3 states and 69 transitions. [2024-11-28 02:55:01,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 159 flow [2024-11-28 02:55:01,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 40 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 02:55:01,505 INFO L231 Difference]: Finished difference. Result has 31 places, 33 transitions, 101 flow [2024-11-28 02:55:01,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=31, PETRI_TRANSITIONS=33} [2024-11-28 02:55:01,514 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2024-11-28 02:55:01,515 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 33 transitions, 101 flow [2024-11-28 02:55:01,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:01,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:01,516 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:01,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:55:01,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-28 02:55:01,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:01,517 INFO L85 PathProgramCache]: Analyzing trace with hash 207203189, now seen corresponding path program 1 times [2024-11-28 02:55:01,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:01,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215487538] [2024-11-28 02:55:01,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:01,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:01,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:01,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:01,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215487538] [2024-11-28 02:55:01,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215487538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:01,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:01,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:55:01,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346055792] [2024-11-28 02:55:01,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:01,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:55:01,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:01,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:55:01,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:55:01,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-28 02:55:01,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 33 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:01,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:01,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-28 02:55:01,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:02,136 INFO L124 PetriNetUnfolderBase]: 191/376 cut-off events. [2024-11-28 02:55:02,136 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-11-28 02:55:02,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 376 events. 191/376 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1735 event pairs, 20 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 276. Up to 143 conditions per place. [2024-11-28 02:55:02,142 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 36 selfloop transitions, 10 changer transitions 5/65 dead transitions. [2024-11-28 02:55:02,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 65 transitions, 290 flow [2024-11-28 02:55:02,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:55:02,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 02:55:02,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2024-11-28 02:55:02,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7375 [2024-11-28 02:55:02,145 INFO L175 Difference]: Start difference. First operand has 31 places, 33 transitions, 101 flow. Second operand 5 states and 118 transitions. [2024-11-28 02:55:02,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 65 transitions, 290 flow [2024-11-28 02:55:02,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 65 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 02:55:02,149 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 155 flow [2024-11-28 02:55:02,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2024-11-28 02:55:02,150 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2024-11-28 02:55:02,151 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 155 flow [2024-11-28 02:55:02,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:02,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:02,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:02,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:55:02,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-28 02:55:02,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:02,153 INFO L85 PathProgramCache]: Analyzing trace with hash 892689401, now seen corresponding path program 2 times [2024-11-28 02:55:02,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:02,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085724659] [2024-11-28 02:55:02,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:55:02,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:02,186 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 02:55:02,187 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:55:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:02,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:02,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085724659] [2024-11-28 02:55:02,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085724659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:02,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:02,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:55:02,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378119907] [2024-11-28 02:55:02,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:02,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:55:02,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:02,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:55:02,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:55:02,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-28 02:55:02,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:02,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:02,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-28 02:55:02,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:02,799 INFO L124 PetriNetUnfolderBase]: 185/391 cut-off events. [2024-11-28 02:55:02,799 INFO L125 PetriNetUnfolderBase]: For 231/231 co-relation queries the response was YES. [2024-11-28 02:55:02,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 391 events. 185/391 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1866 event pairs, 12 based on Foata normal form. 8/367 useless extension candidates. Maximal degree in co-relation 345. Up to 88 conditions per place. [2024-11-28 02:55:02,806 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 35 selfloop transitions, 12 changer transitions 4/65 dead transitions. [2024-11-28 02:55:02,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 65 transitions, 348 flow [2024-11-28 02:55:02,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:55:02,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 02:55:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2024-11-28 02:55:02,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2024-11-28 02:55:02,810 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 155 flow. Second operand 5 states and 115 transitions. [2024-11-28 02:55:02,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 65 transitions, 348 flow [2024-11-28 02:55:02,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 348 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 02:55:02,814 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 241 flow [2024-11-28 02:55:02,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2024-11-28 02:55:02,816 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2024-11-28 02:55:02,817 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 241 flow [2024-11-28 02:55:02,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:02,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:02,817 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:02,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:55:02,818 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-28 02:55:02,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:02,819 INFO L85 PathProgramCache]: Analyzing trace with hash -854382726, now seen corresponding path program 1 times [2024-11-28 02:55:02,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:02,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985084031] [2024-11-28 02:55:02,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:02,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:03,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:03,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985084031] [2024-11-28 02:55:03,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985084031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:03,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:03,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:55:03,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293122350] [2024-11-28 02:55:03,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:03,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:55:03,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:03,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:55:03,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:55:03,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-28 02:55:03,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:03,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:03,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-28 02:55:03,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:03,324 INFO L124 PetriNetUnfolderBase]: 182/379 cut-off events. [2024-11-28 02:55:03,325 INFO L125 PetriNetUnfolderBase]: For 588/588 co-relation queries the response was YES. [2024-11-28 02:55:03,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 379 events. 182/379 cut-off events. For 588/588 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1834 event pairs, 17 based on Foata normal form. 2/347 useless extension candidates. Maximal degree in co-relation 572. Up to 163 conditions per place. [2024-11-28 02:55:03,332 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 41 selfloop transitions, 9 changer transitions 2/66 dead transitions. [2024-11-28 02:55:03,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 436 flow [2024-11-28 02:55:03,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:55:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 02:55:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2024-11-28 02:55:03,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-11-28 02:55:03,335 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 241 flow. Second operand 5 states and 112 transitions. [2024-11-28 02:55:03,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 436 flow [2024-11-28 02:55:03,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 432 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-28 02:55:03,350 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 292 flow [2024-11-28 02:55:03,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2024-11-28 02:55:03,351 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2024-11-28 02:55:03,351 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 292 flow [2024-11-28 02:55:03,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:03,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:03,354 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:03,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:55:03,354 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-28 02:55:03,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:03,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1653691984, now seen corresponding path program 2 times [2024-11-28 02:55:03,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:03,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598208926] [2024-11-28 02:55:03,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:55:03,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:03,395 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 02:55:03,399 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:55:03,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:03,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:03,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598208926] [2024-11-28 02:55:03,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598208926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:03,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:03,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:55:03,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090437510] [2024-11-28 02:55:03,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:03,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:55:03,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:03,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:55:03,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:55:03,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-28 02:55:03,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 292 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:03,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:03,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-28 02:55:03,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:03,842 INFO L124 PetriNetUnfolderBase]: 168/379 cut-off events. [2024-11-28 02:55:03,843 INFO L125 PetriNetUnfolderBase]: For 793/793 co-relation queries the response was YES. [2024-11-28 02:55:03,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 379 events. 168/379 cut-off events. For 793/793 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1715 event pairs, 6 based on Foata normal form. 17/361 useless extension candidates. Maximal degree in co-relation 751. Up to 99 conditions per place. [2024-11-28 02:55:03,852 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 43 selfloop transitions, 12 changer transitions 1/70 dead transitions. [2024-11-28 02:55:03,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 512 flow [2024-11-28 02:55:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:55:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 02:55:03,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-11-28 02:55:03,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.70625 [2024-11-28 02:55:03,858 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 292 flow. Second operand 5 states and 113 transitions. [2024-11-28 02:55:03,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 512 flow [2024-11-28 02:55:03,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 496 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-28 02:55:03,869 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 355 flow [2024-11-28 02:55:03,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-11-28 02:55:03,871 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 25 predicate places. [2024-11-28 02:55:03,871 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 355 flow [2024-11-28 02:55:03,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:03,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:03,872 INFO L206 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] [2024-11-28 02:55:03,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:55:03,872 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-28 02:55:03,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:03,873 INFO L85 PathProgramCache]: Analyzing trace with hash -737525244, now seen corresponding path program 1 times [2024-11-28 02:55:03,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:03,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123669941] [2024-11-28 02:55:03,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:03,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:04,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:04,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123669941] [2024-11-28 02:55:04,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123669941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:04,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:04,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:55:04,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662506134] [2024-11-28 02:55:04,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:04,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:55:04,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:04,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:55:04,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:55:04,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2024-11-28 02:55:04,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:04,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:04,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2024-11-28 02:55:04,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:04,866 INFO L124 PetriNetUnfolderBase]: 251/511 cut-off events. [2024-11-28 02:55:04,866 INFO L125 PetriNetUnfolderBase]: For 1446/1494 co-relation queries the response was YES. [2024-11-28 02:55:04,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 511 events. 251/511 cut-off events. For 1446/1494 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2379 event pairs, 14 based on Foata normal form. 20/470 useless extension candidates. Maximal degree in co-relation 712. Up to 163 conditions per place. [2024-11-28 02:55:04,875 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 47 selfloop transitions, 23 changer transitions 0/84 dead transitions. [2024-11-28 02:55:04,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 694 flow [2024-11-28 02:55:04,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:55:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:55:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-11-28 02:55:04,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640625 [2024-11-28 02:55:04,878 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 355 flow. Second operand 6 states and 123 transitions. [2024-11-28 02:55:04,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 694 flow [2024-11-28 02:55:04,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 679 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-28 02:55:04,893 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 490 flow [2024-11-28 02:55:04,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2024-11-28 02:55:04,895 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 31 predicate places. [2024-11-28 02:55:04,897 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 490 flow [2024-11-28 02:55:04,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:04,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:04,897 INFO L206 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] [2024-11-28 02:55:04,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:55:04,898 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-28 02:55:04,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:04,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2102404726, now seen corresponding path program 2 times [2024-11-28 02:55:04,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:04,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238948866] [2024-11-28 02:55:04,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:55:04,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:04,945 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 02:55:04,945 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:55:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:55:05,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:05,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238948866] [2024-11-28 02:55:05,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238948866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:05,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:05,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:55:05,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463311227] [2024-11-28 02:55:05,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:05,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:55:05,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:05,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:55:05,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:55:05,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 32 [2024-11-28 02:55:05,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 490 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:05,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:05,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 32 [2024-11-28 02:55:05,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:05,611 INFO L124 PetriNetUnfolderBase]: 257/559 cut-off events. [2024-11-28 02:55:05,612 INFO L125 PetriNetUnfolderBase]: For 2046/2062 co-relation queries the response was YES. [2024-11-28 02:55:05,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2004 conditions, 559 events. 257/559 cut-off events. For 2046/2062 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2779 event pairs, 33 based on Foata normal form. 16/499 useless extension candidates. Maximal degree in co-relation 832. Up to 154 conditions per place. [2024-11-28 02:55:05,622 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 43 selfloop transitions, 17 changer transitions 0/81 dead transitions. [2024-11-28 02:55:05,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 81 transitions, 762 flow [2024-11-28 02:55:05,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:55:05,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 02:55:05,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2024-11-28 02:55:05,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-11-28 02:55:05,626 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 490 flow. Second operand 5 states and 112 transitions. [2024-11-28 02:55:05,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 81 transitions, 762 flow [2024-11-28 02:55:05,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 81 transitions, 749 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-28 02:55:05,640 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 589 flow [2024-11-28 02:55:05,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=589, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2024-11-28 02:55:05,643 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 36 predicate places. [2024-11-28 02:55:05,644 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 589 flow [2024-11-28 02:55:05,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:05,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:05,645 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:05,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:55:05,645 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-28 02:55:05,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:05,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1758294941, now seen corresponding path program 3 times [2024-11-28 02:55:05,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:05,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181152289] [2024-11-28 02:55:05,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 02:55:05,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:05,695 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-28 02:55:05,699 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:55:05,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 02:55:05,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:05,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181152289] [2024-11-28 02:55:05,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181152289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:05,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:05,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:55:05,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968807657] [2024-11-28 02:55:05,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:05,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:55:05,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:05,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:55:05,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:55:05,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-28 02:55:05,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 589 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:05,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:05,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-28 02:55:05,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:06,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([249] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][40], [42#true, 99#(not (= (mod ~d1~0 256) 0)), Black: 65#(<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296))), Black: 67#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296)))), Black: 40#(= (mod ~pos~0 4294967296) 0), 62#true, Black: 76#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0))), 10#L43-2true, Black: 71#true, Black: 44#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 47#(and (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)) (<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296)))), Black: 45#(<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296))), 74#(<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0)), 85#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 80#true, 28#L61-1true, Black: 57#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)) (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296))), 13#L85-4true, Black: 54#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 52#true, 92#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), 55#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 88#true]) [2024-11-28 02:55:06,257 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-28 02:55:06,257 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-28 02:55:06,257 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-28 02:55:06,258 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-28 02:55:06,258 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([261] L61-1-->L56-3: Formula: (and (= v_~d2~0_15 (ite (= (ite (= (mod v_~d2~0_16 256) 0) 1 0) 0) 0 1)) (= v_~i2~0_14 (+ v_~i2~0_15 1))) InVars {~i2~0=v_~i2~0_15, ~d2~0=v_~d2~0_16} OutVars{thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_1|, ~i2~0=v_~i2~0_14, ~d2~0=v_~d2~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post4, ~i2~0, ~d2~0][49], [42#true, 18#L56-3true, 99#(not (= (mod ~d1~0 256) 0)), Black: 65#(<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296))), Black: 67#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296)))), 16#L43true, Black: 40#(= (mod ~pos~0 4294967296) 0), 62#true, 71#true, Black: 74#(<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0)), Black: 76#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0))), Black: 44#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 47#(and (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)) (<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296)))), Black: 45#(<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296))), 85#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 80#true, 13#L85-4true, Black: 57#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)) (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296))), Black: 54#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 52#true, 92#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), 55#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 88#true]) [2024-11-28 02:55:06,258 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-28 02:55:06,258 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-28 02:55:06,258 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-28 02:55:06,259 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-28 02:55:06,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([249] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][40], [42#true, 99#(not (= (mod ~d1~0 256) 0)), Black: 65#(<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296))), Black: 67#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296)))), Black: 40#(= (mod ~pos~0 4294967296) 0), 62#true, Black: 76#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0))), 10#L43-2true, Black: 71#true, Black: 44#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), 4#L86true, Black: 47#(and (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)) (<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296)))), Black: 45#(<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296))), 74#(<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0)), 85#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 80#true, 28#L61-1true, Black: 57#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)) (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296))), Black: 54#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 52#true, 92#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), 55#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 88#true]) [2024-11-28 02:55:06,275 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-28 02:55:06,276 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 02:55:06,276 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-28 02:55:06,276 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-28 02:55:06,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([261] L61-1-->L56-3: Formula: (and (= v_~d2~0_15 (ite (= (ite (= (mod v_~d2~0_16 256) 0) 1 0) 0) 0 1)) (= v_~i2~0_14 (+ v_~i2~0_15 1))) InVars {~i2~0=v_~i2~0_15, ~d2~0=v_~d2~0_16} OutVars{thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_1|, ~i2~0=v_~i2~0_14, ~d2~0=v_~d2~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post4, ~i2~0, ~d2~0][49], [42#true, 18#L56-3true, 99#(not (= (mod ~d1~0 256) 0)), Black: 65#(<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296))), Black: 67#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296)))), 16#L43true, Black: 40#(= (mod ~pos~0 4294967296) 0), 62#true, 71#true, Black: 74#(<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0)), Black: 76#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0))), Black: 44#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), 4#L86true, Black: 47#(and (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)) (<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296)))), Black: 45#(<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296))), 85#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 80#true, Black: 57#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)) (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296))), Black: 54#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 52#true, 92#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), 55#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 88#true]) [2024-11-28 02:55:06,277 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-28 02:55:06,277 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 02:55:06,277 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-28 02:55:06,277 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-28 02:55:06,338 INFO L124 PetriNetUnfolderBase]: 478/1008 cut-off events. [2024-11-28 02:55:06,338 INFO L125 PetriNetUnfolderBase]: For 5082/5144 co-relation queries the response was YES. [2024-11-28 02:55:06,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4015 conditions, 1008 events. 478/1008 cut-off events. For 5082/5144 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5703 event pairs, 115 based on Foata normal form. 16/904 useless extension candidates. Maximal degree in co-relation 2227. Up to 267 conditions per place. [2024-11-28 02:55:06,350 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 63 selfloop transitions, 16 changer transitions 0/108 dead transitions. [2024-11-28 02:55:06,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 108 transitions, 1211 flow [2024-11-28 02:55:06,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:55:06,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 02:55:06,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2024-11-28 02:55:06,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.765625 [2024-11-28 02:55:06,352 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 589 flow. Second operand 4 states and 98 transitions. [2024-11-28 02:55:06,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 108 transitions, 1211 flow [2024-11-28 02:55:06,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 108 transitions, 1171 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-11-28 02:55:06,375 INFO L231 Difference]: Finished difference. Result has 73 places, 77 transitions, 865 flow [2024-11-28 02:55:06,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=865, PETRI_PLACES=73, PETRI_TRANSITIONS=77} [2024-11-28 02:55:06,376 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 41 predicate places. [2024-11-28 02:55:06,376 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 77 transitions, 865 flow [2024-11-28 02:55:06,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:06,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:06,377 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:06,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:55:06,378 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-28 02:55:06,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:06,378 INFO L85 PathProgramCache]: Analyzing trace with hash 511958522, now seen corresponding path program 1 times [2024-11-28 02:55:06,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:06,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933685611] [2024-11-28 02:55:06,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:06,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:07,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:07,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933685611] [2024-11-28 02:55:07,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933685611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:55:07,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17481040] [2024-11-28 02:55:07,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:07,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:07,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:55:07,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:55:07,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:55:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:07,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 02:55:07,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:55:08,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:08,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:55:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:08,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17481040] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:55:08,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:55:08,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 16 [2024-11-28 02:55:08,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101045676] [2024-11-28 02:55:08,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:55:08,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:55:08,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:08,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:55:08,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:55:08,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-28 02:55:08,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 77 transitions, 865 flow. Second operand has 16 states, 16 states have (on average 14.125) internal successors, (226), 16 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:08,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:08,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-28 02:55:08,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:10,284 INFO L124 PetriNetUnfolderBase]: 1119/2197 cut-off events. [2024-11-28 02:55:10,285 INFO L125 PetriNetUnfolderBase]: For 11985/11985 co-relation queries the response was YES. [2024-11-28 02:55:10,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9183 conditions, 2197 events. 1119/2197 cut-off events. For 11985/11985 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13607 event pairs, 12 based on Foata normal form. 58/2139 useless extension candidates. Maximal degree in co-relation 4670. Up to 562 conditions per place. [2024-11-28 02:55:10,312 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 126 selfloop transitions, 58 changer transitions 0/194 dead transitions. [2024-11-28 02:55:10,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 194 transitions, 2184 flow [2024-11-28 02:55:10,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:55:10,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-28 02:55:10,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 305 transitions. [2024-11-28 02:55:10,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.595703125 [2024-11-28 02:55:10,315 INFO L175 Difference]: Start difference. First operand has 73 places, 77 transitions, 865 flow. Second operand 16 states and 305 transitions. [2024-11-28 02:55:10,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 194 transitions, 2184 flow [2024-11-28 02:55:10,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 194 transitions, 2184 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 02:55:10,359 INFO L231 Difference]: Finished difference. Result has 95 places, 105 transitions, 1440 flow [2024-11-28 02:55:10,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1440, PETRI_PLACES=95, PETRI_TRANSITIONS=105} [2024-11-28 02:55:10,362 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 63 predicate places. [2024-11-28 02:55:10,363 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 105 transitions, 1440 flow [2024-11-28 02:55:10,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 14.125) internal successors, (226), 16 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:10,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:10,364 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:10,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 02:55:10,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-28 02:55:10,566 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-28 02:55:10,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:10,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1545301961, now seen corresponding path program 1 times [2024-11-28 02:55:10,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:10,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726164852] [2024-11-28 02:55:10,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:10,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 02:55:10,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:10,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726164852] [2024-11-28 02:55:10,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726164852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:10,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:10,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:55:10,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193028765] [2024-11-28 02:55:10,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:10,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:55:10,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:10,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:55:10,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:55:10,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-28 02:55:10,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 105 transitions, 1440 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:10,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:10,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-28 02:55:10,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:11,274 INFO L124 PetriNetUnfolderBase]: 631/1385 cut-off events. [2024-11-28 02:55:11,275 INFO L125 PetriNetUnfolderBase]: For 11349/11458 co-relation queries the response was YES. [2024-11-28 02:55:11,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6399 conditions, 1385 events. 631/1385 cut-off events. For 11349/11458 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8457 event pairs, 131 based on Foata normal form. 36/1281 useless extension candidates. Maximal degree in co-relation 5939. Up to 357 conditions per place. [2024-11-28 02:55:11,291 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 85 selfloop transitions, 22 changer transitions 0/140 dead transitions. [2024-11-28 02:55:11,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 140 transitions, 1998 flow [2024-11-28 02:55:11,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:55:11,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 02:55:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-11-28 02:55:11,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7265625 [2024-11-28 02:55:11,293 INFO L175 Difference]: Start difference. First operand has 95 places, 105 transitions, 1440 flow. Second operand 4 states and 93 transitions. [2024-11-28 02:55:11,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 140 transitions, 1998 flow [2024-11-28 02:55:11,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 140 transitions, 1928 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-11-28 02:55:11,333 INFO L231 Difference]: Finished difference. Result has 97 places, 102 transitions, 1390 flow [2024-11-28 02:55:11,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1390, PETRI_PLACES=97, PETRI_TRANSITIONS=102} [2024-11-28 02:55:11,334 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 65 predicate places. [2024-11-28 02:55:11,334 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 102 transitions, 1390 flow [2024-11-28 02:55:11,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:11,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:11,335 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:11,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:55:11,335 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-28 02:55:11,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:11,336 INFO L85 PathProgramCache]: Analyzing trace with hash 733393720, now seen corresponding path program 2 times [2024-11-28 02:55:11,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:11,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923735388] [2024-11-28 02:55:11,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:55:11,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:11,371 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:55:11,371 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:55:11,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:11,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:11,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923735388] [2024-11-28 02:55:11,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923735388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:11,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:11,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:55:11,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673394819] [2024-11-28 02:55:11,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:11,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:55:11,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:11,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:55:11,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:55:11,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-28 02:55:11,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 102 transitions, 1390 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:11,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:11,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-28 02:55:11,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:12,143 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([249] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][39], [42#true, 170#(and (= (mod (+ 4294967295 ~i2~0) 4294967296) 0) (<= 1 (mod ~N~0 2147483648))), Black: 65#(<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296))), Black: 67#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296)))), Black: 76#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0))), Black: 71#true, Black: 80#true, 315#(and (<= (div ~d1~0 256) 0) (<= 1 ~d1~0)), 318#true, 92#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 88#true, 99#(not (= (mod ~d1~0 256) 0)), Black: 100#(and (<= 0 ~d1~0) (<= (mod ~d1~0 256) 0)), Black: 97#true, Black: 40#(= (mod ~pos~0 4294967296) 0), 62#true, 10#L43-2true, Black: 113#(<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (* 2 ~N~0)), Black: 44#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 47#(and (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)) (<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296)))), 4#L86true, Black: 298#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (* 2 ~N~0)) (= (mod (+ 4294967295 ~i2~0) 4294967296) 0)), Black: 45#(<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296))), 74#(<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0)), Black: 104#true, Black: 302#(and (= (mod (+ 4294967295 ~i2~0) 4294967296) 0) (<= 1 (mod ~N~0 2147483648)) (<= (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296)))), 85#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 296#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod (+ (* 2 ~N~0) (* 4294967295 ~i1~0) 4294967295 ~i2~0) 4294967296)) (* 2 ~N~0)) (= (mod ~i2~0 4294967296) 0)), Black: 275#(< (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296) 1)), 28#L61-1true, Black: 57#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)) (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296))), Black: 54#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 312#true, 55#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0))]) [2024-11-28 02:55:12,144 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 02:55:12,144 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 02:55:12,145 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 02:55:12,145 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 02:55:12,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([250] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][38], [42#true, 170#(and (= (mod (+ 4294967295 ~i2~0) 4294967296) 0) (<= 1 (mod ~N~0 2147483648))), 20#L46-2true, 314#(= (mod ~d1~0 256) 0), Black: 65#(<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296))), Black: 67#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296)))), Black: 76#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0))), Black: 71#true, Black: 80#true, 318#true, 92#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 88#true, Black: 99#(not (= (mod ~d1~0 256) 0)), Black: 97#true, Black: 40#(= (mod ~pos~0 4294967296) 0), 100#(and (<= 0 ~d1~0) (<= (mod ~d1~0 256) 0)), 62#true, Black: 113#(<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (* 2 ~N~0)), Black: 44#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 47#(and (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)) (<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296)))), 4#L86true, Black: 298#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (* 2 ~N~0)) (= (mod (+ 4294967295 ~i2~0) 4294967296) 0)), Black: 45#(<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296))), 74#(<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0)), Black: 104#true, Black: 302#(and (= (mod (+ 4294967295 ~i2~0) 4294967296) 0) (<= 1 (mod ~N~0 2147483648)) (<= (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296)))), Black: 296#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod (+ (* 2 ~N~0) (* 4294967295 ~i1~0) 4294967295 ~i2~0) 4294967296)) (* 2 ~N~0)) (= (mod ~i2~0 4294967296) 0)), 85#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 275#(< (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296) 1)), 28#L61-1true, Black: 57#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)) (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296))), Black: 54#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 315#(and (<= (div ~d1~0 256) 0) (<= 1 ~d1~0)), Black: 312#true, 55#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0))]) [2024-11-28 02:55:12,155 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 02:55:12,155 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 02:55:12,155 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 02:55:12,155 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 02:55:12,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([249] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][39], [42#true, Black: 65#(<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296))), Black: 67#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296)))), Black: 76#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0))), Black: 71#true, 231#(< (mod ~i2~0 4294967296) (* 2 (mod ~N~0 2147483648))), Black: 80#true, 315#(and (<= (div ~d1~0 256) 0) (<= 1 ~d1~0)), 318#true, 92#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 88#true, 99#(not (= (mod ~d1~0 256) 0)), Black: 100#(and (<= 0 ~d1~0) (<= (mod ~d1~0 256) 0)), Black: 97#true, Black: 40#(= (mod ~pos~0 4294967296) 0), 62#true, 10#L43-2true, Black: 113#(<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (* 2 ~N~0)), Black: 44#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), 4#L86true, Black: 170#(and (= (mod (+ 4294967295 ~i2~0) 4294967296) 0) (<= 1 (mod ~N~0 2147483648))), Black: 47#(and (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)) (<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296)))), Black: 298#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (* 2 ~N~0)) (= (mod (+ 4294967295 ~i2~0) 4294967296) 0)), Black: 45#(<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296))), Black: 104#true, 74#(<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0)), Black: 302#(and (= (mod (+ 4294967295 ~i2~0) 4294967296) 0) (<= 1 (mod ~N~0 2147483648)) (<= (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296)))), 85#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 296#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod (+ (* 2 ~N~0) (* 4294967295 ~i1~0) 4294967295 ~i2~0) 4294967296)) (* 2 ~N~0)) (= (mod ~i2~0 4294967296) 0)), Black: 275#(< (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296) 1)), 28#L61-1true, Black: 57#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)) (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296))), Black: 54#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 312#true, 55#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0))]) [2024-11-28 02:55:12,359 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-28 02:55:12,359 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:55:12,359 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:55:12,359 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:55:12,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([250] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][38], [42#true, 20#L46-2true, 314#(= (mod ~d1~0 256) 0), Black: 65#(<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296))), Black: 67#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296)))), Black: 76#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0))), Black: 71#true, 231#(< (mod ~i2~0 4294967296) (* 2 (mod ~N~0 2147483648))), Black: 80#true, 318#true, 92#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 88#true, Black: 99#(not (= (mod ~d1~0 256) 0)), Black: 97#true, Black: 40#(= (mod ~pos~0 4294967296) 0), 100#(and (<= 0 ~d1~0) (<= (mod ~d1~0 256) 0)), 62#true, Black: 113#(<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (* 2 ~N~0)), Black: 44#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), 4#L86true, Black: 170#(and (= (mod (+ 4294967295 ~i2~0) 4294967296) 0) (<= 1 (mod ~N~0 2147483648))), Black: 47#(and (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)) (<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296)))), Black: 298#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (* 2 ~N~0)) (= (mod (+ 4294967295 ~i2~0) 4294967296) 0)), Black: 45#(<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296))), Black: 104#true, 74#(<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0)), Black: 302#(and (= (mod (+ 4294967295 ~i2~0) 4294967296) 0) (<= 1 (mod ~N~0 2147483648)) (<= (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296)))), Black: 296#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod (+ (* 2 ~N~0) (* 4294967295 ~i1~0) 4294967295 ~i2~0) 4294967296)) (* 2 ~N~0)) (= (mod ~i2~0 4294967296) 0)), 85#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 275#(< (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296) 1)), 28#L61-1true, Black: 57#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)) (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296))), Black: 54#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 315#(and (<= (div ~d1~0 256) 0) (<= 1 ~d1~0)), Black: 312#true, 55#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0))]) [2024-11-28 02:55:12,365 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-28 02:55:12,365 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:55:12,365 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:55:12,365 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:55:12,424 INFO L124 PetriNetUnfolderBase]: 1608/3329 cut-off events. [2024-11-28 02:55:12,425 INFO L125 PetriNetUnfolderBase]: For 31804/31905 co-relation queries the response was YES. [2024-11-28 02:55:12,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16260 conditions, 3329 events. 1608/3329 cut-off events. For 31804/31905 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 25414 event pairs, 419 based on Foata normal form. 13/2973 useless extension candidates. Maximal degree in co-relation 14893. Up to 1039 conditions per place. [2024-11-28 02:55:12,466 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 146 selfloop transitions, 28 changer transitions 0/209 dead transitions. [2024-11-28 02:55:12,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 209 transitions, 3499 flow [2024-11-28 02:55:12,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:55:12,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 02:55:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-11-28 02:55:12,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7578125 [2024-11-28 02:55:12,468 INFO L175 Difference]: Start difference. First operand has 97 places, 102 transitions, 1390 flow. Second operand 4 states and 97 transitions. [2024-11-28 02:55:12,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 209 transitions, 3499 flow [2024-11-28 02:55:12,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 209 transitions, 3482 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-28 02:55:12,568 INFO L231 Difference]: Finished difference. Result has 102 places, 128 transitions, 1830 flow [2024-11-28 02:55:12,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1830, PETRI_PLACES=102, PETRI_TRANSITIONS=128} [2024-11-28 02:55:12,569 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 70 predicate places. [2024-11-28 02:55:12,569 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 128 transitions, 1830 flow [2024-11-28 02:55:12,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:12,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:12,570 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:12,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:55:12,571 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-28 02:55:12,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:12,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1104209514, now seen corresponding path program 1 times [2024-11-28 02:55:12,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:12,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764026786] [2024-11-28 02:55:12,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:12,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:12,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:12,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764026786] [2024-11-28 02:55:12,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764026786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:55:12,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535365769] [2024-11-28 02:55:12,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:12,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:12,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:55:12,869 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:55:12,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:55:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:12,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-28 02:55:12,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:55:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:13,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:55:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:13,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535365769] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:55:13,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:55:13,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-28 02:55:13,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625534125] [2024-11-28 02:55:13,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:55:13,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:55:13,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:13,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:55:13,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:55:13,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2024-11-28 02:55:13,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 128 transitions, 1830 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:13,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:13,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2024-11-28 02:55:13,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:15,026 INFO L124 PetriNetUnfolderBase]: 2469/5437 cut-off events. [2024-11-28 02:55:15,027 INFO L125 PetriNetUnfolderBase]: For 57092/57310 co-relation queries the response was YES. [2024-11-28 02:55:15,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28873 conditions, 5437 events. 2469/5437 cut-off events. For 57092/57310 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 44870 event pairs, 408 based on Foata normal form. 24/5290 useless extension candidates. Maximal degree in co-relation 26036. Up to 2046 conditions per place. [2024-11-28 02:55:15,100 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 254 selfloop transitions, 25 changer transitions 1/311 dead transitions. [2024-11-28 02:55:15,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 311 transitions, 5253 flow [2024-11-28 02:55:15,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:55:15,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:55:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-11-28 02:55:15,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2024-11-28 02:55:15,103 INFO L175 Difference]: Start difference. First operand has 102 places, 128 transitions, 1830 flow. Second operand 6 states and 148 transitions. [2024-11-28 02:55:15,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 311 transitions, 5253 flow [2024-11-28 02:55:15,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 311 transitions, 5253 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 02:55:15,331 INFO L231 Difference]: Finished difference. Result has 108 places, 144 transitions, 1970 flow [2024-11-28 02:55:15,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1830, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1970, PETRI_PLACES=108, PETRI_TRANSITIONS=144} [2024-11-28 02:55:15,332 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 76 predicate places. [2024-11-28 02:55:15,332 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 144 transitions, 1970 flow [2024-11-28 02:55:15,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:15,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:15,333 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:15,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 02:55:15,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:15,534 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-28 02:55:15,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:15,535 INFO L85 PathProgramCache]: Analyzing trace with hash 979550834, now seen corresponding path program 1 times [2024-11-28 02:55:15,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:15,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928025197] [2024-11-28 02:55:15,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:55:15,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:55:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:15,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:15,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928025197] [2024-11-28 02:55:15,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928025197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:55:15,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:55:15,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:55:15,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206334690] [2024-11-28 02:55:15,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:55:15,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:55:15,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:15,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:55:15,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:55:15,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-28 02:55:15,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 144 transitions, 1970 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:15,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:15,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-28 02:55:15,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:17,055 INFO L124 PetriNetUnfolderBase]: 2271/4894 cut-off events. [2024-11-28 02:55:17,055 INFO L125 PetriNetUnfolderBase]: For 58286/58525 co-relation queries the response was YES. [2024-11-28 02:55:17,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27492 conditions, 4894 events. 2271/4894 cut-off events. For 58286/58525 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 39432 event pairs, 378 based on Foata normal form. 98/4781 useless extension candidates. Maximal degree in co-relation 25019. Up to 1557 conditions per place. [2024-11-28 02:55:17,118 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 134 selfloop transitions, 28 changer transitions 0/204 dead transitions. [2024-11-28 02:55:17,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 204 transitions, 3253 flow [2024-11-28 02:55:17,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:55:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 02:55:17,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-11-28 02:55:17,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7265625 [2024-11-28 02:55:17,120 INFO L175 Difference]: Start difference. First operand has 108 places, 144 transitions, 1970 flow. Second operand 4 states and 93 transitions. [2024-11-28 02:55:17,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 204 transitions, 3253 flow [2024-11-28 02:55:17,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 204 transitions, 3197 flow, removed 28 selfloop flow, removed 0 redundant places. [2024-11-28 02:55:17,392 INFO L231 Difference]: Finished difference. Result has 113 places, 134 transitions, 1887 flow [2024-11-28 02:55:17,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1887, PETRI_PLACES=113, PETRI_TRANSITIONS=134} [2024-11-28 02:55:17,393 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 81 predicate places. [2024-11-28 02:55:17,393 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 134 transitions, 1887 flow [2024-11-28 02:55:17,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:17,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:17,394 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:17,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:55:17,394 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-28 02:55:17,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:17,395 INFO L85 PathProgramCache]: Analyzing trace with hash -447411940, now seen corresponding path program 2 times [2024-11-28 02:55:17,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:17,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583210612] [2024-11-28 02:55:17,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:55:17,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:17,436 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:55:17,438 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:55:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:17,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:17,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583210612] [2024-11-28 02:55:17,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583210612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:55:17,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455459049] [2024-11-28 02:55:17,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:55:17,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:17,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:55:17,706 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:55:17,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:55:17,815 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:55:17,815 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:55:17,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 02:55:17,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:55:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:17,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:55:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:18,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455459049] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:55:18,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:55:18,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-28 02:55:18,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750573475] [2024-11-28 02:55:18,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:55:18,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:55:18,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:18,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:55:18,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:55:18,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2024-11-28 02:55:18,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 134 transitions, 1887 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:18,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:18,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2024-11-28 02:55:18,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:19,824 INFO L124 PetriNetUnfolderBase]: 2544/5838 cut-off events. [2024-11-28 02:55:19,824 INFO L125 PetriNetUnfolderBase]: For 72534/72760 co-relation queries the response was YES. [2024-11-28 02:55:19,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33351 conditions, 5838 events. 2544/5838 cut-off events. For 72534/72760 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 49893 event pairs, 411 based on Foata normal form. 34/5747 useless extension candidates. Maximal degree in co-relation 29833. Up to 2865 conditions per place. [2024-11-28 02:55:19,901 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 237 selfloop transitions, 27 changer transitions 1/297 dead transitions. [2024-11-28 02:55:19,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 297 transitions, 5035 flow [2024-11-28 02:55:19,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:55:19,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:55:19,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-11-28 02:55:19,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7552083333333334 [2024-11-28 02:55:19,904 INFO L175 Difference]: Start difference. First operand has 113 places, 134 transitions, 1887 flow. Second operand 6 states and 145 transitions. [2024-11-28 02:55:19,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 297 transitions, 5035 flow [2024-11-28 02:55:20,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 297 transitions, 5035 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 02:55:20,060 INFO L231 Difference]: Finished difference. Result has 120 places, 151 transitions, 2069 flow [2024-11-28 02:55:20,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2069, PETRI_PLACES=120, PETRI_TRANSITIONS=151} [2024-11-28 02:55:20,061 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 88 predicate places. [2024-11-28 02:55:20,061 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 151 transitions, 2069 flow [2024-11-28 02:55:20,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:20,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:20,062 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:20,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 02:55:20,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:20,263 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-28 02:55:20,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:20,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1867301118, now seen corresponding path program 3 times [2024-11-28 02:55:20,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:20,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906100862] [2024-11-28 02:55:20,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 02:55:20,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:20,303 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-28 02:55:20,303 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:55:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:20,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:20,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906100862] [2024-11-28 02:55:20,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906100862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:55:20,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854581212] [2024-11-28 02:55:20,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 02:55:20,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:20,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:55:20,625 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:55:20,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:55:20,762 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-28 02:55:20,762 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:55:20,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 02:55:20,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:55:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:20,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:55:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:21,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854581212] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:55:21,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:55:21,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-28 02:55:21,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903020520] [2024-11-28 02:55:21,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:55:21,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:55:21,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:21,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:55:21,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:55:21,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2024-11-28 02:55:21,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 151 transitions, 2069 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:21,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:21,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2024-11-28 02:55:21,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:22,996 INFO L124 PetriNetUnfolderBase]: 3335/7562 cut-off events. [2024-11-28 02:55:22,996 INFO L125 PetriNetUnfolderBase]: For 99088/99454 co-relation queries the response was YES. [2024-11-28 02:55:23,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44956 conditions, 7562 events. 3335/7562 cut-off events. For 99088/99454 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 67428 event pairs, 493 based on Foata normal form. 77/7454 useless extension candidates. Maximal degree in co-relation 40551. Up to 2832 conditions per place. [2024-11-28 02:55:23,061 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 264 selfloop transitions, 44 changer transitions 1/341 dead transitions. [2024-11-28 02:55:23,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 341 transitions, 5807 flow [2024-11-28 02:55:23,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:55:23,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:55:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-11-28 02:55:23,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.765625 [2024-11-28 02:55:23,063 INFO L175 Difference]: Start difference. First operand has 120 places, 151 transitions, 2069 flow. Second operand 6 states and 147 transitions. [2024-11-28 02:55:23,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 341 transitions, 5807 flow [2024-11-28 02:55:23,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 341 transitions, 5793 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-11-28 02:55:23,355 INFO L231 Difference]: Finished difference. Result has 129 places, 174 transitions, 2405 flow [2024-11-28 02:55:23,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2059, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2405, PETRI_PLACES=129, PETRI_TRANSITIONS=174} [2024-11-28 02:55:23,357 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 97 predicate places. [2024-11-28 02:55:23,357 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 174 transitions, 2405 flow [2024-11-28 02:55:23,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:23,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:23,357 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:23,369 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 02:55:23,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:23,562 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-28 02:55:23,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:23,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1638750400, now seen corresponding path program 4 times [2024-11-28 02:55:23,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:23,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248610504] [2024-11-28 02:55:23,563 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 02:55:23,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:23,590 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 02:55:23,590 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:55:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:23,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:23,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248610504] [2024-11-28 02:55:23,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248610504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:55:23,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534477361] [2024-11-28 02:55:23,855 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 02:55:23,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:23,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:55:23,858 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:55:23,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:55:23,946 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 02:55:23,946 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:55:23,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-28 02:55:23,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:55:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:24,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:55:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:24,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534477361] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:55:24,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:55:24,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-28 02:55:24,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593246342] [2024-11-28 02:55:24,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:55:24,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:55:24,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:24,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:55:24,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:55:24,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2024-11-28 02:55:24,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 174 transitions, 2405 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:24,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:24,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2024-11-28 02:55:24,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:26,287 INFO L124 PetriNetUnfolderBase]: 3567/8163 cut-off events. [2024-11-28 02:55:26,288 INFO L125 PetriNetUnfolderBase]: For 112625/113011 co-relation queries the response was YES. [2024-11-28 02:55:26,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50409 conditions, 8163 events. 3567/8163 cut-off events. For 112625/113011 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 74242 event pairs, 558 based on Foata normal form. 107/8113 useless extension candidates. Maximal degree in co-relation 45393. Up to 4150 conditions per place. [2024-11-28 02:55:26,397 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 269 selfloop transitions, 33 changer transitions 1/335 dead transitions. [2024-11-28 02:55:26,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 335 transitions, 5715 flow [2024-11-28 02:55:26,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:55:26,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:55:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-11-28 02:55:26,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7552083333333334 [2024-11-28 02:55:26,400 INFO L175 Difference]: Start difference. First operand has 129 places, 174 transitions, 2405 flow. Second operand 6 states and 145 transitions. [2024-11-28 02:55:26,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 335 transitions, 5715 flow [2024-11-28 02:55:26,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 335 transitions, 5697 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-28 02:55:26,780 INFO L231 Difference]: Finished difference. Result has 137 places, 189 transitions, 2654 flow [2024-11-28 02:55:26,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2391, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2654, PETRI_PLACES=137, PETRI_TRANSITIONS=189} [2024-11-28 02:55:26,781 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 105 predicate places. [2024-11-28 02:55:26,781 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 189 transitions, 2654 flow [2024-11-28 02:55:26,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:26,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:55:26,781 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:55:26,793 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 02:55:26,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-28 02:55:26,982 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-28 02:55:26,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:55:26,983 INFO L85 PathProgramCache]: Analyzing trace with hash 529828744, now seen corresponding path program 5 times [2024-11-28 02:55:26,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:55:26,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902536548] [2024-11-28 02:55:26,983 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 02:55:26,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:55:27,024 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-28 02:55:27,025 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:55:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:27,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:55:27,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902536548] [2024-11-28 02:55:27,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902536548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:55:27,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288490310] [2024-11-28 02:55:27,730 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 02:55:27,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:55:27,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:55:27,734 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:55:27,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 02:55:27,889 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-28 02:55:27,890 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:55:27,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 02:55:27,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:55:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:28,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:55:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:55:29,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288490310] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:55:29,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:55:29,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2024-11-28 02:55:29,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365902360] [2024-11-28 02:55:29,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:55:29,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:55:29,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:55:29,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:55:29,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-11-28 02:55:29,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-28 02:55:29,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 189 transitions, 2654 flow. Second operand has 18 states, 18 states have (on average 16.61111111111111) internal successors, (299), 18 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:55:29,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:55:29,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-28 02:55:29,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:55:31,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:55:36,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:55:44,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:55:48,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:55:52,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:55:57,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:56:00,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:56:09,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:56:11,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:56:16,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:56:19,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:56:23,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:56:26,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:56:40,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:56:47,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:56:58,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:57:00,793 INFO L124 PetriNetUnfolderBase]: 15285/34626 cut-off events. [2024-11-28 02:57:00,793 INFO L125 PetriNetUnfolderBase]: For 506423/508515 co-relation queries the response was YES. [2024-11-28 02:57:01,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215629 conditions, 34626 events. 15285/34626 cut-off events. For 506423/508515 co-relation queries the response was YES. Maximal size of possible extension queue 1459. Compared 378048 event pairs, 462 based on Foata normal form. 1148/35679 useless extension candidates. Maximal degree in co-relation 197262. Up to 7133 conditions per place. [2024-11-28 02:57:01,372 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 773 selfloop transitions, 267 changer transitions 3/1097 dead transitions. [2024-11-28 02:57:01,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 1097 transitions, 15550 flow [2024-11-28 02:57:01,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-28 02:57:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-11-28 02:57:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 779 transitions. [2024-11-28 02:57:01,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6762152777777778 [2024-11-28 02:57:01,378 INFO L175 Difference]: Start difference. First operand has 137 places, 189 transitions, 2654 flow. Second operand 36 states and 779 transitions. [2024-11-28 02:57:01,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 1097 transitions, 15550 flow [2024-11-28 02:57:03,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 1097 transitions, 15318 flow, removed 103 selfloop flow, removed 1 redundant places. [2024-11-28 02:57:03,229 INFO L231 Difference]: Finished difference. Result has 195 places, 430 transitions, 8363 flow [2024-11-28 02:57:03,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2620, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=8363, PETRI_PLACES=195, PETRI_TRANSITIONS=430} [2024-11-28 02:57:03,230 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 163 predicate places. [2024-11-28 02:57:03,230 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 430 transitions, 8363 flow [2024-11-28 02:57:03,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 16.61111111111111) internal successors, (299), 18 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:57:03,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:57:03,231 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:57:03,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 02:57:03,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-28 02:57:03,432 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-28 02:57:03,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:57:03,432 INFO L85 PathProgramCache]: Analyzing trace with hash 728251646, now seen corresponding path program 6 times [2024-11-28 02:57:03,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:57:03,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406481513] [2024-11-28 02:57:03,433 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 02:57:03,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:57:03,511 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-11-28 02:57:03,512 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:57:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:57:08,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:57:08,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406481513] [2024-11-28 02:57:08,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406481513] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:57:08,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374407501] [2024-11-28 02:57:08,839 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 02:57:08,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:57:08,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:57:08,843 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:57:08,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 02:57:09,042 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-11-28 02:57:09,042 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:57:09,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 02:57:09,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:57:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:57:09,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:57:10,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:57:10,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374407501] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:57:10,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:57:10,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 24 [2024-11-28 02:57:10,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819030056] [2024-11-28 02:57:10,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:57:10,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 02:57:10,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:57:10,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 02:57:10,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=459, Unknown=1, NotChecked=0, Total=552 [2024-11-28 02:57:10,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-28 02:57:10,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 430 transitions, 8363 flow. Second operand has 24 states, 24 states have (on average 13.916666666666666) internal successors, (334), 24 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:57:10,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:57:10,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-28 02:57:10,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:57:17,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:57:30,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:57:36,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:57:45,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:57:57,236 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 64 DAG size of output: 46 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 02:58:19,514 WARN L286 SmtUtils]: Spent 16.17s on a formula simplification. DAG size of input: 72 DAG size of output: 59 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 02:58:22,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:58:40,098 WARN L286 SmtUtils]: Spent 16.36s on a formula simplification. DAG size of input: 65 DAG size of output: 58 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 02:58:42,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:58:53,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:58:59,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:59:03,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:59:07,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:59:56,495 WARN L286 SmtUtils]: Spent 7.41s on a formula simplification. DAG size of input: 46 DAG size of output: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 03:00:01,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:00:09,346 WARN L286 SmtUtils]: Spent 6.51s on a formula simplification. DAG size of input: 55 DAG size of output: 43 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 03:00:10,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:00:14,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:00:28,166 WARN L286 SmtUtils]: Spent 8.54s on a formula simplification. DAG size of input: 55 DAG size of output: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 03:00:32,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:00:52,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:01:02,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:01:43,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:01:48,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:02:17,230 WARN L286 SmtUtils]: Spent 6.23s on a formula simplification. DAG size of input: 43 DAG size of output: 38 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 03:02:21,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:02:25,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:02:41,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:03:04,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:03:11,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:03:17,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:03:26,469 INFO L124 PetriNetUnfolderBase]: 37233/76912 cut-off events. [2024-11-28 03:03:26,469 INFO L125 PetriNetUnfolderBase]: For 1993381/1993381 co-relation queries the response was YES. [2024-11-28 03:03:27,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584428 conditions, 76912 events. 37233/76912 cut-off events. For 1993381/1993381 co-relation queries the response was YES. Maximal size of possible extension queue 2881. Compared 853431 event pairs, 2084 based on Foata normal form. 2290/79201 useless extension candidates. Maximal degree in co-relation 556224. Up to 14505 conditions per place. [2024-11-28 03:03:27,472 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 1254 selfloop transitions, 585 changer transitions 1/1853 dead transitions. [2024-11-28 03:03:27,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 1853 transitions, 31952 flow [2024-11-28 03:03:27,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-28 03:03:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2024-11-28 03:03:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 790 transitions. [2024-11-28 03:03:27,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6021341463414634 [2024-11-28 03:03:27,477 INFO L175 Difference]: Start difference. First operand has 195 places, 430 transitions, 8363 flow. Second operand 41 states and 790 transitions. [2024-11-28 03:03:27,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 1853 transitions, 31952 flow [2024-11-28 03:04:01,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 1853 transitions, 31277 flow, removed 318 selfloop flow, removed 5 redundant places. [2024-11-28 03:04:01,887 INFO L231 Difference]: Finished difference. Result has 258 places, 836 transitions, 19698 flow [2024-11-28 03:04:01,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=8046, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=19698, PETRI_PLACES=258, PETRI_TRANSITIONS=836} [2024-11-28 03:04:01,888 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 226 predicate places. [2024-11-28 03:04:01,888 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 836 transitions, 19698 flow [2024-11-28 03:04:01,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 13.916666666666666) internal successors, (334), 24 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:04:01,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:04:01,888 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:04:01,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 03:04:02,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 03:04:02,089 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-28 03:04:02,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:02,090 INFO L85 PathProgramCache]: Analyzing trace with hash -569744234, now seen corresponding path program 7 times [2024-11-28 03:04:02,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:04:02,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020115259] [2024-11-28 03:04:02,090 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 03:04:02,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:04:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:04:02,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:04:02,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020115259] [2024-11-28 03:04:02,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020115259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:04:02,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976899054] [2024-11-28 03:04:02,836 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 03:04:02,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:04:02,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:04:02,839 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:04:02,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f6c6d6-43f4-4fa5-bdca-82b919c3f8f5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:04:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:04:02,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 03:04:02,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:04:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:04:04,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:04:25,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:04:25,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976899054] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:04:25,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:04:25,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2024-11-28 03:04:25,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769577651] [2024-11-28 03:04:25,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:04:25,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 03:04:25,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:04:25,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 03:04:25,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=348, Unknown=4, NotChecked=0, Total=420 [2024-11-28 03:04:29,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:04:29,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-28 03:04:29,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 836 transitions, 19698 flow. Second operand has 21 states, 21 states have (on average 16.38095238095238) internal successors, (344), 21 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:04:29,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:04:29,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-28 03:04:29,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:04:44,706 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 34 DAG size of output: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 03:04:56,522 WARN L286 SmtUtils]: Spent 7.42s on a formula simplification. DAG size of input: 49 DAG size of output: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 03:04:57,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:05:01,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:05:05,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:05:25,087 WARN L286 SmtUtils]: Spent 14.04s on a formula simplification. DAG size of input: 51 DAG size of output: 47 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 03:05:27,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:05:32,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:05:39,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:05:53,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:06:00,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:06:03,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:06:08,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:06:20,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:06:23,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:06:26,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:06:38,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:06:51,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:06:53,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:07:16,133 WARN L286 SmtUtils]: Spent 6.41s on a formula simplification. DAG size of input: 51 DAG size of output: 45 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 03:07:19,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:07:31,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:07:40,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:07:44,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []