./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b 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_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- 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-8393723 [2022-11-18 19:53:15,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:53:15,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:53:15,405 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:53:15,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:53:15,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:53:15,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:53:15,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:53:15,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:53:15,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:53:15,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:53:15,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:53:15,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:53:15,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:53:15,441 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:53:15,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:53:15,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:53:15,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:53:15,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:53:15,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:53:15,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:53:15,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:53:15,458 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:53:15,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:53:15,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:53:15,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:53:15,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:53:15,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:53:15,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:53:15,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:53:15,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:53:15,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:53:15,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:53:15,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:53:15,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:53:15,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:53:15,484 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:53:15,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:53:15,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:53:15,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:53:15,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:53:15,487 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-18 19:53:15,528 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:53:15,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:53:15,529 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:53:15,530 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:53:15,531 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:53:15,531 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:53:15,532 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:53:15,532 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:53:15,532 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:53:15,532 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:53:15,533 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:53:15,534 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 19:53:15,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:53:15,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:53:15,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:53:15,534 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:53:15,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:53:15,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:53:15,535 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 19:53:15,535 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:53:15,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:53:15,536 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:53:15,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:53:15,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:53:15,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:53:15,537 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:53:15,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:53:15,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:53:15,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:53:15,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:53:15,539 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:53:15,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:53:15,540 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:53:15,540 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:53:15,540 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:53:15,540 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/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_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro 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 ! overflow) ) 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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2022-11-18 19:53:15,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:53:15,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:53:15,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:53:15,914 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:53:15,915 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:53:15,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread/queue_ok.i [2022-11-18 19:53:15,996 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/data/801ab0c56/567c7cdcf01846b9be38a1f509e257e5/FLAG3dcb4d09d [2022-11-18 19:53:16,594 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:53:16,595 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/sv-benchmarks/c/pthread/queue_ok.i [2022-11-18 19:53:16,615 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/data/801ab0c56/567c7cdcf01846b9be38a1f509e257e5/FLAG3dcb4d09d [2022-11-18 19:53:16,881 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/data/801ab0c56/567c7cdcf01846b9be38a1f509e257e5 [2022-11-18 19:53:16,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:53:16,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:53:16,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:53:16,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:53:16,890 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:53:16,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:53:16" (1/1) ... [2022-11-18 19:53:16,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d920761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:16, skipping insertion in model container [2022-11-18 19:53:16,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:53:16" (1/1) ... [2022-11-18 19:53:16,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:53:16,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:53:17,651 WARN L234 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_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-18 19:53:17,658 WARN L234 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_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-18 19:53:17,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:53:17,677 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:53:17,745 WARN L234 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_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-18 19:53:17,752 WARN L234 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_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-18 19:53:17,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:53:17,805 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:53:17,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:17 WrapperNode [2022-11-18 19:53:17,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:53:17,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:53:17,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:53:17,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:53:17,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:17" (1/1) ... [2022-11-18 19:53:17,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:17" (1/1) ... [2022-11-18 19:53:17,882 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-11-18 19:53:17,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:53:17,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:53:17,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:53:17,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:53:17,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:17" (1/1) ... [2022-11-18 19:53:17,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:17" (1/1) ... [2022-11-18 19:53:17,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:17" (1/1) ... [2022-11-18 19:53:17,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:17" (1/1) ... [2022-11-18 19:53:17,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:17" (1/1) ... [2022-11-18 19:53:17,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:17" (1/1) ... [2022-11-18 19:53:17,914 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:17" (1/1) ... [2022-11-18 19:53:17,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:17" (1/1) ... [2022-11-18 19:53:17,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:53:17,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:53:17,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:53:17,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:53:17,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:17" (1/1) ... [2022-11-18 19:53:17,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:53:17,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:53:17,952 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:53:17,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:53:18,012 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-18 19:53:18,014 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-18 19:53:18,014 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-18 19:53:18,015 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-18 19:53:18,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:53:18,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:53:18,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 19:53:18,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:53:18,016 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-18 19:53:18,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:53:18,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:53:18,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:53:18,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:53:18,020 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 19:53:18,220 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:53:18,222 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:53:18,669 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:53:18,679 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:53:18,679 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 19:53:18,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:53:18 BoogieIcfgContainer [2022-11-18 19:53:18,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:53:18,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:53:18,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:53:18,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:53:18,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:53:16" (1/3) ... [2022-11-18 19:53:18,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1528f1bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:53:18, skipping insertion in model container [2022-11-18 19:53:18,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:17" (2/3) ... [2022-11-18 19:53:18,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1528f1bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:53:18, skipping insertion in model container [2022-11-18 19:53:18,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:53:18" (3/3) ... [2022-11-18 19:53:18,701 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-11-18 19:53:18,710 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 19:53:18,721 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:53:18,721 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-18 19:53:18,721 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 19:53:18,890 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-18 19:53:18,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 251 transitions, 518 flow [2022-11-18 19:53:19,089 INFO L130 PetriNetUnfolder]: 13/249 cut-off events. [2022-11-18 19:53:19,090 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-18 19:53:19,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 249 events. 13/249 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 459 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2022-11-18 19:53:19,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 251 transitions, 518 flow [2022-11-18 19:53:19,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 239 transitions, 487 flow [2022-11-18 19:53:19,137 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:53:19,146 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;@7be43f63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:53:19,146 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-18 19:53:19,186 INFO L130 PetriNetUnfolder]: 6/139 cut-off events. [2022-11-18 19:53:19,187 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-18 19:53:19,187 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:53:19,188 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:53:19,188 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 19:53:19,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:19,194 INFO L85 PathProgramCache]: Analyzing trace with hash 68024645, now seen corresponding path program 1 times [2022-11-18 19:53:19,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:19,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488843350] [2022-11-18 19:53:19,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:19,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:20,775 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-18 19:53:20,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:20,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488843350] [2022-11-18 19:53:20,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488843350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:53:20,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:53:20,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-18 19:53:20,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455971037] [2022-11-18 19:53:20,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:53:20,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 19:53:20,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:20,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 19:53:20,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-18 19:53:20,838 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 251 [2022-11-18 19:53:20,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 239 transitions, 487 flow. Second operand has 12 states, 12 states have (on average 188.5) internal successors, (2262), 12 states have internal predecessors, (2262), 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-18 19:53:20,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:53:20,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 251 [2022-11-18 19:53:20,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:53:22,019 INFO L130 PetriNetUnfolder]: 611/2940 cut-off events. [2022-11-18 19:53:22,019 INFO L131 PetriNetUnfolder]: For 88/91 co-relation queries the response was YES. [2022-11-18 19:53:22,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3902 conditions, 2940 events. 611/2940 cut-off events. For 88/91 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 24649 event pairs, 459 based on Foata normal form. 118/2693 useless extension candidates. Maximal degree in co-relation 3504. Up to 882 conditions per place. [2022-11-18 19:53:22,043 INFO L137 encePairwiseOnDemand]: 234/251 looper letters, 42 selfloop transitions, 12 changer transitions 0/227 dead transitions. [2022-11-18 19:53:22,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 227 transitions, 571 flow [2022-11-18 19:53:22,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:53:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 19:53:22,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2477 transitions. [2022-11-18 19:53:22,065 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7591173766472571 [2022-11-18 19:53:22,066 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2477 transitions. [2022-11-18 19:53:22,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2477 transitions. [2022-11-18 19:53:22,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:53:22,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2477 transitions. [2022-11-18 19:53:22,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 190.53846153846155) internal successors, (2477), 13 states have internal predecessors, (2477), 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-18 19:53:22,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 251.0) internal successors, (3514), 14 states have internal predecessors, (3514), 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-18 19:53:22,099 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 251.0) internal successors, (3514), 14 states have internal predecessors, (3514), 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-18 19:53:22,101 INFO L175 Difference]: Start difference. First operand has 233 places, 239 transitions, 487 flow. Second operand 13 states and 2477 transitions. [2022-11-18 19:53:22,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 227 transitions, 571 flow [2022-11-18 19:53:22,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 227 transitions, 566 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 19:53:22,117 INFO L231 Difference]: Finished difference. Result has 235 places, 227 transitions, 482 flow [2022-11-18 19:53:22,119 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=482, PETRI_PLACES=235, PETRI_TRANSITIONS=227} [2022-11-18 19:53:22,123 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 2 predicate places. [2022-11-18 19:53:22,124 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 227 transitions, 482 flow [2022-11-18 19:53:22,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 188.5) internal successors, (2262), 12 states have internal predecessors, (2262), 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-18 19:53:22,125 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:53:22,127 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:53:22,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:53:22,127 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 19:53:22,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:22,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1738829715, now seen corresponding path program 1 times [2022-11-18 19:53:22,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:22,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291604785] [2022-11-18 19:53:22,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:22,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:33,846 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-18 19:53:33,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:33,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291604785] [2022-11-18 19:53:33,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291604785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:53:33,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:53:33,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-18 19:53:33,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520409432] [2022-11-18 19:53:33,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:53:33,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 19:53:33,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:33,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 19:53:33,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-11-18 19:53:33,854 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 251 [2022-11-18 19:53:33,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 227 transitions, 482 flow. Second operand has 20 states, 20 states have (on average 178.75) internal successors, (3575), 20 states have internal predecessors, (3575), 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-18 19:53:33,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:53:33,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 251 [2022-11-18 19:53:33,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:53:42,465 INFO L130 PetriNetUnfolder]: 1367/5618 cut-off events. [2022-11-18 19:53:42,466 INFO L131 PetriNetUnfolder]: For 30/33 co-relation queries the response was YES. [2022-11-18 19:53:42,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7805 conditions, 5618 events. 1367/5618 cut-off events. For 30/33 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 51961 event pairs, 952 based on Foata normal form. 1/4851 useless extension candidates. Maximal degree in co-relation 7705. Up to 1675 conditions per place. [2022-11-18 19:53:42,498 INFO L137 encePairwiseOnDemand]: 229/251 looper letters, 108 selfloop transitions, 28 changer transitions 0/299 dead transitions. [2022-11-18 19:53:42,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 299 transitions, 904 flow [2022-11-18 19:53:42,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 19:53:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-18 19:53:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3857 transitions. [2022-11-18 19:53:42,508 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7317397078353254 [2022-11-18 19:53:42,508 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3857 transitions. [2022-11-18 19:53:42,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3857 transitions. [2022-11-18 19:53:42,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:53:42,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3857 transitions. [2022-11-18 19:53:42,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 183.66666666666666) internal successors, (3857), 21 states have internal predecessors, (3857), 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-18 19:53:42,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 251.0) internal successors, (5522), 22 states have internal predecessors, (5522), 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-18 19:53:42,532 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 251.0) internal successors, (5522), 22 states have internal predecessors, (5522), 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-18 19:53:42,532 INFO L175 Difference]: Start difference. First operand has 235 places, 227 transitions, 482 flow. Second operand 21 states and 3857 transitions. [2022-11-18 19:53:42,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 299 transitions, 904 flow [2022-11-18 19:53:42,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 299 transitions, 881 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-11-18 19:53:42,545 INFO L231 Difference]: Finished difference. Result has 253 places, 248 transitions, 618 flow [2022-11-18 19:53:42,545 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=618, PETRI_PLACES=253, PETRI_TRANSITIONS=248} [2022-11-18 19:53:42,546 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 20 predicate places. [2022-11-18 19:53:42,546 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 248 transitions, 618 flow [2022-11-18 19:53:42,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 178.75) internal successors, (3575), 20 states have internal predecessors, (3575), 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-18 19:53:42,550 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:53:42,551 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:53:42,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:53:42,551 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 19:53:42,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:42,552 INFO L85 PathProgramCache]: Analyzing trace with hash 689057386, now seen corresponding path program 1 times [2022-11-18 19:53:42,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:42,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239071771] [2022-11-18 19:53:42,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:42,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:44,837 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-18 19:53:44,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:44,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239071771] [2022-11-18 19:53:44,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239071771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:53:44,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:53:44,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-18 19:53:44,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942633084] [2022-11-18 19:53:44,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:53:44,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 19:53:44,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:44,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 19:53:44,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-11-18 19:53:44,844 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 251 [2022-11-18 19:53:44,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 248 transitions, 618 flow. Second operand has 20 states, 20 states have (on average 171.1) internal successors, (3422), 20 states have internal predecessors, (3422), 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-18 19:53:44,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:53:44,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 251 [2022-11-18 19:53:44,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:53:48,060 INFO L130 PetriNetUnfolder]: 2220/7783 cut-off events. [2022-11-18 19:53:48,060 INFO L131 PetriNetUnfolder]: For 888/895 co-relation queries the response was YES. [2022-11-18 19:53:48,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12411 conditions, 7783 events. 2220/7783 cut-off events. For 888/895 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 72994 event pairs, 175 based on Foata normal form. 86/7089 useless extension candidates. Maximal degree in co-relation 12298. Up to 1746 conditions per place. [2022-11-18 19:53:48,116 INFO L137 encePairwiseOnDemand]: 229/251 looper letters, 208 selfloop transitions, 44 changer transitions 0/409 dead transitions. [2022-11-18 19:53:48,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 409 transitions, 1503 flow [2022-11-18 19:53:48,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 19:53:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-11-18 19:53:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3958 transitions. [2022-11-18 19:53:48,125 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7167692864904021 [2022-11-18 19:53:48,126 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3958 transitions. [2022-11-18 19:53:48,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3958 transitions. [2022-11-18 19:53:48,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:53:48,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3958 transitions. [2022-11-18 19:53:48,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 179.9090909090909) internal successors, (3958), 22 states have internal predecessors, (3958), 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-18 19:53:48,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 251.0) internal successors, (5773), 23 states have internal predecessors, (5773), 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-18 19:53:48,148 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 251.0) internal successors, (5773), 23 states have internal predecessors, (5773), 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-18 19:53:48,148 INFO L175 Difference]: Start difference. First operand has 253 places, 248 transitions, 618 flow. Second operand 22 states and 3958 transitions. [2022-11-18 19:53:48,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 409 transitions, 1503 flow [2022-11-18 19:53:48,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 409 transitions, 1488 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-18 19:53:48,166 INFO L231 Difference]: Finished difference. Result has 273 places, 277 transitions, 861 flow [2022-11-18 19:53:48,166 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=861, PETRI_PLACES=273, PETRI_TRANSITIONS=277} [2022-11-18 19:53:48,169 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 40 predicate places. [2022-11-18 19:53:48,169 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 277 transitions, 861 flow [2022-11-18 19:53:48,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 171.1) internal successors, (3422), 20 states have internal predecessors, (3422), 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-18 19:53:48,171 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:53:48,171 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:53:48,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:53:48,171 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 19:53:48,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:48,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1840558730, now seen corresponding path program 1 times [2022-11-18 19:53:48,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:48,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600417587] [2022-11-18 19:53:48,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:48,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:48,253 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-18 19:53:48,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:48,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600417587] [2022-11-18 19:53:48,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600417587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:53:48,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:53:48,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:53:48,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973652569] [2022-11-18 19:53:48,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:53:48,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:53:48,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:48,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:53:48,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:53:48,263 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 251 [2022-11-18 19:53:48,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 277 transitions, 861 flow. Second operand has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 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-18 19:53:48,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:53:48,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 251 [2022-11-18 19:53:48,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:53:48,889 INFO L130 PetriNetUnfolder]: 220/3315 cut-off events. [2022-11-18 19:53:48,889 INFO L131 PetriNetUnfolder]: For 227/229 co-relation queries the response was YES. [2022-11-18 19:53:48,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4051 conditions, 3315 events. 220/3315 cut-off events. For 227/229 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 29855 event pairs, 15 based on Foata normal form. 0/2895 useless extension candidates. Maximal degree in co-relation 3961. Up to 224 conditions per place. [2022-11-18 19:53:48,930 INFO L137 encePairwiseOnDemand]: 246/251 looper letters, 15 selfloop transitions, 4 changer transitions 0/284 dead transitions. [2022-11-18 19:53:48,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 284 transitions, 915 flow [2022-11-18 19:53:48,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:53:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-18 19:53:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 944 transitions. [2022-11-18 19:53:48,936 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9402390438247012 [2022-11-18 19:53:48,936 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 944 transitions. [2022-11-18 19:53:48,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 944 transitions. [2022-11-18 19:53:48,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:53:48,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 944 transitions. [2022-11-18 19:53:48,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 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-18 19:53:48,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 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-18 19:53:48,942 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 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-18 19:53:48,942 INFO L175 Difference]: Start difference. First operand has 273 places, 277 transitions, 861 flow. Second operand 4 states and 944 transitions. [2022-11-18 19:53:48,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 284 transitions, 915 flow [2022-11-18 19:53:48,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 284 transitions, 882 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-11-18 19:53:48,951 INFO L231 Difference]: Finished difference. Result has 270 places, 280 transitions, 856 flow [2022-11-18 19:53:48,951 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=856, PETRI_PLACES=270, PETRI_TRANSITIONS=280} [2022-11-18 19:53:48,952 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 37 predicate places. [2022-11-18 19:53:48,952 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 280 transitions, 856 flow [2022-11-18 19:53:48,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 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-18 19:53:48,953 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:53:48,953 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:53:48,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:53:48,954 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 19:53:48,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:48,954 INFO L85 PathProgramCache]: Analyzing trace with hash -2061236017, now seen corresponding path program 1 times [2022-11-18 19:53:48,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:48,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925752741] [2022-11-18 19:53:48,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:48,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:49,046 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-18 19:53:49,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:49,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925752741] [2022-11-18 19:53:49,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925752741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:53:49,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:53:49,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:53:49,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885602350] [2022-11-18 19:53:49,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:53:49,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:53:49,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:49,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:53:49,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:53:49,050 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 251 [2022-11-18 19:53:49,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 280 transitions, 856 flow. Second operand has 4 states, 4 states have (on average 229.75) internal successors, (919), 4 states have internal predecessors, (919), 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-18 19:53:49,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:53:49,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 251 [2022-11-18 19:53:49,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:53:49,904 INFO L130 PetriNetUnfolder]: 372/4921 cut-off events. [2022-11-18 19:53:49,905 INFO L131 PetriNetUnfolder]: For 323/333 co-relation queries the response was YES. [2022-11-18 19:53:49,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6383 conditions, 4921 events. 372/4921 cut-off events. For 323/333 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 51755 event pairs, 31 based on Foata normal form. 0/4345 useless extension candidates. Maximal degree in co-relation 6298. Up to 486 conditions per place. [2022-11-18 19:53:49,943 INFO L137 encePairwiseOnDemand]: 244/251 looper letters, 21 selfloop transitions, 4 changer transitions 0/290 dead transitions. [2022-11-18 19:53:49,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 290 transitions, 929 flow [2022-11-18 19:53:49,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:53:49,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 19:53:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1168 transitions. [2022-11-18 19:53:49,946 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9306772908366534 [2022-11-18 19:53:49,946 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1168 transitions. [2022-11-18 19:53:49,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1168 transitions. [2022-11-18 19:53:49,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:53:49,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1168 transitions. [2022-11-18 19:53:49,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 233.6) internal successors, (1168), 5 states have internal predecessors, (1168), 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-18 19:53:49,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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-18 19:53:49,968 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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-18 19:53:49,968 INFO L175 Difference]: Start difference. First operand has 270 places, 280 transitions, 856 flow. Second operand 5 states and 1168 transitions. [2022-11-18 19:53:49,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 290 transitions, 929 flow [2022-11-18 19:53:49,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 290 transitions, 927 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 19:53:49,980 INFO L231 Difference]: Finished difference. Result has 276 places, 283 transitions, 886 flow [2022-11-18 19:53:49,983 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=886, PETRI_PLACES=276, PETRI_TRANSITIONS=283} [2022-11-18 19:53:49,983 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 43 predicate places. [2022-11-18 19:53:49,984 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 283 transitions, 886 flow [2022-11-18 19:53:49,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 229.75) internal successors, (919), 4 states have internal predecessors, (919), 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-18 19:53:49,986 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:53:49,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, 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, 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-18 19:53:49,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:53:49,986 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 19:53:49,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:49,988 INFO L85 PathProgramCache]: Analyzing trace with hash 223433814, now seen corresponding path program 1 times [2022-11-18 19:53:49,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:49,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451325876] [2022-11-18 19:53:49,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:49,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:53,286 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-18 19:53:53,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:53,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451325876] [2022-11-18 19:53:53,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451325876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:53:53,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:53:53,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-18 19:53:53,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505983645] [2022-11-18 19:53:53,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:53:53,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 19:53:53,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:53,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 19:53:53,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-11-18 19:53:53,292 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 251 [2022-11-18 19:53:53,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 283 transitions, 886 flow. Second operand has 20 states, 20 states have (on average 178.9) internal successors, (3578), 20 states have internal predecessors, (3578), 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-18 19:53:53,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:53:53,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 251 [2022-11-18 19:53:53,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:54:00,272 INFO L130 PetriNetUnfolder]: 6682/26255 cut-off events. [2022-11-18 19:54:00,273 INFO L131 PetriNetUnfolder]: For 4451/4518 co-relation queries the response was YES. [2022-11-18 19:54:00,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43974 conditions, 26255 events. 6682/26255 cut-off events. For 4451/4518 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 328684 event pairs, 4290 based on Foata normal form. 11/23509 useless extension candidates. Maximal degree in co-relation 43861. Up to 8780 conditions per place. [2022-11-18 19:54:00,502 INFO L137 encePairwiseOnDemand]: 228/251 looper letters, 134 selfloop transitions, 34 changer transitions 0/350 dead transitions. [2022-11-18 19:54:00,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 350 transitions, 1395 flow [2022-11-18 19:54:00,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 19:54:00,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-18 19:54:00,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3861 transitions. [2022-11-18 19:54:00,514 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.732498577120091 [2022-11-18 19:54:00,514 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3861 transitions. [2022-11-18 19:54:00,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3861 transitions. [2022-11-18 19:54:00,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:54:00,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3861 transitions. [2022-11-18 19:54:00,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 183.85714285714286) internal successors, (3861), 21 states have internal predecessors, (3861), 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-18 19:54:00,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 251.0) internal successors, (5522), 22 states have internal predecessors, (5522), 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-18 19:54:00,539 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 251.0) internal successors, (5522), 22 states have internal predecessors, (5522), 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-18 19:54:00,540 INFO L175 Difference]: Start difference. First operand has 276 places, 283 transitions, 886 flow. Second operand 21 states and 3861 transitions. [2022-11-18 19:54:00,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 350 transitions, 1395 flow [2022-11-18 19:54:00,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 350 transitions, 1393 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 19:54:00,609 INFO L231 Difference]: Finished difference. Result has 300 places, 293 transitions, 1031 flow [2022-11-18 19:54:00,609 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1031, PETRI_PLACES=300, PETRI_TRANSITIONS=293} [2022-11-18 19:54:00,612 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 67 predicate places. [2022-11-18 19:54:00,613 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 293 transitions, 1031 flow [2022-11-18 19:54:00,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 178.9) internal successors, (3578), 20 states have internal predecessors, (3578), 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-18 19:54:00,614 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:54:00,615 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, 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, 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-18 19:54:00,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:54:00,615 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 19:54:00,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:00,616 INFO L85 PathProgramCache]: Analyzing trace with hash 302890185, now seen corresponding path program 1 times [2022-11-18 19:54:00,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:00,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940047182] [2022-11-18 19:54:00,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:00,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:02,189 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-18 19:54:02,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:02,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940047182] [2022-11-18 19:54:02,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940047182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:02,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:02,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-18 19:54:02,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61889641] [2022-11-18 19:54:02,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:02,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 19:54:02,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:02,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 19:54:02,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-11-18 19:54:02,194 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 251 [2022-11-18 19:54:02,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 293 transitions, 1031 flow. Second operand has 19 states, 19 states have (on average 171.3684210526316) internal successors, (3256), 19 states have internal predecessors, (3256), 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-18 19:54:02,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:54:02,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 251 [2022-11-18 19:54:02,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:54:08,234 INFO L130 PetriNetUnfolder]: 8327/30061 cut-off events. [2022-11-18 19:54:08,234 INFO L131 PetriNetUnfolder]: For 7582/7657 co-relation queries the response was YES. [2022-11-18 19:54:08,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54263 conditions, 30061 events. 8327/30061 cut-off events. For 7582/7657 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 376689 event pairs, 1616 based on Foata normal form. 254/28087 useless extension candidates. Maximal degree in co-relation 54130. Up to 8392 conditions per place. [2022-11-18 19:54:08,501 INFO L137 encePairwiseOnDemand]: 228/251 looper letters, 215 selfloop transitions, 59 changer transitions 0/450 dead transitions. [2022-11-18 19:54:08,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 450 transitions, 2035 flow [2022-11-18 19:54:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 19:54:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-18 19:54:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3783 transitions. [2022-11-18 19:54:08,518 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7177006260671599 [2022-11-18 19:54:08,518 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3783 transitions. [2022-11-18 19:54:08,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3783 transitions. [2022-11-18 19:54:08,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:54:08,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3783 transitions. [2022-11-18 19:54:08,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 180.14285714285714) internal successors, (3783), 21 states have internal predecessors, (3783), 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-18 19:54:08,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 251.0) internal successors, (5522), 22 states have internal predecessors, (5522), 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-18 19:54:08,544 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 251.0) internal successors, (5522), 22 states have internal predecessors, (5522), 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-18 19:54:08,545 INFO L175 Difference]: Start difference. First operand has 300 places, 293 transitions, 1031 flow. Second operand 21 states and 3783 transitions. [2022-11-18 19:54:08,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 450 transitions, 2035 flow [2022-11-18 19:54:08,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 450 transitions, 2001 flow, removed 2 selfloop flow, removed 13 redundant places. [2022-11-18 19:54:08,762 INFO L231 Difference]: Finished difference. Result has 314 places, 317 transitions, 1335 flow [2022-11-18 19:54:08,763 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1335, PETRI_PLACES=314, PETRI_TRANSITIONS=317} [2022-11-18 19:54:08,765 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 81 predicate places. [2022-11-18 19:54:08,765 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 317 transitions, 1335 flow [2022-11-18 19:54:08,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 171.3684210526316) internal successors, (3256), 19 states have internal predecessors, (3256), 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-18 19:54:08,766 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:54:08,767 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, 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, 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-18 19:54:08,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 19:54:08,767 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 19:54:08,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:08,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1284739427, now seen corresponding path program 2 times [2022-11-18 19:54:08,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:08,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805743923] [2022-11-18 19:54:08,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:08,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:10,309 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-18 19:54:10,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:10,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805743923] [2022-11-18 19:54:10,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805743923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:10,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:10,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-18 19:54:10,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021742092] [2022-11-18 19:54:10,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:10,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 19:54:10,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:10,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 19:54:10,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-11-18 19:54:10,314 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 251 [2022-11-18 19:54:10,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 317 transitions, 1335 flow. Second operand has 19 states, 19 states have (on average 171.3684210526316) internal successors, (3256), 19 states have internal predecessors, (3256), 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-18 19:54:10,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:54:10,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 251 [2022-11-18 19:54:10,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:54:17,116 INFO L130 PetriNetUnfolder]: 8939/31692 cut-off events. [2022-11-18 19:54:17,116 INFO L131 PetriNetUnfolder]: For 16576/16717 co-relation queries the response was YES. [2022-11-18 19:54:17,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60634 conditions, 31692 events. 8939/31692 cut-off events. For 16576/16717 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 398275 event pairs, 1184 based on Foata normal form. 316/29602 useless extension candidates. Maximal degree in co-relation 60494. Up to 6856 conditions per place. [2022-11-18 19:54:17,440 INFO L137 encePairwiseOnDemand]: 230/251 looper letters, 194 selfloop transitions, 64 changer transitions 0/434 dead transitions. [2022-11-18 19:54:17,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 434 transitions, 2170 flow [2022-11-18 19:54:17,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 19:54:17,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-18 19:54:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3251 transitions. [2022-11-18 19:54:17,447 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7195661797255423 [2022-11-18 19:54:17,451 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3251 transitions. [2022-11-18 19:54:17,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3251 transitions. [2022-11-18 19:54:17,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:54:17,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3251 transitions. [2022-11-18 19:54:17,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 180.61111111111111) internal successors, (3251), 18 states have internal predecessors, (3251), 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-18 19:54:17,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 251.0) internal successors, (4769), 19 states have internal predecessors, (4769), 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-18 19:54:17,468 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 251.0) internal successors, (4769), 19 states have internal predecessors, (4769), 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-18 19:54:17,468 INFO L175 Difference]: Start difference. First operand has 314 places, 317 transitions, 1335 flow. Second operand 18 states and 3251 transitions. [2022-11-18 19:54:17,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 434 transitions, 2170 flow [2022-11-18 19:54:17,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 434 transitions, 2125 flow, removed 13 selfloop flow, removed 9 redundant places. [2022-11-18 19:54:17,670 INFO L231 Difference]: Finished difference. Result has 326 places, 325 transitions, 1548 flow [2022-11-18 19:54:17,671 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1548, PETRI_PLACES=326, PETRI_TRANSITIONS=325} [2022-11-18 19:54:17,672 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 93 predicate places. [2022-11-18 19:54:17,672 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 325 transitions, 1548 flow [2022-11-18 19:54:17,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 171.3684210526316) internal successors, (3256), 19 states have internal predecessors, (3256), 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-18 19:54:17,674 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:54:17,674 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, 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, 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-18 19:54:17,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 19:54:17,675 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 19:54:17,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:17,675 INFO L85 PathProgramCache]: Analyzing trace with hash -777952197, now seen corresponding path program 1 times [2022-11-18 19:54:17,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:17,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45727276] [2022-11-18 19:54:17,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:17,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:17,748 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-18 19:54:17,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:17,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45727276] [2022-11-18 19:54:17,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45727276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:17,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:17,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:54:17,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287155687] [2022-11-18 19:54:17,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:17,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:54:17,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:17,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:54:17,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:54:17,751 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 251 [2022-11-18 19:54:17,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 325 transitions, 1548 flow. Second operand has 4 states, 4 states have (on average 229.75) internal successors, (919), 4 states have internal predecessors, (919), 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-18 19:54:17,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:54:17,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 251 [2022-11-18 19:54:17,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:54:19,155 INFO L130 PetriNetUnfolder]: 467/7570 cut-off events. [2022-11-18 19:54:19,155 INFO L131 PetriNetUnfolder]: For 1927/2285 co-relation queries the response was YES. [2022-11-18 19:54:19,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10420 conditions, 7570 events. 467/7570 cut-off events. For 1927/2285 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 86377 event pairs, 23 based on Foata normal form. 44/6948 useless extension candidates. Maximal degree in co-relation 10354. Up to 231 conditions per place. [2022-11-18 19:54:19,236 INFO L137 encePairwiseOnDemand]: 244/251 looper letters, 21 selfloop transitions, 4 changer transitions 0/335 dead transitions. [2022-11-18 19:54:19,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 335 transitions, 1624 flow [2022-11-18 19:54:19,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:54:19,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 19:54:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1168 transitions. [2022-11-18 19:54:19,242 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9306772908366534 [2022-11-18 19:54:19,242 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1168 transitions. [2022-11-18 19:54:19,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1168 transitions. [2022-11-18 19:54:19,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:54:19,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1168 transitions. [2022-11-18 19:54:19,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 233.6) internal successors, (1168), 5 states have internal predecessors, (1168), 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-18 19:54:19,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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-18 19:54:19,249 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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-18 19:54:19,249 INFO L175 Difference]: Start difference. First operand has 326 places, 325 transitions, 1548 flow. Second operand 5 states and 1168 transitions. [2022-11-18 19:54:19,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 335 transitions, 1624 flow [2022-11-18 19:54:19,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 335 transitions, 1578 flow, removed 7 selfloop flow, removed 10 redundant places. [2022-11-18 19:54:19,495 INFO L231 Difference]: Finished difference. Result has 323 places, 328 transitions, 1534 flow [2022-11-18 19:54:19,496 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1534, PETRI_PLACES=323, PETRI_TRANSITIONS=328} [2022-11-18 19:54:19,496 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 90 predicate places. [2022-11-18 19:54:19,497 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 328 transitions, 1534 flow [2022-11-18 19:54:19,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 229.75) internal successors, (919), 4 states have internal predecessors, (919), 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-18 19:54:19,497 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:54:19,497 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, 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, 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-18 19:54:19,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 19:54:19,497 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 19:54:19,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:19,498 INFO L85 PathProgramCache]: Analyzing trace with hash -180825677, now seen corresponding path program 1 times [2022-11-18 19:54:19,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:19,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382094419] [2022-11-18 19:54:19,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:19,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:19,656 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-18 19:54:19,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:19,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382094419] [2022-11-18 19:54:19,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382094419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:19,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:19,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:54:19,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640347337] [2022-11-18 19:54:19,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:19,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:54:19,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:19,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:54:19,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:19,660 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 251 [2022-11-18 19:54:19,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 328 transitions, 1534 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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-18 19:54:19,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:54:19,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 251 [2022-11-18 19:54:19,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:54:19,844 INFO L130 PetriNetUnfolder]: 49/984 cut-off events. [2022-11-18 19:54:19,844 INFO L131 PetriNetUnfolder]: For 392/393 co-relation queries the response was YES. [2022-11-18 19:54:19,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 984 events. 49/984 cut-off events. For 392/393 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4528 event pairs, 2 based on Foata normal form. 0/922 useless extension candidates. Maximal degree in co-relation 1519. Up to 24 conditions per place. [2022-11-18 19:54:19,851 INFO L137 encePairwiseOnDemand]: 247/251 looper letters, 7 selfloop transitions, 2 changer transitions 5/295 dead transitions. [2022-11-18 19:54:19,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 295 transitions, 1247 flow [2022-11-18 19:54:19,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:54:19,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:54:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2022-11-18 19:54:19,853 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.949535192563081 [2022-11-18 19:54:19,854 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 715 transitions. [2022-11-18 19:54:19,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 715 transitions. [2022-11-18 19:54:19,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:54:19,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 715 transitions. [2022-11-18 19:54:19,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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-18 19:54:19,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 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-18 19:54:19,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 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-18 19:54:19,858 INFO L175 Difference]: Start difference. First operand has 323 places, 328 transitions, 1534 flow. Second operand 3 states and 715 transitions. [2022-11-18 19:54:19,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 295 transitions, 1247 flow [2022-11-18 19:54:19,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 295 transitions, 1222 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-11-18 19:54:19,869 INFO L231 Difference]: Finished difference. Result has 318 places, 289 transitions, 1191 flow [2022-11-18 19:54:19,870 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=318, PETRI_TRANSITIONS=289} [2022-11-18 19:54:19,871 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 85 predicate places. [2022-11-18 19:54:19,872 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 289 transitions, 1191 flow [2022-11-18 19:54:19,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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-18 19:54:19,872 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:54:19,872 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:19,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 19:54:19,873 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 19:54:19,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:19,873 INFO L85 PathProgramCache]: Analyzing trace with hash -477690277, now seen corresponding path program 1 times [2022-11-18 19:54:19,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:19,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029644230] [2022-11-18 19:54:19,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:19,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:54:21,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:21,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029644230] [2022-11-18 19:54:21,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029644230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:21,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:21,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-18 19:54:21,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138769847] [2022-11-18 19:54:21,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:21,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 19:54:21,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:21,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 19:54:21,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-11-18 19:54:21,287 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 251 [2022-11-18 19:54:21,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 289 transitions, 1191 flow. Second operand has 17 states, 17 states have (on average 183.64705882352942) internal successors, (3122), 17 states have internal predecessors, (3122), 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-18 19:54:21,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:54:21,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 251 [2022-11-18 19:54:21,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:54:22,531 INFO L130 PetriNetUnfolder]: 331/2028 cut-off events. [2022-11-18 19:54:22,531 INFO L131 PetriNetUnfolder]: For 1030/1034 co-relation queries the response was YES. [2022-11-18 19:54:22,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3845 conditions, 2028 events. 331/2028 cut-off events. For 1030/1034 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 12827 event pairs, 237 based on Foata normal form. 2/1909 useless extension candidates. Maximal degree in co-relation 3712. Up to 643 conditions per place. [2022-11-18 19:54:22,543 INFO L137 encePairwiseOnDemand]: 234/251 looper letters, 77 selfloop transitions, 30 changer transitions 0/297 dead transitions. [2022-11-18 19:54:22,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 297 transitions, 1419 flow [2022-11-18 19:54:22,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 19:54:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-18 19:54:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2799 transitions. [2022-11-18 19:54:22,548 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7434262948207171 [2022-11-18 19:54:22,548 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2799 transitions. [2022-11-18 19:54:22,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2799 transitions. [2022-11-18 19:54:22,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:54:22,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2799 transitions. [2022-11-18 19:54:22,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 186.6) internal successors, (2799), 15 states have internal predecessors, (2799), 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-18 19:54:22,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 251.0) internal successors, (4016), 16 states have internal predecessors, (4016), 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-18 19:54:22,561 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 251.0) internal successors, (4016), 16 states have internal predecessors, (4016), 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-18 19:54:22,561 INFO L175 Difference]: Start difference. First operand has 318 places, 289 transitions, 1191 flow. Second operand 15 states and 2799 transitions. [2022-11-18 19:54:22,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 297 transitions, 1419 flow [2022-11-18 19:54:22,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 297 transitions, 1415 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 19:54:22,574 INFO L231 Difference]: Finished difference. Result has 332 places, 292 transitions, 1277 flow [2022-11-18 19:54:22,575 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1277, PETRI_PLACES=332, PETRI_TRANSITIONS=292} [2022-11-18 19:54:22,576 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 99 predicate places. [2022-11-18 19:54:22,576 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 292 transitions, 1277 flow [2022-11-18 19:54:22,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 183.64705882352942) internal successors, (3122), 17 states have internal predecessors, (3122), 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-18 19:54:22,577 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:54:22,577 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:22,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 19:54:22,578 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 19:54:22,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:22,578 INFO L85 PathProgramCache]: Analyzing trace with hash 253624126, now seen corresponding path program 1 times [2022-11-18 19:54:22,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:22,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967480220] [2022-11-18 19:54:22,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:22,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:54:24,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:24,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967480220] [2022-11-18 19:54:24,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967480220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:24,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:24,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-18 19:54:24,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681449542] [2022-11-18 19:54:24,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:24,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 19:54:24,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:24,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 19:54:24,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-11-18 19:54:24,045 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 251 [2022-11-18 19:54:24,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 292 transitions, 1277 flow. Second operand has 18 states, 18 states have (on average 174.94444444444446) internal successors, (3149), 18 states have internal predecessors, (3149), 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-18 19:54:24,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:54:24,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 251 [2022-11-18 19:54:24,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:54:25,533 INFO L130 PetriNetUnfolder]: 317/1966 cut-off events. [2022-11-18 19:54:25,533 INFO L131 PetriNetUnfolder]: For 1124/1129 co-relation queries the response was YES. [2022-11-18 19:54:25,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3813 conditions, 1966 events. 317/1966 cut-off events. For 1124/1129 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 12435 event pairs, 109 based on Foata normal form. 7/1863 useless extension candidates. Maximal degree in co-relation 3663. Up to 477 conditions per place. [2022-11-18 19:54:25,545 INFO L137 encePairwiseOnDemand]: 235/251 looper letters, 95 selfloop transitions, 26 changer transitions 0/304 dead transitions. [2022-11-18 19:54:25,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 304 transitions, 1536 flow [2022-11-18 19:54:25,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 19:54:25,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-18 19:54:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2676 transitions. [2022-11-18 19:54:25,551 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7107569721115538 [2022-11-18 19:54:25,551 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2676 transitions. [2022-11-18 19:54:25,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2676 transitions. [2022-11-18 19:54:25,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:54:25,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2676 transitions. [2022-11-18 19:54:25,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 178.4) internal successors, (2676), 15 states have internal predecessors, (2676), 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-18 19:54:25,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 251.0) internal successors, (4016), 16 states have internal predecessors, (4016), 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-18 19:54:25,566 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 251.0) internal successors, (4016), 16 states have internal predecessors, (4016), 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-18 19:54:25,566 INFO L175 Difference]: Start difference. First operand has 332 places, 292 transitions, 1277 flow. Second operand 15 states and 2676 transitions. [2022-11-18 19:54:25,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 304 transitions, 1536 flow [2022-11-18 19:54:25,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 304 transitions, 1502 flow, removed 2 selfloop flow, removed 11 redundant places. [2022-11-18 19:54:25,582 INFO L231 Difference]: Finished difference. Result has 337 places, 292 transitions, 1305 flow [2022-11-18 19:54:25,583 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1305, PETRI_PLACES=337, PETRI_TRANSITIONS=292} [2022-11-18 19:54:25,584 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 104 predicate places. [2022-11-18 19:54:25,584 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 292 transitions, 1305 flow [2022-11-18 19:54:25,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 174.94444444444446) internal successors, (3149), 18 states have internal predecessors, (3149), 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-18 19:54:25,585 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:54:25,585 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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-18 19:54:25,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 19:54:25,586 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 19:54:25,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:25,587 INFO L85 PathProgramCache]: Analyzing trace with hash 51128915, now seen corresponding path program 1 times [2022-11-18 19:54:25,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:25,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703498132] [2022-11-18 19:54:25,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:25,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:29,385 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:54:29,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:29,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703498132] [2022-11-18 19:54:29,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703498132] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:54:29,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333643069] [2022-11-18 19:54:29,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:29,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:29,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:29,388 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:54:29,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 19:54:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:29,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-18 19:54:29,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:54:29,853 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:54:29,853 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-18 19:54:30,133 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 13 treesize of output 9 [2022-11-18 19:54:30,229 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 23 treesize of output 22 [2022-11-18 19:54:30,766 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 25 treesize of output 25 [2022-11-18 19:54:31,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:54:31,334 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-18 19:54:31,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-18 19:54:31,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:31,634 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:54:31,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-18 19:54:32,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-18 19:54:32,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:32,337 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 25 treesize of output 25 [2022-11-18 19:54:32,721 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-18 19:54:32,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-18 19:54:32,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-18 19:54:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:54:32,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:54:33,588 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_345 Int) (v_ArrVal_343 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_344 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_343)) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_345) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_343 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) is different from false [2022-11-18 19:54:33,794 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_345 Int) (v_ArrVal_343 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_344 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_343)) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_343) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_345) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse2 (+ 84 |c_~#queue~0.offset|)))))))) is different from false [2022-11-18 19:54:33,986 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse2 .cse3))) (or (forall ((v_ArrVal_345 Int) (v_ArrVal_343 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_344 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_343)) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_343) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_345) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse1 (+ 84 |c_~#queue~0.offset|))))))) (= .cse0 20)))) is different from false [2022-11-18 19:54:34,323 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse2 .cse3))) (or (= .cse0 20) (forall ((v_ArrVal_345 Int) (v_ArrVal_343 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_344 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_341) .cse3 v_ArrVal_343)) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_343) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem37#1| 1) v_ArrVal_341) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse1 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_345) (+ 88 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-11-18 19:54:34,870 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_345 Int) (v_ArrVal_343 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse0 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_338)) (.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_341) .cse4 v_ArrVal_343)) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|)) (.cse3 (select .cse0 .cse4))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_341) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_345) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse3 1) v_ArrVal_343) (= .cse3 20))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse5 .cse4)))))) is different from false [2022-11-18 19:54:34,992 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_345 Int) (v_ArrVal_343 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4)) v_ArrVal_338)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse2 .cse3 v_ArrVal_341) .cse5 v_ArrVal_343)) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|)) (.cse0 (select .cse2 .cse5))) (or (< (+ .cse0 1) v_ArrVal_343) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_345) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ 1 (select .cse2 .cse3)) v_ArrVal_341) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse4 .cse5))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse1 (+ 84 |c_~#queue~0.offset|)))) (= .cse0 20)))))) is different from false [2022-11-18 19:54:43,839 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_345 Int) (v_ArrVal_343 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_337))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4) |c_~#queue~0.offset|) v_ArrVal_338)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_341) .cse3 v_ArrVal_343)) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|)) (.cse4 (select .cse0 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_341) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse2 .cse3))) (= 20 .cse4) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_345) .cse1) 2147483647) (< (+ .cse4 1) v_ArrVal_343) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse5 .cse3))))))))) is different from false [2022-11-18 19:54:44,722 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_345 Int) (v_ArrVal_343 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_338 Int) (v_ArrVal_336 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_336)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_337))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4) |c_~#queue~0.offset|) v_ArrVal_338)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse3 .cse4)) (.cse1 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_341) .cse4 v_ArrVal_343)) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_343) (not (<= v_ArrVal_336 0)) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_345) .cse2) 2147483647) (= 20 .cse0) (< (+ (select .cse3 .cse2) 1) v_ArrVal_341) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse1 .cse4))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse5 .cse4))))))))) is different from false [2022-11-18 19:54:44,752 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:44,753 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 2 case distinctions, treesize of input 283 treesize of output 183 [2022-11-18 19:54:44,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:44,775 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 349 treesize of output 343 [2022-11-18 19:54:44,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 178 [2022-11-18 19:54:44,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 157 [2022-11-18 19:54:44,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-18 19:54:45,369 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:45,370 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 147 treesize of output 147 [2022-11-18 19:54:46,210 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-18 19:54:46,211 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 25 treesize of output 38 [2022-11-18 19:54:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-18 19:54:46,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333643069] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:54:46,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:54:46,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 29] total 80 [2022-11-18 19:54:46,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513571235] [2022-11-18 19:54:46,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:54:46,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-18 19:54:46,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:46,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-18 19:54:46,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=607, Invalid=4637, Unknown=44, NotChecked=1192, Total=6480 [2022-11-18 19:54:46,302 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 251 [2022-11-18 19:54:46,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 292 transitions, 1305 flow. Second operand has 81 states, 81 states have (on average 160.14814814814815) internal successors, (12972), 81 states have internal predecessors, (12972), 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-18 19:54:46,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:54:46,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 251 [2022-11-18 19:54:46,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:55:12,098 WARN L233 SmtUtils]: Spent 16.23s on a formula simplification. DAG size of input: 87 DAG size of output: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:55:45,032 WARN L233 SmtUtils]: Spent 10.35s on a formula simplification. DAG size of input: 73 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:55:58,735 WARN L233 SmtUtils]: Spent 6.91s on a formula simplification. DAG size of input: 74 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:56:11,334 INFO L130 PetriNetUnfolder]: 809/4028 cut-off events. [2022-11-18 19:56:11,334 INFO L131 PetriNetUnfolder]: For 2437/2441 co-relation queries the response was YES. [2022-11-18 19:56:11,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8183 conditions, 4028 events. 809/4028 cut-off events. For 2437/2441 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 29961 event pairs, 364 based on Foata normal form. 10/3820 useless extension candidates. Maximal degree in co-relation 8030. Up to 755 conditions per place. [2022-11-18 19:56:11,380 INFO L137 encePairwiseOnDemand]: 212/251 looper letters, 210 selfloop transitions, 120 changer transitions 0/481 dead transitions. [2022-11-18 19:56:11,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 481 transitions, 2942 flow [2022-11-18 19:56:11,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-18 19:56:11,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-11-18 19:56:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 9612 transitions. [2022-11-18 19:56:11,399 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6490647579174826 [2022-11-18 19:56:11,399 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 9612 transitions. [2022-11-18 19:56:11,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 9612 transitions. [2022-11-18 19:56:11,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:56:11,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 9612 transitions. [2022-11-18 19:56:11,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 162.91525423728814) internal successors, (9612), 59 states have internal predecessors, (9612), 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-18 19:56:11,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 251.0) internal successors, (15060), 60 states have internal predecessors, (15060), 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-18 19:56:11,447 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 251.0) internal successors, (15060), 60 states have internal predecessors, (15060), 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-18 19:56:11,447 INFO L175 Difference]: Start difference. First operand has 337 places, 292 transitions, 1305 flow. Second operand 59 states and 9612 transitions. [2022-11-18 19:56:11,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 481 transitions, 2942 flow [2022-11-18 19:56:11,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 481 transitions, 2885 flow, removed 12 selfloop flow, removed 13 redundant places. [2022-11-18 19:56:11,476 INFO L231 Difference]: Finished difference. Result has 404 places, 378 transitions, 2324 flow [2022-11-18 19:56:11,477 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1266, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=2324, PETRI_PLACES=404, PETRI_TRANSITIONS=378} [2022-11-18 19:56:11,478 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 171 predicate places. [2022-11-18 19:56:11,478 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 378 transitions, 2324 flow [2022-11-18 19:56:11,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 160.14814814814815) internal successors, (12972), 81 states have internal predecessors, (12972), 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-18 19:56:11,481 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:56:11,481 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:56:11,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 19:56:11,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 19:56:11,687 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 19:56:11,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:11,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1584996986, now seen corresponding path program 1 times [2022-11-18 19:56:11,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:11,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092819465] [2022-11-18 19:56:11,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:11,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:13,325 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:13,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:13,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092819465] [2022-11-18 19:56:13,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092819465] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:56:13,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520136437] [2022-11-18 19:56:13,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:13,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:56:13,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:56:13,327 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:56:13,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 19:56:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:13,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-18 19:56:13,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:14,416 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 13 treesize of output 9 [2022-11-18 19:56:14,708 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 25 treesize of output 24 [2022-11-18 19:56:14,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:56:14,920 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-18 19:56:15,499 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-18 19:56:15,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-18 19:56:15,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-18 19:56:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:15,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:56:16,243 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_407 (Array Int Int)) (v_ArrVal_408 Int)) (or (< (+ v_ArrVal_408 2147483648) 0) (< 0 (+ (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_407) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_408) (+ 88 |c_~#queue~0.offset|)) 2147483650)))) is different from false [2022-11-18 19:56:16,533 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:56:16,534 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 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-18 19:56:16,544 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:56:16,544 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 56 treesize of output 60 [2022-11-18 19:56:16,552 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 32 treesize of output 28 [2022-11-18 19:56:16,568 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 10 treesize of output 6 [2022-11-18 19:56:16,585 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:56:16,586 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 48 treesize of output 48 [2022-11-18 19:56:17,055 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:17,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520136437] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:56:17,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:56:17,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 50 [2022-11-18 19:56:17,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148539638] [2022-11-18 19:56:17,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:56:17,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-18 19:56:17,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:17,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-18 19:56:17,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=2189, Unknown=7, NotChecked=96, Total=2550 [2022-11-18 19:56:17,067 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 251 [2022-11-18 19:56:17,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 378 transitions, 2324 flow. Second operand has 51 states, 51 states have (on average 181.07843137254903) internal successors, (9235), 51 states have internal predecessors, (9235), 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-18 19:56:17,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:56:17,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 251 [2022-11-18 19:56:17,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:56:25,150 INFO L130 PetriNetUnfolder]: 1508/9290 cut-off events. [2022-11-18 19:56:25,151 INFO L131 PetriNetUnfolder]: For 5891/5892 co-relation queries the response was YES. [2022-11-18 19:56:25,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17809 conditions, 9290 events. 1508/9290 cut-off events. For 5891/5892 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 88147 event pairs, 478 based on Foata normal form. 26/8867 useless extension candidates. Maximal degree in co-relation 17643. Up to 1162 conditions per place. [2022-11-18 19:56:25,271 INFO L137 encePairwiseOnDemand]: 226/251 looper letters, 232 selfloop transitions, 183 changer transitions 0/609 dead transitions. [2022-11-18 19:56:25,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 609 transitions, 4457 flow [2022-11-18 19:56:25,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-18 19:56:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-11-18 19:56:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 8275 transitions. [2022-11-18 19:56:25,285 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7326250553342187 [2022-11-18 19:56:25,285 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 8275 transitions. [2022-11-18 19:56:25,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 8275 transitions. [2022-11-18 19:56:25,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:56:25,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 8275 transitions. [2022-11-18 19:56:25,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 183.88888888888889) internal successors, (8275), 45 states have internal predecessors, (8275), 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-18 19:56:25,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 251.0) internal successors, (11546), 46 states have internal predecessors, (11546), 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-18 19:56:25,317 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 251.0) internal successors, (11546), 46 states have internal predecessors, (11546), 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-18 19:56:25,317 INFO L175 Difference]: Start difference. First operand has 404 places, 378 transitions, 2324 flow. Second operand 45 states and 8275 transitions. [2022-11-18 19:56:25,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 609 transitions, 4457 flow [2022-11-18 19:56:25,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 609 transitions, 3876 flow, removed 245 selfloop flow, removed 23 redundant places. [2022-11-18 19:56:25,385 INFO L231 Difference]: Finished difference. Result has 440 places, 490 transitions, 3224 flow [2022-11-18 19:56:25,386 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1870, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=3224, PETRI_PLACES=440, PETRI_TRANSITIONS=490} [2022-11-18 19:56:25,386 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 207 predicate places. [2022-11-18 19:56:25,387 INFO L495 AbstractCegarLoop]: Abstraction has has 440 places, 490 transitions, 3224 flow [2022-11-18 19:56:25,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 181.07843137254903) internal successors, (9235), 51 states have internal predecessors, (9235), 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-18 19:56:25,389 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:56:25,389 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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-18 19:56:25,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 19:56:25,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:56:25,595 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 19:56:25,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:25,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1750094602, now seen corresponding path program 1 times [2022-11-18 19:56:25,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:25,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600627663] [2022-11-18 19:56:25,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:25,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:29,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:29,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600627663] [2022-11-18 19:56:29,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600627663] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:56:29,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057202967] [2022-11-18 19:56:29,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:29,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:56:29,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:56:29,898 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:56:29,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c7f8bc4-b215-4a60-9f43-fbc8d84df64b/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 19:56:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:30,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-18 19:56:30,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:30,265 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 19:56:30,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 19:56:30,351 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:56:30,352 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-18 19:56:30,646 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 13 treesize of output 9 [2022-11-18 19:56:30,744 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 23 treesize of output 22 [2022-11-18 19:56:31,416 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 25 treesize of output 25 [2022-11-18 19:56:31,614 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 25 treesize of output 25 [2022-11-18 19:56:32,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:56:32,275 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-18 19:56:32,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-18 19:56:32,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:56:32,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:56:32,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-18 19:56:33,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-18 19:56:33,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:56:33,373 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 25 treesize of output 25 [2022-11-18 19:56:33,802 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-18 19:56:33,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-18 19:56:33,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-18 19:56:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:33,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:56:37,291 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_485 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_479) .cse2 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_481) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_485) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_479 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))) is different from false [2022-11-18 19:56:37,617 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_485 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_479) .cse2 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_481) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_485) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_479))))) is different from false [2022-11-18 19:56:37,695 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_477 Int) (v_ArrVal_485 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_477)) (.cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_479) .cse1 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_481) (< (+ (select .cse0 .cse2) 1) v_ArrVal_479) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse3 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_485) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-18 19:56:38,480 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (v_ArrVal_477 Int) (v_ArrVal_485 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_477)) (.cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (let ((.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 .cse2 v_ArrVal_479) .cse1 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_481) (< (+ (select .cse0 .cse2) 1) v_ArrVal_479) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse3 .cse1))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_485) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse4 (+ 84 |c_~#queue~0.offset|))))))))) is different from false [2022-11-18 19:56:54,117 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (v_ArrVal_477 Int) (v_ArrVal_485 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_476))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_477)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_479) .cse1 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_479) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_485) .cse3) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_481) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse4 .cse1))))))))) is different from false [2022-11-18 19:56:55,097 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (v_ArrVal_477 Int) (v_ArrVal_485 Int) (v_ArrVal_473 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_473)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_476))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_477)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_479) .cse1 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_473 0)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_479) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_485) .cse4) 2147483647) (< (+ (select .cse3 .cse1) 1) v_ArrVal_481))))))) is different from false [2022-11-18 19:56:55,141 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:56:55,144 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 2 case distinctions, treesize of input 270 treesize of output 185 [2022-11-18 19:56:55,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:56:55,178 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 1320 treesize of output 1308 [2022-11-18 19:56:55,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 614 treesize of output 590 [2022-11-18 19:56:55,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 814 treesize of output 750 [2022-11-18 19:56:55,298 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:56:55,298 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 1140 treesize of output 1092 [2022-11-18 19:56:55,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:56:55,358 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 17 treesize of output 9 [2022-11-18 19:56:56,785 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:56:56,786 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 631 treesize of output 647 [2022-11-18 19:57:00,190 INFO L321 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2022-11-18 19:57:00,191 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 45 treesize of output 80 [2022-11-18 19:57:00,362 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-18 19:57:00,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057202967] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:57:00,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:57:00,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 29] total 84 [2022-11-18 19:57:00,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432424955] [2022-11-18 19:57:00,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:57:00,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-11-18 19:57:00,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:57:00,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-11-18 19:57:00,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=5457, Unknown=78, NotChecked=954, Total=7140 [2022-11-18 19:57:00,381 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 251 [2022-11-18 19:57:00,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 490 transitions, 3224 flow. Second operand has 85 states, 85 states have (on average 163.01176470588234) internal successors, (13856), 85 states have internal predecessors, (13856), 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-18 19:57:00,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:57:00,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 251 [2022-11-18 19:57:00,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand