./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu --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 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:42:55,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:42:55,818 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:42:55,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:42:55,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:42:55,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:42:55,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:42:55,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:42:55,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:42:55,885 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:42:55,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:42:55,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:42:55,889 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:42:55,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:42:55,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:42:55,892 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:42:55,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:42:55,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:42:55,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:42:55,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:42:55,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:42:55,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:42:55,898 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:42:55,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:42:55,899 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:42:55,900 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:42:55,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:42:55,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:42:55,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:42:55,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:42:55,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:42:55,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:42:55,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:42:55,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:42:55,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:42:55,905 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:42:55,906 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:42:55,906 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:42:55,906 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:42:55,906 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_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/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_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu 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 -> 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b [2023-11-19 07:42:56,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:42:56,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:42:56,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:42:56,279 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:42:56,280 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:42:56,281 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2023-11-19 07:42:59,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:42:59,898 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:42:59,899 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2023-11-19 07:42:59,909 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/data/526186f9f/bcb92a905b384420982aa4d4dba28df6/FLAG7d82a6e1c [2023-11-19 07:42:59,922 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/data/526186f9f/bcb92a905b384420982aa4d4dba28df6 [2023-11-19 07:42:59,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:42:59,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:42:59,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:42:59,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:42:59,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:42:59,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:42:59" (1/1) ... [2023-11-19 07:42:59,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1357055a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:59, skipping insertion in model container [2023-11-19 07:42:59,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:42:59" (1/1) ... [2023-11-19 07:42:59,966 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:43:00,161 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_464be99a-a8e7-4fbc-9f51-569172e4a77a/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2023-11-19 07:43:00,171 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:43:00,183 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:43:00,209 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_464be99a-a8e7-4fbc-9f51-569172e4a77a/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2023-11-19 07:43:00,213 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:43:00,222 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:43:00,223 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:43:00,231 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:43:00,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00 WrapperNode [2023-11-19 07:43:00,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:43:00,233 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:43:00,233 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:43:00,234 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:43:00,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,300 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 199 [2023-11-19 07:43:00,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:43:00,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:43:00,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:43:00,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:43:00,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,325 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:43:00,343 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:43:00,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:43:00,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:43:00,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (1/1) ... [2023-11-19 07:43:00,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:43:00,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:43:00,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:43:00,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:43:00,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:43:00,415 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-19 07:43:00,415 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-19 07:43:00,415 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-19 07:43:00,416 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-19 07:43:00,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:43:00,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:43:00,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:43:00,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:43:00,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:43:00,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 07:43:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:43:00,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:43:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:43:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:43:00,422 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:43:00,535 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:43:00,537 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:43:01,018 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:43:01,167 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:43:01,167 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-19 07:43:01,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:43:01 BoogieIcfgContainer [2023-11-19 07:43:01,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:43:01,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:43:01,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:43:01,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:43:01,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:42:59" (1/3) ... [2023-11-19 07:43:01,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254789bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:43:01, skipping insertion in model container [2023-11-19 07:43:01,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:43:00" (2/3) ... [2023-11-19 07:43:01,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254789bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:43:01, skipping insertion in model container [2023-11-19 07:43:01,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:43:01" (3/3) ... [2023-11-19 07:43:01,193 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2023-11-19 07:43:01,206 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:43:01,219 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:43:01,220 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:43:01,220 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:43:01,335 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-19 07:43:01,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 194 transitions, 402 flow [2023-11-19 07:43:01,549 INFO L124 PetriNetUnfolderBase]: 15/192 cut-off events. [2023-11-19 07:43:01,550 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 07:43:01,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 192 events. 15/192 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 112 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 156. Up to 2 conditions per place. [2023-11-19 07:43:01,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 194 transitions, 402 flow [2023-11-19 07:43:01,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 183 transitions, 378 flow [2023-11-19 07:43:01,567 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:43:01,579 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 183 transitions, 378 flow [2023-11-19 07:43:01,582 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 183 transitions, 378 flow [2023-11-19 07:43:01,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 183 transitions, 378 flow [2023-11-19 07:43:01,640 INFO L124 PetriNetUnfolderBase]: 15/183 cut-off events. [2023-11-19 07:43:01,641 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 07:43:01,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 183 events. 15/183 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 156. Up to 2 conditions per place. [2023-11-19 07:43:01,645 INFO L119 LiptonReduction]: Number of co-enabled transitions 772 [2023-11-19 07:43:09,162 INFO L134 LiptonReduction]: Checked pairs total: 1282 [2023-11-19 07:43:09,162 INFO L136 LiptonReduction]: Total number of compositions: 195 [2023-11-19 07:43:09,178 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:43:09,185 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;@6ce3011d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:43:09,186 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-19 07:43:09,193 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:43:09,193 INFO L124 PetriNetUnfolderBase]: 5/23 cut-off events. [2023-11-19 07:43:09,193 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 07:43:09,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:09,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:09,195 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-19 07:43:09,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:09,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1126679500, now seen corresponding path program 1 times [2023-11-19 07:43:09,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:09,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332029730] [2023-11-19 07:43:09,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:09,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:09,678 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-19 07:43:09,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:09,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332029730] [2023-11-19 07:43:09,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332029730] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:09,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:09,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:43:09,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113898568] [2023-11-19 07:43:09,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:09,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:43:09,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:09,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:43:09,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:43:09,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 389 [2023-11-19 07:43:09,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 174.5) internal successors, (698), 4 states have internal predecessors, (698), 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-19 07:43:09,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:09,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 389 [2023-11-19 07:43:09,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:09,939 INFO L124 PetriNetUnfolderBase]: 157/261 cut-off events. [2023-11-19 07:43:09,940 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-19 07:43:09,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 261 events. 157/261 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 812 event pairs, 39 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 491. Up to 169 conditions per place. [2023-11-19 07:43:09,944 INFO L140 encePairwiseOnDemand]: 384/389 looper letters, 31 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2023-11-19 07:43:09,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 36 transitions, 157 flow [2023-11-19 07:43:09,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:43:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:43:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 720 transitions. [2023-11-19 07:43:09,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46272493573264784 [2023-11-19 07:43:09,967 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 720 transitions. [2023-11-19 07:43:09,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 720 transitions. [2023-11-19 07:43:09,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:09,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 720 transitions. [2023-11-19 07:43:09,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 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-19 07:43:09,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 389.0) internal successors, (1945), 5 states have internal predecessors, (1945), 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-19 07:43:09,994 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 389.0) internal successors, (1945), 5 states have internal predecessors, (1945), 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-19 07:43:09,996 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 60 flow. Second operand 4 states and 720 transitions. [2023-11-19 07:43:09,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 36 transitions, 157 flow [2023-11-19 07:43:10,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 36 transitions, 147 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:43:10,004 INFO L231 Difference]: Finished difference. Result has 26 places, 26 transitions, 73 flow [2023-11-19 07:43:10,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=73, PETRI_PLACES=26, PETRI_TRANSITIONS=26} [2023-11-19 07:43:10,012 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 0 predicate places. [2023-11-19 07:43:10,013 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 26 transitions, 73 flow [2023-11-19 07:43:10,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 174.5) internal successors, (698), 4 states have internal predecessors, (698), 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-19 07:43:10,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:10,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:10,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:43:10,016 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-19 07:43:10,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:10,018 INFO L85 PathProgramCache]: Analyzing trace with hash 729908109, now seen corresponding path program 1 times [2023-11-19 07:43:10,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:10,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22139458] [2023-11-19 07:43:10,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:10,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,260 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-19 07:43:10,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:10,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22139458] [2023-11-19 07:43:10,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22139458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:10,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:10,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:43:10,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688862780] [2023-11-19 07:43:10,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:10,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:43:10,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:10,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:43:10,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:43:10,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 389 [2023-11-19 07:43:10,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 26 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 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-19 07:43:10,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:10,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 389 [2023-11-19 07:43:10,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:10,450 INFO L124 PetriNetUnfolderBase]: 157/262 cut-off events. [2023-11-19 07:43:10,451 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-11-19 07:43:10,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 262 events. 157/262 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 794 event pairs, 105 based on Foata normal form. 1/242 useless extension candidates. Maximal degree in co-relation 276. Up to 261 conditions per place. [2023-11-19 07:43:10,454 INFO L140 encePairwiseOnDemand]: 386/389 looper letters, 24 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2023-11-19 07:43:10,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 27 transitions, 127 flow [2023-11-19 07:43:10,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:43:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:43:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2023-11-19 07:43:10,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44301628106255353 [2023-11-19 07:43:10,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 517 transitions. [2023-11-19 07:43:10,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 517 transitions. [2023-11-19 07:43:10,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:10,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 517 transitions. [2023-11-19 07:43:10,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 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-19 07:43:10,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 389.0) internal successors, (1556), 4 states have internal predecessors, (1556), 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-19 07:43:10,467 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 389.0) internal successors, (1556), 4 states have internal predecessors, (1556), 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-19 07:43:10,467 INFO L175 Difference]: Start difference. First operand has 26 places, 26 transitions, 73 flow. Second operand 3 states and 517 transitions. [2023-11-19 07:43:10,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 27 transitions, 127 flow [2023-11-19 07:43:10,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 27 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:43:10,469 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 80 flow [2023-11-19 07:43:10,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2023-11-19 07:43:10,471 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2023-11-19 07:43:10,471 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 80 flow [2023-11-19 07:43:10,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 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-19 07:43:10,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:10,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:10,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:43:10,473 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-19 07:43:10,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:10,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1310587903, now seen corresponding path program 1 times [2023-11-19 07:43:10,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:10,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108251802] [2023-11-19 07:43:10,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:10,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:43:10,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:10,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108251802] [2023-11-19 07:43:10,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108251802] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:10,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:10,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:43:10,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955165077] [2023-11-19 07:43:10,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:10,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:43:10,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:10,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:43:10,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:43:10,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 389 [2023-11-19 07:43:10,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 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-19 07:43:10,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:10,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 389 [2023-11-19 07:43:10,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:10,705 INFO L124 PetriNetUnfolderBase]: 256/422 cut-off events. [2023-11-19 07:43:10,705 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-11-19 07:43:10,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 422 events. 256/422 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1458 event pairs, 105 based on Foata normal form. 1/383 useless extension candidates. Maximal degree in co-relation 928. Up to 240 conditions per place. [2023-11-19 07:43:10,710 INFO L140 encePairwiseOnDemand]: 386/389 looper letters, 37 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-19 07:43:10,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 42 transitions, 204 flow [2023-11-19 07:43:10,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:43:10,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:43:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2023-11-19 07:43:10,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47643530419880037 [2023-11-19 07:43:10,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 556 transitions. [2023-11-19 07:43:10,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions. [2023-11-19 07:43:10,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:10,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions. [2023-11-19 07:43:10,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 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-19 07:43:10,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 389.0) internal successors, (1556), 4 states have internal predecessors, (1556), 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-19 07:43:10,722 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 389.0) internal successors, (1556), 4 states have internal predecessors, (1556), 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-19 07:43:10,723 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 80 flow. Second operand 3 states and 556 transitions. [2023-11-19 07:43:10,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 42 transitions, 204 flow [2023-11-19 07:43:10,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 42 transitions, 200 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-19 07:43:10,727 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 88 flow [2023-11-19 07:43:10,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2023-11-19 07:43:10,729 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2023-11-19 07:43:10,733 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 88 flow [2023-11-19 07:43:10,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 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-19 07:43:10,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:10,735 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] [2023-11-19 07:43:10,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:43:10,735 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-19 07:43:10,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:10,736 INFO L85 PathProgramCache]: Analyzing trace with hash -515102088, now seen corresponding path program 1 times [2023-11-19 07:43:10,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:10,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541137940] [2023-11-19 07:43:10,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:10,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:43:10,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:10,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541137940] [2023-11-19 07:43:10,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541137940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:10,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:10,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:43:10,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143443282] [2023-11-19 07:43:10,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:10,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:43:10,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:10,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:43:10,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:43:10,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 389 [2023-11-19 07:43:10,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 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-19 07:43:10,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:10,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 389 [2023-11-19 07:43:10,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:11,003 INFO L124 PetriNetUnfolderBase]: 259/440 cut-off events. [2023-11-19 07:43:11,003 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2023-11-19 07:43:11,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 440 events. 259/440 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1527 event pairs, 90 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 1017. Up to 337 conditions per place. [2023-11-19 07:43:11,008 INFO L140 encePairwiseOnDemand]: 386/389 looper letters, 32 selfloop transitions, 2 changer transitions 5/40 dead transitions. [2023-11-19 07:43:11,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 40 transitions, 197 flow [2023-11-19 07:43:11,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:43:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:43:11,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2023-11-19 07:43:11,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4730077120822622 [2023-11-19 07:43:11,012 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 552 transitions. [2023-11-19 07:43:11,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 552 transitions. [2023-11-19 07:43:11,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:11,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 552 transitions. [2023-11-19 07:43:11,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 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-19 07:43:11,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 389.0) internal successors, (1556), 4 states have internal predecessors, (1556), 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-19 07:43:11,019 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 389.0) internal successors, (1556), 4 states have internal predecessors, (1556), 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-19 07:43:11,020 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 88 flow. Second operand 3 states and 552 transitions. [2023-11-19 07:43:11,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 40 transitions, 197 flow [2023-11-19 07:43:11,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 40 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:43:11,023 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 98 flow [2023-11-19 07:43:11,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2023-11-19 07:43:11,025 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2023-11-19 07:43:11,025 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 98 flow [2023-11-19 07:43:11,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 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-19 07:43:11,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:11,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:11,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:43:11,026 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-19 07:43:11,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:11,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1388560608, now seen corresponding path program 1 times [2023-11-19 07:43:11,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:11,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126280200] [2023-11-19 07:43:11,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:11,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:43:11,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:11,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126280200] [2023-11-19 07:43:11,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126280200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:11,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:11,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:43:11,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156113857] [2023-11-19 07:43:11,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:11,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:43:11,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:11,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:43:11,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:43:11,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 389 [2023-11-19 07:43:11,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 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-19 07:43:11,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:11,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 389 [2023-11-19 07:43:11,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:11,462 INFO L124 PetriNetUnfolderBase]: 310/543 cut-off events. [2023-11-19 07:43:11,462 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2023-11-19 07:43:11,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 543 events. 310/543 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2056 event pairs, 227 based on Foata normal form. 16/559 useless extension candidates. Maximal degree in co-relation 1081. Up to 440 conditions per place. [2023-11-19 07:43:11,467 INFO L140 encePairwiseOnDemand]: 384/389 looper letters, 27 selfloop transitions, 2 changer transitions 17/47 dead transitions. [2023-11-19 07:43:11,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 47 transitions, 244 flow [2023-11-19 07:43:11,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:43:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:43:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 851 transitions. [2023-11-19 07:43:11,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43753213367609256 [2023-11-19 07:43:11,471 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 851 transitions. [2023-11-19 07:43:11,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 851 transitions. [2023-11-19 07:43:11,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:11,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 851 transitions. [2023-11-19 07:43:11,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 170.2) internal successors, (851), 5 states have internal predecessors, (851), 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-19 07:43:11,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 389.0) internal successors, (2334), 6 states have internal predecessors, (2334), 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-19 07:43:11,481 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 389.0) internal successors, (2334), 6 states have internal predecessors, (2334), 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-19 07:43:11,482 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 98 flow. Second operand 5 states and 851 transitions. [2023-11-19 07:43:11,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 47 transitions, 244 flow [2023-11-19 07:43:11,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:43:11,484 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 112 flow [2023-11-19 07:43:11,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-11-19 07:43:11,485 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2023-11-19 07:43:11,486 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 112 flow [2023-11-19 07:43:11,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 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-19 07:43:11,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:11,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:11,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:43:11,487 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-19 07:43:11,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:11,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1583704034, now seen corresponding path program 1 times [2023-11-19 07:43:11,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:11,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457338404] [2023-11-19 07:43:11,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:11,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:13,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:43:13,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:13,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457338404] [2023-11-19 07:43:13,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457338404] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:43:13,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874728664] [2023-11-19 07:43:13,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:13,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:43:13,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:43:13,136 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:43:13,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:43:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:13,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-19 07:43:13,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:43:13,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:43:13,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-11-19 07:43:13,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:43:13,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:43:13,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-19 07:43:13,504 INFO L378 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 23 treesize of output 1 [2023-11-19 07:43:13,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:43:13,597 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-19 07:43:13,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-19 07:43:13,663 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 07:43:13,699 INFO L378 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-19 07:43:13,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:43:14,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2023-11-19 07:43:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:43:14,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:43:15,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:43:15,689 INFO L378 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 62 treesize of output 51 [2023-11-19 07:43:15,700 INFO L378 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 3350 treesize of output 3222 [2023-11-19 07:43:15,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:43:15,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 798 treesize of output 623 [2023-11-19 07:43:15,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:43:15,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 606 treesize of output 551 [2023-11-19 07:43:15,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:43:15,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 534 treesize of output 455 [2023-11-19 07:43:16,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:43:16,559 INFO L378 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 123 treesize of output 87 [2023-11-19 07:43:16,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:43:16,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2096 treesize of output 2024 [2023-11-19 07:43:16,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:43:16,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1176 treesize of output 976 [2023-11-19 07:43:16,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:43:16,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 936 treesize of output 808 [2023-11-19 07:43:16,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:43:16,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 768 treesize of output 676 [2023-11-19 07:43:21,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:43:21,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874728664] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:43:21,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:43:21,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 29 [2023-11-19 07:43:21,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822381765] [2023-11-19 07:43:21,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:43:21,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-19 07:43:21,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:21,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-19 07:43:21,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=780, Unknown=6, NotChecked=0, Total=930 [2023-11-19 07:43:23,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 389 [2023-11-19 07:43:23,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 112 flow. Second operand has 31 states, 31 states have (on average 90.09677419354838) internal successors, (2793), 31 states have internal predecessors, (2793), 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-19 07:43:23,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:23,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 389 [2023-11-19 07:43:23,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:25,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 07:43:33,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 07:43:33,413 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (+ c_~end~0 1)) (.cse17 (* c_~i~0 4)) (.cse23 (= c_~start~0 0))) (let ((.cse11 (+ c_~v_old~0 1)) (.cse16 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (not (= c_~end~0 0))) (.cse0 (or (< (+ c_~start~0 c_~n~0) 2) (< c_~start~0 1))) (.cse1 (not .cse23)) (.cse5 (select |c_#memory_int| c_~A~0.base)) (.cse20 (+ c_~A~0.offset .cse17)) (.cse14 (not (= (mod c_~ok~0 256) 0))) (.cse10 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse9 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse3 (< c_~end~0 0)) (.cse4 (< c_~n~0 .cse18))) (and (or (and .cse0 (or .cse1 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) .cse2) (or .cse3 .cse4 (and (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse6 (+ (* ~i~0 4) ~A~0.offset))) (or (< c_~last~0 (select .cse5 .cse6)) (forall ((v_ArrVal_106 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse8 (select .cse7 c_~queue~0.base))) (or (not (= (select (select .cse7 c_~A~0.base) .cse6) (select .cse8 .cse9))) (< (select .cse8 .cse10) .cse11)))))))) (or (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (~i~0 Int)) (let ((.cse13 (+ (* ~i~0 4) ~A~0.offset))) (or (not (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse12 c_~A~0.base) .cse13) (select (select .cse12 c_~queue~0.base) .cse9)))) (< c_~last~0 (select .cse5 .cse13))))) .cse14))) (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse15 (select (select |c_#memory_int| ~A~0.base) (+ ~A~0.offset .cse17)))) (and (<= .cse15 c_~v_old~0) (= (select .cse16 c_~queue~0.offset) .cse15) (not (= c_~queue~0.base ~A~0.base))))) (or (< 0 .cse18) (< c_~start~0 .cse18)) (or .cse3 .cse4 (< c_~last~0 |c_thread1Thread1of1ForFork1_#t~mem1#1|) (and (or (forall ((v_ArrVal_106 (Array Int Int))) (not (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse19 c_~A~0.base) .cse20) (select (select .cse19 c_~queue~0.base) .cse9))))) .cse14) (forall ((v_ArrVal_106 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse21 (select .cse22 c_~queue~0.base))) (or (< (select .cse21 .cse10) .cse11) (not (= (select (select .cse22 c_~A~0.base) .cse20) (select .cse21 .cse9))))))))) .cse23 (or (and (<= (select .cse16 0) c_~v_old~0) .cse23) (< c_~start~0 0)) (or .cse2 (and .cse0 (or .cse1 (and (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (= |c_thread1Thread1of1ForFork1_#t~mem1#1| (select .cse5 .cse20)))))) (or (< c_~end~0 1) (< c_~n~0 2)) (= c_~ok~0 1) (or .cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4 (let ((.cse24 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_127| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_127|) 0))))) (and (or .cse24 (= c_~start~0 c_~end~0)) (or .cse14 .cse24) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))) (= c_~queue~0.offset 0) (<= (+ c_~i~0 1) c_~N~0) (= c_~v_old~0 c_~last~0) (or (and (or .cse14 (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int)) (not (let ((.cse25 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse25 c_~queue~0.base) .cse9) (select (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset))))))) (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int)) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (let ((.cse29 (store .cse27 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse26 (select .cse29 c_~queue~0.base)) (.cse28 (+ (* ~i~0 4) ~A~0.offset))) (or (< (select .cse26 .cse10) (+ (select (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse28) 1)) (not (= (select .cse26 .cse9) (select (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse28))))))))) .cse3 .cse4) (or (and (or .cse14 (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (not (let ((.cse30 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse30 c_~queue~0.base) .cse9)))))) (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (let ((.cse34 (store .cse32 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse33 (+ (* ~i~0 4) ~A~0.offset)) (.cse31 (select .cse34 c_~queue~0.base))) (or (< (select .cse31 .cse10) (+ (select (select .cse32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse33) 1)) (not (= (select (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse33) (select .cse31 .cse9))))))))) .cse3 .cse4)))) is different from false [2023-11-19 07:43:34,884 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (+ c_~end~0 1)) (.cse5 (select |c_#memory_int| c_~A~0.base)) (.cse18 (+ c_~A~0.offset (* c_~i~0 4)))) (let ((.cse11 (+ c_~v_old~0 1)) (.cse2 (not (= c_~end~0 0))) (.cse0 (or (< (+ c_~start~0 c_~n~0) 2) (< c_~start~0 1))) (.cse1 (not (= c_~start~0 0))) (.cse21 (select .cse5 .cse18)) (.cse16 (< c_~last~0 |c_thread1Thread1of1ForFork1_#t~mem1#1|)) (.cse14 (not (= (mod c_~ok~0 256) 0))) (.cse10 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse9 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse3 (< c_~end~0 0)) (.cse4 (< c_~n~0 .cse15))) (and (or (and .cse0 (or .cse1 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) .cse2) (or .cse3 .cse4 (and (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse6 (+ (* ~i~0 4) ~A~0.offset))) (or (< c_~last~0 (select .cse5 .cse6)) (forall ((v_ArrVal_106 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse8 (select .cse7 c_~queue~0.base))) (or (not (= (select (select .cse7 c_~A~0.base) .cse6) (select .cse8 .cse9))) (< (select .cse8 .cse10) .cse11)))))))) (or (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (~i~0 Int)) (let ((.cse13 (+ (* ~i~0 4) ~A~0.offset))) (or (not (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse12 c_~A~0.base) .cse13) (select (select .cse12 c_~queue~0.base) .cse9)))) (< c_~last~0 (select .cse5 .cse13))))) .cse14))) (or (< 0 .cse15) (< c_~start~0 .cse15)) (or .cse3 .cse4 .cse16 (and (or (forall ((v_ArrVal_106 (Array Int Int))) (not (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse17 c_~A~0.base) .cse18) (select (select .cse17 c_~queue~0.base) .cse9))))) .cse14) (forall ((v_ArrVal_106 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse19 (select .cse20 c_~queue~0.base))) (or (< (select .cse19 .cse10) .cse11) (not (= (select (select .cse20 c_~A~0.base) .cse18) (select .cse19 .cse9))))))))) (or .cse2 (and .cse0 (or .cse1 (and (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (= |c_thread1Thread1of1ForFork1_#t~mem1#1| .cse21))))) (let ((.cse22 (select |c_#memory_int| c_~queue~0.base))) (or (and .cse14 (<= (select .cse22 .cse10) c_~v_old~0)) (not (= (select .cse22 .cse9) .cse21)) .cse3 .cse4 .cse16)) (or (< c_~end~0 1) (< c_~n~0 2)) (= c_~ok~0 1) (or .cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4 (let ((.cse23 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_127| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_127|) 0))))) (and (or .cse23 (= c_~start~0 c_~end~0)) (or .cse14 .cse23) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))) (= c_~queue~0.offset 0) (= c_~v_old~0 c_~last~0) (or (and (or .cse14 (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int)) (not (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse24 c_~queue~0.base) .cse9) (select (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset))))))) (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (let ((.cse28 (store .cse26 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse25 (select .cse28 c_~queue~0.base)) (.cse27 (+ (* ~i~0 4) ~A~0.offset))) (or (< (select .cse25 .cse10) (+ (select (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse27) 1)) (not (= (select .cse25 .cse9) (select (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse27))))))))) .cse3 .cse4) (or (and (or .cse14 (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (not (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (= (select (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse29 c_~queue~0.base) .cse9)))))) (forall ((v_ArrVal_106 (Array Int Int)) (~A~0.offset Int) (v_ArrVal_105 (Array Int Int)) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (let ((.cse33 (store .cse31 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106))) (let ((.cse32 (+ (* ~i~0 4) ~A~0.offset)) (.cse30 (select .cse33 c_~queue~0.base))) (or (< (select .cse30 .cse10) (+ (select (select .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse32) 1)) (not (= (select (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse32) (select .cse30 .cse9))))))))) .cse3 .cse4)))) is different from false [2023-11-19 07:43:37,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 07:43:38,324 INFO L124 PetriNetUnfolderBase]: 799/1351 cut-off events. [2023-11-19 07:43:38,325 INFO L125 PetriNetUnfolderBase]: For 359/359 co-relation queries the response was YES. [2023-11-19 07:43:38,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3392 conditions, 1351 events. 799/1351 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6453 event pairs, 96 based on Foata normal form. 17/1368 useless extension candidates. Maximal degree in co-relation 3373. Up to 319 conditions per place. [2023-11-19 07:43:38,335 INFO L140 encePairwiseOnDemand]: 372/389 looper letters, 118 selfloop transitions, 53 changer transitions 57/229 dead transitions. [2023-11-19 07:43:38,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 229 transitions, 1206 flow [2023-11-19 07:43:38,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-19 07:43:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-11-19 07:43:38,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 3112 transitions. [2023-11-19 07:43:38,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24242424242424243 [2023-11-19 07:43:38,352 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 3112 transitions. [2023-11-19 07:43:38,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 3112 transitions. [2023-11-19 07:43:38,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:38,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 3112 transitions. [2023-11-19 07:43:38,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 94.3030303030303) internal successors, (3112), 33 states have internal predecessors, (3112), 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-19 07:43:38,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 389.0) internal successors, (13226), 34 states have internal predecessors, (13226), 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-19 07:43:38,394 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 389.0) internal successors, (13226), 34 states have internal predecessors, (13226), 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-19 07:43:38,394 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 112 flow. Second operand 33 states and 3112 transitions. [2023-11-19 07:43:38,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 229 transitions, 1206 flow [2023-11-19 07:43:38,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 229 transitions, 1180 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-11-19 07:43:38,402 INFO L231 Difference]: Finished difference. Result has 81 places, 83 transitions, 527 flow [2023-11-19 07:43:38,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=527, PETRI_PLACES=81, PETRI_TRANSITIONS=83} [2023-11-19 07:43:38,403 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 55 predicate places. [2023-11-19 07:43:38,403 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 527 flow [2023-11-19 07:43:38,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 90.09677419354838) internal successors, (2793), 31 states have internal predecessors, (2793), 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-19 07:43:38,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:38,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:38,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:43:38,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-19 07:43:38,626 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-19 07:43:38,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:38,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1489711258, now seen corresponding path program 2 times [2023-11-19 07:43:38,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:38,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878968731] [2023-11-19 07:43:38,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:38,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:40,387 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-19 07:43:40,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:40,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878968731] [2023-11-19 07:43:40,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878968731] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:43:40,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526508883] [2023-11-19 07:43:40,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:43:40,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:43:40,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:43:40,389 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:43:40,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_464be99a-a8e7-4fbc-9f51-569172e4a77a/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:43:40,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:43:40,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:43:40,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-19 07:43:40,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:43:40,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:43:40,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-19 07:43:40,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:43:40,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:43:40,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-19 07:43:40,627 INFO L378 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 23 treesize of output 1 [2023-11-19 07:43:40,706 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 07:43:40,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-19 07:43:40,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-19 07:43:40,834 INFO L378 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-19 07:43:40,910 INFO L378 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-19 07:43:41,316 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-19 07:43:41,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2023-11-19 07:43:41,368 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-19 07:43:41,369 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:43:42,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:43:42,740 INFO L378 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 126 treesize of output 90 [2023-11-19 07:43:42,859 INFO L349 Elim1Store]: treesize reduction 9, result has 80.9 percent of original size [2023-11-19 07:43:42,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55276 treesize of output 51217 [2023-11-19 07:43:43,338 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:43:43,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:43:43,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 3052 treesize of output 2892 [2023-11-19 07:43:43,446 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:43:43,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:43:43,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 2860 treesize of output 2508 [2023-11-19 07:43:43,592 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:43:43,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:43:43,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 2476 treesize of output 1740