./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-min-max-1.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_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/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_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/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_275dc933-a71e-4a0a-a703-c843654da8bd/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 0d8fc97f7c37032d6079f8a24b87bc520ff0a9c17c3894514011566166a643e8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:23:25,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:23:25,224 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:23:25,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:23:25,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:23:25,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:23:25,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:23:25,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:23:25,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:23:25,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:23:25,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:23:25,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:23:25,269 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:23:25,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:23:25,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:23:25,274 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:23:25,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:23:25,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:23:25,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:23:25,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:23:25,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:23:25,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:23:25,279 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:23:25,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:23:25,280 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:23:25,281 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:23:25,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:23:25,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:23:25,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:23:25,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:23:25,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:23:25,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:23:25,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:23:25,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:23:25,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:23:25,285 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:23:25,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:23:25,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:23:25,286 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:23:25,286 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_275dc933-a71e-4a0a-a703-c843654da8bd/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_275dc933-a71e-4a0a-a703-c843654da8bd/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 -> 0d8fc97f7c37032d6079f8a24b87bc520ff0a9c17c3894514011566166a643e8 [2023-11-12 02:23:25,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:23:25,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:23:25,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:23:25,613 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:23:25,613 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:23:25,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2023-11-12 02:23:28,823 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:23:29,030 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:23:29,031 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2023-11-12 02:23:29,040 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/data/596f28e52/f4ba21eeb3574eb0a9483f9b33dda06b/FLAGb0183245c [2023-11-12 02:23:29,058 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/data/596f28e52/f4ba21eeb3574eb0a9483f9b33dda06b [2023-11-12 02:23:29,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:23:29,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:23:29,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:23:29,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:23:29,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:23:29,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:23:29" (1/1) ... [2023-11-12 02:23:29,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@94de1fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:29, skipping insertion in model container [2023-11-12 02:23:29,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:23:29" (1/1) ... [2023-11-12 02:23:29,100 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:23:29,287 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_275dc933-a71e-4a0a-a703-c843654da8bd/sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c[3096,3109] [2023-11-12 02:23:29,297 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:23:29,307 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:23:29,332 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_275dc933-a71e-4a0a-a703-c843654da8bd/sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c[3096,3109] [2023-11-12 02:23:29,348 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:23:29,357 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:23:29,358 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:23:29,366 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:23:29,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:29 WrapperNode [2023-11-12 02:23:29,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:23:29,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:23:29,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:23:29,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:23:29,376 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:23:29" (1/1) ... [2023-11-12 02:23:29,386 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:23:29" (1/1) ... [2023-11-12 02:23:29,416 INFO L138 Inliner]: procedures = 25, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2023-11-12 02:23:29,417 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:23:29,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:23:29,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:23:29,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:23:29,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:29" (1/1) ... [2023-11-12 02:23:29,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:29" (1/1) ... [2023-11-12 02:23:29,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:29" (1/1) ... [2023-11-12 02:23:29,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:29" (1/1) ... [2023-11-12 02:23:29,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:29" (1/1) ... [2023-11-12 02:23:29,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:29" (1/1) ... [2023-11-12 02:23:29,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:29" (1/1) ... [2023-11-12 02:23:29,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:29" (1/1) ... [2023-11-12 02:23:29,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:23:29,454 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:23:29,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:23:29,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:23:29,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:29" (1/1) ... [2023-11-12 02:23:29,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:23:29,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:23:29,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/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:23:29,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/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:23:29,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:23:29,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:23:29,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:23:29,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:23:29,553 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-12 02:23:29,553 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-12 02:23:29,553 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-12 02:23:29,553 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-12 02:23:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-12 02:23:29,554 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-12 02:23:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:23:29,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:23:29,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:23:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 02:23:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:23:29,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:23:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:23:29,559 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:23:29,755 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:23:29,758 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:23:30,251 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:23:30,310 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:23:30,310 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-12 02:23:30,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:23:30 BoogieIcfgContainer [2023-11-12 02:23:30,313 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:23:30,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:23:30,316 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:23:30,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:23:30,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:23:29" (1/3) ... [2023-11-12 02:23:30,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e75881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:23:30, skipping insertion in model container [2023-11-12 02:23:30,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:29" (2/3) ... [2023-11-12 02:23:30,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e75881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:23:30, skipping insertion in model container [2023-11-12 02:23:30,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:23:30" (3/3) ... [2023-11-12 02:23:30,323 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2023-11-12 02:23:30,332 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 02:23:30,343 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:23:30,343 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:23:30,343 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:23:30,428 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-12 02:23:30,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 185 transitions, 391 flow [2023-11-12 02:23:30,568 INFO L124 PetriNetUnfolderBase]: 12/182 cut-off events. [2023-11-12 02:23:30,569 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-12 02:23:30,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 182 events. 12/182 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 122 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2023-11-12 02:23:30,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 185 transitions, 391 flow [2023-11-12 02:23:30,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 171 transitions, 360 flow [2023-11-12 02:23:30,585 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:23:30,595 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 171 transitions, 360 flow [2023-11-12 02:23:30,598 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 171 transitions, 360 flow [2023-11-12 02:23:30,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 171 transitions, 360 flow [2023-11-12 02:23:30,647 INFO L124 PetriNetUnfolderBase]: 12/171 cut-off events. [2023-11-12 02:23:30,648 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-12 02:23:30,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 171 events. 12/171 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 121 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2023-11-12 02:23:30,652 INFO L119 LiptonReduction]: Number of co-enabled transitions 1444 [2023-11-12 02:23:37,775 INFO L134 LiptonReduction]: Checked pairs total: 2100 [2023-11-12 02:23:37,775 INFO L136 LiptonReduction]: Total number of compositions: 180 [2023-11-12 02:23:37,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:23:37,798 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;@479ac97a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:23:37,799 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-12 02:23:37,806 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:23:37,807 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2023-11-12 02:23:37,807 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-12 02:23:37,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:23:37,808 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] [2023-11-12 02:23:37,808 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 1 more)] === [2023-11-12 02:23:37,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:37,814 INFO L85 PathProgramCache]: Analyzing trace with hash 957104947, now seen corresponding path program 1 times [2023-11-12 02:23:37,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:37,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767989401] [2023-11-12 02:23:37,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:37,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:38,340 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:23:38,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:38,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767989401] [2023-11-12 02:23:38,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767989401] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:38,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:38,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:23:38,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606325734] [2023-11-12 02:23:38,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:38,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:23:38,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:38,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:23:38,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:23:38,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 365 [2023-11-12 02:23:38,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 165.25) internal successors, (661), 4 states have internal predecessors, (661), 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:23:38,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:23:38,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 365 [2023-11-12 02:23:38,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:23:38,658 INFO L124 PetriNetUnfolderBase]: 282/438 cut-off events. [2023-11-12 02:23:38,659 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-11-12 02:23:38,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 438 events. 282/438 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1309 event pairs, 173 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 800. Up to 356 conditions per place. [2023-11-12 02:23:38,670 INFO L140 encePairwiseOnDemand]: 361/365 looper letters, 32 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2023-11-12 02:23:38,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 164 flow [2023-11-12 02:23:38,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:23:38,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:23:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 676 transitions. [2023-11-12 02:23:38,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46301369863013697 [2023-11-12 02:23:38,698 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 676 transitions. [2023-11-12 02:23:38,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 676 transitions. [2023-11-12 02:23:38,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:23:38,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 676 transitions. [2023-11-12 02:23:38,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 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:23:38,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 365.0) internal successors, (1825), 5 states have internal predecessors, (1825), 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:23:38,725 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 365.0) internal successors, (1825), 5 states have internal predecessors, (1825), 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:23:38,727 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 66 flow. Second operand 4 states and 676 transitions. [2023-11-12 02:23:38,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 164 flow [2023-11-12 02:23:38,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 35 transitions, 148 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-12 02:23:38,733 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 68 flow [2023-11-12 02:23:38,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2023-11-12 02:23:38,743 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-11-12 02:23:38,744 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 68 flow [2023-11-12 02:23:38,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 165.25) internal successors, (661), 4 states have internal predecessors, (661), 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:23:38,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:23:38,745 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] [2023-11-12 02:23:38,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:23:38,746 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 1 more)] === [2023-11-12 02:23:38,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:38,747 INFO L85 PathProgramCache]: Analyzing trace with hash 273187408, now seen corresponding path program 1 times [2023-11-12 02:23:38,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:38,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076005326] [2023-11-12 02:23:38,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:38,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:38,907 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:23:38,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:38,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076005326] [2023-11-12 02:23:38,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076005326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:38,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:38,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:23:38,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95081652] [2023-11-12 02:23:38,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:38,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:23:38,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:38,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:23:38,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:23:38,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 365 [2023-11-12 02:23:38,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 165.5) internal successors, (662), 4 states have internal predecessors, (662), 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:23:38,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:23:38,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 365 [2023-11-12 02:23:38,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:23:39,095 INFO L124 PetriNetUnfolderBase]: 344/532 cut-off events. [2023-11-12 02:23:39,095 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-12 02:23:39,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1270 conditions, 532 events. 344/532 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1700 event pairs, 221 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 397. Up to 438 conditions per place. [2023-11-12 02:23:39,101 INFO L140 encePairwiseOnDemand]: 361/365 looper letters, 34 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2023-11-12 02:23:39,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 178 flow [2023-11-12 02:23:39,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:23:39,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:23:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 676 transitions. [2023-11-12 02:23:39,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46301369863013697 [2023-11-12 02:23:39,107 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 676 transitions. [2023-11-12 02:23:39,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 676 transitions. [2023-11-12 02:23:39,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:23:39,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 676 transitions. [2023-11-12 02:23:39,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 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:23:39,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 365.0) internal successors, (1825), 5 states have internal predecessors, (1825), 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:23:39,119 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 365.0) internal successors, (1825), 5 states have internal predecessors, (1825), 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:23:39,119 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 68 flow. Second operand 4 states and 676 transitions. [2023-11-12 02:23:39,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 178 flow [2023-11-12 02:23:39,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 37 transitions, 168 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-12 02:23:39,124 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 76 flow [2023-11-12 02:23:39,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2023-11-12 02:23:39,132 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-11-12 02:23:39,132 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 76 flow [2023-11-12 02:23:39,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 165.5) internal successors, (662), 4 states have internal predecessors, (662), 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:23:39,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:23:39,133 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] [2023-11-12 02:23:39,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:23:39,134 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 1 more)] === [2023-11-12 02:23:39,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:39,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1875280769, now seen corresponding path program 1 times [2023-11-12 02:23:39,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:39,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936414833] [2023-11-12 02:23:39,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:39,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 02:23:39,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:39,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936414833] [2023-11-12 02:23:39,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936414833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:39,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:39,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:23:39,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112950256] [2023-11-12 02:23:39,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:39,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:23:39,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:39,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:23:39,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:23:39,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 365 [2023-11-12 02:23:39,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:23:39,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:23:39,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 365 [2023-11-12 02:23:39,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:23:39,527 INFO L124 PetriNetUnfolderBase]: 344/533 cut-off events. [2023-11-12 02:23:39,527 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2023-11-12 02:23:39,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 533 events. 344/533 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1619 event pairs, 277 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 469. Up to 533 conditions per place. [2023-11-12 02:23:39,532 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 25 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2023-11-12 02:23:39,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 132 flow [2023-11-12 02:23:39,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:23:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:23:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2023-11-12 02:23:39,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45388127853881277 [2023-11-12 02:23:39,536 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2023-11-12 02:23:39,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2023-11-12 02:23:39,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:23:39,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2023-11-12 02:23:39,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 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:23:39,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 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:23:39,543 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 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:23:39,543 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 76 flow. Second operand 3 states and 497 transitions. [2023-11-12 02:23:39,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 132 flow [2023-11-12 02:23:39,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 27 transitions, 126 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-12 02:23:39,546 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 82 flow [2023-11-12 02:23:39,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2023-11-12 02:23:39,548 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2023-11-12 02:23:39,551 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 82 flow [2023-11-12 02:23:39,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:23:39,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:23:39,552 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] [2023-11-12 02:23:39,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:23:39,553 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 1 more)] === [2023-11-12 02:23:39,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:39,554 INFO L85 PathProgramCache]: Analyzing trace with hash 389934810, now seen corresponding path program 1 times [2023-11-12 02:23:39,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:39,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645722362] [2023-11-12 02:23:39,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:39,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:23:40,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:40,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645722362] [2023-11-12 02:23:40,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645722362] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:23:40,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717057708] [2023-11-12 02:23:40,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:40,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:23:40,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:23:40,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:23:40,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:23:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:40,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-12 02:23:40,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:23:40,440 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:23:40,480 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:23:40,517 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:23:40,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:23:40,649 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:23:40,765 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:23:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:23:40,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:23:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:23:41,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717057708] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:23:41,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:23:41,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 8] total 22 [2023-11-12 02:23:41,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785969676] [2023-11-12 02:23:41,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:23:41,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-12 02:23:41,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:41,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-12 02:23:41,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=391, Unknown=2, NotChecked=0, Total=506 [2023-11-12 02:23:42,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 365 [2023-11-12 02:23:42,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 82 flow. Second operand has 23 states, 23 states have (on average 112.8695652173913) internal successors, (2596), 23 states have internal predecessors, (2596), 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:23:42,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:23:42,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 365 [2023-11-12 02:23:42,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:23:45,590 INFO L124 PetriNetUnfolderBase]: 996/1578 cut-off events. [2023-11-12 02:23:45,591 INFO L125 PetriNetUnfolderBase]: For 316/316 co-relation queries the response was YES. [2023-11-12 02:23:45,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3948 conditions, 1578 events. 996/1578 cut-off events. For 316/316 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6842 event pairs, 113 based on Foata normal form. 5/1296 useless extension candidates. Maximal degree in co-relation 3935. Up to 385 conditions per place. [2023-11-12 02:23:45,600 INFO L140 encePairwiseOnDemand]: 354/365 looper letters, 88 selfloop transitions, 17 changer transitions 167/272 dead transitions. [2023-11-12 02:23:45,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 272 transitions, 1329 flow [2023-11-12 02:23:45,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-12 02:23:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-11-12 02:23:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 3785 transitions. [2023-11-12 02:23:45,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3240582191780822 [2023-11-12 02:23:45,620 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 3785 transitions. [2023-11-12 02:23:45,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 3785 transitions. [2023-11-12 02:23:45,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:23:45,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 3785 transitions. [2023-11-12 02:23:45,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 118.28125) internal successors, (3785), 32 states have internal predecessors, (3785), 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:23:45,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 365.0) internal successors, (12045), 33 states have internal predecessors, (12045), 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:23:45,677 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 365.0) internal successors, (12045), 33 states have internal predecessors, (12045), 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:23:45,677 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 82 flow. Second operand 32 states and 3785 transitions. [2023-11-12 02:23:45,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 272 transitions, 1329 flow [2023-11-12 02:23:45,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 272 transitions, 1325 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-12 02:23:45,690 INFO L231 Difference]: Finished difference. Result has 87 places, 37 transitions, 255 flow [2023-11-12 02:23:45,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=255, PETRI_PLACES=87, PETRI_TRANSITIONS=37} [2023-11-12 02:23:45,692 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 56 predicate places. [2023-11-12 02:23:45,693 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 37 transitions, 255 flow [2023-11-12 02:23:45,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 112.8695652173913) internal successors, (2596), 23 states have internal predecessors, (2596), 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:23:45,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:23:45,696 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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:23:45,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:23:45,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:23:45,903 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 1 more)] === [2023-11-12 02:23:45,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:45,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1665174355, now seen corresponding path program 2 times [2023-11-12 02:23:45,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:45,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921635957] [2023-11-12 02:23:45,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:45,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:23:46,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:46,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921635957] [2023-11-12 02:23:46,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921635957] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:23:46,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059294531] [2023-11-12 02:23:46,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 02:23:46,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:23:46,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:23:46,140 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:23:46,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 02:23:46,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-12 02:23:46,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:23:46,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-12 02:23:46,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:23:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:23:46,464 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:23:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:23:46,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059294531] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:23:46,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:23:46,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-12 02:23:46,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187283529] [2023-11-12 02:23:46,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:23:46,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-12 02:23:46,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:46,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-12 02:23:46,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-11-12 02:23:46,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 365 [2023-11-12 02:23:46,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 37 transitions, 255 flow. Second operand has 14 states, 14 states have (on average 153.78571428571428) internal successors, (2153), 14 states have internal predecessors, (2153), 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:23:46,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:23:46,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 365 [2023-11-12 02:23:46,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:23:47,109 INFO L124 PetriNetUnfolderBase]: 379/640 cut-off events. [2023-11-12 02:23:47,109 INFO L125 PetriNetUnfolderBase]: For 6228/6228 co-relation queries the response was YES. [2023-11-12 02:23:47,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3429 conditions, 640 events. 379/640 cut-off events. For 6228/6228 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2176 event pairs, 232 based on Foata normal form. 6/646 useless extension candidates. Maximal degree in co-relation 3377. Up to 599 conditions per place. [2023-11-12 02:23:47,125 INFO L140 encePairwiseOnDemand]: 360/365 looper letters, 35 selfloop transitions, 3 changer transitions 20/58 dead transitions. [2023-11-12 02:23:47,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 58 transitions, 437 flow [2023-11-12 02:23:47,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:23:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:23:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1104 transitions. [2023-11-12 02:23:47,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4320939334637965 [2023-11-12 02:23:47,132 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1104 transitions. [2023-11-12 02:23:47,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1104 transitions. [2023-11-12 02:23:47,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:23:47,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1104 transitions. [2023-11-12 02:23:47,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 157.71428571428572) internal successors, (1104), 7 states have internal predecessors, (1104), 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:23:47,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 365.0) internal successors, (2920), 8 states have internal predecessors, (2920), 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:23:47,144 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 365.0) internal successors, (2920), 8 states have internal predecessors, (2920), 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:23:47,145 INFO L175 Difference]: Start difference. First operand has 87 places, 37 transitions, 255 flow. Second operand 7 states and 1104 transitions. [2023-11-12 02:23:47,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 58 transitions, 437 flow [2023-11-12 02:23:47,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 380 flow, removed 25 selfloop flow, removed 17 redundant places. [2023-11-12 02:23:47,165 INFO L231 Difference]: Finished difference. Result has 62 places, 38 transitions, 222 flow [2023-11-12 02:23:47,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=62, PETRI_TRANSITIONS=38} [2023-11-12 02:23:47,168 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 31 predicate places. [2023-11-12 02:23:47,170 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 38 transitions, 222 flow [2023-11-12 02:23:47,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 153.78571428571428) internal successors, (2153), 14 states have internal predecessors, (2153), 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:23:47,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:23:47,172 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:47,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:23:47,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:23:47,389 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 1 more)] === [2023-11-12 02:23:47,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:47,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1683270082, now seen corresponding path program 3 times [2023-11-12 02:23:47,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:47,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92121361] [2023-11-12 02:23:47,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:47,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 02:23:47,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:47,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92121361] [2023-11-12 02:23:47,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92121361] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:23:47,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880402235] [2023-11-12 02:23:47,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 02:23:47,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:23:47,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:23:47,621 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:23:47,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 02:23:48,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-12 02:23:48,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:23:48,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-12 02:23:48,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:23:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 02:23:48,194 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:23:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 02:23:48,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880402235] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:23:48,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:23:48,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-11-12 02:23:48,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716882506] [2023-11-12 02:23:48,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:23:48,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-12 02:23:48,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:48,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-12 02:23:48,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-11-12 02:23:48,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 365 [2023-11-12 02:23:48,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 38 transitions, 222 flow. Second operand has 15 states, 15 states have (on average 153.53333333333333) internal successors, (2303), 15 states have internal predecessors, (2303), 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:23:48,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:23:48,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 365 [2023-11-12 02:23:48,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:23:48,889 INFO L124 PetriNetUnfolderBase]: 448/732 cut-off events. [2023-11-12 02:23:48,889 INFO L125 PetriNetUnfolderBase]: For 3030/3030 co-relation queries the response was YES. [2023-11-12 02:23:48,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3236 conditions, 732 events. 448/732 cut-off events. For 3030/3030 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2658 event pairs, 161 based on Foata normal form. 48/780 useless extension candidates. Maximal degree in co-relation 3202. Up to 474 conditions per place. [2023-11-12 02:23:48,898 INFO L140 encePairwiseOnDemand]: 359/365 looper letters, 49 selfloop transitions, 11 changer transitions 0/60 dead transitions. [2023-11-12 02:23:48,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 60 transitions, 466 flow [2023-11-12 02:23:48,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:23:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-12 02:23:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1253 transitions. [2023-11-12 02:23:48,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4291095890410959 [2023-11-12 02:23:48,904 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1253 transitions. [2023-11-12 02:23:48,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1253 transitions. [2023-11-12 02:23:48,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:23:48,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1253 transitions. [2023-11-12 02:23:48,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 156.625) internal successors, (1253), 8 states have internal predecessors, (1253), 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:23:48,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 365.0) internal successors, (3285), 9 states have internal predecessors, (3285), 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:23:48,917 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 365.0) internal successors, (3285), 9 states have internal predecessors, (3285), 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:23:48,917 INFO L175 Difference]: Start difference. First operand has 62 places, 38 transitions, 222 flow. Second operand 8 states and 1253 transitions. [2023-11-12 02:23:48,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 60 transitions, 466 flow [2023-11-12 02:23:48,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 60 transitions, 440 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-11-12 02:23:48,926 INFO L231 Difference]: Finished difference. Result has 61 places, 39 transitions, 240 flow [2023-11-12 02:23:48,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=240, PETRI_PLACES=61, PETRI_TRANSITIONS=39} [2023-11-12 02:23:48,927 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 30 predicate places. [2023-11-12 02:23:48,927 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 39 transitions, 240 flow [2023-11-12 02:23:48,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 153.53333333333333) internal successors, (2303), 15 states have internal predecessors, (2303), 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:23:48,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:23:48,929 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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:23:48,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 02:23:49,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:23:49,136 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 1 more)] === [2023-11-12 02:23:49,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:49,136 INFO L85 PathProgramCache]: Analyzing trace with hash -442587539, now seen corresponding path program 4 times [2023-11-12 02:23:49,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:49,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404925111] [2023-11-12 02:23:49,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:49,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 02:23:50,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:50,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404925111] [2023-11-12 02:23:50,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404925111] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:23:50,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889322625] [2023-11-12 02:23:50,379 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-12 02:23:50,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:23:50,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:23:50,383 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:23:50,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 02:23:50,537 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-12 02:23:50,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:23:50,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-12 02:23:50,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:23:50,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:23:50,706 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:23:51,075 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:23:51,076 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 35 [2023-11-12 02:23:51,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 02:23:51,123 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:23:52,260 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse28 (* c_thread1Thread1of1ForFork1_~i~0 4))) (let ((.cse2 (+ c_~min~0 1)) (.cse6 (+ c_~A~0.offset .cse28 4)) (.cse5 (+ c_~A~0.offset 4)) (.cse1 (+ c_~A~0.offset .cse28))) (and (forall ((v_ArrVal_183 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_183) c_~A~0.base))) (let ((.cse3 (select .cse0 .cse6)) (.cse4 (select .cse0 .cse5))) (or (< (select .cse0 .cse1) .cse2) (< .cse3 (+ .cse4 1)) (< c_~min~0 .cse3) (< .cse4 (select .cse0 c_~A~0.offset)))))) (forall ((v_ArrVal_183 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_183) c_~A~0.base))) (let ((.cse8 (select .cse9 c_~A~0.offset)) (.cse7 (select .cse9 .cse1))) (or (< .cse7 (+ 1 .cse8)) (< (select .cse9 .cse6) (+ .cse7 1)) (< .cse8 (+ (select .cse9 .cse5) 1)) (< c_~min~0 .cse7))))) (forall ((v_ArrVal_183 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_183) c_~A~0.base))) (let ((.cse12 (select .cse10 .cse6)) (.cse11 (select .cse10 c_~A~0.offset))) (or (< (select .cse10 .cse1) .cse2) (< .cse11 (+ (select .cse10 .cse5) 1)) (< c_~min~0 .cse12) (< .cse12 (+ 1 .cse11)))))) (forall ((v_ArrVal_183 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_183) c_~A~0.base))) (let ((.cse13 (select .cse16 .cse1)) (.cse14 (select .cse16 .cse6)) (.cse15 (select .cse16 c_~A~0.offset))) (or (< .cse13 .cse14) (< .cse15 (+ (select .cse16 .cse5) 1)) (< c_~min~0 .cse13) (< .cse14 (+ 1 .cse15)))))) (forall ((v_ArrVal_183 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_183) c_~A~0.base))) (let ((.cse18 (select .cse20 .cse6)) (.cse17 (select .cse20 .cse1)) (.cse19 (select .cse20 .cse5))) (or (< .cse17 .cse18) (< .cse18 (+ .cse19 1)) (< c_~min~0 .cse17) (< .cse19 (select .cse20 c_~A~0.offset)))))) (forall ((v_ArrVal_183 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_183) c_~A~0.base))) (let ((.cse22 (select .cse21 .cse5))) (or (< (select .cse21 .cse1) .cse2) (< (select .cse21 .cse6) .cse2) (< c_~min~0 (+ .cse22 1)) (< .cse22 (select .cse21 c_~A~0.offset)))))) (forall ((v_ArrVal_183 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_183) c_~A~0.base))) (let ((.cse24 (select .cse23 c_~A~0.offset))) (or (< (select .cse23 .cse1) .cse2) (< c_~min~0 (+ 1 .cse24)) (< (select .cse23 .cse6) .cse2) (< .cse24 (+ (select .cse23 .cse5) 1)))))) (forall ((v_ArrVal_183 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_183) c_~A~0.base))) (let ((.cse25 (select .cse27 .cse1)) (.cse26 (select .cse27 .cse5))) (or (< .cse25 (+ .cse26 1)) (< (select .cse27 .cse6) (+ .cse25 1)) (< c_~min~0 .cse25) (< .cse26 (select .cse27 c_~A~0.offset))))))))) is different from false [2023-11-12 02:23:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 02:23:52,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889322625] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:23:52,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:23:52,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 10] total 27 [2023-11-12 02:23:52,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384966101] [2023-11-12 02:23:52,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:23:52,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-12 02:23:52,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:52,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-12 02:23:52,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=577, Unknown=1, NotChecked=50, Total=756 [2023-11-12 02:23:52,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 365 [2023-11-12 02:23:52,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 39 transitions, 240 flow. Second operand has 28 states, 28 states have (on average 124.75) internal successors, (3493), 28 states have internal predecessors, (3493), 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:23:52,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:23:52,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 365 [2023-11-12 02:23:52,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:23:54,846 INFO L124 PetriNetUnfolderBase]: 1516/2454 cut-off events. [2023-11-12 02:23:54,847 INFO L125 PetriNetUnfolderBase]: For 9089/9089 co-relation queries the response was YES. [2023-11-12 02:23:54,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11119 conditions, 2454 events. 1516/2454 cut-off events. For 9089/9089 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12044 event pairs, 298 based on Foata normal form. 6/2460 useless extension candidates. Maximal degree in co-relation 11079. Up to 854 conditions per place. [2023-11-12 02:23:54,867 INFO L140 encePairwiseOnDemand]: 354/365 looper letters, 90 selfloop transitions, 22 changer transitions 159/271 dead transitions. [2023-11-12 02:23:54,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 271 transitions, 1985 flow [2023-11-12 02:23:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-12 02:23:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-11-12 02:23:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3390 transitions. [2023-11-12 02:23:54,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35721812434141204 [2023-11-12 02:23:54,883 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 3390 transitions. [2023-11-12 02:23:54,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 3390 transitions. [2023-11-12 02:23:54,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:23:54,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 3390 transitions. [2023-11-12 02:23:54,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 130.3846153846154) internal successors, (3390), 26 states have internal predecessors, (3390), 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:23:54,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 365.0) internal successors, (9855), 27 states have internal predecessors, (9855), 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:23:54,926 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 365.0) internal successors, (9855), 27 states have internal predecessors, (9855), 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:23:54,932 INFO L175 Difference]: Start difference. First operand has 61 places, 39 transitions, 240 flow. Second operand 26 states and 3390 transitions. [2023-11-12 02:23:54,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 271 transitions, 1985 flow [2023-11-12 02:23:54,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 271 transitions, 1905 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-11-12 02:23:54,960 INFO L231 Difference]: Finished difference. Result has 97 places, 55 transitions, 458 flow [2023-11-12 02:23:54,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=458, PETRI_PLACES=97, PETRI_TRANSITIONS=55} [2023-11-12 02:23:54,961 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 66 predicate places. [2023-11-12 02:23:54,961 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 55 transitions, 458 flow [2023-11-12 02:23:54,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 124.75) internal successors, (3493), 28 states have internal predecessors, (3493), 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:23:54,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:23:54,963 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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:23:54,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 02:23:55,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-12 02:23:55,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 1 more)] === [2023-11-12 02:23:55,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:55,171 INFO L85 PathProgramCache]: Analyzing trace with hash 2105490869, now seen corresponding path program 5 times [2023-11-12 02:23:55,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:55,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067395506] [2023-11-12 02:23:55,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:55,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 02:23:55,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:55,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067395506] [2023-11-12 02:23:55,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067395506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:55,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:55,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:23:55,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092060707] [2023-11-12 02:23:55,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:55,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:23:55,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:55,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:23:55,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:23:55,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 365 [2023-11-12 02:23:55,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 55 transitions, 458 flow. Second operand has 5 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 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:23:55,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:23:55,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 365 [2023-11-12 02:23:55,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:23:56,015 INFO L124 PetriNetUnfolderBase]: 1037/1739 cut-off events. [2023-11-12 02:23:56,015 INFO L125 PetriNetUnfolderBase]: For 15874/15874 co-relation queries the response was YES. [2023-11-12 02:23:56,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9600 conditions, 1739 events. 1037/1739 cut-off events. For 15874/15874 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8248 event pairs, 257 based on Foata normal form. 6/1745 useless extension candidates. Maximal degree in co-relation 9545. Up to 1129 conditions per place. [2023-11-12 02:23:56,034 INFO L140 encePairwiseOnDemand]: 361/365 looper letters, 58 selfloop transitions, 7 changer transitions 36/101 dead transitions. [2023-11-12 02:23:56,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 101 transitions, 1067 flow [2023-11-12 02:23:56,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:23:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:23:56,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 814 transitions. [2023-11-12 02:23:56,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44602739726027396 [2023-11-12 02:23:56,038 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 814 transitions. [2023-11-12 02:23:56,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 814 transitions. [2023-11-12 02:23:56,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:23:56,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 814 transitions. [2023-11-12 02:23:56,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 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:23:56,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 365.0) internal successors, (2190), 6 states have internal predecessors, (2190), 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:23:56,046 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 365.0) internal successors, (2190), 6 states have internal predecessors, (2190), 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:23:56,046 INFO L175 Difference]: Start difference. First operand has 97 places, 55 transitions, 458 flow. Second operand 5 states and 814 transitions. [2023-11-12 02:23:56,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 101 transitions, 1067 flow [2023-11-12 02:23:56,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 101 transitions, 974 flow, removed 40 selfloop flow, removed 13 redundant places. [2023-11-12 02:23:56,079 INFO L231 Difference]: Finished difference. Result has 79 places, 55 transitions, 430 flow [2023-11-12 02:23:56,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=430, PETRI_PLACES=79, PETRI_TRANSITIONS=55} [2023-11-12 02:23:56,081 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 48 predicate places. [2023-11-12 02:23:56,082 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 55 transitions, 430 flow [2023-11-12 02:23:56,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 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:23:56,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:23:56,082 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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:23:56,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:23:56,083 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 1 more)] === [2023-11-12 02:23:56,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:56,083 INFO L85 PathProgramCache]: Analyzing trace with hash -692421337, now seen corresponding path program 6 times [2023-11-12 02:23:56,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:56,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876689776] [2023-11-12 02:23:56,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:56,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 02:23:56,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:56,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876689776] [2023-11-12 02:23:56,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876689776] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:23:56,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096046708] [2023-11-12 02:23:56,834 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-12 02:23:56,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:23:56,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:23:56,836 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:23:56,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 02:23:57,021 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-12 02:23:57,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:23:57,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-12 02:23:57,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:23:57,093 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:23:57,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:23:57,194 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:23:57,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:23:57,262 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:23:57,592 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:23:57,592 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 45 [2023-11-12 02:23:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:23:57,625 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:23:57,937 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_240 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_240) c_~A~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (< (select .cse0 (+ c_~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (+ c_~min~0 1))) (< c_~min~0 (+ (select .cse0 c_~A~0.offset) 1))))) (forall ((v_ArrVal_240 (Array Int Int)) (thread1Thread1of1ForFork1_~i~0 Int)) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_240) c_~A~0.base))) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (< .cse1 (+ (select .cse2 c_~A~0.offset) 1)) (< c_~min~0 .cse1)))))) is different from false [2023-11-12 02:23:58,289 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4))) (.cse2 (+ c_~min~0 1))) (and (forall ((v_ArrVal_239 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_239))) (or (< (select (select .cse0 c_~A~0.base) .cse1) .cse2) (forall ((v_ArrVal_240 (Array Int Int)) (v_subst_3 Int)) (let ((.cse4 (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_240) c_~A~0.base))) (let ((.cse3 (select .cse4 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (< c_~min~0 .cse3) (< .cse3 (+ (select .cse4 c_~A~0.offset) 1))))))))) (forall ((v_ArrVal_239 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_239))) (let ((.cse7 (select (select .cse8 c_~A~0.base) .cse1))) (or (forall ((v_ArrVal_240 (Array Int Int)) (v_subst_2 Int)) (let ((.cse6 (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_240) c_~A~0.base))) (let ((.cse5 (select .cse6 (+ c_~A~0.offset (* 4 v_subst_2))))) (or (< .cse5 (+ (select .cse6 c_~A~0.offset) 1)) (< .cse7 .cse5))))) (< c_~min~0 .cse7))))) (forall ((v_ArrVal_239 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_239))) (let ((.cse10 (select (select .cse11 c_~A~0.base) .cse1))) (or (forall ((v_ArrVal_240 (Array Int Int))) (let ((.cse9 (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_240) c_~A~0.base))) (or (forall ((v_subst_1 Int)) (< (select .cse9 (+ c_~A~0.offset (* 4 v_subst_1))) (+ .cse10 1))) (< .cse10 (+ (select .cse9 c_~A~0.offset) 1))))) (< c_~min~0 .cse10))))) (forall ((v_ArrVal_239 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_239))) (or (forall ((v_ArrVal_240 (Array Int Int))) (let ((.cse12 (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_240) c_~A~0.base))) (or (forall ((v_subst_4 Int)) (< (select .cse12 (+ c_~A~0.offset (* 4 v_subst_4))) .cse2)) (< c_~min~0 (+ (select .cse12 c_~A~0.offset) 1))))) (< (select (select .cse13 c_~A~0.base) .cse1) .cse2)))))) is different from false [2023-11-12 02:23:58,375 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_~min~0 1))) (and (forall ((v_ArrVal_239 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_239))) (let ((.cse0 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_240 (Array Int Int))) (let ((.cse1 (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_240) c_~A~0.base))) (or (< .cse0 (+ (select .cse1 c_~A~0.offset) 1)) (forall ((v_subst_1 Int)) (< (select .cse1 (+ c_~A~0.offset (* 4 v_subst_1))) (+ .cse0 1)))))) (< c_~min~0 .cse0))))) (forall ((v_ArrVal_239 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_239))) (let ((.cse5 (select (select .cse6 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_240 (Array Int Int)) (v_subst_2 Int)) (let ((.cse4 (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_240) c_~A~0.base))) (let ((.cse3 (select .cse4 (+ c_~A~0.offset (* 4 v_subst_2))))) (or (< .cse3 (+ (select .cse4 c_~A~0.offset) 1)) (< .cse5 .cse3))))) (< c_~min~0 .cse5))))) (forall ((v_ArrVal_239 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_239))) (or (forall ((v_ArrVal_240 (Array Int Int))) (let ((.cse7 (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_240) c_~A~0.base))) (or (forall ((v_subst_4 Int)) (< (select .cse7 (+ c_~A~0.offset (* 4 v_subst_4))) .cse8)) (< c_~min~0 (+ (select .cse7 c_~A~0.offset) 1))))) (< (select (select .cse9 c_~A~0.base) c_~A~0.offset) .cse8)))) (forall ((v_ArrVal_239 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_239))) (or (< (select (select .cse10 c_~A~0.base) c_~A~0.offset) .cse8) (forall ((v_ArrVal_240 (Array Int Int)) (v_subst_3 Int)) (let ((.cse12 (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_240) c_~A~0.base))) (let ((.cse11 (select .cse12 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (< c_~min~0 .cse11) (< .cse11 (+ (select .cse12 c_~A~0.offset) 1))))))))))) is different from false [2023-11-12 02:23:58,457 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse5 (+ .cse3 1))) (and (forall ((v_ArrVal_239 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_239))) (let ((.cse0 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_240 (Array Int Int))) (let ((.cse1 (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_240) c_~A~0.base))) (or (< .cse0 (+ (select .cse1 c_~A~0.offset) 1)) (forall ((v_subst_1 Int)) (< (select .cse1 (+ c_~A~0.offset (* 4 v_subst_1))) (+ .cse0 1)))))) (< .cse3 .cse0))))) (forall ((v_ArrVal_239 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_239))) (or (< (select (select .cse4 c_~A~0.base) c_~A~0.offset) .cse5) (forall ((v_ArrVal_240 (Array Int Int))) (let ((.cse6 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_240) c_~A~0.base))) (or (< .cse3 (+ (select .cse6 c_~A~0.offset) 1)) (forall ((v_subst_4 Int)) (< (select .cse6 (+ c_~A~0.offset (* 4 v_subst_4))) .cse5)))))))) (forall ((v_ArrVal_239 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_239))) (let ((.cse9 (select (select .cse10 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_240 (Array Int Int)) (v_subst_2 Int)) (let ((.cse8 (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_240) c_~A~0.base))) (let ((.cse7 (select .cse8 (+ c_~A~0.offset (* 4 v_subst_2))))) (or (< .cse7 (+ (select .cse8 c_~A~0.offset) 1)) (< .cse9 .cse7))))) (< .cse3 .cse9))))) (forall ((v_ArrVal_239 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_239))) (or (< (select (select .cse11 c_~A~0.base) c_~A~0.offset) .cse5) (forall ((v_ArrVal_240 (Array Int Int)) (v_subst_3 Int)) (let ((.cse13 (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_240) c_~A~0.base))) (let ((.cse12 (select .cse13 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (< .cse3 .cse12) (< .cse12 (+ (select .cse13 c_~A~0.offset) 1)))))))))))) is different from false [2023-11-12 02:23:58,578 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:23:58,579 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1196 treesize of output 1060 [2023-11-12 02:23:58,613 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:23:58,614 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 152 [2023-11-12 02:23:58,636 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:23:58,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 195 [2023-11-12 02:23:58,657 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-12 02:23:58,658 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 104 [2023-11-12 02:23:58,745 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:23:58,745 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1484 treesize of output 1 [2023-11-12 02:23:58,764 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:23:58,765 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2741 treesize of output 2517 [2023-11-12 02:23:58,808 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-12 02:23:58,809 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 98 [2023-11-12 02:23:58,820 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 126 treesize of output 114 [2023-11-12 02:23:58,830 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 59 treesize of output 53 [2023-11-12 02:23:58,895 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:23:58,905 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 02:23:58,906 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 533 treesize of output 1 [2023-11-12 02:23:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:23:58,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096046708] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:23:58,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:23:58,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 29 [2023-11-12 02:23:58,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442204229] [2023-11-12 02:23:58,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:23:58,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-12 02:23:58,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:58,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-12 02:23:58,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=568, Unknown=4, NotChecked=212, Total=930 [2023-11-12 02:23:58,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 365 [2023-11-12 02:23:58,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 55 transitions, 430 flow. Second operand has 31 states, 31 states have (on average 118.41935483870968) internal successors, (3671), 31 states have internal predecessors, (3671), 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:23:58,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:23:58,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 365 [2023-11-12 02:23:58,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:24:00,688 INFO L124 PetriNetUnfolderBase]: 1007/1595 cut-off events. [2023-11-12 02:24:00,688 INFO L125 PetriNetUnfolderBase]: For 10741/10741 co-relation queries the response was YES. [2023-11-12 02:24:00,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8418 conditions, 1595 events. 1007/1595 cut-off events. For 10741/10741 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6854 event pairs, 43 based on Foata normal form. 6/1601 useless extension candidates. Maximal degree in co-relation 8390. Up to 555 conditions per place. [2023-11-12 02:24:00,698 INFO L140 encePairwiseOnDemand]: 351/365 looper letters, 0 selfloop transitions, 0 changer transitions 159/159 dead transitions. [2023-11-12 02:24:00,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 159 transitions, 1529 flow [2023-11-12 02:24:00,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-12 02:24:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-12 02:24:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2075 transitions. [2023-11-12 02:24:00,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33440773569701854 [2023-11-12 02:24:00,708 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2075 transitions. [2023-11-12 02:24:00,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2075 transitions. [2023-11-12 02:24:00,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:24:00,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2075 transitions. [2023-11-12 02:24:00,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 122.05882352941177) internal successors, (2075), 17 states have internal predecessors, (2075), 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:24:00,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 365.0) internal successors, (6570), 18 states have internal predecessors, (6570), 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:24:00,728 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 365.0) internal successors, (6570), 18 states have internal predecessors, (6570), 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:24:00,728 INFO L175 Difference]: Start difference. First operand has 79 places, 55 transitions, 430 flow. Second operand 17 states and 2075 transitions. [2023-11-12 02:24:00,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 159 transitions, 1529 flow [2023-11-12 02:24:00,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 159 transitions, 1511 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-12 02:24:00,746 INFO L231 Difference]: Finished difference. Result has 90 places, 0 transitions, 0 flow [2023-11-12 02:24:00,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=0, PETRI_PLACES=90, PETRI_TRANSITIONS=0} [2023-11-12 02:24:00,747 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 59 predicate places. [2023-11-12 02:24:00,748 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 0 transitions, 0 flow [2023-11-12 02:24:00,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 118.41935483870968) internal successors, (3671), 31 states have internal predecessors, (3671), 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:24:00,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-12 02:24:00,752 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-12 02:24:00,752 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-12 02:24:00,752 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-12 02:24:00,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-12 02:24:00,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:24:00,959 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2023-11-12 02:24:00,963 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 02:24:00,963 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:24:00,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:24:00 BasicIcfg [2023-11-12 02:24:00,967 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:24:00,968 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:24:00,968 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:24:00,968 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:24:00,968 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:23:30" (3/4) ... [2023-11-12 02:24:00,971 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 02:24:00,975 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-11-12 02:24:00,975 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-11-12 02:24:00,975 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2023-11-12 02:24:00,986 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2023-11-12 02:24:00,987 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-12 02:24:00,987 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-12 02:24:00,988 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 02:24:01,107 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:24:01,108 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/witness.yml [2023-11-12 02:24:01,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:24:01,109 INFO L158 Benchmark]: Toolchain (without parser) took 32046.35ms. Allocated memory was 142.6MB in the beginning and 371.2MB in the end (delta: 228.6MB). Free memory was 97.3MB in the beginning and 292.2MB in the end (delta: -194.9MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2023-11-12 02:24:01,109 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 111.1MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:24:01,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.38ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 84.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 02:24:01,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.63ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 82.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:24:01,110 INFO L158 Benchmark]: Boogie Preprocessor took 36.17ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 81.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:24:01,111 INFO L158 Benchmark]: RCFGBuilder took 859.27ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 103.1MB in the end (delta: -22.0MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2023-11-12 02:24:01,111 INFO L158 Benchmark]: TraceAbstraction took 30650.96ms. Allocated memory was 142.6MB in the beginning and 371.2MB in the end (delta: 228.6MB). Free memory was 102.4MB in the beginning and 298.1MB in the end (delta: -195.7MB). Peak memory consumption was 230.4MB. Max. memory is 16.1GB. [2023-11-12 02:24:01,112 INFO L158 Benchmark]: Witness Printer took 140.54ms. Allocated memory is still 371.2MB. Free memory was 298.1MB in the beginning and 292.2MB in the end (delta: 5.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:24:01,119 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.62ms. Allocated memory is still 111.1MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.38ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 84.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.63ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 82.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.17ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 81.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 859.27ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 103.1MB in the end (delta: -22.0MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * TraceAbstraction took 30650.96ms. Allocated memory was 142.6MB in the beginning and 371.2MB in the end (delta: 228.6MB). Free memory was 102.4MB in the beginning and 298.1MB in the end (delta: -195.7MB). Peak memory consumption was 230.4MB. Max. memory is 16.1GB. * Witness Printer took 140.54ms. Allocated memory is still 371.2MB. Free memory was 298.1MB in the beginning and 292.2MB in the end (delta: 5.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.2s, 169 PlacesBefore, 31 PlacesAfterwards, 171 TransitionsBefore, 24 TransitionsAfterwards, 1444 CoEnabledTransitionPairs, 8 FixpointIterations, 112 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 24 TrivialYvCompositions, 4 ConcurrentYvCompositions, 9 ChoiceCompositions, 180 TotalNumberOfCompositions, 2100 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1586, independent: 1525, independent conditional: 0, independent unconditional: 1525, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 785, independent: 765, independent conditional: 0, independent unconditional: 765, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1586, independent: 760, independent conditional: 0, independent unconditional: 760, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 785, unknown conditional: 0, unknown unconditional: 785] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 115]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 208 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.5s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, HoareTripleCheckerStatistics: 40 mSolverCounterUnknown, 1654 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1481 mSDsluCounter, 619 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 698 IncrementalHoareTripleChecker+Unchecked, 606 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3575 IncrementalHoareTripleChecker+Invalid, 4488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 13 mSDtfsCounter, 3575 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 391 GetRequests, 197 SyntacticMatches, 16 SemanticMatches, 178 ConstructedPredicates, 5 IntricatePredicates, 6 DeprecatedPredicates, 1986 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=458occurred in iteration=7, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 351 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 461 ConstructedInterpolants, 19 QuantifiedInterpolants, 6977 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1171 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 68/111 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-12 02:24:01,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275dc933-a71e-4a0a-a703-c843654da8bd/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE