./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-min-max-dec.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_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/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_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/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_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/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 67ced8cbf918778cce3ae5cae291c50696df3950945fdf68713903c29ac269e1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:26:22,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:26:22,763 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:26:22,769 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:26:22,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:26:22,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:26:22,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:26:22,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:26:22,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:26:22,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:26:22,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:26:22,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:26:22,807 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:26:22,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:26:22,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:26:22,810 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:26:22,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:26:22,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:26:22,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:26:22,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:26:22,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:26:22,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:26:22,815 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:26:22,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:26:22,816 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:26:22,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:26:22,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:26:22,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:26:22,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:26:22,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:26:22,827 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:26:22,827 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:26:22,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:26:22,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:26:22,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:26:22,829 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:26:22,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:26:22,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:26:22,831 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:26:22,831 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_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/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_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/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 -> 67ced8cbf918778cce3ae5cae291c50696df3950945fdf68713903c29ac269e1 [2023-11-12 02:26:23,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:26:23,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:26:23,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:26:23,141 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:26:23,142 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:26:23,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c [2023-11-12 02:26:26,159 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:26:26,426 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:26:26,426 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c [2023-11-12 02:26:26,437 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/bin/uautomizer-verify-uTZkv6EMXl/data/1fe6d4d37/e7cca0303df24c0eba8d65a370fc0c02/FLAG5838b2aeb [2023-11-12 02:26:26,735 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/bin/uautomizer-verify-uTZkv6EMXl/data/1fe6d4d37/e7cca0303df24c0eba8d65a370fc0c02 [2023-11-12 02:26:26,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:26:26,740 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:26:26,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:26:26,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:26:26,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:26:26,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:26:26" (1/1) ... [2023-11-12 02:26:26,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42cc1add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:26, skipping insertion in model container [2023-11-12 02:26:26,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:26:26" (1/1) ... [2023-11-12 02:26:26,778 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:26:26,993 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_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c[3071,3084] [2023-11-12 02:26:27,004 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:26:27,015 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:26:27,044 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_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c[3071,3084] [2023-11-12 02:26:27,048 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:26:27,057 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:26:27,057 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:26:27,064 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:26:27,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:27 WrapperNode [2023-11-12 02:26:27,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:26:27,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:26:27,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:26:27,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:26:27,075 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:26:27" (1/1) ... [2023-11-12 02:26:27,096 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:26:27" (1/1) ... [2023-11-12 02:26:27,126 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2023-11-12 02:26:27,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:26:27,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:26:27,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:26:27,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:26:27,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:27" (1/1) ... [2023-11-12 02:26:27,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:27" (1/1) ... [2023-11-12 02:26:27,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:27" (1/1) ... [2023-11-12 02:26:27,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:27" (1/1) ... [2023-11-12 02:26:27,161 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:27" (1/1) ... [2023-11-12 02:26:27,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:27" (1/1) ... [2023-11-12 02:26:27,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:27" (1/1) ... [2023-11-12 02:26:27,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:27" (1/1) ... [2023-11-12 02:26:27,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:26:27,189 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:26:27,190 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:26:27,190 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:26:27,191 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:27" (1/1) ... [2023-11-12 02:26:27,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:26:27,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:26:27,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/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:26:27,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/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:26:27,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:26:27,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:26:27,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:26:27,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:26:27,289 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-12 02:26:27,289 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-12 02:26:27,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-12 02:26:27,290 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-12 02:26:27,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-12 02:26:27,290 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-12 02:26:27,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-12 02:26:27,292 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-12 02:26:27,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:26:27,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:26:27,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:26:27,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 02:26:27,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:26:27,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:26:27,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:26:27,295 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:26:27,505 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:26:27,509 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:26:27,890 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:26:28,008 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:26:28,008 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-12 02:26:28,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:26:28 BoogieIcfgContainer [2023-11-12 02:26:28,011 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:26:28,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:26:28,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:26:28,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:26:28,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:26:26" (1/3) ... [2023-11-12 02:26:28,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51bbaa99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:26:28, skipping insertion in model container [2023-11-12 02:26:28,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:26:27" (2/3) ... [2023-11-12 02:26:28,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51bbaa99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:26:28, skipping insertion in model container [2023-11-12 02:26:28,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:26:28" (3/3) ... [2023-11-12 02:26:28,022 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2023-11-12 02:26:28,032 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 02:26:28,044 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:26:28,044 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:26:28,044 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:26:28,142 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-12 02:26:28,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 178 transitions, 384 flow [2023-11-12 02:26:28,282 INFO L124 PetriNetUnfolderBase]: 12/174 cut-off events. [2023-11-12 02:26:28,282 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-12 02:26:28,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 174 events. 12/174 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 147 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 139. Up to 2 conditions per place. [2023-11-12 02:26:28,290 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 178 transitions, 384 flow [2023-11-12 02:26:28,305 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 161 transitions, 346 flow [2023-11-12 02:26:28,316 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:26:28,328 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 161 transitions, 346 flow [2023-11-12 02:26:28,331 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 161 transitions, 346 flow [2023-11-12 02:26:28,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 161 transitions, 346 flow [2023-11-12 02:26:28,433 INFO L124 PetriNetUnfolderBase]: 12/161 cut-off events. [2023-11-12 02:26:28,434 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-12 02:26:28,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 161 events. 12/161 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 146 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 139. Up to 2 conditions per place. [2023-11-12 02:26:28,442 INFO L119 LiptonReduction]: Number of co-enabled transitions 2932 [2023-11-12 02:26:36,298 INFO L134 LiptonReduction]: Checked pairs total: 4091 [2023-11-12 02:26:36,299 INFO L136 LiptonReduction]: Total number of compositions: 154 [2023-11-12 02:26:36,316 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:26:36,324 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;@3f3a13e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:26:36,325 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-12 02:26:36,334 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:26:36,335 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2023-11-12 02:26:36,335 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-12 02:26:36,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:26:36,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:26:36,337 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:26:36,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:36,343 INFO L85 PathProgramCache]: Analyzing trace with hash 461781200, now seen corresponding path program 1 times [2023-11-12 02:26:36,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:36,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111969555] [2023-11-12 02:26:36,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:36,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:37,008 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:26:37,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:26:37,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111969555] [2023-11-12 02:26:37,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111969555] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:26:37,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:26:37,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:26:37,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126513270] [2023-11-12 02:26:37,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:26:37,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:26:37,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:26:37,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:26:37,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:26:37,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 332 [2023-11-12 02:26:37,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:37,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:26:37,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 332 [2023-11-12 02:26:37,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:26:37,626 INFO L124 PetriNetUnfolderBase]: 1312/1790 cut-off events. [2023-11-12 02:26:37,627 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2023-11-12 02:26:37,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3791 conditions, 1790 events. 1312/1790 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5882 event pairs, 787 based on Foata normal form. 0/1455 useless extension candidates. Maximal degree in co-relation 3330. Up to 1474 conditions per place. [2023-11-12 02:26:37,648 INFO L140 encePairwiseOnDemand]: 328/332 looper letters, 44 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2023-11-12 02:26:37,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 221 flow [2023-11-12 02:26:37,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:26:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:26:37,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 648 transitions. [2023-11-12 02:26:37,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4879518072289157 [2023-11-12 02:26:37,678 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 648 transitions. [2023-11-12 02:26:37,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 648 transitions. [2023-11-12 02:26:37,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:26:37,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 648 transitions. [2023-11-12 02:26:37,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:37,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:37,705 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:37,707 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 4 states and 648 transitions. [2023-11-12 02:26:37,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 221 flow [2023-11-12 02:26:37,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 199 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-12 02:26:37,718 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2023-11-12 02:26:37,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2023-11-12 02:26:37,725 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-11-12 02:26:37,726 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2023-11-12 02:26:37,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:37,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:26:37,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:26:37,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:26:37,728 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:26:37,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:37,729 INFO L85 PathProgramCache]: Analyzing trace with hash 154653664, now seen corresponding path program 1 times [2023-11-12 02:26:37,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:37,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176940632] [2023-11-12 02:26:37,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:37,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:38,044 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:26:38,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:26:38,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176940632] [2023-11-12 02:26:38,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176940632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:26:38,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:26:38,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:26:38,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138087706] [2023-11-12 02:26:38,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:26:38,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:26:38,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:26:38,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:26:38,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:26:38,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 332 [2023-11-12 02:26:38,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:38,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:26:38,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 332 [2023-11-12 02:26:38,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:26:38,485 INFO L124 PetriNetUnfolderBase]: 1632/2222 cut-off events. [2023-11-12 02:26:38,486 INFO L125 PetriNetUnfolderBase]: For 509/509 co-relation queries the response was YES. [2023-11-12 02:26:38,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5065 conditions, 2222 events. 1632/2222 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7618 event pairs, 977 based on Foata normal form. 0/1833 useless extension candidates. Maximal degree in co-relation 2296. Up to 1790 conditions per place. [2023-11-12 02:26:38,505 INFO L140 encePairwiseOnDemand]: 328/332 looper letters, 46 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2023-11-12 02:26:38,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 229 flow [2023-11-12 02:26:38,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:26:38,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:26:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 648 transitions. [2023-11-12 02:26:38,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4879518072289157 [2023-11-12 02:26:38,513 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 648 transitions. [2023-11-12 02:26:38,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 648 transitions. [2023-11-12 02:26:38,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:26:38,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 648 transitions. [2023-11-12 02:26:38,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:38,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:38,524 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:38,524 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 4 states and 648 transitions. [2023-11-12 02:26:38,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 229 flow [2023-11-12 02:26:38,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 219 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-12 02:26:38,532 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2023-11-12 02:26:38,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-11-12 02:26:38,533 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-11-12 02:26:38,533 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2023-11-12 02:26:38,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:38,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:26:38,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:26:38,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:26:38,535 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:26:38,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:38,536 INFO L85 PathProgramCache]: Analyzing trace with hash -383130912, now seen corresponding path program 1 times [2023-11-12 02:26:38,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:38,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342006256] [2023-11-12 02:26:38,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:38,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:38,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:26:38,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:26:38,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342006256] [2023-11-12 02:26:38,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342006256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:26:38,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:26:38,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:26:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110514292] [2023-11-12 02:26:38,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:26:38,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:26:38,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:26:38,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:26:38,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:26:38,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 332 [2023-11-12 02:26:38,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 157.25) internal successors, (629), 4 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:38,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:26:38,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 332 [2023-11-12 02:26:38,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:26:39,245 INFO L124 PetriNetUnfolderBase]: 2138/2902 cut-off events. [2023-11-12 02:26:39,245 INFO L125 PetriNetUnfolderBase]: For 941/941 co-relation queries the response was YES. [2023-11-12 02:26:39,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7067 conditions, 2902 events. 2138/2902 cut-off events. For 941/941 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10531 event pairs, 1243 based on Foata normal form. 0/2449 useless extension candidates. Maximal degree in co-relation 2239. Up to 2222 conditions per place. [2023-11-12 02:26:39,270 INFO L140 encePairwiseOnDemand]: 328/332 looper letters, 49 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2023-11-12 02:26:39,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 52 transitions, 253 flow [2023-11-12 02:26:39,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:26:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:26:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 649 transitions. [2023-11-12 02:26:39,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48870481927710846 [2023-11-12 02:26:39,274 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 649 transitions. [2023-11-12 02:26:39,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 649 transitions. [2023-11-12 02:26:39,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:26:39,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 649 transitions. [2023-11-12 02:26:39,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.25) internal successors, (649), 4 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:39,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:39,284 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:39,284 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 4 states and 649 transitions. [2023-11-12 02:26:39,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 52 transitions, 253 flow [2023-11-12 02:26:39,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 243 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-12 02:26:39,290 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 100 flow [2023-11-12 02:26:39,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-11-12 02:26:39,292 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-11-12 02:26:39,296 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 100 flow [2023-11-12 02:26:39,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.25) internal successors, (629), 4 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:39,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:26:39,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:26:39,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:26:39,298 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:26:39,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:39,299 INFO L85 PathProgramCache]: Analyzing trace with hash -768487385, now seen corresponding path program 1 times [2023-11-12 02:26:39,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:39,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193097371] [2023-11-12 02:26:39,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:39,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:39,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 02:26:39,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:26:39,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193097371] [2023-11-12 02:26:39,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193097371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:26:39,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:26:39,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:26:39,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580139974] [2023-11-12 02:26:39,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:26:39,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:26:39,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:26:39,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:26:39,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:26:39,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 332 [2023-11-12 02:26:39,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:39,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:26:39,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 332 [2023-11-12 02:26:39,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:26:40,124 INFO L124 PetriNetUnfolderBase]: 2138/2903 cut-off events. [2023-11-12 02:26:40,124 INFO L125 PetriNetUnfolderBase]: For 1284/1284 co-relation queries the response was YES. [2023-11-12 02:26:40,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7648 conditions, 2903 events. 2138/2903 cut-off events. For 1284/1284 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10162 event pairs, 1685 based on Foata normal form. 0/2450 useless extension candidates. Maximal degree in co-relation 2581. Up to 2903 conditions per place. [2023-11-12 02:26:40,153 INFO L140 encePairwiseOnDemand]: 329/332 looper letters, 33 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-11-12 02:26:40,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 172 flow [2023-11-12 02:26:40,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:26:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:26:40,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2023-11-12 02:26:40,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789156626506024 [2023-11-12 02:26:40,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 477 transitions. [2023-11-12 02:26:40,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions. [2023-11-12 02:26:40,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:26:40,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions. [2023-11-12 02:26:40,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:40,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:40,165 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:40,166 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 100 flow. Second operand 3 states and 477 transitions. [2023-11-12 02:26:40,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 172 flow [2023-11-12 02:26:40,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 166 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-12 02:26:40,175 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 106 flow [2023-11-12 02:26:40,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-11-12 02:26:40,178 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-11-12 02:26:40,178 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 106 flow [2023-11-12 02:26:40,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:40,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:26:40,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:26:40,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:26:40,181 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:26:40,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:40,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1633297591, now seen corresponding path program 1 times [2023-11-12 02:26:40,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:40,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930207144] [2023-11-12 02:26:40,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:40,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 02:26:41,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:26:41,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930207144] [2023-11-12 02:26:41,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930207144] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:26:41,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518175468] [2023-11-12 02:26:41,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:41,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:26:41,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:26:41,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:26:41,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:26:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:41,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-12 02:26:41,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:26:41,800 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:26:41,867 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:26:41,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:26:41,969 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:26:42,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:26:42,116 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:26:42,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:26:42,281 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:26:42,333 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:26:42,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:26:42,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:26:43,025 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse0 1)) (< 2147483645 .cse0) (< c_~min~0 (+ 3 .cse0))))) (forall ((v_ArrVal_124 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse1) (< c_~min~0 (+ 2 .cse1)))))) is different from false [2023-11-12 02:26:43,883 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~min~0 1))) (and (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (let ((.cse0 (select (select .cse3 c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 .cse0) (forall ((v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< 2147483645 .cse1) (< .cse0 (+ 3 .cse1)) (< (select (select .cse2 c_~A~0.base) c_~A~0.offset) (+ .cse1 1)))))))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (or (< (select (select .cse4 c_~A~0.base) c_~A~0.offset) .cse5) (forall ((v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ 3 .cse6)) (< 2147483645 .cse6) (< (select (select .cse7 c_~A~0.base) c_~A~0.offset) (+ .cse6 1))))))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (let ((.cse8 (select (select .cse10 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse9 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< .cse8 (+ 2 .cse9)) (< 2147483646 .cse9)))) (< c_~min~0 .cse8))))) (forall ((v_ArrVal_122 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (or (< (select (select .cse11 c_~A~0.base) c_~A~0.offset) .cse5) (forall ((v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse12 (select (select (store (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ 2 .cse12)) (< 2147483646 .cse12))))))))) is different from false [2023-11-12 02:26:44,029 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1))) (and (forall ((v_ArrVal_122 (Array Int Int)) (v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (let ((.cse1 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< (select (select .cse0 c_~A~0.base) c_~A~0.offset) (+ 2 .cse1)) (< 2147483646 .cse1))))) (forall ((v_ArrVal_122 (Array Int Int)) (v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (let ((.cse4 (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< 2147483645 .cse2) (< (select (select .cse3 c_~A~0.base) c_~A~0.offset) (+ 3 .cse2)) (< (select (select .cse4 c_~A~0.base) c_~A~0.offset) (+ .cse2 1))))))) (forall ((v_ArrVal_122 (Array Int Int)) (v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123))) (let ((.cse5 (select (select .cse9 c_~A~0.base) c_~A~0.offset)) (.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< .cse5 (+ 4 .cse6)) (< 2147483645 .cse6) (< .cse5 .cse7) (< (select (select .cse8 c_~A~0.base) c_~A~0.offset) (+ .cse6 1))))))) (forall ((v_ArrVal_122 (Array Int Int)) (v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (let ((.cse10 (select (select .cse12 c_~A~0.base) c_~A~0.offset)) (.cse11 (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< .cse10 .cse7) (< 2147483646 .cse11) (< .cse10 (+ 3 .cse11)))))))) is different from false [2023-11-12 02:26:44,217 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_122 (Array Int Int)) (v_ArrVal_121 (Array Int Int)) (v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_121))) (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse0 (+ (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (< 2147483645 .cse2) (< (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse2 1)) (< .cse0 (+ .cse2 4)))))))) (forall ((v_ArrVal_122 (Array Int Int)) (v_ArrVal_121 (Array Int Int)) (v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_121) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (let ((.cse5 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483646 .cse5) (< (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ 2 .cse5)))))) (forall ((v_ArrVal_122 (Array Int Int)) (v_ArrVal_121 (Array Int Int)) (v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_121))) (let ((.cse10 (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483646 .cse7) (< .cse8 (+ (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (< .cse8 (+ 3 .cse7))))))) (forall ((v_ArrVal_122 (Array Int Int)) (v_ArrVal_121 (Array Int Int)) (v_ArrVal_124 (Array Int Int)) (v_ArrVal_123 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_121) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_122))) (let ((.cse13 (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_123))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483645 .cse11) (< (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ 3 .cse11)) (< (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse11 1)))))))) is different from false [2023-11-12 02:26:44,268 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:26:44,269 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 85 [2023-11-12 02:26:44,284 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2976 treesize of output 2808 [2023-11-12 02:26:44,367 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 494 treesize of output 474 [2023-11-12 02:26:44,398 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 231 [2023-11-12 02:26:44,439 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 435 treesize of output 419 [2023-11-12 02:26:44,464 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 419 treesize of output 387 [2023-11-12 02:26:44,762 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:26:44,763 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 63 [2023-11-12 02:26:44,784 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41707 treesize of output 39339 [2023-11-12 02:26:44,907 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 213 [2023-11-12 02:26:44,928 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 439 treesize of output 423 [2023-11-12 02:26:44,947 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 423 treesize of output 391 [2023-11-12 02:26:44,970 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 187 [2023-11-12 02:26:45,367 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-12 02:26:45,367 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 1 [2023-11-12 02:26:45,377 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-12 02:26:45,378 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 1 [2023-11-12 02:26:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-12 02:26:45,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518175468] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:26:45,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:26:45,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 34 [2023-11-12 02:26:45,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888923848] [2023-11-12 02:26:45,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:26:45,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-12 02:26:45,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:26:45,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-12 02:26:45,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=858, Unknown=20, NotChecked=252, Total=1260 [2023-11-12 02:26:45,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 332 [2023-11-12 02:26:45,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 106 flow. Second operand has 36 states, 36 states have (on average 104.58333333333333) internal successors, (3765), 36 states have internal predecessors, (3765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:26:45,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:26:45,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 332 [2023-11-12 02:26:45,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:27:00,350 INFO L124 PetriNetUnfolderBase]: 21114/29146 cut-off events. [2023-11-12 02:27:00,350 INFO L125 PetriNetUnfolderBase]: For 8047/8047 co-relation queries the response was YES. [2023-11-12 02:27:00,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75961 conditions, 29146 events. 21114/29146 cut-off events. For 8047/8047 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 164713 event pairs, 461 based on Foata normal form. 21/22416 useless extension candidates. Maximal degree in co-relation 75947. Up to 6781 conditions per place. [2023-11-12 02:27:00,504 INFO L140 encePairwiseOnDemand]: 320/332 looper letters, 511 selfloop transitions, 129 changer transitions 642/1282 dead transitions. [2023-11-12 02:27:00,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 1282 transitions, 6437 flow [2023-11-12 02:27:00,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-11-12 02:27:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2023-11-12 02:27:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 10189 transitions. [2023-11-12 02:27:00,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3487472617743702 [2023-11-12 02:27:00,632 INFO L72 ComplementDD]: Start complementDD. Operand 88 states and 10189 transitions. [2023-11-12 02:27:00,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 10189 transitions. [2023-11-12 02:27:00,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:27:00,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 88 states and 10189 transitions. [2023-11-12 02:27:00,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 89 states, 88 states have (on average 115.7840909090909) internal successors, (10189), 88 states have internal predecessors, (10189), 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:27:00,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 89 states, 89 states have (on average 332.0) internal successors, (29548), 89 states have internal predecessors, (29548), 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:27:00,736 INFO L81 ComplementDD]: Finished complementDD. Result has 89 states, 89 states have (on average 332.0) internal successors, (29548), 89 states have internal predecessors, (29548), 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:27:00,736 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 106 flow. Second operand 88 states and 10189 transitions. [2023-11-12 02:27:00,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 1282 transitions, 6437 flow [2023-11-12 02:27:00,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 1282 transitions, 6433 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-12 02:27:00,911 INFO L231 Difference]: Finished difference. Result has 200 places, 182 transitions, 1338 flow [2023-11-12 02:27:00,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=88, PETRI_FLOW=1338, PETRI_PLACES=200, PETRI_TRANSITIONS=182} [2023-11-12 02:27:00,912 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 160 predicate places. [2023-11-12 02:27:00,912 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 182 transitions, 1338 flow [2023-11-12 02:27:00,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 104.58333333333333) internal successors, (3765), 36 states have internal predecessors, (3765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:00,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:27:00,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:27:00,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:27:01,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d62149-1dcf-4f72-9fee-38cd0328b9d1/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:27:01,123 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-12 02:27:01,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:27:01,124 INFO L85 PathProgramCache]: Analyzing trace with hash -971463889, now seen corresponding path program 2 times [2023-11-12 02:27:01,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:27:01,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391984954] [2023-11-12 02:27:01,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:27:01,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:27:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:27:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:27:01,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:27:01,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391984954] [2023-11-12 02:27:01,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391984954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:27:01,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:27:01,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:27:01,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944258884] [2023-11-12 02:27:01,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:27:01,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:27:01,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:27:01,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:27:01,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:27:01,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 332 [2023-11-12 02:27:01,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 182 transitions, 1338 flow. Second operand has 4 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:01,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:27:01,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 332 [2023-11-12 02:27:01,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:27:07,612 INFO L124 PetriNetUnfolderBase]: 16940/23696 cut-off events. [2023-11-12 02:27:07,612 INFO L125 PetriNetUnfolderBase]: For 773396/773396 co-relation queries the response was YES. [2023-11-12 02:27:07,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150791 conditions, 23696 events. 16940/23696 cut-off events. For 773396/773396 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 134629 event pairs, 2581 based on Foata normal form. 21/23717 useless extension candidates. Maximal degree in co-relation 150697. Up to 13795 conditions per place. [2023-11-12 02:27:07,941 INFO L140 encePairwiseOnDemand]: 328/332 looper letters, 142 selfloop transitions, 8 changer transitions 362/512 dead transitions. [2023-11-12 02:27:07,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 512 transitions, 4666 flow [2023-11-12 02:27:07,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:27:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:27:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 836 transitions. [2023-11-12 02:27:07,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036144578313253 [2023-11-12 02:27:07,945 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 836 transitions. [2023-11-12 02:27:07,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 836 transitions. [2023-11-12 02:27:07,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:27:07,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 836 transitions. [2023-11-12 02:27:07,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.2) internal successors, (836), 5 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:07,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:07,954 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:27:07,955 INFO L175 Difference]: Start difference. First operand has 200 places, 182 transitions, 1338 flow. Second operand 5 states and 836 transitions. [2023-11-12 02:27:07,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 512 transitions, 4666 flow