./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/bench-exp2x4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/bench-exp2x4.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya --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 f64e270e7d8e8fe7bf3b7cd641a237e1a4059fd56c14ffbabdcef7751fd05704 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:58:13,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:58:13,143 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:58:13,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:58:13,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:58:13,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:58:13,168 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:58:13,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:58:13,169 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:58:13,170 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:58:13,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:58:13,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:58:13,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:58:13,172 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:58:13,172 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:58:13,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:58:13,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:58:13,174 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:58:13,174 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:58:13,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:58:13,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:58:13,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:58:13,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:58:13,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:58:13,178 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:58:13,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:58:13,178 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:58:13,179 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:58:13,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:58:13,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:58:13,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:58:13,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:58:13,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:58:13,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:58:13,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:58:13,181 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:58:13,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:58:13,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:58:13,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:58:13,182 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:58:13,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:58:13,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:58:13,182 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya 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 -> f64e270e7d8e8fe7bf3b7cd641a237e1a4059fd56c14ffbabdcef7751fd05704 [2023-11-29 01:58:13,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:58:13,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:58:13,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:58:13,420 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:58:13,420 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:58:13,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/bench-exp2x4.wvr.c [2023-11-29 01:58:16,138 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:58:16,317 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:58:16,317 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c [2023-11-29 01:58:16,325 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/data/07ef9ed23/0ab5230f6303460eb28b172d693486e4/FLAGcde1cca74 [2023-11-29 01:58:16,337 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/data/07ef9ed23/0ab5230f6303460eb28b172d693486e4 [2023-11-29 01:58:16,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:58:16,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:58:16,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:58:16,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:58:16,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:58:16,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:58:16" (1/1) ... [2023-11-29 01:58:16,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d9d1122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:16, skipping insertion in model container [2023-11-29 01:58:16,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:58:16" (1/1) ... [2023-11-29 01:58:16,369 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:58:16,520 WARN L240 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_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c[2361,2374] [2023-11-29 01:58:16,525 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:58:16,534 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:58:16,556 WARN L240 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_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c[2361,2374] [2023-11-29 01:58:16,557 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:58:16,570 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:58:16,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:16 WrapperNode [2023-11-29 01:58:16,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:58:16,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:58:16,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:58:16,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:58:16,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:16" (1/1) ... [2023-11-29 01:58:16,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:16" (1/1) ... [2023-11-29 01:58:16,609 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2023-11-29 01:58:16,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:58:16,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:58:16,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:58:16,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:58:16,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:16" (1/1) ... [2023-11-29 01:58:16,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:16" (1/1) ... [2023-11-29 01:58:16,622 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:16" (1/1) ... [2023-11-29 01:58:16,639 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 01:58:16,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:16" (1/1) ... [2023-11-29 01:58:16,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:16" (1/1) ... [2023-11-29 01:58:16,646 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:16" (1/1) ... [2023-11-29 01:58:16,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:16" (1/1) ... [2023-11-29 01:58:16,652 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:16" (1/1) ... [2023-11-29 01:58:16,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:16" (1/1) ... [2023-11-29 01:58:16,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:58:16,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:58:16,659 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:58:16,659 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:58:16,660 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:16" (1/1) ... [2023-11-29 01:58:16,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:58:16,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:58:16,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:58:16,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:58:16,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:58:16,721 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 01:58:16,721 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 01:58:16,721 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 01:58:16,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 01:58:16,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 01:58:16,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 01:58:16,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-29 01:58:16,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-29 01:58:16,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:58:16,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 01:58:16,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 01:58:16,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 01:58:16,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 01:58:16,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:58:16,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 01:58:16,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 01:58:16,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 01:58:16,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 01:58:16,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 01:58:16,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:58:16,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:58:16,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 01:58:16,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 01:58:16,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 01:58:16,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 01:58:16,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 01:58:16,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:58:16,727 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 01:58:16,853 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:58:16,855 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:58:17,079 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:58:17,246 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:58:17,247 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 01:58:17,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:58:17 BoogieIcfgContainer [2023-11-29 01:58:17,247 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:58:17,251 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:58:17,251 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:58:17,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:58:17,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:58:16" (1/3) ... [2023-11-29 01:58:17,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718dadf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:58:17, skipping insertion in model container [2023-11-29 01:58:17,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:58:16" (2/3) ... [2023-11-29 01:58:17,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718dadf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:58:17, skipping insertion in model container [2023-11-29 01:58:17,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:58:17" (3/3) ... [2023-11-29 01:58:17,258 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2023-11-29 01:58:17,267 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 01:58:17,303 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:58:17,303 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:58:17,303 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 01:58:17,355 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-29 01:58:17,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 98 flow [2023-11-29 01:58:17,419 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-11-29 01:58:17,419 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 01:58:17,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 17 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2023-11-29 01:58:17,423 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 35 transitions, 98 flow [2023-11-29 01:58:17,427 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 30 transitions, 84 flow [2023-11-29 01:58:17,438 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:58:17,445 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@1dbf6c91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:58:17,446 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-29 01:58:17,459 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 01:58:17,459 INFO L124 PetriNetUnfolderBase]: 4/29 cut-off events. [2023-11-29 01:58:17,459 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 01:58:17,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:58:17,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:17,461 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 01:58:17,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:17,466 INFO L85 PathProgramCache]: Analyzing trace with hash 253207303, now seen corresponding path program 1 times [2023-11-29 01:58:17,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:17,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925139469] [2023-11-29 01:58:17,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:17,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:17,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:17,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925139469] [2023-11-29 01:58:17,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925139469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:17,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:17,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:58:17,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379754385] [2023-11-29 01:58:17,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:17,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:58:17,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:18,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:58:18,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:58:18,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 01:58:18,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) [2023-11-29 01:58:18,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:58:18,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 01:58:18,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:58:18,429 INFO L124 PetriNetUnfolderBase]: 1537/1955 cut-off events. [2023-11-29 01:58:18,429 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2023-11-29 01:58:18,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4057 conditions, 1955 events. 1537/1955 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6342 event pairs, 141 based on Foata normal form. 1/1135 useless extension candidates. Maximal degree in co-relation 3091. Up to 1733 conditions per place. [2023-11-29 01:58:18,451 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 41 selfloop transitions, 5 changer transitions 1/52 dead transitions. [2023-11-29 01:58:18,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 52 transitions, 243 flow [2023-11-29 01:58:18,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:58:18,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:58:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2023-11-29 01:58:18,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2023-11-29 01:58:18,465 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 75 transitions. [2023-11-29 01:58:18,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 75 transitions. [2023-11-29 01:58:18,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:58:18,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 75 transitions. [2023-11-29 01:58:18,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 25.0) internal successors, (75), 3 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) [2023-11-29 01:58:18,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 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) [2023-11-29 01:58:18,475 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 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) [2023-11-29 01:58:18,477 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 84 flow. Second operand 3 states and 75 transitions. [2023-11-29 01:58:18,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 52 transitions, 243 flow [2023-11-29 01:58:18,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 52 transitions, 213 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-29 01:58:18,486 INFO L231 Difference]: Finished difference. Result has 34 places, 34 transitions, 101 flow [2023-11-29 01:58:18,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=34, PETRI_TRANSITIONS=34} [2023-11-29 01:58:18,492 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2023-11-29 01:58:18,492 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 34 transitions, 101 flow [2023-11-29 01:58:18,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) [2023-11-29 01:58:18,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:58:18,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:18,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:58:18,493 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 01:58:18,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:18,494 INFO L85 PathProgramCache]: Analyzing trace with hash -805030782, now seen corresponding path program 1 times [2023-11-29 01:58:18,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:18,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526666110] [2023-11-29 01:58:18,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:18,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:18,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:18,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526666110] [2023-11-29 01:58:18,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526666110] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:18,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:18,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:58:18,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922408656] [2023-11-29 01:58:18,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:18,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:58:18,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:18,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:58:18,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:58:18,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 01:58:18,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:18,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:58:18,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 01:58:18,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:58:19,088 INFO L124 PetriNetUnfolderBase]: 1843/2368 cut-off events. [2023-11-29 01:58:19,089 INFO L125 PetriNetUnfolderBase]: For 579/579 co-relation queries the response was YES. [2023-11-29 01:58:19,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5874 conditions, 2368 events. 1843/2368 cut-off events. For 579/579 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8342 event pairs, 139 based on Foata normal form. 34/2396 useless extension candidates. Maximal degree in co-relation 1448. Up to 967 conditions per place. [2023-11-29 01:58:19,112 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 72 selfloop transitions, 10 changer transitions 0/87 dead transitions. [2023-11-29 01:58:19,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 87 transitions, 415 flow [2023-11-29 01:58:19,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:58:19,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:58:19,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2023-11-29 01:58:19,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6914285714285714 [2023-11-29 01:58:19,114 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 121 transitions. [2023-11-29 01:58:19,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 121 transitions. [2023-11-29 01:58:19,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:58:19,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 121 transitions. [2023-11-29 01:58:19,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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) [2023-11-29 01:58:19,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 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) [2023-11-29 01:58:19,118 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 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) [2023-11-29 01:58:19,118 INFO L175 Difference]: Start difference. First operand has 34 places, 34 transitions, 101 flow. Second operand 5 states and 121 transitions. [2023-11-29 01:58:19,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 87 transitions, 415 flow [2023-11-29 01:58:19,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 87 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:58:19,123 INFO L231 Difference]: Finished difference. Result has 39 places, 41 transitions, 161 flow [2023-11-29 01:58:19,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=39, PETRI_TRANSITIONS=41} [2023-11-29 01:58:19,124 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2023-11-29 01:58:19,124 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 41 transitions, 161 flow [2023-11-29 01:58:19,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:19,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:58:19,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:19,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:58:19,125 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 01:58:19,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:19,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1237410086, now seen corresponding path program 1 times [2023-11-29 01:58:19,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:19,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572117076] [2023-11-29 01:58:19,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:19,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:19,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:19,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:19,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572117076] [2023-11-29 01:58:19,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572117076] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:19,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:19,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:58:19,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387415543] [2023-11-29 01:58:19,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:19,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:58:19,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:19,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:58:19,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:58:19,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 01:58:19,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 41 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:19,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:58:19,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 01:58:19,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:58:19,762 INFO L124 PetriNetUnfolderBase]: 2211/2948 cut-off events. [2023-11-29 01:58:19,762 INFO L125 PetriNetUnfolderBase]: For 3599/3599 co-relation queries the response was YES. [2023-11-29 01:58:19,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8998 conditions, 2948 events. 2211/2948 cut-off events. For 3599/3599 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 11916 event pairs, 316 based on Foata normal form. 80/3004 useless extension candidates. Maximal degree in co-relation 2808. Up to 1265 conditions per place. [2023-11-29 01:58:19,797 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 90 selfloop transitions, 8 changer transitions 0/103 dead transitions. [2023-11-29 01:58:19,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 103 transitions, 615 flow [2023-11-29 01:58:19,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:58:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:58:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2023-11-29 01:58:19,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2023-11-29 01:58:19,801 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 119 transitions. [2023-11-29 01:58:19,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 119 transitions. [2023-11-29 01:58:19,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:58:19,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 119 transitions. [2023-11-29 01:58:19,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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) [2023-11-29 01:58:19,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 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) [2023-11-29 01:58:19,805 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 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) [2023-11-29 01:58:19,805 INFO L175 Difference]: Start difference. First operand has 39 places, 41 transitions, 161 flow. Second operand 5 states and 119 transitions. [2023-11-29 01:58:19,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 103 transitions, 615 flow [2023-11-29 01:58:19,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 103 transitions, 615 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:58:19,815 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 216 flow [2023-11-29 01:58:19,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2023-11-29 01:58:19,816 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 7 predicate places. [2023-11-29 01:58:19,817 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 216 flow [2023-11-29 01:58:19,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:19,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:58:19,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:19,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:58:19,818 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 01:58:19,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:19,819 INFO L85 PathProgramCache]: Analyzing trace with hash -771990875, now seen corresponding path program 1 times [2023-11-29 01:58:19,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:19,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629622029] [2023-11-29 01:58:19,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:19,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:19,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:19,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:19,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629622029] [2023-11-29 01:58:19,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629622029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:19,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:19,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:58:19,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616172524] [2023-11-29 01:58:19,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:19,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:58:19,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:19,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:58:19,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:58:19,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 01:58:19,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:19,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:58:19,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 01:58:19,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:58:20,451 INFO L124 PetriNetUnfolderBase]: 2149/2856 cut-off events. [2023-11-29 01:58:20,452 INFO L125 PetriNetUnfolderBase]: For 5352/5352 co-relation queries the response was YES. [2023-11-29 01:58:20,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10398 conditions, 2856 events. 2149/2856 cut-off events. For 5352/5352 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 11430 event pairs, 165 based on Foata normal form. 66/2918 useless extension candidates. Maximal degree in co-relation 5282. Up to 1169 conditions per place. [2023-11-29 01:58:20,482 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 88 selfloop transitions, 8 changer transitions 0/101 dead transitions. [2023-11-29 01:58:20,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 101 transitions, 639 flow [2023-11-29 01:58:20,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:58:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:58:20,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2023-11-29 01:58:20,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2023-11-29 01:58:20,484 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 120 transitions. [2023-11-29 01:58:20,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 120 transitions. [2023-11-29 01:58:20,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:58:20,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 120 transitions. [2023-11-29 01:58:20,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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) [2023-11-29 01:58:20,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 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) [2023-11-29 01:58:20,486 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 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) [2023-11-29 01:58:20,486 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 216 flow. Second operand 5 states and 120 transitions. [2023-11-29 01:58:20,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 101 transitions, 639 flow [2023-11-29 01:58:20,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 101 transitions, 639 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:58:20,498 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 230 flow [2023-11-29 01:58:20,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2023-11-29 01:58:20,499 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 12 predicate places. [2023-11-29 01:58:20,499 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 230 flow [2023-11-29 01:58:20,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:20,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:58:20,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:20,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:58:20,500 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 01:58:20,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:20,501 INFO L85 PathProgramCache]: Analyzing trace with hash -146950148, now seen corresponding path program 2 times [2023-11-29 01:58:20,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:20,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160051780] [2023-11-29 01:58:20,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:20,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:20,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:20,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:20,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160051780] [2023-11-29 01:58:20,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160051780] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:20,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:20,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:58:20,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420186419] [2023-11-29 01:58:20,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:20,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:58:20,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:20,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:58:20,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:58:20,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 01:58:20,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:20,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:58:20,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 01:58:20,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:58:21,006 INFO L124 PetriNetUnfolderBase]: 1931/2571 cut-off events. [2023-11-29 01:58:21,006 INFO L125 PetriNetUnfolderBase]: For 5523/5523 co-relation queries the response was YES. [2023-11-29 01:58:21,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9925 conditions, 2571 events. 1931/2571 cut-off events. For 5523/5523 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 9845 event pairs, 98 based on Foata normal form. 38/2585 useless extension candidates. Maximal degree in co-relation 5648. Up to 1021 conditions per place. [2023-11-29 01:58:21,031 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 90 selfloop transitions, 11 changer transitions 0/106 dead transitions. [2023-11-29 01:58:21,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 106 transitions, 740 flow [2023-11-29 01:58:21,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:58:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:58:21,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2023-11-29 01:58:21,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6685714285714286 [2023-11-29 01:58:21,033 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 117 transitions. [2023-11-29 01:58:21,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 117 transitions. [2023-11-29 01:58:21,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:58:21,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 117 transitions. [2023-11-29 01:58:21,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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) [2023-11-29 01:58:21,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 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) [2023-11-29 01:58:21,035 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 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) [2023-11-29 01:58:21,035 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 230 flow. Second operand 5 states and 117 transitions. [2023-11-29 01:58:21,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 106 transitions, 740 flow [2023-11-29 01:58:21,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 106 transitions, 723 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:58:21,047 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 284 flow [2023-11-29 01:58:21,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=284, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2023-11-29 01:58:21,048 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2023-11-29 01:58:21,049 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 284 flow [2023-11-29 01:58:21,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:21,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:58:21,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:21,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:58:21,050 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 01:58:21,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:21,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1018376552, now seen corresponding path program 2 times [2023-11-29 01:58:21,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:21,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391881291] [2023-11-29 01:58:21,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:21,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:21,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:21,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391881291] [2023-11-29 01:58:21,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391881291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:21,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:21,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:58:21,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921940167] [2023-11-29 01:58:21,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:21,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:58:21,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:21,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:58:21,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:58:21,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 01:58:21,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 284 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:21,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:58:21,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 01:58:21,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:58:21,524 INFO L124 PetriNetUnfolderBase]: 1843/2477 cut-off events. [2023-11-29 01:58:21,524 INFO L125 PetriNetUnfolderBase]: For 6459/6459 co-relation queries the response was YES. [2023-11-29 01:58:21,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10334 conditions, 2477 events. 1843/2477 cut-off events. For 6459/6459 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10185 event pairs, 435 based on Foata normal form. 92/2559 useless extension candidates. Maximal degree in co-relation 5843. Up to 1377 conditions per place. [2023-11-29 01:58:21,542 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 106 selfloop transitions, 8 changer transitions 0/119 dead transitions. [2023-11-29 01:58:21,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 119 transitions, 883 flow [2023-11-29 01:58:21,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:58:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:58:21,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2023-11-29 01:58:21,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6914285714285714 [2023-11-29 01:58:21,544 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 121 transitions. [2023-11-29 01:58:21,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 121 transitions. [2023-11-29 01:58:21,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:58:21,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 121 transitions. [2023-11-29 01:58:21,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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) [2023-11-29 01:58:21,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 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) [2023-11-29 01:58:21,546 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 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) [2023-11-29 01:58:21,546 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 284 flow. Second operand 5 states and 121 transitions. [2023-11-29 01:58:21,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 119 transitions, 883 flow [2023-11-29 01:58:21,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 119 transitions, 846 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-11-29 01:58:21,555 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 321 flow [2023-11-29 01:58:21,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=321, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2023-11-29 01:58:21,556 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2023-11-29 01:58:21,556 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 321 flow [2023-11-29 01:58:21,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:21,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:58:21,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:21,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:58:21,557 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 01:58:21,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:21,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1233619209, now seen corresponding path program 1 times [2023-11-29 01:58:21,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:21,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836480949] [2023-11-29 01:58:21,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:21,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:21,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:21,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:21,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836480949] [2023-11-29 01:58:21,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836480949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:21,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:21,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:58:21,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797299193] [2023-11-29 01:58:21,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:21,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:58:21,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:21,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:58:21,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:58:21,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 01:58:21,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 321 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:21,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:58:21,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 01:58:21,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:58:21,946 INFO L124 PetriNetUnfolderBase]: 1801/2440 cut-off events. [2023-11-29 01:58:21,946 INFO L125 PetriNetUnfolderBase]: For 7699/7699 co-relation queries the response was YES. [2023-11-29 01:58:21,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10792 conditions, 2440 events. 1801/2440 cut-off events. For 7699/7699 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9627 event pairs, 75 based on Foata normal form. 42/2460 useless extension candidates. Maximal degree in co-relation 6684. Up to 1137 conditions per place. [2023-11-29 01:58:21,963 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 99 selfloop transitions, 8 changer transitions 4/116 dead transitions. [2023-11-29 01:58:21,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 116 transitions, 923 flow [2023-11-29 01:58:21,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:58:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:58:21,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2023-11-29 01:58:21,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6628571428571428 [2023-11-29 01:58:21,965 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 116 transitions. [2023-11-29 01:58:21,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 116 transitions. [2023-11-29 01:58:21,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:58:21,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 116 transitions. [2023-11-29 01:58:21,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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) [2023-11-29 01:58:21,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 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) [2023-11-29 01:58:21,967 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 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) [2023-11-29 01:58:21,967 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 321 flow. Second operand 5 states and 116 transitions. [2023-11-29 01:58:21,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 116 transitions, 923 flow [2023-11-29 01:58:21,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 116 transitions, 898 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-29 01:58:22,007 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 328 flow [2023-11-29 01:58:22,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-11-29 01:58:22,008 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 25 predicate places. [2023-11-29 01:58:22,008 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 328 flow [2023-11-29 01:58:22,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:22,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:58:22,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:22,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:58:22,009 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 01:58:22,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:22,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1520247103, now seen corresponding path program 2 times [2023-11-29 01:58:22,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:22,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879244800] [2023-11-29 01:58:22,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:22,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:22,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:22,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879244800] [2023-11-29 01:58:22,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879244800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:22,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:22,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:58:22,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471424564] [2023-11-29 01:58:22,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:22,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:58:22,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:22,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:58:22,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:58:22,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 01:58:22,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 328 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:22,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:58:22,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 01:58:22,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:58:22,417 INFO L124 PetriNetUnfolderBase]: 1725/2376 cut-off events. [2023-11-29 01:58:22,418 INFO L125 PetriNetUnfolderBase]: For 8064/8064 co-relation queries the response was YES. [2023-11-29 01:58:22,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10864 conditions, 2376 events. 1725/2376 cut-off events. For 8064/8064 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9804 event pairs, 293 based on Foata normal form. 76/2430 useless extension candidates. Maximal degree in co-relation 6709. Up to 1307 conditions per place. [2023-11-29 01:58:22,435 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 101 selfloop transitions, 8 changer transitions 0/114 dead transitions. [2023-11-29 01:58:22,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 114 transitions, 925 flow [2023-11-29 01:58:22,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:58:22,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:58:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2023-11-29 01:58:22,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6457142857142857 [2023-11-29 01:58:22,436 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 113 transitions. [2023-11-29 01:58:22,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 113 transitions. [2023-11-29 01:58:22,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:58:22,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 113 transitions. [2023-11-29 01:58:22,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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) [2023-11-29 01:58:22,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 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) [2023-11-29 01:58:22,438 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 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) [2023-11-29 01:58:22,438 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 328 flow. Second operand 5 states and 113 transitions. [2023-11-29 01:58:22,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 114 transitions, 925 flow [2023-11-29 01:58:22,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 114 transitions, 912 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-29 01:58:22,452 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 368 flow [2023-11-29 01:58:22,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=368, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2023-11-29 01:58:22,453 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 30 predicate places. [2023-11-29 01:58:22,454 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 368 flow [2023-11-29 01:58:22,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:22,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:58:22,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:22,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 01:58:22,455 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 01:58:22,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:22,455 INFO L85 PathProgramCache]: Analyzing trace with hash 719442405, now seen corresponding path program 2 times [2023-11-29 01:58:22,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:22,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332886122] [2023-11-29 01:58:22,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:22,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:22,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:22,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332886122] [2023-11-29 01:58:22,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332886122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:58:22,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:58:22,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:58:22,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614162739] [2023-11-29 01:58:22,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:58:22,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:58:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:22,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:58:22,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:58:22,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 01:58:22,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 368 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:22,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:58:22,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 01:58:22,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:58:22,962 INFO L124 PetriNetUnfolderBase]: 1657/2291 cut-off events. [2023-11-29 01:58:22,962 INFO L125 PetriNetUnfolderBase]: For 8227/8227 co-relation queries the response was YES. [2023-11-29 01:58:22,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11116 conditions, 2291 events. 1657/2291 cut-off events. For 8227/8227 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9610 event pairs, 481 based on Foata normal form. 68/2349 useless extension candidates. Maximal degree in co-relation 9772. Up to 1331 conditions per place. [2023-11-29 01:58:22,986 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 117 selfloop transitions, 8 changer transitions 0/130 dead transitions. [2023-11-29 01:58:22,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 130 transitions, 1116 flow [2023-11-29 01:58:22,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:58:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:58:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2023-11-29 01:58:22,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6685714285714286 [2023-11-29 01:58:22,988 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 117 transitions. [2023-11-29 01:58:22,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 117 transitions. [2023-11-29 01:58:22,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:58:22,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 117 transitions. [2023-11-29 01:58:22,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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) [2023-11-29 01:58:22,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 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) [2023-11-29 01:58:22,990 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 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) [2023-11-29 01:58:22,990 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 368 flow. Second operand 5 states and 117 transitions. [2023-11-29 01:58:22,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 130 transitions, 1116 flow [2023-11-29 01:58:23,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 130 transitions, 1058 flow, removed 20 selfloop flow, removed 2 redundant places. [2023-11-29 01:58:23,011 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 405 flow [2023-11-29 01:58:23,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=405, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2023-11-29 01:58:23,013 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 34 predicate places. [2023-11-29 01:58:23,013 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 405 flow [2023-11-29 01:58:23,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:58:23,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:58:23,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:58:23,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 01:58:23,014 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 01:58:23,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:58:23,015 INFO L85 PathProgramCache]: Analyzing trace with hash 421662064, now seen corresponding path program 1 times [2023-11-29 01:58:23,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:58:23,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731789129] [2023-11-29 01:58:23,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:23,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:58:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:23,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:58:23,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731789129] [2023-11-29 01:58:23,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731789129] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:58:23,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171960776] [2023-11-29 01:58:23,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:58:23,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:58:23,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:58:23,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:58:23,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:58:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:58:25,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 01:58:25,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:58:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:46,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:58:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:58:47,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171960776] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:58:47,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:58:47,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2023-11-29 01:58:47,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602800170] [2023-11-29 01:58:47,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:58:47,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 01:58:47,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:58:47,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 01:58:47,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=128, Unknown=3, NotChecked=0, Total=182 [2023-11-29 01:58:47,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 01:58:47,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 405 flow. Second operand has 14 states, 14 states have (on average 13.5) internal successors, (189), 14 states have internal predecessors, (189), 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) [2023-11-29 01:58:47,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:58:47,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 01:58:47,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:58:54,036 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 [] [2023-11-29 01:59:02,023 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 [] [2023-11-29 01:59:06,040 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 [] [2023-11-29 01:59:20,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:59:27,711 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 [] [2023-11-29 01:59:28,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:59:37,013 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 [] [2023-11-29 01:59:41,020 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 [] [2023-11-29 01:59:42,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:59:45,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:59:59,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:00:02,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:00:06,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 [] [2023-11-29 02:00:10,959 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 [] [2023-11-29 02:00:13,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:00:14,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:00:25,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:00:30,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:00:32,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:00:37,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:00:41,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:00:44,598 INFO L124 PetriNetUnfolderBase]: 3085/4284 cut-off events. [2023-11-29 02:00:44,598 INFO L125 PetriNetUnfolderBase]: For 14783/14783 co-relation queries the response was YES. [2023-11-29 02:00:44,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20754 conditions, 4284 events. 3085/4284 cut-off events. For 14783/14783 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 19543 event pairs, 331 based on Foata normal form. 3/4277 useless extension candidates. Maximal degree in co-relation 18487. Up to 2341 conditions per place. [2023-11-29 02:00:44,629 INFO L140 encePairwiseOnDemand]: 17/35 looper letters, 215 selfloop transitions, 112 changer transitions 10/342 dead transitions. [2023-11-29 02:00:44,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 342 transitions, 2874 flow [2023-11-29 02:00:44,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 02:00:44,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-29 02:00:44,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 393 transitions. [2023-11-29 02:00:44,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6605042016806723 [2023-11-29 02:00:44,633 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 393 transitions. [2023-11-29 02:00:44,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 393 transitions. [2023-11-29 02:00:44,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:00:44,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 393 transitions. [2023-11-29 02:00:44,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 23.11764705882353) internal successors, (393), 17 states have internal predecessors, (393), 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) [2023-11-29 02:00:44,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 35.0) internal successors, (630), 18 states have internal predecessors, (630), 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) [2023-11-29 02:00:44,638 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 35.0) internal successors, (630), 18 states have internal predecessors, (630), 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) [2023-11-29 02:00:44,638 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 405 flow. Second operand 17 states and 393 transitions. [2023-11-29 02:00:44,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 342 transitions, 2874 flow [2023-11-29 02:00:44,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 342 transitions, 2783 flow, removed 32 selfloop flow, removed 1 redundant places. [2023-11-29 02:00:44,687 INFO L231 Difference]: Finished difference. Result has 96 places, 169 transitions, 1738 flow [2023-11-29 02:00:44,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1738, PETRI_PLACES=96, PETRI_TRANSITIONS=169} [2023-11-29 02:00:44,688 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 57 predicate places. [2023-11-29 02:00:44,688 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 169 transitions, 1738 flow [2023-11-29 02:00:44,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.5) internal successors, (189), 14 states have internal predecessors, (189), 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) [2023-11-29 02:00:44,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:00:44,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:44,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 02:00:44,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:00:44,892 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 02:00:44,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:44,892 INFO L85 PathProgramCache]: Analyzing trace with hash 927699822, now seen corresponding path program 2 times [2023-11-29 02:00:44,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:44,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73488277] [2023-11-29 02:00:44,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:44,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:45,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:00:45,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:45,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73488277] [2023-11-29 02:00:45,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73488277] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:00:45,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288770699] [2023-11-29 02:00:45,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:00:45,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:00:45,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:00:45,529 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:00:45,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 02:00:47,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 02:00:47,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:00:47,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 02:00:47,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:02:37,906 WARN L293 SmtUtils]: Spent 11.86s on a formula simplification. DAG size of input: 37 DAG size of output: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:03:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:03:22,962 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:04:07,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:04:07,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288770699] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:04:07,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:04:07,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-11-29 02:04:07,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619796243] [2023-11-29 02:04:07,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:04:07,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 02:04:07,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:04:07,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 02:04:07,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=164, Unknown=26, NotChecked=0, Total=240 [2023-11-29 02:04:07,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 02:04:07,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 169 transitions, 1738 flow. Second operand has 16 states, 16 states have (on average 13.0625) internal successors, (209), 16 states have internal predecessors, (209), 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) [2023-11-29 02:04:07,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:04:07,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 02:04:07,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:05:09,012 WARN L293 SmtUtils]: Spent 54.34s on a formula simplification. DAG size of input: 91 DAG size of output: 82 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:05:10,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:05:15,577 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 [] [2023-11-29 02:05:20,260 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 [] [2023-11-29 02:05:24,268 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 [] [2023-11-29 02:05:28,276 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 [] [2023-11-29 02:05:31,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:05:36,202 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 [] [2023-11-29 02:05:40,926 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 [] [2023-11-29 02:05:43,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:05:46,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:05:50,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:05:54,096 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 [] [2023-11-29 02:05:57,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:06:00,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:06:04,559 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 [] [2023-11-29 02:06:08,567 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 [] [2023-11-29 02:06:12,579 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 [] [2023-11-29 02:06:16,589 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 [] [2023-11-29 02:06:20,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:06:42,140 WARN L293 SmtUtils]: Spent 16.96s on a formula simplification. DAG size of input: 76 DAG size of output: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:06:46,751 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 [] [2023-11-29 02:06:50,763 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 [] [2023-11-29 02:06:54,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:06:57,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:07:02,180 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 [] [2023-11-29 02:07:06,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:07:10,026 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 [] [2023-11-29 02:07:14,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:07:18,056 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 [] [2023-11-29 02:07:22,064 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 [] [2023-11-29 02:07:26,208 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 [] [2023-11-29 02:07:30,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:07:32,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:07:34,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:07:38,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:07:42,869 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 [] [2023-11-29 02:07:44,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:07:46,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:07:50,544 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 [] [2023-11-29 02:07:54,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 [] [2023-11-29 02:07:58,585 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 [] [2023-11-29 02:08:01,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:08:05,451 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 [] [2023-11-29 02:08:09,885 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 [] [2023-11-29 02:08:13,894 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 [] [2023-11-29 02:08:17,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:08:21,828 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (* 4294967296 (div c_~x3~0 4294967296)))) (let ((.cse2 (mod c_~n~0 4294967296)) (.cse0 (mod c_~x1~0 4294967296)) (.cse3 (mod (* 4294967295 (div (* (- 1) c_~x3~0) 4)) 4294967296)) (.cse1 (mod (* 4294967295 (div (* (- 1) c_~x4~0) 4)) 4294967296)) (.cse6 (+ c_~x3~0 (* (div c_~x4~0 4294967296) 4294967296))) (.cse5 (+ .cse4 c_~x4~0))) (and (= .cse0 (mod c_~x2~0 4294967296)) (= (mod (* 3 c_~x4~0) 4) 0) (<= (+ .cse1 1) .cse2) (<= .cse2 (mod c_~x4~0 4294967296)) (<= 1 .cse3) (<= 1 .cse0) (= (+ c_~x1~0 (* (div c_~x2~0 4294967296) 4294967296)) (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0)) (= .cse3 .cse1) (or (< (+ c_~x3~0 2 (* 4294967296 (div c_~n~0 4294967296))) (+ .cse4 c_~n~0)) (= .cse5 .cse6)) (<= .cse6 .cse5) (= (mod (* c_~x3~0 3) 4) 0)))) is different from false [2023-11-29 02:08:42,275 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 [] [2023-11-29 02:08:55,708 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 [] [2023-11-29 02:08:57,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:09:00,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:09:06,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:09:08,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:09:09,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:09:13,648 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 [] [2023-11-29 02:09:16,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:09:19,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:09:23,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:09:25,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:09:28,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:09:32,799 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 [] [2023-11-29 02:09:32,909 INFO L124 PetriNetUnfolderBase]: 3551/4951 cut-off events. [2023-11-29 02:09:32,909 INFO L125 PetriNetUnfolderBase]: For 25617/25617 co-relation queries the response was YES. [2023-11-29 02:09:32,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28999 conditions, 4951 events. 3551/4951 cut-off events. For 25617/25617 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 23306 event pairs, 439 based on Foata normal form. 2/4943 useless extension candidates. Maximal degree in co-relation 27513. Up to 3962 conditions per place. [2023-11-29 02:09:32,966 INFO L140 encePairwiseOnDemand]: 20/35 looper letters, 274 selfloop transitions, 69 changer transitions 15/363 dead transitions. [2023-11-29 02:09:32,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 363 transitions, 3910 flow [2023-11-29 02:09:32,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 02:09:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 02:09:32,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 292 transitions. [2023-11-29 02:09:32,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6417582417582418 [2023-11-29 02:09:32,969 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 292 transitions. [2023-11-29 02:09:32,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 292 transitions. [2023-11-29 02:09:32,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:09:32,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 292 transitions. [2023-11-29 02:09:32,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 22.46153846153846) internal successors, (292), 13 states have internal predecessors, (292), 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) [2023-11-29 02:09:32,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 35.0) internal successors, (490), 14 states have internal predecessors, (490), 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) [2023-11-29 02:09:32,972 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 35.0) internal successors, (490), 14 states have internal predecessors, (490), 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) [2023-11-29 02:09:32,972 INFO L175 Difference]: Start difference. First operand has 96 places, 169 transitions, 1738 flow. Second operand 13 states and 292 transitions. [2023-11-29 02:09:32,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 363 transitions, 3910 flow [2023-11-29 02:09:33,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 363 transitions, 3637 flow, removed 134 selfloop flow, removed 1 redundant places. [2023-11-29 02:09:33,174 INFO L231 Difference]: Finished difference. Result has 114 places, 230 transitions, 2397 flow [2023-11-29 02:09:33,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1481, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2397, PETRI_PLACES=114, PETRI_TRANSITIONS=230} [2023-11-29 02:09:33,175 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 75 predicate places. [2023-11-29 02:09:33,175 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 230 transitions, 2397 flow [2023-11-29 02:09:33,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 13.0625) internal successors, (209), 16 states have internal predecessors, (209), 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) [2023-11-29 02:09:33,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:09:33,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:09:33,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 02:09:33,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 02:09:33,377 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 02:09:33,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:09:33,377 INFO L85 PathProgramCache]: Analyzing trace with hash 35910096, now seen corresponding path program 3 times [2023-11-29 02:09:33,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:09:33,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716388475] [2023-11-29 02:09:33,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:09:33,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:09:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:09:34,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:09:34,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:09:34,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716388475] [2023-11-29 02:09:34,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716388475] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:09:34,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545452613] [2023-11-29 02:09:34,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 02:09:34,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:09:34,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:09:34,034 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:09:34,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deacb4cc-775e-48ab-b7b2-2f3f9f6a09c8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 02:09:36,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 02:09:36,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:09:36,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 02:09:36,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:10:59,564 WARN L293 SmtUtils]: Spent 9.42s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:11:31,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:11:31,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:12:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:12:13,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545452613] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:12:13,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:12:13,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-11-29 02:12:13,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758826756] [2023-11-29 02:12:13,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:12:13,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 02:12:13,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:12:13,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 02:12:13,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=165, Unknown=25, NotChecked=0, Total=240 [2023-11-29 02:12:13,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 02:12:13,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 230 transitions, 2397 flow. Second operand has 16 states, 16 states have (on average 13.0625) internal successors, (209), 16 states have internal predecessors, (209), 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) [2023-11-29 02:12:13,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:12:13,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 02:12:13,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:12:15,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:12:16,909 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 [] [2023-11-29 02:12:20,915 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 [] [2023-11-29 02:12:58,555 WARN L293 SmtUtils]: Spent 31.45s on a formula simplification. DAG size of input: 77 DAG size of output: 69 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:13:03,250 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 [] [2023-11-29 02:13:07,313 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 [] [2023-11-29 02:13:12,037 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 [] [2023-11-29 02:13:17,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:13:18,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:13:20,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []