./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 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_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl --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 55079ed406966de8cb8f01bd4828043af39842b101d9722a0d33cee3b1fc3a52 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:19:25,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:19:26,057 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:19:26,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:19:26,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:19:26,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:19:26,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:19:26,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:19:26,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:19:26,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:19:26,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:19:26,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:19:26,125 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:19:26,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:19:26,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:19:26,128 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:19:26,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:19:26,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:19:26,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:19:26,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:19:26,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:19:26,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:19:26,132 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:19:26,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:19:26,133 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:19:26,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:19:26,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:19:26,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:19:26,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:19:26,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:19:26,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:19:26,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:19:26,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:19:26,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:19:26,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:19:26,162 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:19:26,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:19:26,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:19:26,163 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:19:26,163 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_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/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_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl 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 -> 55079ed406966de8cb8f01bd4828043af39842b101d9722a0d33cee3b1fc3a52 [2023-11-12 02:19:26,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:19:26,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:19:26,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:19:26,557 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:19:26,557 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:19:26,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c [2023-11-12 02:19:29,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:19:29,853 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:19:29,854 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c [2023-11-12 02:19:29,865 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/data/33f01c2f6/6bb394b3b1a246259ccca90f1f6910a4/FLAGe3a092c96 [2023-11-12 02:19:29,883 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/data/33f01c2f6/6bb394b3b1a246259ccca90f1f6910a4 [2023-11-12 02:19:29,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:19:29,892 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:19:29,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:19:29,896 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:19:29,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:19:29,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:19:29" (1/1) ... [2023-11-12 02:19:29,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10123e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:29, skipping insertion in model container [2023-11-12 02:19:29,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:19:29" (1/1) ... [2023-11-12 02:19:29,960 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:19:30,185 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_655ca30c-3055-4e0d-b673-92449027738d/sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c[3070,3083] [2023-11-12 02:19:30,195 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:19:30,206 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:19:30,234 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_655ca30c-3055-4e0d-b673-92449027738d/sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c[3070,3083] [2023-11-12 02:19:30,238 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:19:30,252 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:19:30,253 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:19:30,262 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:19:30,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:30 WrapperNode [2023-11-12 02:19:30,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:19:30,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:19:30,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:19:30,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:19:30,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:30" (1/1) ... [2023-11-12 02:19:30,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:30" (1/1) ... [2023-11-12 02:19:30,315 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2023-11-12 02:19:30,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:19:30,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:19:30,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:19:30,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:19:30,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:30" (1/1) ... [2023-11-12 02:19:30,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:30" (1/1) ... [2023-11-12 02:19:30,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:30" (1/1) ... [2023-11-12 02:19:30,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:30" (1/1) ... [2023-11-12 02:19:30,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:30" (1/1) ... [2023-11-12 02:19:30,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:30" (1/1) ... [2023-11-12 02:19:30,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:30" (1/1) ... [2023-11-12 02:19:30,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:30" (1/1) ... [2023-11-12 02:19:30,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:19:30,368 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:19:30,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:19:30,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:19:30,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:30" (1/1) ... [2023-11-12 02:19:30,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:19:30,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:19:30,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:19:30,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:19:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:19:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:19:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:19:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:19:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-12 02:19:30,455 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-12 02:19:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-12 02:19:30,455 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-12 02:19:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-12 02:19:30,455 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-12 02:19:30,456 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-12 02:19:30,457 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-12 02:19:30,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:19:30,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:19:30,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:19:30,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 02:19:30,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:19:30,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:19:30,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:19:30,462 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:19:30,685 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:19:30,686 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:19:31,045 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:19:31,176 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:19:31,177 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-12 02:19:31,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:19:31 BoogieIcfgContainer [2023-11-12 02:19:31,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:19:31,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:19:31,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:19:31,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:19:31,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:19:29" (1/3) ... [2023-11-12 02:19:31,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d973873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:19:31, skipping insertion in model container [2023-11-12 02:19:31,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:30" (2/3) ... [2023-11-12 02:19:31,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d973873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:19:31, skipping insertion in model container [2023-11-12 02:19:31,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:19:31" (3/3) ... [2023-11-12 02:19:31,202 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2023-11-12 02:19:31,211 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 02:19:31,221 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:19:31,221 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:19:31,221 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:19:31,312 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-12 02:19:31,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 178 transitions, 384 flow [2023-11-12 02:19:31,466 INFO L124 PetriNetUnfolderBase]: 12/174 cut-off events. [2023-11-12 02:19:31,466 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-12 02:19:31,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 174 events. 12/174 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 147 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 139. Up to 2 conditions per place. [2023-11-12 02:19:31,476 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 178 transitions, 384 flow [2023-11-12 02:19:31,489 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 161 transitions, 346 flow [2023-11-12 02:19:31,495 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:19:31,511 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 161 transitions, 346 flow [2023-11-12 02:19:31,514 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 161 transitions, 346 flow [2023-11-12 02:19:31,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 161 transitions, 346 flow [2023-11-12 02:19:31,604 INFO L124 PetriNetUnfolderBase]: 12/161 cut-off events. [2023-11-12 02:19:31,604 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-12 02:19:31,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 161 events. 12/161 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 146 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 139. Up to 2 conditions per place. [2023-11-12 02:19:31,609 INFO L119 LiptonReduction]: Number of co-enabled transitions 2932 [2023-11-12 02:19:39,036 INFO L134 LiptonReduction]: Checked pairs total: 4091 [2023-11-12 02:19:39,037 INFO L136 LiptonReduction]: Total number of compositions: 154 [2023-11-12 02:19:39,070 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:19:39,079 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;@18c3875e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:19:39,080 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-12 02:19:39,094 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:19:39,094 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2023-11-12 02:19:39,094 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-12 02:19:39,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:19:39,095 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-12 02:19:39,096 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-12 02:19:39,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:39,102 INFO L85 PathProgramCache]: Analyzing trace with hash 461781200, now seen corresponding path program 1 times [2023-11-12 02:19:39,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:39,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145738532] [2023-11-12 02:19:39,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:39,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:39,640 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-12 02:19:39,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:39,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145738532] [2023-11-12 02:19:39,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145738532] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:39,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:39,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:19:39,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042267609] [2023-11-12 02:19:39,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:39,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:19:39,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:39,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:19:39,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:19:39,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 332 [2023-11-12 02:19:39,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 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-12 02:19:39,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:19:39,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 332 [2023-11-12 02:19:39,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:19:40,188 INFO L124 PetriNetUnfolderBase]: 1312/1790 cut-off events. [2023-11-12 02:19:40,188 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2023-11-12 02:19:40,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3791 conditions, 1790 events. 1312/1790 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5882 event pairs, 787 based on Foata normal form. 0/1455 useless extension candidates. Maximal degree in co-relation 3330. Up to 1474 conditions per place. [2023-11-12 02:19:40,212 INFO L140 encePairwiseOnDemand]: 328/332 looper letters, 44 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2023-11-12 02:19:40,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 221 flow [2023-11-12 02:19:40,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:19:40,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:19:40,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 648 transitions. [2023-11-12 02:19:40,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4879518072289157 [2023-11-12 02:19:40,241 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 648 transitions. [2023-11-12 02:19:40,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 648 transitions. [2023-11-12 02:19:40,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:19:40,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 648 transitions. [2023-11-12 02:19:40,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 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-12 02:19:40,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 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-12 02:19:40,264 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 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-12 02:19:40,266 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 4 states and 648 transitions. [2023-11-12 02:19:40,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 221 flow [2023-11-12 02:19:40,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 199 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-12 02:19:40,287 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2023-11-12 02:19:40,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2023-11-12 02:19:40,293 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-11-12 02:19:40,293 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2023-11-12 02:19:40,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 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-12 02:19:40,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:19:40,295 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-12 02:19:40,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:19:40,295 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-12 02:19:40,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:40,296 INFO L85 PathProgramCache]: Analyzing trace with hash 154653664, now seen corresponding path program 1 times [2023-11-12 02:19:40,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:40,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007317437] [2023-11-12 02:19:40,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:40,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:40,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:19:40,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:40,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007317437] [2023-11-12 02:19:40,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007317437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:40,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:40,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:19:40,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641490814] [2023-11-12 02:19:40,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:40,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:19:40,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:40,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:19:40,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:19:40,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 332 [2023-11-12 02:19:40,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 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-12 02:19:40,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:19:40,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 332 [2023-11-12 02:19:40,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:19:40,912 INFO L124 PetriNetUnfolderBase]: 1632/2222 cut-off events. [2023-11-12 02:19:40,912 INFO L125 PetriNetUnfolderBase]: For 509/509 co-relation queries the response was YES. [2023-11-12 02:19:40,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5065 conditions, 2222 events. 1632/2222 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7618 event pairs, 977 based on Foata normal form. 0/1833 useless extension candidates. Maximal degree in co-relation 2296. Up to 1790 conditions per place. [2023-11-12 02:19:40,932 INFO L140 encePairwiseOnDemand]: 328/332 looper letters, 46 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2023-11-12 02:19:40,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 229 flow [2023-11-12 02:19:40,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:19:40,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:19:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 648 transitions. [2023-11-12 02:19:40,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4879518072289157 [2023-11-12 02:19:40,940 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 648 transitions. [2023-11-12 02:19:40,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 648 transitions. [2023-11-12 02:19:40,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:19:40,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 648 transitions. [2023-11-12 02:19:40,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 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-12 02:19:40,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 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-12 02:19:40,951 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 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-12 02:19:40,951 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 4 states and 648 transitions. [2023-11-12 02:19:40,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 229 flow [2023-11-12 02:19:40,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 219 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-12 02:19:40,961 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2023-11-12 02:19:40,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-11-12 02:19:40,964 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-11-12 02:19:40,965 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2023-11-12 02:19:40,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 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-12 02:19:40,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:19:40,966 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, 1] [2023-11-12 02:19:40,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:19:40,966 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-12 02:19:40,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:40,967 INFO L85 PathProgramCache]: Analyzing trace with hash -383130912, now seen corresponding path program 1 times [2023-11-12 02:19:40,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:40,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023279228] [2023-11-12 02:19:40,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:40,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:19:41,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:41,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023279228] [2023-11-12 02:19:41,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023279228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:41,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:41,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:19:41,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650953664] [2023-11-12 02:19:41,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:41,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:19:41,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:41,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:19:41,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:19:41,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 332 [2023-11-12 02:19:41,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 157.25) internal successors, (629), 4 states have internal predecessors, (629), 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-12 02:19:41,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:19:41,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 332 [2023-11-12 02:19:41,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:19:41,697 INFO L124 PetriNetUnfolderBase]: 2138/2902 cut-off events. [2023-11-12 02:19:41,697 INFO L125 PetriNetUnfolderBase]: For 941/941 co-relation queries the response was YES. [2023-11-12 02:19:41,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7067 conditions, 2902 events. 2138/2902 cut-off events. For 941/941 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10531 event pairs, 1243 based on Foata normal form. 0/2449 useless extension candidates. Maximal degree in co-relation 2239. Up to 2222 conditions per place. [2023-11-12 02:19:41,722 INFO L140 encePairwiseOnDemand]: 328/332 looper letters, 49 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2023-11-12 02:19:41,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 52 transitions, 253 flow [2023-11-12 02:19:41,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:19:41,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:19:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 649 transitions. [2023-11-12 02:19:41,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48870481927710846 [2023-11-12 02:19:41,727 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 649 transitions. [2023-11-12 02:19:41,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 649 transitions. [2023-11-12 02:19:41,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:19:41,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 649 transitions. [2023-11-12 02:19:41,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.25) internal successors, (649), 4 states have internal predecessors, (649), 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-12 02:19:41,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 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-12 02:19:41,736 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 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-12 02:19:41,736 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 4 states and 649 transitions. [2023-11-12 02:19:41,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 52 transitions, 253 flow [2023-11-12 02:19:41,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 243 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-12 02:19:41,741 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 100 flow [2023-11-12 02:19:41,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-11-12 02:19:41,742 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-11-12 02:19:41,743 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 100 flow [2023-11-12 02:19:41,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.25) internal successors, (629), 4 states have internal predecessors, (629), 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-12 02:19:41,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:19:41,744 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, 1, 1] [2023-11-12 02:19:41,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:19:41,744 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-12 02:19:41,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:41,745 INFO L85 PathProgramCache]: Analyzing trace with hash -768487385, now seen corresponding path program 1 times [2023-11-12 02:19:41,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:41,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345941656] [2023-11-12 02:19:41,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:41,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:41,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 02:19:41,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:41,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345941656] [2023-11-12 02:19:41,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345941656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:41,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:41,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:19:41,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837396036] [2023-11-12 02:19:41,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:41,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:19:41,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:41,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:19:41,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:19:41,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 332 [2023-11-12 02:19:41,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 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-12 02:19:41,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:19:41,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 332 [2023-11-12 02:19:41,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:19:42,391 INFO L124 PetriNetUnfolderBase]: 2138/2903 cut-off events. [2023-11-12 02:19:42,392 INFO L125 PetriNetUnfolderBase]: For 1284/1284 co-relation queries the response was YES. [2023-11-12 02:19:42,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7648 conditions, 2903 events. 2138/2903 cut-off events. For 1284/1284 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10162 event pairs, 1685 based on Foata normal form. 0/2450 useless extension candidates. Maximal degree in co-relation 2581. Up to 2903 conditions per place. [2023-11-12 02:19:42,415 INFO L140 encePairwiseOnDemand]: 329/332 looper letters, 33 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-11-12 02:19:42,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 172 flow [2023-11-12 02:19:42,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:19:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:19:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2023-11-12 02:19:42,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789156626506024 [2023-11-12 02:19:42,418 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 477 transitions. [2023-11-12 02:19:42,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions. [2023-11-12 02:19:42,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:19:42,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions. [2023-11-12 02:19:42,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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-12 02:19:42,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 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-12 02:19:42,425 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 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-12 02:19:42,425 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 100 flow. Second operand 3 states and 477 transitions. [2023-11-12 02:19:42,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 172 flow [2023-11-12 02:19:42,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 166 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-12 02:19:42,433 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 106 flow [2023-11-12 02:19:42,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-11-12 02:19:42,435 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-11-12 02:19:42,435 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 106 flow [2023-11-12 02:19:42,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 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-12 02:19:42,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:19:42,436 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, 1, 1, 1] [2023-11-12 02:19:42,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:19:42,436 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-12 02:19:42,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:42,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1633297591, now seen corresponding path program 1 times [2023-11-12 02:19:42,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:42,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524405698] [2023-11-12 02:19:42,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:42,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 02:19:43,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:43,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524405698] [2023-11-12 02:19:43,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524405698] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:19:43,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898886959] [2023-11-12 02:19:43,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:43,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:19:43,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:19:43,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:19:43,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:19:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:43,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-12 02:19:43,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:19:43,905 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-12 02:19:43,975 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-12 02:19:44,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:19:44,074 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 02:19:44,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:19:44,218 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 02:19:44,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:19:44,374 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-12 02:19:44,431 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-12 02:19:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:19:44,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:19:45,280 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse0) (< c_~min~0 (+ .cse0 2))))) (forall ((v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ .cse1 3)) (< 2147483645 .cse1) (< (select (select .cse2 c_~A~0.base) c_~A~0.offset) (+ .cse1 1))))))) is different from false [2023-11-12 02:19:46,031 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~min~0 1))) (and (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (let ((.cse0 (select (select .cse3 c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 .cse0) (forall ((v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< 2147483645 .cse1) (< .cse0 (+ 3 .cse1)) (< (select (select .cse2 c_~A~0.base) c_~A~0.offset) (+ .cse1 1)))))))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (or (< (select (select .cse4 c_~A~0.base) c_~A~0.offset) .cse5) (forall ((v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ 3 .cse6)) (< 2147483645 .cse6) (< (select (select .cse7 c_~A~0.base) c_~A~0.offset) (+ .cse6 1))))))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (let ((.cse8 (select (select .cse10 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse9 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< .cse8 (+ 2 .cse9)) (< 2147483646 .cse9)))) (< c_~min~0 .cse8))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (or (< (select (select .cse11 c_~A~0.base) c_~A~0.offset) .cse5) (forall ((v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse12 (select (select (store (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ 2 .cse12)) (< 2147483646 .cse12))))))))) is different from false [2023-11-12 02:19:46,175 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1))) (and (forall ((v_ArrVal_122 (Array Int Int)) (v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (let ((.cse1 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< (select (select .cse0 c_~A~0.base) c_~A~0.offset) (+ 2 .cse1)) (< 2147483646 .cse1))))) (forall ((v_ArrVal_122 (Array Int Int)) (v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (let ((.cse4 (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< 2147483645 .cse2) (< (select (select .cse3 c_~A~0.base) c_~A~0.offset) (+ 3 .cse2)) (< (select (select .cse4 c_~A~0.base) c_~A~0.offset) (+ .cse2 1))))))) (forall ((v_ArrVal_122 (Array Int Int)) (v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123))) (let ((.cse5 (select (select .cse9 c_~A~0.base) c_~A~0.offset)) (.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< .cse5 (+ 4 .cse6)) (< 2147483645 .cse6) (< .cse5 .cse7) (< (select (select .cse8 c_~A~0.base) c_~A~0.offset) (+ .cse6 1))))))) (forall ((v_ArrVal_122 (Array Int Int)) (v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (let ((.cse10 (select (select .cse12 c_~A~0.base) c_~A~0.offset)) (.cse11 (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< .cse10 .cse7) (< 2147483646 .cse11) (< .cse10 (+ 3 .cse11)))))))) is different from false [2023-11-12 02:19:46,360 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_122 (Array Int Int)) (v_ArrVal_121 (Array Int Int)) (v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_121))) (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse0 (+ (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (< 2147483645 .cse2) (< (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse2 1)) (< .cse0 (+ .cse2 4)))))))) (forall ((v_ArrVal_122 (Array Int Int)) (v_ArrVal_121 (Array Int Int)) (v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_121) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (let ((.cse5 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483646 .cse5) (< (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ 2 .cse5)))))) (forall ((v_ArrVal_122 (Array Int Int)) (v_ArrVal_121 (Array Int Int)) (v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_121))) (let ((.cse10 (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483646 .cse7) (< .cse8 (+ (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (< .cse8 (+ 3 .cse7))))))) (forall ((v_ArrVal_122 (Array Int Int)) (v_ArrVal_121 (Array Int Int)) (v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_121) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (let ((.cse13 (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483645 .cse11) (< (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ 3 .cse11)) (< (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse11 1)))))))) is different from false [2023-11-12 02:19:46,415 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:19:46,415 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 85 [2023-11-12 02:19:46,429 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2976 treesize of output 2808 [2023-11-12 02:19:46,505 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 494 treesize of output 474 [2023-11-12 02:19:46,532 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 231 [2023-11-12 02:19:46,562 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 435 treesize of output 419 [2023-11-12 02:19:46,585 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 419 treesize of output 387 [2023-11-12 02:19:46,857 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:19:46,858 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 63 [2023-11-12 02:19:46,879 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41707 treesize of output 39339 [2023-11-12 02:19:47,001 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 213 [2023-11-12 02:19:47,021 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 439 treesize of output 423 [2023-11-12 02:19:47,041 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 423 treesize of output 391 [2023-11-12 02:19:47,065 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 187 [2023-11-12 02:19:47,447 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-12 02:19:47,447 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 1 [2023-11-12 02:19:47,456 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-12 02:19:47,457 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 1 [2023-11-12 02:19:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-12 02:19:47,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898886959] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:19:47,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:19:47,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 34 [2023-11-12 02:19:47,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437120688] [2023-11-12 02:19:47,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:19:47,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-12 02:19:47,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:47,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-12 02:19:47,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=857, Unknown=18, NotChecked=252, Total=1260 [2023-11-12 02:19:47,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 332 [2023-11-12 02:19:47,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 106 flow. Second operand has 36 states, 36 states have (on average 104.58333333333333) internal successors, (3765), 36 states have internal predecessors, (3765), 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-12 02:19:47,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:19:47,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 332 [2023-11-12 02:19:47,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:19:55,707 INFO L124 PetriNetUnfolderBase]: 11820/16283 cut-off events. [2023-11-12 02:19:55,707 INFO L125 PetriNetUnfolderBase]: For 4378/4378 co-relation queries the response was YES. [2023-11-12 02:19:55,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41979 conditions, 16283 events. 11820/16283 cut-off events. For 4378/4378 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 84786 event pairs, 163 based on Foata normal form. 8/12990 useless extension candidates. Maximal degree in co-relation 41965. Up to 3329 conditions per place. [2023-11-12 02:19:55,808 INFO L140 encePairwiseOnDemand]: 320/332 looper letters, 243 selfloop transitions, 67 changer transitions 304/614 dead transitions. [2023-11-12 02:19:55,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 614 transitions, 3070 flow [2023-11-12 02:19:55,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-12 02:19:55,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-11-12 02:19:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 4848 transitions. [2023-11-12 02:19:55,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3476764199655766 [2023-11-12 02:19:55,832 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 4848 transitions. [2023-11-12 02:19:55,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 4848 transitions. [2023-11-12 02:19:55,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:19:55,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 4848 transitions. [2023-11-12 02:19:55,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 115.42857142857143) internal successors, (4848), 42 states have internal predecessors, (4848), 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-12 02:19:55,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 332.0) internal successors, (14276), 43 states have internal predecessors, (14276), 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-12 02:19:55,887 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 332.0) internal successors, (14276), 43 states have internal predecessors, (14276), 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-12 02:19:55,887 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 106 flow. Second operand 42 states and 4848 transitions. [2023-11-12 02:19:55,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 614 transitions, 3070 flow [2023-11-12 02:19:55,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 614 transitions, 3066 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-12 02:19:55,956 INFO L231 Difference]: Finished difference. Result has 102 places, 124 transitions, 715 flow [2023-11-12 02:19:55,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=715, PETRI_PLACES=102, PETRI_TRANSITIONS=124} [2023-11-12 02:19:55,957 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 62 predicate places. [2023-11-12 02:19:55,957 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 124 transitions, 715 flow [2023-11-12 02:19:55,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 104.58333333333333) internal successors, (3765), 36 states have internal predecessors, (3765), 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-12 02:19:55,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:19:55,960 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, 1, 1, 1] [2023-11-12 02:19:56,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:19:56,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:19:56,237 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-12 02:19:56,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:56,238 INFO L85 PathProgramCache]: Analyzing trace with hash -971463889, now seen corresponding path program 2 times [2023-11-12 02:19:56,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:56,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947676416] [2023-11-12 02:19:56,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:56,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:56,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:19:56,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:56,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947676416] [2023-11-12 02:19:56,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947676416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:56,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:56,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:19:56,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110850546] [2023-11-12 02:19:56,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:56,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:19:56,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:56,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:19:56,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:19:56,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 332 [2023-11-12 02:19:56,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 124 transitions, 715 flow. Second operand has 4 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 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-12 02:19:56,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:19:56,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 332 [2023-11-12 02:19:56,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:19:58,872 INFO L124 PetriNetUnfolderBase]: 9680/13491 cut-off events. [2023-11-12 02:19:58,873 INFO L125 PetriNetUnfolderBase]: For 67549/67549 co-relation queries the response was YES. [2023-11-12 02:19:58,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53427 conditions, 13491 events. 9680/13491 cut-off events. For 67549/67549 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 68854 event pairs, 1413 based on Foata normal form. 8/13499 useless extension candidates. Maximal degree in co-relation 53385. Up to 8137 conditions per place. [2023-11-12 02:19:58,985 INFO L140 encePairwiseOnDemand]: 328/332 looper letters, 99 selfloop transitions, 5 changer transitions 206/310 dead transitions. [2023-11-12 02:19:58,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 310 transitions, 2377 flow [2023-11-12 02:19:58,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:19:58,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:19:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 836 transitions. [2023-11-12 02:19:58,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036144578313253 [2023-11-12 02:19:58,990 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 836 transitions. [2023-11-12 02:19:58,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 836 transitions. [2023-11-12 02:19:58,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:19:58,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 836 transitions. [2023-11-12 02:19:58,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.2) internal successors, (836), 5 states have internal predecessors, (836), 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-12 02:19:58,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-12 02:19:58,999 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-12 02:19:58,999 INFO L175 Difference]: Start difference. First operand has 102 places, 124 transitions, 715 flow. Second operand 5 states and 836 transitions. [2023-11-12 02:19:58,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 310 transitions, 2377 flow [2023-11-12 02:19:59,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 310 transitions, 2346 flow, removed 14 selfloop flow, removed 11 redundant places. [2023-11-12 02:19:59,640 INFO L231 Difference]: Finished difference. Result has 78 places, 79 transitions, 413 flow [2023-11-12 02:19:59,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=413, PETRI_PLACES=78, PETRI_TRANSITIONS=79} [2023-11-12 02:19:59,641 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 38 predicate places. [2023-11-12 02:19:59,641 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 79 transitions, 413 flow [2023-11-12 02:19:59,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 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-12 02:19:59,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:19:59,642 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, 1, 1, 1] [2023-11-12 02:19:59,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:19:59,642 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-12 02:19:59,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:59,643 INFO L85 PathProgramCache]: Analyzing trace with hash 63514737, now seen corresponding path program 3 times [2023-11-12 02:19:59,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:59,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098471662] [2023-11-12 02:19:59,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:59,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:00,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 02:20:00,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:00,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098471662] [2023-11-12 02:20:00,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098471662] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:20:00,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616178961] [2023-11-12 02:20:00,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 02:20:00,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:20:00,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:20:00,052 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:20:00,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 02:20:00,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-12 02:20:00,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:20:00,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-12 02:20:00,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:20:00,655 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-12 02:20:00,728 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-12 02:20:00,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 02:20:00,768 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:20:01,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 02:20:01,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616178961] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-12 02:20:01,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-12 02:20:01,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 7] total 15 [2023-11-12 02:20:01,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991072872] [2023-11-12 02:20:01,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:01,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:20:01,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:01,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:20:01,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2023-11-12 02:20:01,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 332 [2023-11-12 02:20:01,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 79 transitions, 413 flow. Second operand has 7 states, 7 states have (on average 146.42857142857142) internal successors, (1025), 7 states have internal predecessors, (1025), 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-12 02:20:01,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:20:01,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 332 [2023-11-12 02:20:01,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:20:03,494 INFO L124 PetriNetUnfolderBase]: 12256/16943 cut-off events. [2023-11-12 02:20:03,494 INFO L125 PetriNetUnfolderBase]: For 110180/110180 co-relation queries the response was YES. [2023-11-12 02:20:03,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68351 conditions, 16943 events. 12256/16943 cut-off events. For 110180/110180 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 88792 event pairs, 1901 based on Foata normal form. 8/16951 useless extension candidates. Maximal degree in co-relation 68316. Up to 5751 conditions per place. [2023-11-12 02:20:03,603 INFO L140 encePairwiseOnDemand]: 324/332 looper letters, 130 selfloop transitions, 13 changer transitions 176/319 dead transitions. [2023-11-12 02:20:03,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 319 transitions, 2308 flow [2023-11-12 02:20:03,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:20:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:20:03,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1117 transitions. [2023-11-12 02:20:03,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4806368330464716 [2023-11-12 02:20:03,609 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1117 transitions. [2023-11-12 02:20:03,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1117 transitions. [2023-11-12 02:20:03,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:20:03,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1117 transitions. [2023-11-12 02:20:03,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 159.57142857142858) internal successors, (1117), 7 states have internal predecessors, (1117), 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-12 02:20:03,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 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-12 02:20:03,621 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 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-12 02:20:03,621 INFO L175 Difference]: Start difference. First operand has 78 places, 79 transitions, 413 flow. Second operand 7 states and 1117 transitions. [2023-11-12 02:20:03,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 319 transitions, 2308 flow [2023-11-12 02:20:03,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 319 transitions, 2185 flow, removed 47 selfloop flow, removed 12 redundant places. [2023-11-12 02:20:03,961 INFO L231 Difference]: Finished difference. Result has 67 places, 90 transitions, 565 flow [2023-11-12 02:20:03,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=565, PETRI_PLACES=67, PETRI_TRANSITIONS=90} [2023-11-12 02:20:03,963 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2023-11-12 02:20:03,964 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 90 transitions, 565 flow [2023-11-12 02:20:03,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 146.42857142857142) internal successors, (1025), 7 states have internal predecessors, (1025), 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-12 02:20:03,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:20:03,965 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, 1, 1, 1] [2023-11-12 02:20:03,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:20:04,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:20:04,171 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-12 02:20:04,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:04,172 INFO L85 PathProgramCache]: Analyzing trace with hash 166793213, now seen corresponding path program 4 times [2023-11-12 02:20:04,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:04,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918909613] [2023-11-12 02:20:04,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:04,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:20:04,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:04,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918909613] [2023-11-12 02:20:04,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918909613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:04,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:04,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:20:04,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527205701] [2023-11-12 02:20:04,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:04,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:20:04,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:04,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:20:04,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:20:04,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 332 [2023-11-12 02:20:04,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 90 transitions, 565 flow. Second operand has 4 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 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-12 02:20:04,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:20:04,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 332 [2023-11-12 02:20:04,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:20:05,883 INFO L124 PetriNetUnfolderBase]: 8514/12040 cut-off events. [2023-11-12 02:20:05,883 INFO L125 PetriNetUnfolderBase]: For 28304/28304 co-relation queries the response was YES. [2023-11-12 02:20:05,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44437 conditions, 12040 events. 8514/12040 cut-off events. For 28304/28304 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 62091 event pairs, 1325 based on Foata normal form. 7/12047 useless extension candidates. Maximal degree in co-relation 44406. Up to 7858 conditions per place. [2023-11-12 02:20:05,953 INFO L140 encePairwiseOnDemand]: 328/332 looper letters, 94 selfloop transitions, 5 changer transitions 105/204 dead transitions. [2023-11-12 02:20:05,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 204 transitions, 1744 flow [2023-11-12 02:20:05,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:20:05,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:20:05,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 826 transitions. [2023-11-12 02:20:05,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4975903614457831 [2023-11-12 02:20:05,957 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 826 transitions. [2023-11-12 02:20:05,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 826 transitions. [2023-11-12 02:20:05,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:20:05,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 826 transitions. [2023-11-12 02:20:05,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 165.2) internal successors, (826), 5 states have internal predecessors, (826), 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-12 02:20:05,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-12 02:20:05,964 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-12 02:20:05,964 INFO L175 Difference]: Start difference. First operand has 67 places, 90 transitions, 565 flow. Second operand 5 states and 826 transitions. [2023-11-12 02:20:05,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 204 transitions, 1744 flow [2023-11-12 02:20:06,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 204 transitions, 1639 flow, removed 40 selfloop flow, removed 3 redundant places. [2023-11-12 02:20:06,207 INFO L231 Difference]: Finished difference. Result has 68 places, 81 transitions, 470 flow [2023-11-12 02:20:06,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=470, PETRI_PLACES=68, PETRI_TRANSITIONS=81} [2023-11-12 02:20:06,210 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2023-11-12 02:20:06,210 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 81 transitions, 470 flow [2023-11-12 02:20:06,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 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-12 02:20:06,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:20:06,211 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, 1, 1, 1] [2023-11-12 02:20:06,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:20:06,212 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-12 02:20:06,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:06,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1885096551, now seen corresponding path program 5 times [2023-11-12 02:20:06,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:06,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157826007] [2023-11-12 02:20:06,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:06,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 02:20:06,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:06,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157826007] [2023-11-12 02:20:06,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157826007] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:20:06,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988761001] [2023-11-12 02:20:06,848 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-12 02:20:06,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:20:06,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:20:06,853 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:20:06,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 02:20:07,000 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-12 02:20:07,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:20:07,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-12 02:20:07,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:20:07,168 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-12 02:20:07,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:20:07,220 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-12 02:20:07,287 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-12 02:20:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:20:07,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:20:08,259 INFO L322 Elim1Store]: treesize reduction 163, result has 0.6 percent of original size [2023-11-12 02:20:08,260 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 239 treesize of output 1 [2023-11-12 02:20:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:20:08,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988761001] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:20:08,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:20:08,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 25 [2023-11-12 02:20:08,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078566841] [2023-11-12 02:20:08,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:20:08,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-12 02:20:08,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:08,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-12 02:20:08,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=508, Unknown=5, NotChecked=0, Total=650 [2023-11-12 02:20:08,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 332 [2023-11-12 02:20:08,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 81 transitions, 470 flow. Second operand has 26 states, 26 states have (on average 120.26923076923077) internal successors, (3127), 26 states have internal predecessors, (3127), 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-12 02:20:08,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:20:08,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 332 [2023-11-12 02:20:08,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:20:13,404 INFO L124 PetriNetUnfolderBase]: 11754/16189 cut-off events. [2023-11-12 02:20:13,404 INFO L125 PetriNetUnfolderBase]: For 54334/54334 co-relation queries the response was YES. [2023-11-12 02:20:13,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63095 conditions, 16189 events. 11754/16189 cut-off events. For 54334/54334 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 82567 event pairs, 2325 based on Foata normal form. 10/16199 useless extension candidates. Maximal degree in co-relation 63065. Up to 5248 conditions per place. [2023-11-12 02:20:13,473 INFO L140 encePairwiseOnDemand]: 319/332 looper letters, 113 selfloop transitions, 23 changer transitions 622/758 dead transitions. [2023-11-12 02:20:13,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 758 transitions, 5572 flow [2023-11-12 02:20:13,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-12 02:20:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-11-12 02:20:13,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 6130 transitions. [2023-11-12 02:20:13,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3846636546184739 [2023-11-12 02:20:13,493 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 6130 transitions. [2023-11-12 02:20:13,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 6130 transitions. [2023-11-12 02:20:13,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:20:13,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 6130 transitions. [2023-11-12 02:20:13,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 127.70833333333333) internal successors, (6130), 48 states have internal predecessors, (6130), 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-12 02:20:13,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 332.0) internal successors, (16268), 49 states have internal predecessors, (16268), 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-12 02:20:13,542 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 332.0) internal successors, (16268), 49 states have internal predecessors, (16268), 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-12 02:20:13,542 INFO L175 Difference]: Start difference. First operand has 68 places, 81 transitions, 470 flow. Second operand 48 states and 6130 transitions. [2023-11-12 02:20:13,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 758 transitions, 5572 flow [2023-11-12 02:20:13,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 758 transitions, 5412 flow, removed 58 selfloop flow, removed 5 redundant places. [2023-11-12 02:20:13,897 INFO L231 Difference]: Finished difference. Result has 151 places, 98 transitions, 1138 flow [2023-11-12 02:20:13,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=1138, PETRI_PLACES=151, PETRI_TRANSITIONS=98} [2023-11-12 02:20:13,898 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 111 predicate places. [2023-11-12 02:20:13,898 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 98 transitions, 1138 flow [2023-11-12 02:20:13,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 120.26923076923077) internal successors, (3127), 26 states have internal predecessors, (3127), 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-12 02:20:13,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:20:13,900 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, 1, 1, 1] [2023-11-12 02:20:13,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-12 02:20:14,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655ca30c-3055-4e0d-b673-92449027738d/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:20:14,105 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-12 02:20:14,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:14,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1067067797, now seen corresponding path program 6 times [2023-11-12 02:20:14,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:14,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010543472] [2023-11-12 02:20:14,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:14,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat