./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --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 841ea5a5ca051cc33dfe29d877ccdea4b63526a0ee61a2de18869a9ba1858c4b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 16:41:52,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:41:52,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:41:52,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:41:52,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:41:52,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:41:52,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:41:52,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:41:52,873 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:41:52,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:41:52,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:41:52,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:41:52,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:41:52,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:41:52,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:41:52,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:41:52,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:41:52,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:41:52,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:41:52,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:41:52,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:41:52,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:41:52,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:41:52,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:41:52,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:41:52,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:41:52,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:41:52,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:41:52,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:41:52,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:41:52,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:41:52,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:41:52,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:41:52,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:41:52,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:41:52,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:41:52,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:41:52,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:41:52,929 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:41:52,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:41:52,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:41:52,932 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 16:41:52,975 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:41:52,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:41:52,975 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:41:52,976 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:41:52,976 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:41:52,976 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:41:52,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:41:52,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:41:52,977 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:41:52,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:41:52,978 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:41:52,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:41:52,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:41:52,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:41:52,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:41:52,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:41:52,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:41:52,979 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:41:52,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:41:52,979 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:41:52,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:41:52,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:41:52,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:41:52,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:41:52,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:41:52,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:41:52,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:41:52,981 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:41:52,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:41:52,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:41:52,981 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:41:52,982 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:41:52,982 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:41:52,982 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:41:52,982 INFO L138 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_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/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_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 841ea5a5ca051cc33dfe29d877ccdea4b63526a0ee61a2de18869a9ba1858c4b [2022-11-25 16:41:53,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:41:53,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:41:53,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:41:53,282 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:41:53,283 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:41:53,284 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c [2022-11-25 16:41:56,336 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:41:56,602 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:41:56,603 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c [2022-11-25 16:41:56,612 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/data/5cbfcf703/5511cb53f8394715a43aba238da1d8c6/FLAG1454dbfcb [2022-11-25 16:41:56,639 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/data/5cbfcf703/5511cb53f8394715a43aba238da1d8c6 [2022-11-25 16:41:56,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:41:56,647 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:41:56,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:41:56,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:41:56,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:41:56,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:41:56" (1/1) ... [2022-11-25 16:41:56,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5919e2ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:56, skipping insertion in model container [2022-11-25 16:41:56,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:41:56" (1/1) ... [2022-11-25 16:41:56,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:41:56,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:41:56,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,932 WARN L237 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_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c[4007,4020] [2022-11-25 16:41:56,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:41:56,951 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:41:56,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:41:56,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:41:56,992 WARN L237 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_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c[4007,4020] [2022-11-25 16:41:56,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:41:57,016 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:41:57,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:57 WrapperNode [2022-11-25 16:41:57,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:41:57,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:41:57,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:41:57,018 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:41:57,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:57" (1/1) ... [2022-11-25 16:41:57,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:57" (1/1) ... [2022-11-25 16:41:57,065 INFO L138 Inliner]: procedures = 26, calls = 73, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 267 [2022-11-25 16:41:57,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:41:57,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:41:57,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:41:57,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:41:57,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:57" (1/1) ... [2022-11-25 16:41:57,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:57" (1/1) ... [2022-11-25 16:41:57,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:57" (1/1) ... [2022-11-25 16:41:57,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:57" (1/1) ... [2022-11-25 16:41:57,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:57" (1/1) ... [2022-11-25 16:41:57,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:57" (1/1) ... [2022-11-25 16:41:57,096 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:57" (1/1) ... [2022-11-25 16:41:57,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:57" (1/1) ... [2022-11-25 16:41:57,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:41:57,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:41:57,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:41:57,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:41:57,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:57" (1/1) ... [2022-11-25 16:41:57,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:41:57,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:41:57,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:41:57,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:41:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:41:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:41:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:41:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 16:41:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-25 16:41:57,170 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-25 16:41:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-25 16:41:57,170 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-25 16:41:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-25 16:41:57,170 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-25 16:41:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-25 16:41:57,170 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-25 16:41:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:41:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 16:41:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 16:41:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 16:41:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:41:57,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:41:57,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:41:57,173 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 16:41:57,288 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:41:57,290 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:41:57,966 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:41:58,096 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:41:58,097 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-25 16:41:58,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:41:58 BoogieIcfgContainer [2022-11-25 16:41:58,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:41:58,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:41:58,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:41:58,106 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:41:58,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:41:56" (1/3) ... [2022-11-25 16:41:58,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e6f19d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:41:58, skipping insertion in model container [2022-11-25 16:41:58,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:57" (2/3) ... [2022-11-25 16:41:58,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e6f19d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:41:58, skipping insertion in model container [2022-11-25 16:41:58,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:41:58" (3/3) ... [2022-11-25 16:41:58,109 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons3.wvr.c [2022-11-25 16:41:58,118 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 16:41:58,129 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:41:58,129 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 16:41:58,129 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 16:41:58,258 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-25 16:41:58,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 234 places, 239 transitions, 510 flow [2022-11-25 16:41:58,416 INFO L130 PetriNetUnfolder]: 18/235 cut-off events. [2022-11-25 16:41:58,417 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-25 16:41:58,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 235 events. 18/235 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 124 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 201. Up to 3 conditions per place. [2022-11-25 16:41:58,423 INFO L82 GeneralOperation]: Start removeDead. Operand has 234 places, 239 transitions, 510 flow [2022-11-25 16:41:58,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 217 places, 222 transitions, 468 flow [2022-11-25 16:41:58,433 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 16:41:58,447 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 222 transitions, 468 flow [2022-11-25 16:41:58,450 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 222 transitions, 468 flow [2022-11-25 16:41:58,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 222 transitions, 468 flow [2022-11-25 16:41:58,506 INFO L130 PetriNetUnfolder]: 18/222 cut-off events. [2022-11-25 16:41:58,507 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-25 16:41:58,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 222 events. 18/222 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 123 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 201. Up to 3 conditions per place. [2022-11-25 16:41:58,513 INFO L119 LiptonReduction]: Number of co-enabled transitions 2284 [2022-11-25 16:42:10,647 INFO L134 LiptonReduction]: Checked pairs total: 4682 [2022-11-25 16:42:10,647 INFO L136 LiptonReduction]: Total number of compositions: 227 [2022-11-25 16:42:10,663 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:42:10,670 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=LoopsAndPotentialCycles, 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;@5d6ead87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:42:10,670 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-25 16:42:10,680 INFO L130 PetriNetUnfolder]: 5/35 cut-off events. [2022-11-25 16:42:10,680 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-25 16:42:10,680 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:10,681 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:10,682 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:42:10,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:10,687 INFO L85 PathProgramCache]: Analyzing trace with hash -236605459, now seen corresponding path program 1 times [2022-11-25 16:42:10,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:10,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181387386] [2022-11-25 16:42:10,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:10,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:11,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:11,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181387386] [2022-11-25 16:42:11,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181387386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:11,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:11,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:42:11,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829271776] [2022-11-25 16:42:11,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:11,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:42:11,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:11,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:42:11,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:42:11,392 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 466 [2022-11-25 16:42:11,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 214.25) internal successors, (857), 4 states have internal predecessors, (857), 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) [2022-11-25 16:42:11,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:11,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 466 [2022-11-25 16:42:11,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:12,009 INFO L130 PetriNetUnfolder]: 1835/2622 cut-off events. [2022-11-25 16:42:12,012 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2022-11-25 16:42:12,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5331 conditions, 2622 events. 1835/2622 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 11749 event pairs, 180 based on Foata normal form. 0/2183 useless extension candidates. Maximal degree in co-relation 4539. Up to 845 conditions per place. [2022-11-25 16:42:12,041 INFO L137 encePairwiseOnDemand]: 461/466 looper letters, 76 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2022-11-25 16:42:12,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 373 flow [2022-11-25 16:42:12,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:42:12,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:42:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1123 transitions. [2022-11-25 16:42:12,065 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4819742489270386 [2022-11-25 16:42:12,066 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1123 transitions. [2022-11-25 16:42:12,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1123 transitions. [2022-11-25 16:42:12,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:12,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1123 transitions. [2022-11-25 16:42:12,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 224.6) internal successors, (1123), 5 states have internal predecessors, (1123), 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) [2022-11-25 16:42:12,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 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) [2022-11-25 16:42:12,094 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 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) [2022-11-25 16:42:12,096 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 96 flow. Second operand 5 states and 1123 transitions. [2022-11-25 16:42:12,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 373 flow [2022-11-25 16:42:12,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 83 transitions, 340 flow, removed 0 selfloop flow, removed 9 redundant places. [2022-11-25 16:42:12,107 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 108 flow [2022-11-25 16:42:12,109 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2022-11-25 16:42:12,144 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2022-11-25 16:42:12,155 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 108 flow [2022-11-25 16:42:12,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 214.25) internal successors, (857), 4 states have internal predecessors, (857), 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) [2022-11-25 16:42:12,156 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:12,156 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:12,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:42:12,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:42:12,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash 313797565, now seen corresponding path program 2 times [2022-11-25 16:42:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:12,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802923057] [2022-11-25 16:42:12,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:12,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:12,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:12,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802923057] [2022-11-25 16:42:12,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802923057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:12,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:12,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:42:12,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416743328] [2022-11-25 16:42:12,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:12,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:42:12,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:12,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:42:12,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:42:12,534 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 466 [2022-11-25 16:42:12,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 214.25) internal successors, (857), 4 states have internal predecessors, (857), 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) [2022-11-25 16:42:12,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:12,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 466 [2022-11-25 16:42:12,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:13,002 INFO L130 PetriNetUnfolder]: 1953/2770 cut-off events. [2022-11-25 16:42:13,003 INFO L131 PetriNetUnfolder]: For 722/722 co-relation queries the response was YES. [2022-11-25 16:42:13,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6103 conditions, 2770 events. 1953/2770 cut-off events. For 722/722 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 12763 event pairs, 198 based on Foata normal form. 0/2401 useless extension candidates. Maximal degree in co-relation 3853. Up to 1095 conditions per place. [2022-11-25 16:42:13,024 INFO L137 encePairwiseOnDemand]: 461/466 looper letters, 65 selfloop transitions, 7 changer transitions 0/76 dead transitions. [2022-11-25 16:42:13,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 76 transitions, 346 flow [2022-11-25 16:42:13,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:42:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:42:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1112 transitions. [2022-11-25 16:42:13,030 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47725321888412015 [2022-11-25 16:42:13,030 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1112 transitions. [2022-11-25 16:42:13,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1112 transitions. [2022-11-25 16:42:13,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:13,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1112 transitions. [2022-11-25 16:42:13,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 222.4) internal successors, (1112), 5 states have internal predecessors, (1112), 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) [2022-11-25 16:42:13,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 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) [2022-11-25 16:42:13,041 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 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) [2022-11-25 16:42:13,041 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 108 flow. Second operand 5 states and 1112 transitions. [2022-11-25 16:42:13,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 76 transitions, 346 flow [2022-11-25 16:42:13,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 76 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:42:13,049 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 149 flow [2022-11-25 16:42:13,049 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2022-11-25 16:42:13,050 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2022-11-25 16:42:13,050 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 149 flow [2022-11-25 16:42:13,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 214.25) internal successors, (857), 4 states have internal predecessors, (857), 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) [2022-11-25 16:42:13,051 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:13,051 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:13,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:42:13,051 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:42:13,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:13,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1405631581, now seen corresponding path program 3 times [2022-11-25 16:42:13,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:13,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982087107] [2022-11-25 16:42:13,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:13,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:13,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:13,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982087107] [2022-11-25 16:42:13,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982087107] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:13,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:13,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:42:13,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743298841] [2022-11-25 16:42:13,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:13,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:42:13,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:13,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:42:13,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:42:13,561 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 466 [2022-11-25 16:42:13,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 208.16666666666666) internal successors, (1249), 6 states have internal predecessors, (1249), 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) [2022-11-25 16:42:13,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:13,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 466 [2022-11-25 16:42:13,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:14,529 INFO L130 PetriNetUnfolder]: 4475/6276 cut-off events. [2022-11-25 16:42:14,529 INFO L131 PetriNetUnfolder]: For 3462/3474 co-relation queries the response was YES. [2022-11-25 16:42:14,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15139 conditions, 6276 events. 4475/6276 cut-off events. For 3462/3474 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 31763 event pairs, 400 based on Foata normal form. 100/5723 useless extension candidates. Maximal degree in co-relation 8680. Up to 2042 conditions per place. [2022-11-25 16:42:14,566 INFO L137 encePairwiseOnDemand]: 459/466 looper letters, 87 selfloop transitions, 9 changer transitions 14/113 dead transitions. [2022-11-25 16:42:14,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 113 transitions, 575 flow [2022-11-25 16:42:14,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 16:42:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 16:42:14,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1736 transitions. [2022-11-25 16:42:14,572 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4656652360515021 [2022-11-25 16:42:14,572 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1736 transitions. [2022-11-25 16:42:14,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1736 transitions. [2022-11-25 16:42:14,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:14,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1736 transitions. [2022-11-25 16:42:14,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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) [2022-11-25 16:42:14,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 466.0) internal successors, (4194), 9 states have internal predecessors, (4194), 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) [2022-11-25 16:42:14,591 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 466.0) internal successors, (4194), 9 states have internal predecessors, (4194), 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) [2022-11-25 16:42:14,591 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 149 flow. Second operand 8 states and 1736 transitions. [2022-11-25 16:42:14,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 113 transitions, 575 flow [2022-11-25 16:42:14,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 113 transitions, 568 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:42:14,599 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 180 flow [2022-11-25 16:42:14,599 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=180, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2022-11-25 16:42:14,600 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2022-11-25 16:42:14,600 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 180 flow [2022-11-25 16:42:14,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 208.16666666666666) internal successors, (1249), 6 states have internal predecessors, (1249), 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) [2022-11-25 16:42:14,602 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:14,602 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:14,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:42:14,602 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:42:14,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:14,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1211240282, now seen corresponding path program 1 times [2022-11-25 16:42:14,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:14,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347446492] [2022-11-25 16:42:14,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:14,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:14,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:14,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:14,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347446492] [2022-11-25 16:42:14,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347446492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:14,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:14,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:42:14,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384998356] [2022-11-25 16:42:14,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:14,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:42:14,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:14,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:42:14,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:42:14,890 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 466 [2022-11-25 16:42:14,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 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) [2022-11-25 16:42:14,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:14,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 466 [2022-11-25 16:42:14,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:15,359 INFO L130 PetriNetUnfolder]: 1941/2876 cut-off events. [2022-11-25 16:42:15,359 INFO L131 PetriNetUnfolder]: For 2710/2711 co-relation queries the response was YES. [2022-11-25 16:42:15,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7507 conditions, 2876 events. 1941/2876 cut-off events. For 2710/2711 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13399 event pairs, 502 based on Foata normal form. 54/2586 useless extension candidates. Maximal degree in co-relation 7494. Up to 2173 conditions per place. [2022-11-25 16:42:15,381 INFO L137 encePairwiseOnDemand]: 463/466 looper letters, 45 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2022-11-25 16:42:15,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 52 transitions, 273 flow [2022-11-25 16:42:15,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:42:15,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:42:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 677 transitions. [2022-11-25 16:42:15,384 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4842632331902718 [2022-11-25 16:42:15,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 677 transitions. [2022-11-25 16:42:15,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 677 transitions. [2022-11-25 16:42:15,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:15,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 677 transitions. [2022-11-25 16:42:15,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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) [2022-11-25 16:42:15,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 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) [2022-11-25 16:42:15,392 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 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) [2022-11-25 16:42:15,392 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 180 flow. Second operand 3 states and 677 transitions. [2022-11-25 16:42:15,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 52 transitions, 273 flow [2022-11-25 16:42:15,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 242 flow, removed 2 selfloop flow, removed 12 redundant places. [2022-11-25 16:42:15,404 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 130 flow [2022-11-25 16:42:15,405 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2022-11-25 16:42:15,407 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2022-11-25 16:42:15,407 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 130 flow [2022-11-25 16:42:15,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 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) [2022-11-25 16:42:15,408 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:15,408 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:15,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:42:15,410 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:42:15,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:15,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2035546942, now seen corresponding path program 1 times [2022-11-25 16:42:15,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:15,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709597863] [2022-11-25 16:42:15,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:15,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:42:15,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:15,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709597863] [2022-11-25 16:42:15,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709597863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:15,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:15,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:42:15,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138018946] [2022-11-25 16:42:15,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:15,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:42:15,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:15,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:42:15,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:42:15,700 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 466 [2022-11-25 16:42:15,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 211.25) internal successors, (845), 4 states have internal predecessors, (845), 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) [2022-11-25 16:42:15,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:15,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 466 [2022-11-25 16:42:15,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:16,178 INFO L130 PetriNetUnfolder]: 2206/3259 cut-off events. [2022-11-25 16:42:16,178 INFO L131 PetriNetUnfolder]: For 1661/1662 co-relation queries the response was YES. [2022-11-25 16:42:16,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8135 conditions, 3259 events. 2206/3259 cut-off events. For 1661/1662 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 15282 event pairs, 1544 based on Foata normal form. 44/2877 useless extension candidates. Maximal degree in co-relation 8125. Up to 2594 conditions per place. [2022-11-25 16:42:16,209 INFO L137 encePairwiseOnDemand]: 462/466 looper letters, 34 selfloop transitions, 2 changer transitions 17/58 dead transitions. [2022-11-25 16:42:16,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 281 flow [2022-11-25 16:42:16,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:42:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:42:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 868 transitions. [2022-11-25 16:42:16,212 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4656652360515021 [2022-11-25 16:42:16,212 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 868 transitions. [2022-11-25 16:42:16,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 868 transitions. [2022-11-25 16:42:16,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:16,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 868 transitions. [2022-11-25 16:42:16,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 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) [2022-11-25 16:42:16,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 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) [2022-11-25 16:42:16,220 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 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) [2022-11-25 16:42:16,220 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 130 flow. Second operand 4 states and 868 transitions. [2022-11-25 16:42:16,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 281 flow [2022-11-25 16:42:16,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 58 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:42:16,227 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 142 flow [2022-11-25 16:42:16,227 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2022-11-25 16:42:16,230 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2022-11-25 16:42:16,230 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 142 flow [2022-11-25 16:42:16,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 211.25) internal successors, (845), 4 states have internal predecessors, (845), 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) [2022-11-25 16:42:16,231 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:16,233 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:16,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:42:16,234 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:42:16,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:16,234 INFO L85 PathProgramCache]: Analyzing trace with hash -829695272, now seen corresponding path program 1 times [2022-11-25 16:42:16,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:16,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380033171] [2022-11-25 16:42:16,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:16,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 16:42:16,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:16,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380033171] [2022-11-25 16:42:16,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380033171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:16,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:16,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:42:16,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521705141] [2022-11-25 16:42:16,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:16,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:42:16,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:16,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:42:16,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:42:16,527 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 466 [2022-11-25 16:42:16,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 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) [2022-11-25 16:42:16,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:16,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 466 [2022-11-25 16:42:16,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:16,951 INFO L130 PetriNetUnfolder]: 1500/2291 cut-off events. [2022-11-25 16:42:16,952 INFO L131 PetriNetUnfolder]: For 1284/1285 co-relation queries the response was YES. [2022-11-25 16:42:16,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5858 conditions, 2291 events. 1500/2291 cut-off events. For 1284/1285 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10064 event pairs, 691 based on Foata normal form. 34/2103 useless extension candidates. Maximal degree in co-relation 5846. Up to 1930 conditions per place. [2022-11-25 16:42:16,970 INFO L137 encePairwiseOnDemand]: 463/466 looper letters, 45 selfloop transitions, 2 changer transitions 3/55 dead transitions. [2022-11-25 16:42:16,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 278 flow [2022-11-25 16:42:16,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:42:16,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:42:16,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 672 transitions. [2022-11-25 16:42:16,973 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48068669527896996 [2022-11-25 16:42:16,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 672 transitions. [2022-11-25 16:42:16,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 672 transitions. [2022-11-25 16:42:16,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:16,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 672 transitions. [2022-11-25 16:42:16,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 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) [2022-11-25 16:42:16,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 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) [2022-11-25 16:42:16,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 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) [2022-11-25 16:42:16,980 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 142 flow. Second operand 3 states and 672 transitions. [2022-11-25 16:42:16,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 278 flow [2022-11-25 16:42:16,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 272 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-25 16:42:16,984 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 148 flow [2022-11-25 16:42:16,985 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2022-11-25 16:42:16,985 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2022-11-25 16:42:16,985 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 148 flow [2022-11-25 16:42:16,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 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) [2022-11-25 16:42:16,986 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:16,986 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:16,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:42:16,987 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:42:16,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:16,988 INFO L85 PathProgramCache]: Analyzing trace with hash 680199190, now seen corresponding path program 1 times [2022-11-25 16:42:16,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:16,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448772987] [2022-11-25 16:42:16,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:16,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 16:42:17,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:17,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448772987] [2022-11-25 16:42:17,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448772987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:17,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:17,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:42:17,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977691762] [2022-11-25 16:42:17,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:17,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:42:17,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:17,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:42:17,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:42:17,227 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 466 [2022-11-25 16:42:17,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 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) [2022-11-25 16:42:17,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:17,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 466 [2022-11-25 16:42:17,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:42:17,681 INFO L130 PetriNetUnfolder]: 1608/2502 cut-off events. [2022-11-25 16:42:17,681 INFO L131 PetriNetUnfolder]: For 1611/1612 co-relation queries the response was YES. [2022-11-25 16:42:17,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6685 conditions, 2502 events. 1608/2502 cut-off events. For 1611/1612 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11095 event pairs, 1213 based on Foata normal form. 22/2296 useless extension candidates. Maximal degree in co-relation 6673. Up to 2105 conditions per place. [2022-11-25 16:42:17,697 INFO L137 encePairwiseOnDemand]: 461/466 looper letters, 36 selfloop transitions, 2 changer transitions 18/61 dead transitions. [2022-11-25 16:42:17,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 313 flow [2022-11-25 16:42:17,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:42:17,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:42:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1073 transitions. [2022-11-25 16:42:17,701 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46051502145922746 [2022-11-25 16:42:17,701 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1073 transitions. [2022-11-25 16:42:17,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1073 transitions. [2022-11-25 16:42:17,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:42:17,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1073 transitions. [2022-11-25 16:42:17,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 214.6) internal successors, (1073), 5 states have internal predecessors, (1073), 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) [2022-11-25 16:42:17,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 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) [2022-11-25 16:42:17,709 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 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) [2022-11-25 16:42:17,709 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 148 flow. Second operand 5 states and 1073 transitions. [2022-11-25 16:42:17,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 313 flow [2022-11-25 16:42:17,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:42:17,714 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 162 flow [2022-11-25 16:42:17,714 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2022-11-25 16:42:17,715 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2022-11-25 16:42:17,715 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 162 flow [2022-11-25 16:42:17,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 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) [2022-11-25 16:42:17,716 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:42:17,716 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:17,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:42:17,717 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:42:17,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:17,717 INFO L85 PathProgramCache]: Analyzing trace with hash 159856468, now seen corresponding path program 1 times [2022-11-25 16:42:17,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:17,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416081086] [2022-11-25 16:42:17,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:17,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:20,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:20,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:20,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416081086] [2022-11-25 16:42:20,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416081086] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:42:20,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432418292] [2022-11-25 16:42:20,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:20,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:42:20,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:42:20,961 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:42:20,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 16:42:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:21,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-25 16:42:21,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:42:22,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:42:22,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 16:42:22,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:42:22,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 16:42:22,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:42:22,973 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:42:22,973 INFO L350 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 36 treesize of output 20 [2022-11-25 16:42:23,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:23,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:42:24,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:42:24,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2052 treesize of output 1872 [2022-11-25 16:42:24,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:42:24,266 INFO L350 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 1680 treesize of output 1520 [2022-11-25 16:42:24,334 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:42:24,335 INFO L350 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 1564 treesize of output 1200 [2022-11-25 16:42:39,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:39,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432418292] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:42:39,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:42:39,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 47 [2022-11-25 16:42:39,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523949343] [2022-11-25 16:42:39,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:42:39,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-25 16:42:39,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:39,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-25 16:42:39,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2044, Unknown=5, NotChecked=0, Total=2256 [2022-11-25 16:42:47,587 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 466 [2022-11-25 16:42:47,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 162 flow. Second operand has 48 states, 48 states have (on average 129.91666666666666) internal successors, (6236), 48 states have internal predecessors, (6236), 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) [2022-11-25 16:42:47,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:42:47,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 466 [2022-11-25 16:42:47,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:07,863 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] [2022-11-25 16:43:15,507 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] [2022-11-25 16:43:22,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:43:23,581 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse29 (* c_~front2~0 4))) (let ((.cse1 (+ c_~queue2~0.offset .cse29)) (.cse28 (* c_~back2~0 4)) (.cse30 (* c_~front1~0 4)) (.cse23 (* c_~W~0 2))) (let ((.cse2 (+ .cse23 1)) (.cse5 (+ c_~queue1~0.offset .cse30)) (.cse17 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~queue1~0.base))) (.cse18 (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~queue1~0.base))) (.cse6 (not (< c_~back2~0 c_~n2~0))) (.cse11 (not (< c_~back1~0 c_~n1~0))) (.cse15 (= .cse28 .cse29)) (.cse16 (< c_~d2~0 1)) (.cse19 (= (* 4 c_~back1~0) .cse30)) (.cse12 (= (mod c_~v_assert~0 256) 0)) (.cse13 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse14 (not (<= 0 c_~back1~0))) (.cse7 (not (<= 0 c_~back2~0))) (.cse25 (select (select |c_#memory_int| c_~queue2~0.base) .cse1)) (.cse24 (<= (+ c_~queue2~0.offset .cse29 1) 0)) (.cse8 (= 1 |c_thread2Thread1of1ForFork3_~temp~0#1|)) (.cse9 (= c_~d2~0 0)) (.cse3 (+ c_~queue2~0.offset .cse28)) (.cse27 (<= 1 c_~W~0)) (.cse10 (= .cse1 0))) (and (<= 0 c_~front2~0) (or (forall ((~queue2~0.base Int) (v_ArrVal_283 (Array Int Int)) (v_ArrVal_284 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_284))) (let ((.cse0 (select .cse4 ~queue2~0.base))) (or (< (+ c_~d2~0 (select .cse0 .cse1)) .cse2) (not (<= (select .cse0 .cse3) (+ (select (select .cse4 c_~queue1~0.base) .cse5) 1))))))) .cse6 .cse7) .cse8 .cse9 (<= c_~v_assert~0 1) .cse10 (or .cse11 .cse12 .cse6 .cse13 .cse14 .cse7 (and .cse15 .cse16 .cse17 .cse18 .cse19)) (or .cse6 (forall ((~queue2~0.base Int)) (let ((.cse20 (select |c_#memory_int| ~queue2~0.base))) (or (not (<= (select .cse20 .cse3) (+ (select (select |c_#memory_int| c_~queue1~0.base) .cse5) 1))) (< (+ c_~d2~0 (select .cse20 .cse1)) .cse2)))) .cse7) (or (forall ((~queue2~0.base Int) (v_ArrVal_284 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_284))) (let ((.cse21 (select .cse22 ~queue2~0.base))) (or (< (+ c_~d2~0 (select .cse21 .cse1)) .cse2) (not (<= (select .cse21 .cse3) (+ (select (select .cse22 c_~queue1~0.base) .cse5) 1))))))) .cse6 .cse7) (<= c_~front2~0 0) (or .cse11 (and .cse15 .cse17 (< (+ c_~d2~0 1) .cse23) .cse18 .cse19) .cse6 .cse14 .cse7) (= c_~queue2~0.offset 0) (or .cse11 (< 0 c_~back2~0) (and (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse15 .cse16 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse19) .cse12 .cse13 .cse14 .cse7) (or (<= c_~back2~0 c_~front2~0) (not .cse24)) (<= 1 c_~v_assert~0) (<= c_~d2~0 0) (exists ((v_~front1~0_104 Int) (~queue1~0.base Int)) (let ((.cse26 (select (select |c_#memory_int| ~queue1~0.base) (* v_~front1~0_104 4)))) (and (<= .cse25 (+ .cse26 1)) (<= v_~front1~0_104 0) (= .cse26 1) (<= 0 v_~front1~0_104)))) .cse27 (= .cse25 (+ 1 |c_thread2Thread1of1ForFork3_~temp~0#1|)) (or .cse24 (and (or (and .cse8 .cse9 (or (<= .cse3 0) (<= c_~n2~0 1)) .cse27) (not .cse10)) (or (and (<= c_~front2~0 c_~back2~0) (not (<= (+ c_~front2~0 1) c_~n2~0))) .cse10))))))) is different from false [2022-11-25 16:43:37,606 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] [2022-11-25 16:43:39,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:43:41,564 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] [2022-11-25 16:44:14,636 WARN L233 SmtUtils]: Spent 6.38s on a formula simplification. DAG size of input: 86 DAG size of output: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:44:16,515 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse29 (* c_~front2~0 4))) (let ((.cse1 (+ c_~queue2~0.offset .cse29)) (.cse28 (* c_~back2~0 4)) (.cse30 (* c_~front1~0 4)) (.cse23 (* c_~W~0 2))) (let ((.cse2 (+ .cse23 1)) (.cse5 (+ c_~queue1~0.offset .cse30)) (.cse17 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~queue1~0.base))) (.cse18 (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~queue1~0.base))) (.cse6 (not (< c_~back2~0 c_~n2~0))) (.cse11 (not (< c_~back1~0 c_~n1~0))) (.cse15 (= .cse28 .cse29)) (.cse16 (< c_~d2~0 1)) (.cse19 (= (* 4 c_~back1~0) .cse30)) (.cse12 (= (mod c_~v_assert~0 256) 0)) (.cse13 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse14 (not (<= 0 c_~back1~0))) (.cse7 (not (<= 0 c_~back2~0))) (.cse25 (select (select |c_#memory_int| c_~queue2~0.base) .cse1)) (.cse24 (<= (+ c_~queue2~0.offset .cse29 1) 0)) (.cse8 (= 1 |c_thread2Thread1of1ForFork3_~temp~0#1|)) (.cse9 (= c_~d2~0 0)) (.cse3 (+ c_~queue2~0.offset .cse28)) (.cse27 (<= 1 c_~W~0)) (.cse10 (= .cse1 0))) (and (<= 0 c_~front2~0) (or (forall ((~queue2~0.base Int) (v_ArrVal_283 (Array Int Int)) (v_ArrVal_284 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_284))) (let ((.cse0 (select .cse4 ~queue2~0.base))) (or (< (+ c_~d2~0 (select .cse0 .cse1)) .cse2) (not (<= (select .cse0 .cse3) (+ (select (select .cse4 c_~queue1~0.base) .cse5) 1))))))) .cse6 .cse7) .cse8 .cse9 (<= c_~v_assert~0 1) .cse10 (or .cse11 .cse12 .cse6 .cse13 .cse14 .cse7 (and .cse15 .cse16 .cse17 .cse18 .cse19)) (or .cse6 (forall ((~queue2~0.base Int)) (let ((.cse20 (select |c_#memory_int| ~queue2~0.base))) (or (not (<= (select .cse20 .cse3) (+ (select (select |c_#memory_int| c_~queue1~0.base) .cse5) 1))) (< (+ c_~d2~0 (select .cse20 .cse1)) .cse2)))) .cse7) (or (forall ((~queue2~0.base Int) (v_ArrVal_284 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_284))) (let ((.cse21 (select .cse22 ~queue2~0.base))) (or (< (+ c_~d2~0 (select .cse21 .cse1)) .cse2) (not (<= (select .cse21 .cse3) (+ (select (select .cse22 c_~queue1~0.base) .cse5) 1))))))) .cse6 .cse7) (<= c_~front2~0 0) (or .cse11 (and .cse15 .cse17 (< (+ c_~d2~0 1) .cse23) .cse18 .cse19) .cse6 .cse14 .cse7) (= c_~queue2~0.offset 0) (or .cse11 (< 0 c_~back2~0) (and (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse15 .cse16 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse19) .cse12 .cse13 .cse14 .cse7) (or (<= c_~back2~0 c_~front2~0) (not .cse24)) (<= 1 c_~v_assert~0) (= c_~v_assert~0 |c_thread3Thread1of1ForFork0_~cond~2#1|) (<= c_~d2~0 0) (exists ((v_~front1~0_104 Int) (~queue1~0.base Int)) (let ((.cse26 (select (select |c_#memory_int| ~queue1~0.base) (* v_~front1~0_104 4)))) (and (<= .cse25 (+ .cse26 1)) (<= v_~front1~0_104 0) (= .cse26 1) (<= 0 v_~front1~0_104)))) .cse27 (= .cse25 (+ 1 |c_thread2Thread1of1ForFork3_~temp~0#1|)) (or .cse24 (and (or (and .cse8 .cse9 (or (<= .cse3 0) (<= c_~n2~0 1)) .cse27) (not .cse10)) (or (and (<= c_~front2~0 c_~back2~0) (not (<= (+ c_~front2~0 1) c_~n2~0))) .cse10))))))) is different from false [2022-11-25 16:44:38,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:44:58,462 WARN L233 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 71 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:45:07,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:45:09,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:45:35,769 WARN L233 SmtUtils]: Spent 8.39s on a formula simplification. DAG size of input: 88 DAG size of output: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 16:45:38,069 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] [2022-11-25 16:45:59,628 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~back2~0 4)) (.cse12 (* c_~front2~0 4)) (.cse14 (* c_~front1~0 4)) (.cse13 (* c_~W~0 2))) (let ((.cse2 (+ .cse13 1)) (.cse5 (+ c_~queue1~0.offset .cse14)) (.cse6 (not (< c_~back2~0 c_~n2~0))) (.cse7 (not (<= 0 c_~back2~0))) (.cse15 (<= (+ c_~queue2~0.offset .cse12 1) 0)) (.cse3 (+ c_~queue2~0.offset .cse11)) (.cse16 (<= 1 c_~W~0)) (.cse1 (+ c_~queue2~0.offset .cse12))) (and (or (forall ((~queue2~0.base Int) (v_ArrVal_283 (Array Int Int)) (v_ArrVal_284 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_284))) (let ((.cse0 (select .cse4 ~queue2~0.base))) (or (< (+ c_~d2~0 (select .cse0 .cse1)) .cse2) (not (<= (select .cse0 .cse3) (+ (select (select .cse4 c_~queue1~0.base) .cse5) 1))))))) .cse6 .cse7) (<= c_~v_assert~0 1) (or .cse6 (forall ((~queue2~0.base Int)) (let ((.cse8 (select |c_#memory_int| ~queue2~0.base))) (or (not (<= (select .cse8 .cse3) (+ (select (select |c_#memory_int| c_~queue1~0.base) .cse5) 1))) (< (+ c_~d2~0 (select .cse8 .cse1)) .cse2)))) .cse7) (or (forall ((~queue2~0.base Int) (v_ArrVal_284 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_284))) (let ((.cse9 (select .cse10 ~queue2~0.base))) (or (< (+ c_~d2~0 (select .cse9 .cse1)) .cse2) (not (<= (select .cse9 .cse3) (+ (select (select .cse10 c_~queue1~0.base) .cse5) 1))))))) .cse6 .cse7) (or (not (< c_~back1~0 c_~n1~0)) (and (= .cse11 .cse12) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~queue1~0.base)) (< (+ c_~d2~0 1) .cse13) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~queue1~0.base)) (= (* 4 c_~back1~0) .cse14)) (= (mod c_~v_assert~0 256) 0) .cse6 (not (<= 0 c_~back1~0)) .cse7 (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|))) (= c_~queue2~0.offset 0) (or (<= c_~back2~0 c_~front2~0) (not .cse15)) (<= 1 c_~v_assert~0) .cse16 (or .cse15 (let ((.cse17 (= .cse1 0))) (and (or (and (= 1 |c_thread2Thread1of1ForFork3_~temp~0#1|) (= c_~d2~0 0) (or (<= .cse3 0) (<= c_~n2~0 1)) .cse16) (not .cse17)) (or (and (<= c_~front2~0 c_~back2~0) (not (<= (+ c_~front2~0 1) c_~n2~0))) .cse17)))) (<= c_~d2~0 2)))) is different from false [2022-11-25 16:46:11,214 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] [2022-11-25 16:46:18,127 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (* c_~front2~0 4))) (let ((.cse1 (+ c_~queue2~0.offset .cse18))) (let ((.cse2 (+ (* c_~W~0 2) 1)) (.cse5 (+ c_~queue1~0.offset (* c_~front1~0 4))) (.cse6 (not (< c_~back2~0 c_~n2~0))) (.cse7 (not (<= 0 c_~back2~0))) (.cse15 (select (select |c_#memory_int| c_~queue2~0.base) .cse1)) (.cse14 (<= (+ c_~queue2~0.offset .cse18 1) 0)) (.cse8 (= 1 |c_thread2Thread1of1ForFork3_~temp~0#1|)) (.cse9 (= c_~d2~0 0)) (.cse3 (+ c_~queue2~0.offset (* c_~back2~0 4))) (.cse17 (<= 1 c_~W~0)) (.cse10 (= .cse1 0))) (and (<= 0 c_~front2~0) (or (forall ((~queue2~0.base Int) (v_ArrVal_283 (Array Int Int)) (v_ArrVal_284 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_284))) (let ((.cse0 (select .cse4 ~queue2~0.base))) (or (< (+ c_~d2~0 (select .cse0 .cse1)) .cse2) (not (<= (select .cse0 .cse3) (+ (select (select .cse4 c_~queue1~0.base) .cse5) 1))))))) .cse6 .cse7) .cse8 .cse9 (<= c_~v_assert~0 1) .cse10 (or .cse6 (forall ((~queue2~0.base Int)) (let ((.cse11 (select |c_#memory_int| ~queue2~0.base))) (or (not (<= (select .cse11 .cse3) (+ (select (select |c_#memory_int| c_~queue1~0.base) .cse5) 1))) (< (+ c_~d2~0 (select .cse11 .cse1)) .cse2)))) .cse7) (or (forall ((~queue2~0.base Int) (v_ArrVal_284 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_284))) (let ((.cse12 (select .cse13 ~queue2~0.base))) (or (< (+ c_~d2~0 (select .cse12 .cse1)) .cse2) (not (<= (select .cse12 .cse3) (+ (select (select .cse13 c_~queue1~0.base) .cse5) 1))))))) .cse6 .cse7) (<= c_~front2~0 0) (= c_~queue2~0.offset 0) (or (<= c_~back2~0 c_~front2~0) (not .cse14)) (<= 1 c_~v_assert~0) (= c_~v_assert~0 |c_thread3Thread1of1ForFork0_~cond~2#1|) (<= c_~d2~0 0) (exists ((v_~front1~0_104 Int) (~queue1~0.base Int)) (let ((.cse16 (select (select |c_#memory_int| ~queue1~0.base) (* v_~front1~0_104 4)))) (and (<= .cse15 (+ .cse16 1)) (<= v_~front1~0_104 0) (= .cse16 1) (<= 0 v_~front1~0_104)))) .cse17 (= .cse15 (+ 1 |c_thread2Thread1of1ForFork3_~temp~0#1|)) (or .cse14 (and (or (and .cse8 .cse9 (or (<= .cse3 0) (<= c_~n2~0 1)) .cse17) (not .cse10)) (or (and (<= c_~front2~0 c_~back2~0) (not (<= (+ c_~front2~0 1) c_~n2~0))) .cse10))))))) is different from false [2022-11-25 16:46:22,202 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (* c_~front2~0 4))) (let ((.cse2 (+ (* c_~W~0 2) 1)) (.cse5 (+ c_~queue1~0.offset (* c_~front1~0 4))) (.cse6 (not (< c_~back2~0 c_~n2~0))) (.cse7 (not (<= 0 c_~back2~0))) (.cse11 (<= (+ c_~queue2~0.offset .cse14 1) 0)) (.cse3 (+ c_~queue2~0.offset (* c_~back2~0 4))) (.cse12 (<= 1 c_~W~0)) (.cse1 (+ c_~queue2~0.offset .cse14))) (and (or (forall ((~queue2~0.base Int) (v_ArrVal_283 (Array Int Int)) (v_ArrVal_284 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_284))) (let ((.cse0 (select .cse4 ~queue2~0.base))) (or (< (+ c_~d2~0 (select .cse0 .cse1)) .cse2) (not (<= (select .cse0 .cse3) (+ (select (select .cse4 c_~queue1~0.base) .cse5) 1))))))) .cse6 .cse7) (<= c_~v_assert~0 1) (or .cse6 (forall ((~queue2~0.base Int)) (let ((.cse8 (select |c_#memory_int| ~queue2~0.base))) (or (not (<= (select .cse8 .cse3) (+ (select (select |c_#memory_int| c_~queue1~0.base) .cse5) 1))) (< (+ c_~d2~0 (select .cse8 .cse1)) .cse2)))) .cse7) (or (forall ((~queue2~0.base Int) (v_ArrVal_284 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_284))) (let ((.cse9 (select .cse10 ~queue2~0.base))) (or (< (+ c_~d2~0 (select .cse9 .cse1)) .cse2) (not (<= (select .cse9 .cse3) (+ (select (select .cse10 c_~queue1~0.base) .cse5) 1))))))) .cse6 .cse7) (= c_~queue2~0.offset 0) (or (<= c_~back2~0 c_~front2~0) (not .cse11)) (<= 1 c_~v_assert~0) (= c_~v_assert~0 |c_thread3Thread1of1ForFork0_~cond~2#1|) .cse12 (or .cse11 (let ((.cse13 (= .cse1 0))) (and (or (and (= 1 |c_thread2Thread1of1ForFork3_~temp~0#1|) (= c_~d2~0 0) (or (<= .cse3 0) (<= c_~n2~0 1)) .cse12) (not .cse13)) (or (and (<= c_~front2~0 c_~back2~0) (not (<= (+ c_~front2~0 1) c_~n2~0))) .cse13)))) (<= c_~d2~0 2)))) is different from false [2022-11-25 16:46:30,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:47:38,530 INFO L130 PetriNetUnfolder]: 58331/82495 cut-off events. [2022-11-25 16:47:38,530 INFO L131 PetriNetUnfolder]: For 56663/56663 co-relation queries the response was YES. [2022-11-25 16:47:38,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232218 conditions, 82495 events. 58331/82495 cut-off events. For 56663/56663 co-relation queries the response was YES. Maximal size of possible extension queue 2260. Compared 541351 event pairs, 787 based on Foata normal form. 771/78083 useless extension candidates. Maximal degree in co-relation 232203. Up to 15153 conditions per place. [2022-11-25 16:47:39,105 INFO L137 encePairwiseOnDemand]: 439/466 looper letters, 3279 selfloop transitions, 1974 changer transitions 587/5840 dead transitions. [2022-11-25 16:47:39,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 5840 transitions, 30441 flow [2022-11-25 16:47:39,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 565 states. [2022-11-25 16:47:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2022-11-25 16:47:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 78022 transitions. [2022-11-25 16:47:39,282 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.296334839910365 [2022-11-25 16:47:39,282 INFO L72 ComplementDD]: Start complementDD. Operand 565 states and 78022 transitions. [2022-11-25 16:47:39,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 565 states and 78022 transitions. [2022-11-25 16:47:39,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:47:39,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 565 states and 78022 transitions. [2022-11-25 16:47:39,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 566 states, 565 states have (on average 138.09203539823008) internal successors, (78022), 565 states have internal predecessors, (78022), 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) [2022-11-25 16:47:39,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 566 states, 566 states have (on average 466.0) internal successors, (263756), 566 states have internal predecessors, (263756), 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) [2022-11-25 16:47:39,860 INFO L81 ComplementDD]: Finished complementDD. Result has 566 states, 566 states have (on average 466.0) internal successors, (263756), 566 states have internal predecessors, (263756), 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) [2022-11-25 16:47:39,860 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 162 flow. Second operand 565 states and 78022 transitions. [2022-11-25 16:47:39,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 5840 transitions, 30441 flow [2022-11-25 16:47:40,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 5840 transitions, 30415 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-11-25 16:47:40,079 INFO L231 Difference]: Finished difference. Result has 978 places, 2376 transitions, 16904 flow [2022-11-25 16:47:40,080 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=565, PETRI_FLOW=16904, PETRI_PLACES=978, PETRI_TRANSITIONS=2376} [2022-11-25 16:47:40,081 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 934 predicate places. [2022-11-25 16:47:40,081 INFO L495 AbstractCegarLoop]: Abstraction has has 978 places, 2376 transitions, 16904 flow [2022-11-25 16:47:40,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 129.91666666666666) internal successors, (6236), 48 states have internal predecessors, (6236), 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) [2022-11-25 16:47:40,083 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:47:40,083 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:40,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 16:47:40,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-25 16:47:40,289 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 16:47:40,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:40,290 INFO L85 PathProgramCache]: Analyzing trace with hash -776181406, now seen corresponding path program 2 times [2022-11-25 16:47:40,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:40,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239723854] [2022-11-25 16:47:40,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:40,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:47:44,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:44,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239723854] [2022-11-25 16:47:44,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239723854] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:47:44,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023520971] [2022-11-25 16:47:44,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:47:44,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:47:44,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:47:44,698 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:47:44,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe39c7df-fea1-4c6a-bc1b-a37b23ff81a0/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 16:47:44,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 16:47:44,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:47:44,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-25 16:47:44,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:47:45,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:47:45,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:47:45,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:47:45,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:47:45,082 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-25 16:47:45,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 47 [2022-11-25 16:47:45,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 16:47:45,380 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:47:45,380 INFO L350 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 [2022-11-25 16:47:45,572 INFO L350 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 6 treesize of output 5 [2022-11-25 16:47:45,822 INFO L350 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 6 treesize of output 5 [2022-11-25 16:47:46,129 INFO L350 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 6 treesize of output 5 [2022-11-25 16:47:46,447 INFO L350 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 6 treesize of output 5 [2022-11-25 16:47:47,910 INFO L321 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2022-11-25 16:47:47,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 116 [2022-11-25 16:47:48,343 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:47:48,344 INFO L350 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 40 treesize of output 30 [2022-11-25 16:47:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:47:48,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:47:49,135 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_364 (Array Int Int))) (< (+ c_~d2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_364) c_~queue2~0.base) (+ c_~queue2~0.offset (* c_~front2~0 4)))) (+ (* c_~W~0 2) 1))) is different from false [2022-11-25 16:47:51,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:47:51,501 INFO L350 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 143 treesize of output 107 [2022-11-25 16:47:51,676 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:47:51,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 513282 treesize of output 498142 [2022-11-25 16:47:53,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:47:53,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 498050 treesize of output 454738 [2022-11-25 16:47:54,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:47:54,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 454658 treesize of output 433042 [2022-11-25 16:47:56,343 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:47:56,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 432962 treesize of output 346258 [2022-11-25 16:47:57,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:47:57,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 346178 treesize of output 335410 [2022-11-25 16:47:59,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69622 treesize of output 61430 [2022-11-25 16:49:32,227 WARN L233 SmtUtils]: Spent 10.69s on a formula simplification. DAG size of input: 514 DAG size of output: 515 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 16:52:20,400 WARN L233 SmtUtils]: Spent 16.21s on a formula simplification. DAG size of input: 613 DAG size of output: 614 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 16:52:55,728 WARN L233 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 536 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 16:53:22,197 WARN L233 SmtUtils]: Spent 13.50s on a formula simplification. DAG size of input: 514 DAG size of output: 515 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 16:56:14,643 WARN L233 SmtUtils]: Spent 5.23s on a formula simplification. DAG size of input: 538 DAG size of output: 538 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)