./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN --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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- 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-6b4ec56 [2022-11-20 12:29:46,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:29:46,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:29:46,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:29:46,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:29:46,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:29:46,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:29:46,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:29:46,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:29:46,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:29:46,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:29:46,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:29:46,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:29:46,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:29:46,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:29:46,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:29:46,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:29:46,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:29:46,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:29:46,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:29:46,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:29:46,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:29:46,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:29:46,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:29:46,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:29:46,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:29:46,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:29:46,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:29:46,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:29:46,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:29:46,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:29:46,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:29:46,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:29:46,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:29:46,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:29:46,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:29:46,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:29:46,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:29:46,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:29:46,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:29:46,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:29:46,546 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-20 12:29:46,566 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:29:46,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:29:46,567 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:29:46,567 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:29:46,567 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:29:46,568 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:29:46,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:29:46,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:29:46,569 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:29:46,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:29:46,569 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:29:46,570 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 12:29:46,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:29:46,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:29:46,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:29:46,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:29:46,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:29:46,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:29:46,571 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 12:29:46,572 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:29:46,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:29:46,572 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:29:46,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:29:46,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:29:46,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:29:46,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:29:46,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:29:46,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:29:46,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:29:46,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:29:46,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:29:46,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:29:46,575 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:29:46,575 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:29:46,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:29:46,575 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_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/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_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-11-20 12:29:46,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:29:46,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:29:46,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:29:46,977 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:29:46,978 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:29:46,979 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-20 12:29:49,905 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:29:50,198 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:29:50,199 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-20 12:29:50,216 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/data/df754c298/361e374d092045bb9d8776b51ce81ce6/FLAG8fa67250b [2022-11-20 12:29:50,247 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/data/df754c298/361e374d092045bb9d8776b51ce81ce6 [2022-11-20 12:29:50,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:29:50,254 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:29:50,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:29:50,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:29:50,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:29:50,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:29:50" (1/1) ... [2022-11-20 12:29:50,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a4d7f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:29:50, skipping insertion in model container [2022-11-20 12:29:50,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:29:50" (1/1) ... [2022-11-20 12:29:50,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:29:50,342 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:29:50,933 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-20 12:29:50,942 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-20 12:29:50,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:29:50,966 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:29:51,003 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-20 12:29:51,006 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-20 12:29:51,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:29:51,067 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:29:51,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:29:51 WrapperNode [2022-11-20 12:29:51,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:29:51,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:29:51,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:29:51,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:29:51,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:29:51" (1/1) ... [2022-11-20 12:29:51,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:29:51" (1/1) ... [2022-11-20 12:29:51,161 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-11-20 12:29:51,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:29:51,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:29:51,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:29:51,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:29:51,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:29:51" (1/1) ... [2022-11-20 12:29:51,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:29:51" (1/1) ... [2022-11-20 12:29:51,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:29:51" (1/1) ... [2022-11-20 12:29:51,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:29:51" (1/1) ... [2022-11-20 12:29:51,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:29:51" (1/1) ... [2022-11-20 12:29:51,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:29:51" (1/1) ... [2022-11-20 12:29:51,230 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:29:51" (1/1) ... [2022-11-20 12:29:51,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:29:51" (1/1) ... [2022-11-20 12:29:51,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:29:51,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:29:51,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:29:51,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:29:51,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:29:51" (1/1) ... [2022-11-20 12:29:51,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:29:51,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:29:51,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:29:51,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:29:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-20 12:29:51,318 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-20 12:29:51,318 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-20 12:29:51,319 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-20 12:29:51,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:29:51,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:29:51,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 12:29:51,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:29:51,319 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 12:29:51,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:29:51,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:29:51,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:29:51,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:29:51,322 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 12:29:51,543 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:29:51,545 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:29:51,863 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:29:51,873 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:29:51,873 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 12:29:51,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:29:51 BoogieIcfgContainer [2022-11-20 12:29:51,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:29:51,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:29:51,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:29:51,882 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:29:51,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:29:50" (1/3) ... [2022-11-20 12:29:51,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@953ccea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:29:51, skipping insertion in model container [2022-11-20 12:29:51,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:29:51" (2/3) ... [2022-11-20 12:29:51,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@953ccea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:29:51, skipping insertion in model container [2022-11-20 12:29:51,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:29:51" (3/3) ... [2022-11-20 12:29:51,885 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-20 12:29:51,894 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 12:29:51,906 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:29:51,906 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-20 12:29:51,906 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:29:52,074 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 12:29:52,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 251 transitions, 518 flow [2022-11-20 12:29:52,294 INFO L130 PetriNetUnfolder]: 13/249 cut-off events. [2022-11-20 12:29:52,294 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 12:29:52,306 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 458 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-20 12:29:52,306 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 251 transitions, 518 flow [2022-11-20 12:29:52,319 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 239 transitions, 487 flow [2022-11-20 12:29:52,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:29:52,345 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;@50bf844d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:29:52,345 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-20 12:29:52,434 INFO L130 PetriNetUnfolder]: 6/139 cut-off events. [2022-11-20 12:29:52,435 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-20 12:29:52,435 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:29:52,436 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-20 12:29:52,436 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 12:29:52,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:29:52,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1034587718, now seen corresponding path program 1 times [2022-11-20 12:29:52,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:29:52,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100530488] [2022-11-20 12:29:52,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:29:52,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:29:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:29:53,950 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-20 12:29:53,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:29:53,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100530488] [2022-11-20 12:29:53,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100530488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:29:53,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:29:53,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 12:29:53,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071623771] [2022-11-20 12:29:53,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:29:53,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 12:29:53,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:29:54,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 12:29:54,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:29:54,031 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 251 [2022-11-20 12:29:54,041 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-20 12:29:54,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:29:54,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 251 [2022-11-20 12:29:54,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:29:55,299 INFO L130 PetriNetUnfolder]: 611/2940 cut-off events. [2022-11-20 12:29:55,299 INFO L131 PetriNetUnfolder]: For 88/91 co-relation queries the response was YES. [2022-11-20 12:29:55,313 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 24667 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-20 12:29:55,330 INFO L137 encePairwiseOnDemand]: 234/251 looper letters, 42 selfloop transitions, 12 changer transitions 0/227 dead transitions. [2022-11-20 12:29:55,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 227 transitions, 571 flow [2022-11-20 12:29:55,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:29:55,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 12:29:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2477 transitions. [2022-11-20 12:29:55,358 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7591173766472571 [2022-11-20 12:29:55,359 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2477 transitions. [2022-11-20 12:29:55,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2477 transitions. [2022-11-20 12:29:55,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:29:55,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2477 transitions. [2022-11-20 12:29:55,378 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-20 12:29:55,392 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-20 12:29:55,395 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-20 12:29:55,397 INFO L175 Difference]: Start difference. First operand has 233 places, 239 transitions, 487 flow. Second operand 13 states and 2477 transitions. [2022-11-20 12:29:55,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 227 transitions, 571 flow [2022-11-20 12:29:55,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 227 transitions, 566 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 12:29:55,411 INFO L231 Difference]: Finished difference. Result has 235 places, 227 transitions, 482 flow [2022-11-20 12:29:55,414 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-20 12:29:55,419 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 2 predicate places. [2022-11-20 12:29:55,420 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 227 transitions, 482 flow [2022-11-20 12:29:55,422 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-20 12:29:55,422 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:29:55,422 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-20 12:29:55,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:29:55,423 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 12:29:55,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:29:55,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1366298667, now seen corresponding path program 1 times [2022-11-20 12:29:55,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:29:55,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099411471] [2022-11-20 12:29:55,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:29:55,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:29:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:30:09,300 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-20 12:30:09,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:30:09,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099411471] [2022-11-20 12:30:09,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099411471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:30:09,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:30:09,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-20 12:30:09,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217514760] [2022-11-20 12:30:09,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:30:09,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 12:30:09,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:30:09,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 12:30:09,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:30:09,308 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 251 [2022-11-20 12:30:09,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 227 transitions, 482 flow. Second operand has 18 states, 18 states have (on average 179.88888888888889) internal successors, (3238), 18 states have internal predecessors, (3238), 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-20 12:30:09,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:30:09,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 251 [2022-11-20 12:30:09,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:30:14,307 INFO L130 PetriNetUnfolder]: 1342/5185 cut-off events. [2022-11-20 12:30:14,307 INFO L131 PetriNetUnfolder]: For 31/34 co-relation queries the response was YES. [2022-11-20 12:30:14,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7370 conditions, 5185 events. 1342/5185 cut-off events. For 31/34 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 46642 event pairs, 872 based on Foata normal form. 1/4450 useless extension candidates. Maximal degree in co-relation 7271. Up to 1675 conditions per place. [2022-11-20 12:30:14,413 INFO L137 encePairwiseOnDemand]: 230/251 looper letters, 108 selfloop transitions, 27 changer transitions 0/299 dead transitions. [2022-11-20 12:30:14,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 299 transitions, 902 flow [2022-11-20 12:30:14,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 12:30:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-20 12:30:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3699 transitions. [2022-11-20 12:30:14,436 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7368525896414343 [2022-11-20 12:30:14,436 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3699 transitions. [2022-11-20 12:30:14,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3699 transitions. [2022-11-20 12:30:14,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:30:14,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3699 transitions. [2022-11-20 12:30:14,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 184.95) internal successors, (3699), 20 states have internal predecessors, (3699), 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-20 12:30:14,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 251.0) internal successors, (5271), 21 states have internal predecessors, (5271), 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-20 12:30:14,461 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 251.0) internal successors, (5271), 21 states have internal predecessors, (5271), 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-20 12:30:14,461 INFO L175 Difference]: Start difference. First operand has 235 places, 227 transitions, 482 flow. Second operand 20 states and 3699 transitions. [2022-11-20 12:30:14,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 299 transitions, 902 flow [2022-11-20 12:30:14,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 299 transitions, 879 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-11-20 12:30:14,473 INFO L231 Difference]: Finished difference. Result has 252 places, 248 transitions, 616 flow [2022-11-20 12:30:14,474 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=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=616, PETRI_PLACES=252, PETRI_TRANSITIONS=248} [2022-11-20 12:30:14,475 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 19 predicate places. [2022-11-20 12:30:14,475 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 248 transitions, 616 flow [2022-11-20 12:30:14,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 179.88888888888889) internal successors, (3238), 18 states have internal predecessors, (3238), 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-20 12:30:14,479 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:30:14,479 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-20 12:30:14,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:30:14,480 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 12:30:14,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:30:14,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1204215650, now seen corresponding path program 1 times [2022-11-20 12:30:14,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:30:14,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892573407] [2022-11-20 12:30:14,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:30:14,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:30:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:30:16,653 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-20 12:30:16,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:30:16,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892573407] [2022-11-20 12:30:16,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892573407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:30:16,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:30:16,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-20 12:30:16,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430363482] [2022-11-20 12:30:16,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:30:16,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 12:30:16,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:30:16,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 12:30:16,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-11-20 12:30:16,660 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 251 [2022-11-20 12:30:16,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 248 transitions, 616 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-20 12:30:16,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:30:16,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 251 [2022-11-20 12:30:16,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:30:20,086 INFO L130 PetriNetUnfolder]: 2220/7783 cut-off events. [2022-11-20 12:30:20,087 INFO L131 PetriNetUnfolder]: For 889/896 co-relation queries the response was YES. [2022-11-20 12:30:20,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12410 conditions, 7783 events. 2220/7783 cut-off events. For 889/896 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 72945 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-20 12:30:20,148 INFO L137 encePairwiseOnDemand]: 229/251 looper letters, 208 selfloop transitions, 44 changer transitions 0/409 dead transitions. [2022-11-20 12:30:20,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 409 transitions, 1501 flow [2022-11-20 12:30:20,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 12:30:20,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-11-20 12:30:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3958 transitions. [2022-11-20 12:30:20,159 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7167692864904021 [2022-11-20 12:30:20,160 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3958 transitions. [2022-11-20 12:30:20,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3958 transitions. [2022-11-20 12:30:20,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:30:20,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3958 transitions. [2022-11-20 12:30:20,170 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-20 12:30:20,179 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-20 12:30:20,183 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-20 12:30:20,184 INFO L175 Difference]: Start difference. First operand has 252 places, 248 transitions, 616 flow. Second operand 22 states and 3958 transitions. [2022-11-20 12:30:20,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 409 transitions, 1501 flow [2022-11-20 12:30:20,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 409 transitions, 1488 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-20 12:30:20,203 INFO L231 Difference]: Finished difference. Result has 273 places, 277 transitions, 861 flow [2022-11-20 12:30:20,203 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-20 12:30:20,208 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 40 predicate places. [2022-11-20 12:30:20,209 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 277 transitions, 861 flow [2022-11-20 12:30:20,211 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-20 12:30:20,211 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:30:20,211 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-20 12:30:20,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:30:20,212 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 12:30:20,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:30:20,213 INFO L85 PathProgramCache]: Analyzing trace with hash -526008184, now seen corresponding path program 1 times [2022-11-20 12:30:20,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:30:20,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617788592] [2022-11-20 12:30:20,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:30:20,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:30:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:30:20,312 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-20 12:30:20,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:30:20,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617788592] [2022-11-20 12:30:20,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617788592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:30:20,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:30:20,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:30:20,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575343400] [2022-11-20 12:30:20,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:30:20,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:30:20,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:30:20,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:30:20,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:30:20,322 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 251 [2022-11-20 12:30:20,323 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-20 12:30:20,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:30:20,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 251 [2022-11-20 12:30:20,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:30:20,961 INFO L130 PetriNetUnfolder]: 220/3315 cut-off events. [2022-11-20 12:30:20,962 INFO L131 PetriNetUnfolder]: For 227/229 co-relation queries the response was YES. [2022-11-20 12:30:20,983 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 29920 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-20 12:30:21,000 INFO L137 encePairwiseOnDemand]: 246/251 looper letters, 15 selfloop transitions, 4 changer transitions 0/284 dead transitions. [2022-11-20 12:30:21,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 284 transitions, 915 flow [2022-11-20 12:30:21,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:30:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 12:30:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 944 transitions. [2022-11-20 12:30:21,004 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9402390438247012 [2022-11-20 12:30:21,005 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 944 transitions. [2022-11-20 12:30:21,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 944 transitions. [2022-11-20 12:30:21,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:30:21,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 944 transitions. [2022-11-20 12:30:21,012 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-20 12:30:21,014 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-20 12:30:21,015 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-20 12:30:21,015 INFO L175 Difference]: Start difference. First operand has 273 places, 277 transitions, 861 flow. Second operand 4 states and 944 transitions. [2022-11-20 12:30:21,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 284 transitions, 915 flow [2022-11-20 12:30:21,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 284 transitions, 882 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-11-20 12:30:21,025 INFO L231 Difference]: Finished difference. Result has 270 places, 280 transitions, 856 flow [2022-11-20 12:30:21,031 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-20 12:30:21,032 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 37 predicate places. [2022-11-20 12:30:21,033 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 280 transitions, 856 flow [2022-11-20 12:30:21,033 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-20 12:30:21,033 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:30:21,034 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-20 12:30:21,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:30:21,034 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 12:30:21,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:30:21,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1884600977, now seen corresponding path program 1 times [2022-11-20 12:30:21,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:30:21,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229654649] [2022-11-20 12:30:21,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:30:21,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:30:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:30:21,120 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-20 12:30:21,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:30:21,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229654649] [2022-11-20 12:30:21,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229654649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:30:21,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:30:21,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:30:21,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316268427] [2022-11-20 12:30:21,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:30:21,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:30:21,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:30:21,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:30:21,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:30:21,124 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 251 [2022-11-20 12:30:21,125 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-20 12:30:21,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:30:21,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 251 [2022-11-20 12:30:21,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:30:22,141 INFO L130 PetriNetUnfolder]: 372/4921 cut-off events. [2022-11-20 12:30:22,142 INFO L131 PetriNetUnfolder]: For 323/333 co-relation queries the response was YES. [2022-11-20 12:30:22,179 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 51818 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-20 12:30:22,194 INFO L137 encePairwiseOnDemand]: 244/251 looper letters, 21 selfloop transitions, 4 changer transitions 0/290 dead transitions. [2022-11-20 12:30:22,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 290 transitions, 929 flow [2022-11-20 12:30:22,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:30:22,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 12:30:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1168 transitions. [2022-11-20 12:30:22,199 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9306772908366534 [2022-11-20 12:30:22,199 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1168 transitions. [2022-11-20 12:30:22,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1168 transitions. [2022-11-20 12:30:22,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:30:22,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1168 transitions. [2022-11-20 12:30:22,203 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-20 12:30:22,206 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-20 12:30:22,207 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-20 12:30:22,207 INFO L175 Difference]: Start difference. First operand has 270 places, 280 transitions, 856 flow. Second operand 5 states and 1168 transitions. [2022-11-20 12:30:22,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 290 transitions, 929 flow [2022-11-20 12:30:22,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 290 transitions, 927 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 12:30:22,223 INFO L231 Difference]: Finished difference. Result has 276 places, 283 transitions, 886 flow [2022-11-20 12:30:22,224 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-20 12:30:22,226 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 43 predicate places. [2022-11-20 12:30:22,226 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 283 transitions, 886 flow [2022-11-20 12:30:22,235 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-20 12:30:22,243 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:30:22,243 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-20 12:30:22,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:30:22,244 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 12:30:22,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:30:22,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1942994580, now seen corresponding path program 1 times [2022-11-20 12:30:22,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:30:22,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339507989] [2022-11-20 12:30:22,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:30:22,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:30:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:30:25,556 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-20 12:30:25,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:30:25,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339507989] [2022-11-20 12:30:25,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339507989] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:30:25,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:30:25,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-20 12:30:25,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894358878] [2022-11-20 12:30:25,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:30:25,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 12:30:25,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:30:25,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 12:30:25,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:30:25,562 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 251 [2022-11-20 12:30:25,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 283 transitions, 886 flow. Second operand has 18 states, 18 states have (on average 180.05555555555554) internal successors, (3241), 18 states have internal predecessors, (3241), 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-20 12:30:25,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:30:25,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 251 [2022-11-20 12:30:25,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:30:32,008 INFO L130 PetriNetUnfolder]: 6627/24237 cut-off events. [2022-11-20 12:30:32,008 INFO L131 PetriNetUnfolder]: For 4268/4335 co-relation queries the response was YES. [2022-11-20 12:30:32,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41547 conditions, 24237 events. 6627/24237 cut-off events. For 4268/4335 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 295776 event pairs, 4023 based on Foata normal form. 11/21524 useless extension candidates. Maximal degree in co-relation 41435. Up to 8780 conditions per place. [2022-11-20 12:30:32,246 INFO L137 encePairwiseOnDemand]: 229/251 looper letters, 134 selfloop transitions, 33 changer transitions 0/350 dead transitions. [2022-11-20 12:30:32,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 350 transitions, 1393 flow [2022-11-20 12:30:32,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 12:30:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-20 12:30:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3703 transitions. [2022-11-20 12:30:32,255 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7376494023904383 [2022-11-20 12:30:32,255 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3703 transitions. [2022-11-20 12:30:32,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3703 transitions. [2022-11-20 12:30:32,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:30:32,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3703 transitions. [2022-11-20 12:30:32,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 185.15) internal successors, (3703), 20 states have internal predecessors, (3703), 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-20 12:30:32,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 251.0) internal successors, (5271), 21 states have internal predecessors, (5271), 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-20 12:30:32,275 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 251.0) internal successors, (5271), 21 states have internal predecessors, (5271), 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-20 12:30:32,275 INFO L175 Difference]: Start difference. First operand has 276 places, 283 transitions, 886 flow. Second operand 20 states and 3703 transitions. [2022-11-20 12:30:32,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 350 transitions, 1393 flow [2022-11-20 12:30:32,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 350 transitions, 1391 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 12:30:32,331 INFO L231 Difference]: Finished difference. Result has 299 places, 293 transitions, 1029 flow [2022-11-20 12:30:32,332 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=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1029, PETRI_PLACES=299, PETRI_TRANSITIONS=293} [2022-11-20 12:30:32,332 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 66 predicate places. [2022-11-20 12:30:32,332 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 293 transitions, 1029 flow [2022-11-20 12:30:32,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 180.05555555555554) internal successors, (3241), 18 states have internal predecessors, (3241), 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-20 12:30:32,334 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:30:32,334 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-20 12:30:32,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:30:32,334 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 12:30:32,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:30:32,335 INFO L85 PathProgramCache]: Analyzing trace with hash -531483381, now seen corresponding path program 1 times [2022-11-20 12:30:32,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:30:32,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595102652] [2022-11-20 12:30:32,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:30:32,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:30:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:30:33,727 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-20 12:30:33,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:30:33,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595102652] [2022-11-20 12:30:33,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595102652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:30:33,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:30:33,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-20 12:30:33,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016005025] [2022-11-20 12:30:33,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:30:33,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-20 12:30:33,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:30:33,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 12:30:33,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-11-20 12:30:33,732 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 251 [2022-11-20 12:30:33,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 293 transitions, 1029 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-20 12:30:33,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:30:33,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 251 [2022-11-20 12:30:33,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:30:39,541 INFO L130 PetriNetUnfolder]: 7210/25781 cut-off events. [2022-11-20 12:30:39,542 INFO L131 PetriNetUnfolder]: For 6052/6112 co-relation queries the response was YES. [2022-11-20 12:30:39,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45944 conditions, 25781 events. 7210/25781 cut-off events. For 6052/6112 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 316770 event pairs, 868 based on Foata normal form. 283/24051 useless extension candidates. Maximal degree in co-relation 45812. Up to 6630 conditions per place. [2022-11-20 12:30:39,795 INFO L137 encePairwiseOnDemand]: 230/251 looper letters, 193 selfloop transitions, 42 changer transitions 0/411 dead transitions. [2022-11-20 12:30:39,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 411 transitions, 1797 flow [2022-11-20 12:30:39,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 12:30:39,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-20 12:30:39,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3420 transitions. [2022-11-20 12:30:39,804 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7171314741035857 [2022-11-20 12:30:39,804 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3420 transitions. [2022-11-20 12:30:39,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3420 transitions. [2022-11-20 12:30:39,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:30:39,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3420 transitions. [2022-11-20 12:30:39,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 180.0) internal successors, (3420), 19 states have internal predecessors, (3420), 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-20 12:30:39,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 251.0) internal successors, (5020), 20 states have internal predecessors, (5020), 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-20 12:30:39,824 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 251.0) internal successors, (5020), 20 states have internal predecessors, (5020), 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-20 12:30:39,825 INFO L175 Difference]: Start difference. First operand has 299 places, 293 transitions, 1029 flow. Second operand 19 states and 3420 transitions. [2022-11-20 12:30:39,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 411 transitions, 1797 flow [2022-11-20 12:30:39,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 411 transitions, 1765 flow, removed 2 selfloop flow, removed 12 redundant places. [2022-11-20 12:30:39,955 INFO L231 Difference]: Finished difference. Result has 309 places, 301 transitions, 1165 flow [2022-11-20 12:30:39,955 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=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1165, PETRI_PLACES=309, PETRI_TRANSITIONS=301} [2022-11-20 12:30:39,956 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 76 predicate places. [2022-11-20 12:30:39,956 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 301 transitions, 1165 flow [2022-11-20 12:30:39,957 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-20 12:30:39,958 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:30:39,958 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-20 12:30:39,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:30:39,958 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 12:30:39,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:30:39,959 INFO L85 PathProgramCache]: Analyzing trace with hash 99264505, now seen corresponding path program 1 times [2022-11-20 12:30:39,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:30:39,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318559040] [2022-11-20 12:30:39,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:30:39,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:30:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:30:40,032 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-20 12:30:40,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:30:40,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318559040] [2022-11-20 12:30:40,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318559040] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:30:40,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:30:40,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:30:40,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735137147] [2022-11-20 12:30:40,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:30:40,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:30:40,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:30:40,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:30:40,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:30:40,036 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 251 [2022-11-20 12:30:40,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 301 transitions, 1165 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-20 12:30:40,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:30:40,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 251 [2022-11-20 12:30:40,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:30:40,990 INFO L130 PetriNetUnfolder]: 374/6307 cut-off events. [2022-11-20 12:30:40,991 INFO L131 PetriNetUnfolder]: For 844/892 co-relation queries the response was YES. [2022-11-20 12:30:41,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8397 conditions, 6307 events. 374/6307 cut-off events. For 844/892 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 68723 event pairs, 23 based on Foata normal form. 0/5744 useless extension candidates. Maximal degree in co-relation 8313. Up to 191 conditions per place. [2022-11-20 12:30:41,055 INFO L137 encePairwiseOnDemand]: 244/251 looper letters, 21 selfloop transitions, 4 changer transitions 0/311 dead transitions. [2022-11-20 12:30:41,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 311 transitions, 1241 flow [2022-11-20 12:30:41,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:30:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 12:30:41,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1168 transitions. [2022-11-20 12:30:41,064 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9306772908366534 [2022-11-20 12:30:41,068 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1168 transitions. [2022-11-20 12:30:41,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1168 transitions. [2022-11-20 12:30:41,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:30:41,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1168 transitions. [2022-11-20 12:30:41,075 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-20 12:30:41,078 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-20 12:30:41,078 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-20 12:30:41,079 INFO L175 Difference]: Start difference. First operand has 309 places, 301 transitions, 1165 flow. Second operand 5 states and 1168 transitions. [2022-11-20 12:30:41,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 311 transitions, 1241 flow [2022-11-20 12:30:41,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 311 transitions, 1208 flow, removed 2 selfloop flow, removed 11 redundant places. [2022-11-20 12:30:41,097 INFO L231 Difference]: Finished difference. Result has 305 places, 304 transitions, 1164 flow [2022-11-20 12:30:41,098 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1164, PETRI_PLACES=305, PETRI_TRANSITIONS=304} [2022-11-20 12:30:41,101 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 72 predicate places. [2022-11-20 12:30:41,102 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 304 transitions, 1164 flow [2022-11-20 12:30:41,102 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-20 12:30:41,102 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:30:41,102 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-20 12:30:41,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:30:41,103 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 12:30:41,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:30:41,103 INFO L85 PathProgramCache]: Analyzing trace with hash -738274639, now seen corresponding path program 1 times [2022-11-20 12:30:41,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:30:41,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221861112] [2022-11-20 12:30:41,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:30:41,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:30:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:30:41,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-20 12:30:41,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:30:41,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221861112] [2022-11-20 12:30:41,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221861112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:30:41,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:30:41,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:30:41,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185410988] [2022-11-20 12:30:41,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:30:41,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:30:41,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:30:41,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:30:41,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:30:41,291 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 251 [2022-11-20 12:30:41,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 304 transitions, 1164 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-20 12:30:41,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:30:41,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 251 [2022-11-20 12:30:41,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:30:41,454 INFO L130 PetriNetUnfolder]: 48/939 cut-off events. [2022-11-20 12:30:41,454 INFO L131 PetriNetUnfolder]: For 227/228 co-relation queries the response was YES. [2022-11-20 12:30:41,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 939 events. 48/939 cut-off events. For 227/228 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4215 event pairs, 2 based on Foata normal form. 0/878 useless extension candidates. Maximal degree in co-relation 1353. Up to 20 conditions per place. [2022-11-20 12:30:41,463 INFO L137 encePairwiseOnDemand]: 247/251 looper letters, 7 selfloop transitions, 2 changer transitions 5/285 dead transitions. [2022-11-20 12:30:41,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 285 transitions, 1045 flow [2022-11-20 12:30:41,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:30:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:30:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2022-11-20 12:30:41,465 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.949535192563081 [2022-11-20 12:30:41,466 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 715 transitions. [2022-11-20 12:30:41,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 715 transitions. [2022-11-20 12:30:41,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:30:41,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 715 transitions. [2022-11-20 12:30:41,468 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-20 12:30:41,470 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-20 12:30:41,471 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-20 12:30:41,471 INFO L175 Difference]: Start difference. First operand has 305 places, 304 transitions, 1164 flow. Second operand 3 states and 715 transitions. [2022-11-20 12:30:41,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 285 transitions, 1045 flow [2022-11-20 12:30:41,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 285 transitions, 1033 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-11-20 12:30:41,481 INFO L231 Difference]: Finished difference. Result has 302 places, 279 transitions, 1002 flow [2022-11-20 12:30:41,481 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1002, PETRI_PLACES=302, PETRI_TRANSITIONS=279} [2022-11-20 12:30:41,482 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 69 predicate places. [2022-11-20 12:30:41,483 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 279 transitions, 1002 flow [2022-11-20 12:30:41,483 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-20 12:30:41,483 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:30:41,484 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-20 12:30:41,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:30:41,484 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 12:30:41,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:30:41,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1781137955, now seen corresponding path program 1 times [2022-11-20 12:30:41,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:30:41,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911187748] [2022-11-20 12:30:41,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:30:41,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:30:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:30:42,609 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-20 12:30:42,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:30:42,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911187748] [2022-11-20 12:30:42,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911187748] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:30:42,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:30:42,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-20 12:30:42,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758020109] [2022-11-20 12:30:42,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:30:42,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 12:30:42,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:30:42,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 12:30:42,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-11-20 12:30:42,614 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 251 [2022-11-20 12:30:42,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 279 transitions, 1002 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-20 12:30:42,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:30:42,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 251 [2022-11-20 12:30:42,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:30:43,642 INFO L130 PetriNetUnfolder]: 302/1913 cut-off events. [2022-11-20 12:30:43,642 INFO L131 PetriNetUnfolder]: For 672/677 co-relation queries the response was YES. [2022-11-20 12:30:43,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3386 conditions, 1913 events. 302/1913 cut-off events. For 672/677 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 12012 event pairs, 213 based on Foata normal form. 3/1797 useless extension candidates. Maximal degree in co-relation 3260. Up to 576 conditions per place. [2022-11-20 12:30:43,661 INFO L137 encePairwiseOnDemand]: 235/251 looper letters, 71 selfloop transitions, 29 changer transitions 0/287 dead transitions. [2022-11-20 12:30:43,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 287 transitions, 1216 flow [2022-11-20 12:30:43,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 12:30:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-20 12:30:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2799 transitions. [2022-11-20 12:30:43,667 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7434262948207171 [2022-11-20 12:30:43,667 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2799 transitions. [2022-11-20 12:30:43,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2799 transitions. [2022-11-20 12:30:43,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:30:43,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2799 transitions. [2022-11-20 12:30:43,674 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-20 12:30:43,679 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-20 12:30:43,681 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-20 12:30:43,681 INFO L175 Difference]: Start difference. First operand has 302 places, 279 transitions, 1002 flow. Second operand 15 states and 2799 transitions. [2022-11-20 12:30:43,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 287 transitions, 1216 flow [2022-11-20 12:30:43,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 287 transitions, 1212 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:30:43,692 INFO L231 Difference]: Finished difference. Result has 316 places, 282 transitions, 1086 flow [2022-11-20 12:30:43,693 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=987, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1086, PETRI_PLACES=316, PETRI_TRANSITIONS=282} [2022-11-20 12:30:43,694 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 83 predicate places. [2022-11-20 12:30:43,694 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 282 transitions, 1086 flow [2022-11-20 12:30:43,695 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-20 12:30:43,695 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:30:43,696 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-20 12:30:43,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:30:43,696 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 12:30:43,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:30:43,697 INFO L85 PathProgramCache]: Analyzing trace with hash -404100282, now seen corresponding path program 1 times [2022-11-20 12:30:43,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:30:43,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547782437] [2022-11-20 12:30:43,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:30:43,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:30:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:30:45,220 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-20 12:30:45,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:30:45,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547782437] [2022-11-20 12:30:45,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547782437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:30:45,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:30:45,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-20 12:30:45,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400032593] [2022-11-20 12:30:45,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:30:45,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-20 12:30:45,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:30:45,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 12:30:45,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-11-20 12:30:45,230 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 251 [2022-11-20 12:30:45,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 282 transitions, 1086 flow. Second operand has 19 states, 19 states have (on average 174.78947368421052) internal successors, (3321), 19 states have internal predecessors, (3321), 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-20 12:30:45,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:30:45,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 251 [2022-11-20 12:30:45,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:30:46,681 INFO L130 PetriNetUnfolder]: 295/1884 cut-off events. [2022-11-20 12:30:46,681 INFO L131 PetriNetUnfolder]: For 752/757 co-relation queries the response was YES. [2022-11-20 12:30:46,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3421 conditions, 1884 events. 295/1884 cut-off events. For 752/757 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11824 event pairs, 99 based on Foata normal form. 4/1779 useless extension candidates. Maximal degree in co-relation 3279. Up to 472 conditions per place. [2022-11-20 12:30:46,694 INFO L137 encePairwiseOnDemand]: 235/251 looper letters, 93 selfloop transitions, 23 changer transitions 0/296 dead transitions. [2022-11-20 12:30:46,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 296 transitions, 1354 flow [2022-11-20 12:30:46,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 12:30:46,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-20 12:30:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2676 transitions. [2022-11-20 12:30:46,701 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7107569721115538 [2022-11-20 12:30:46,701 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2676 transitions. [2022-11-20 12:30:46,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2676 transitions. [2022-11-20 12:30:46,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:30:46,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2676 transitions. [2022-11-20 12:30:46,708 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-20 12:30:46,713 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-20 12:30:46,715 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-20 12:30:46,715 INFO L175 Difference]: Start difference. First operand has 316 places, 282 transitions, 1086 flow. Second operand 15 states and 2676 transitions. [2022-11-20 12:30:46,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 296 transitions, 1354 flow [2022-11-20 12:30:46,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 296 transitions, 1323 flow, removed 2 selfloop flow, removed 11 redundant places. [2022-11-20 12:30:46,727 INFO L231 Difference]: Finished difference. Result has 321 places, 283 transitions, 1123 flow [2022-11-20 12:30:46,727 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1123, PETRI_PLACES=321, PETRI_TRANSITIONS=283} [2022-11-20 12:30:46,728 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 88 predicate places. [2022-11-20 12:30:46,728 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 283 transitions, 1123 flow [2022-11-20 12:30:46,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 174.78947368421052) internal successors, (3321), 19 states have internal predecessors, (3321), 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-20 12:30:46,729 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:30:46,730 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-20 12:30:46,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:30:46,730 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 12:30:46,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:30:46,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1123022933, now seen corresponding path program 1 times [2022-11-20 12:30:46,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:30:46,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200506768] [2022-11-20 12:30:46,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:30:46,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:30:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:30:49,774 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-20 12:30:49,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:30:49,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200506768] [2022-11-20 12:30:49,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200506768] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:30:49,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630248966] [2022-11-20 12:30:49,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:30:49,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:30:49,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:30:49,778 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:30:49,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:30:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:30:49,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 12:30:49,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:30:50,181 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:30:50,182 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-20 12:30:50,470 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-20 12:30:50,561 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-20 12:30:51,105 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-20 12:30:51,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:30:51,732 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-11-20 12:30:51,733 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-20 12:30:52,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:30:52,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:30:52,108 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-20 12:30:52,687 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 40 treesize of output 27 [2022-11-20 12:30:52,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:30:52,875 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-20 12:30:53,283 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-20 12:30:53,284 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 39 [2022-11-20 12:30:53,359 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-20 12:30:53,365 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-20 12:30:53,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:30:53,857 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int))) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-11-20 12:30:53,915 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int))) (< (select (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|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-11-20 12:30:53,939 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int))) (< (select (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|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 1604))) |c_~#queue~0.offset|) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-11-20 12:30:53,951 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-11-20 12:30:53,972 WARN L837 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1|) (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))) is different from false [2022-11-20 12:30:54,146 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select .cse1 .cse2))) (or (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_316 Int)) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_316) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_316 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))) (= 400 .cse3)))) is different from false [2022-11-20 12:30:54,214 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select .cse1 .cse2))) (or (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_316 Int)) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_316) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem37#1| 1) v_ArrVal_316))) (= 400 .cse3)))) is different from false [2022-11-20 12:30:54,430 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_316 Int) (v_ArrVal_314 Int)) (let ((.cse1 (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_314)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse1 .cse3)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_316) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 1604))) |c_~#queue~0.offset|) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (= 400 .cse4) (< (+ (select .cse1 .cse2) 1) v_ArrVal_316))))) is different from false [2022-11-20 12:30:54,476 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|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_316 Int) (v_ArrVal_314 Int)) (let ((.cse1 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_314))) (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (select .cse1 .cse3))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_316) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_316) (= 400 .cse4))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse5 .cse3)))))) is different from false [2022-11-20 12:30:54,552 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_316 Int) (v_ArrVal_314 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4)) v_ArrVal_314)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse2 (select .cse4 .cse1)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (= 400 .cse2) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse4 .cse5 v_ArrVal_316) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* 4 (select .cse3 (+ |c_~#queue~0.offset| 1604)))) v_ArrVal_322)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_316)))))) is different from false [2022-11-20 12:30:56,432 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_316 Int) (v_ArrVal_313 (Array Int Int)) (v_ArrVal_314 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_313))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4) |c_~#queue~0.offset|) v_ArrVal_314)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (select .cse4 .cse1)) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (< (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_316) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_322)) .cse5) 2147483647) (= 400 .cse6) (< (+ 1 (select .cse4 .cse5)) v_ArrVal_316))))))) is different from false [2022-11-20 12:30:57,125 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 Int) (v_ArrVal_322 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_316 Int) (v_ArrVal_313 (Array Int Int)) (v_ArrVal_314 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_312)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_313))) (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4) |c_~#queue~0.offset|) v_ArrVal_314)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_316) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_320) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_322)) .cse4) 2147483647) (not (<= v_ArrVal_312 0)) (< (+ (select .cse3 .cse4) 1) v_ArrVal_316) (= 400 .cse5) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse6 .cse1))))))))) is different from false [2022-11-20 12:30:57,160 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:30:57,161 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 309 treesize of output 194 [2022-11-20 12:30:57,181 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:30:57,182 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 314 treesize of output 306 [2022-11-20 12:30:57,207 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 181 treesize of output 161 [2022-11-20 12:30:57,222 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 204 treesize of output 180 [2022-11-20 12:30:57,295 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-20 12:30:57,578 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:30:57,578 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 211 treesize of output 219 [2022-11-20 12:30:59,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:30:59,326 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 43 [2022-11-20 12:30:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-20 12:30:59,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630248966] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:30:59,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:30:59,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 29] total 79 [2022-11-20 12:30:59,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701286729] [2022-11-20 12:30:59,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:30:59,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-11-20 12:30:59,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:30:59,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-11-20 12:30:59,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=590, Invalid=3992, Unknown=22, NotChecked=1716, Total=6320 [2022-11-20 12:30:59,446 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 251 [2022-11-20 12:30:59,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 283 transitions, 1123 flow. Second operand has 80 states, 80 states have (on average 160.1375) internal successors, (12811), 80 states have internal predecessors, (12811), 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-20 12:30:59,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:30:59,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 251 [2022-11-20 12:30:59,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:31:10,498 INFO L130 PetriNetUnfolder]: 769/3918 cut-off events. [2022-11-20 12:31:10,498 INFO L131 PetriNetUnfolder]: For 1952/1956 co-relation queries the response was YES. [2022-11-20 12:31:10,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7646 conditions, 3918 events. 769/3918 cut-off events. For 1952/1956 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 29100 event pairs, 326 based on Foata normal form. 10/3711 useless extension candidates. Maximal degree in co-relation 7500. Up to 675 conditions per place. [2022-11-20 12:31:10,542 INFO L137 encePairwiseOnDemand]: 215/251 looper letters, 202 selfloop transitions, 120 changer transitions 0/473 dead transitions. [2022-11-20 12:31:10,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 473 transitions, 2737 flow [2022-11-20 12:31:10,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-20 12:31:10,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-11-20 12:31:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 9614 transitions. [2022-11-20 12:31:10,561 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6491998109257884 [2022-11-20 12:31:10,561 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 9614 transitions. [2022-11-20 12:31:10,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 9614 transitions. [2022-11-20 12:31:10,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:31:10,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 9614 transitions. [2022-11-20 12:31:10,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 162.94915254237287) internal successors, (9614), 59 states have internal predecessors, (9614), 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-20 12:31:10,610 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-20 12:31:10,616 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-20 12:31:10,616 INFO L175 Difference]: Start difference. First operand has 321 places, 283 transitions, 1123 flow. Second operand 59 states and 9614 transitions. [2022-11-20 12:31:10,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 473 transitions, 2737 flow [2022-11-20 12:31:10,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 473 transitions, 2682 flow, removed 12 selfloop flow, removed 13 redundant places. [2022-11-20 12:31:10,639 INFO L231 Difference]: Finished difference. Result has 388 places, 372 transitions, 2150 flow [2022-11-20 12:31:10,640 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=2150, PETRI_PLACES=388, PETRI_TRANSITIONS=372} [2022-11-20 12:31:10,640 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 155 predicate places. [2022-11-20 12:31:10,640 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 372 transitions, 2150 flow [2022-11-20 12:31:10,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 160.1375) internal successors, (12811), 80 states have internal predecessors, (12811), 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-20 12:31:10,645 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:31:10,645 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-20 12:31:10,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 12:31:10,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 12:31:10,851 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 12:31:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:31:10,852 INFO L85 PathProgramCache]: Analyzing trace with hash 453973176, now seen corresponding path program 1 times [2022-11-20 12:31:10,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:31:10,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699260478] [2022-11-20 12:31:10,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:31:10,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:31:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:31:12,242 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-20 12:31:12,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:31:12,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699260478] [2022-11-20 12:31:12,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699260478] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:31:12,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483559849] [2022-11-20 12:31:12,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:31:12,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:31:12,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:31:12,244 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:31:12,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:31:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:31:12,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-20 12:31:12,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:31:12,998 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-20 12:31:13,204 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-20 12:31:13,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:31:13,309 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-20 12:31:13,667 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 12:31:13,667 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-20 12:31:13,760 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-20 12:31:13,769 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-20 12:31:13,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:31:14,338 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_384 Int) (v_ArrVal_383 (Array Int Int))) (or (< (+ v_ArrVal_384 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_383) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_384) (+ 1608 |c_~#queue~0.offset|)))))) is different from false [2022-11-20 12:31:14,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:31:14,611 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-20 12:31:14,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:31:14,622 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-20 12:31:14,630 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-20 12:31:14,646 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-20 12:31:14,661 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:31:14,662 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-20 12:31:15,075 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-20 12:31:15,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483559849] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:31:15,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:31:15,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 49 [2022-11-20 12:31:15,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697377201] [2022-11-20 12:31:15,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:31:15,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-20 12:31:15,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:31:15,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-20 12:31:15,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=2113, Unknown=4, NotChecked=94, Total=2450 [2022-11-20 12:31:15,085 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 251 [2022-11-20 12:31:15,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 372 transitions, 2150 flow. Second operand has 50 states, 50 states have (on average 181.1) internal successors, (9055), 50 states have internal predecessors, (9055), 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-20 12:31:15,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:31:15,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 251 [2022-11-20 12:31:15,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:31:19,643 INFO L130 PetriNetUnfolder]: 1241/7437 cut-off events. [2022-11-20 12:31:19,643 INFO L131 PetriNetUnfolder]: For 4468/4469 co-relation queries the response was YES. [2022-11-20 12:31:19,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14187 conditions, 7437 events. 1241/7437 cut-off events. For 4468/4469 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 70512 event pairs, 410 based on Foata normal form. 22/7094 useless extension candidates. Maximal degree in co-relation 14031. Up to 1090 conditions per place. [2022-11-20 12:31:19,758 INFO L137 encePairwiseOnDemand]: 225/251 looper letters, 192 selfloop transitions, 153 changer transitions 0/536 dead transitions. [2022-11-20 12:31:19,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 536 transitions, 3755 flow [2022-11-20 12:31:19,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-20 12:31:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-11-20 12:31:19,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 5907 transitions. [2022-11-20 12:31:19,767 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.735433266932271 [2022-11-20 12:31:19,767 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 5907 transitions. [2022-11-20 12:31:19,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 5907 transitions. [2022-11-20 12:31:19,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:31:19,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 5907 transitions. [2022-11-20 12:31:19,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 184.59375) internal successors, (5907), 32 states have internal predecessors, (5907), 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-20 12:31:19,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 251.0) internal successors, (8283), 33 states have internal predecessors, (8283), 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-20 12:31:19,791 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 251.0) internal successors, (8283), 33 states have internal predecessors, (8283), 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-20 12:31:19,791 INFO L175 Difference]: Start difference. First operand has 388 places, 372 transitions, 2150 flow. Second operand 32 states and 5907 transitions. [2022-11-20 12:31:19,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 536 transitions, 3755 flow [2022-11-20 12:31:19,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 536 transitions, 3194 flow, removed 238 selfloop flow, removed 22 redundant places. [2022-11-20 12:31:19,843 INFO L231 Difference]: Finished difference. Result has 407 places, 447 transitions, 2741 flow [2022-11-20 12:31:19,844 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1694, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2741, PETRI_PLACES=407, PETRI_TRANSITIONS=447} [2022-11-20 12:31:19,844 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 174 predicate places. [2022-11-20 12:31:19,844 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 447 transitions, 2741 flow [2022-11-20 12:31:19,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 181.1) internal successors, (9055), 50 states have internal predecessors, (9055), 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-20 12:31:19,847 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:31:19,847 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-20 12:31:19,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-20 12:31:20,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:31:20,053 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 12:31:20,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:31:20,054 INFO L85 PathProgramCache]: Analyzing trace with hash -916173708, now seen corresponding path program 1 times [2022-11-20 12:31:20,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:31:20,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085986696] [2022-11-20 12:31:20,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:31:20,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:31:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:31:24,001 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-20 12:31:24,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:31:24,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085986696] [2022-11-20 12:31:24,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085986696] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:31:24,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824717143] [2022-11-20 12:31:24,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:31:24,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:31:24,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:31:24,007 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:31:24,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:31:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:31:24,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 12:31:24,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:31:24,352 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 12:31:24,353 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-20 12:31:24,415 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:31:24,416 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-20 12:31:24,669 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-20 12:31:24,775 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-20 12:31:25,330 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-20 12:31:25,499 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-20 12:31:26,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:31:26,096 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-11-20 12:31:26,097 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-20 12:31:26,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:31:26,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:31:26,456 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-20 12:31:26,924 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-20 12:31:27,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:31:27,123 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-20 12:31:27,482 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-20 12:31:27,483 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-20 12:31:27,543 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-20 12:31:27,549 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-20 12:31:27,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:31:28,055 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_459 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_460 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 12:31:28,323 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_459 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_460 Int) (v_ArrVal_457 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|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_457) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 12:31:28,596 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_459 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_460 Int) (v_ArrVal_457 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_456) .cse2 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_456 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_457) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 12:31:28,679 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_459 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_460 Int) (v_ArrVal_457 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_456) .cse2 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem37#1| 1) v_ArrVal_456) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_457) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 12:31:30,121 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_460 Int) (v_ArrVal_457 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_454)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 .cse2 v_ArrVal_456) .cse1 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_457) (< (+ (select .cse0 .cse2) 1) v_ArrVal_456) (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_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse4 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-11-20 12:31:41,884 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_460 Int) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_457 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_452))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_454)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_456) .cse1 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_457) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_460) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse4 .cse1))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_456))))))) is different from false [2022-11-20 12:31:42,767 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (v_ArrVal_456 Int) (v_ArrVal_454 Int) (v_ArrVal_459 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_450 Int) (v_ArrVal_460 Int) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_457 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|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_450)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_452))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_454)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_456) .cse4 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_460) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_456) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 .cse4))) (< (+ (select .cse2 .cse4) 1) v_ArrVal_457) (not (<= v_ArrVal_450 0)))))))) is different from false [2022-11-20 12:31:42,801 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:31:42,801 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-20 12:31:42,829 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:31:42,830 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 644 treesize of output 640 [2022-11-20 12:31:42,851 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 408 treesize of output 376 [2022-11-20 12:31:42,877 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 304 treesize of output 292 [2022-11-20 12:31:42,903 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:31:42,904 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 549 treesize of output 525 [2022-11-20 12:31:43,020 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:31:43,021 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-20 12:31:44,032 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:31:44,032 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 304 treesize of output 320 [2022-11-20 12:31:45,980 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:31:45,980 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 85 [2022-11-20 12:31:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-20 12:31:46,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824717143] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:31:46,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:31:46,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 29] total 83 [2022-11-20 12:31:46,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638529236] [2022-11-20 12:31:46,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:31:46,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-11-20 12:31:46,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:31:46,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-11-20 12:31:46,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=659, Invalid=5165, Unknown=56, NotChecked=1092, Total=6972 [2022-11-20 12:31:46,214 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 251 [2022-11-20 12:31:46,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 447 transitions, 2741 flow. Second operand has 84 states, 84 states have (on average 163.0) internal successors, (13692), 84 states have internal predecessors, (13692), 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-20 12:31:46,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:31:46,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 251 [2022-11-20 12:31:46,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:32:35,726 WARN L233 SmtUtils]: Spent 6.32s on a formula simplification. DAG size of input: 91 DAG size of output: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:33:06,868 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_459 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_460 Int) (v_ArrVal_457 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_460) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_457)))) (forall ((v_ArrVal_459 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_460 Int) (v_ArrVal_457 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_460) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse5 .cse2))) (not (<= v_ArrVal_457 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)))))))) is different from false [2022-11-20 12:33:32,726 INFO L130 PetriNetUnfolder]: 2246/12854 cut-off events. [2022-11-20 12:33:32,726 INFO L131 PetriNetUnfolder]: For 28177/28211 co-relation queries the response was YES. [2022-11-20 12:33:32,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31555 conditions, 12854 events. 2246/12854 cut-off events. For 28177/28211 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 137011 event pairs, 808 based on Foata normal form. 11/12178 useless extension candidates. Maximal degree in co-relation 31380. Up to 2381 conditions per place. [2022-11-20 12:33:32,851 INFO L137 encePairwiseOnDemand]: 212/251 looper letters, 373 selfloop transitions, 230 changer transitions 0/772 dead transitions. [2022-11-20 12:33:32,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 772 transitions, 7049 flow [2022-11-20 12:33:32,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-11-20 12:33:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2022-11-20 12:33:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 11994 transitions. [2022-11-20 12:33:32,867 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6636786188579017 [2022-11-20 12:33:32,867 INFO L72 ComplementDD]: Start complementDD. Operand 72 states and 11994 transitions. [2022-11-20 12:33:32,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 11994 transitions. [2022-11-20 12:33:32,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:33:32,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 72 states and 11994 transitions. [2022-11-20 12:33:32,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 73 states, 72 states have (on average 166.58333333333334) internal successors, (11994), 72 states have internal predecessors, (11994), 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-20 12:33:32,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 73 states, 73 states have (on average 251.0) internal successors, (18323), 73 states have internal predecessors, (18323), 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-20 12:33:32,912 INFO L81 ComplementDD]: Finished complementDD. Result has 73 states, 73 states have (on average 251.0) internal successors, (18323), 73 states have internal predecessors, (18323), 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-20 12:33:32,912 INFO L175 Difference]: Start difference. First operand has 407 places, 447 transitions, 2741 flow. Second operand 72 states and 11994 transitions. [2022-11-20 12:33:32,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 772 transitions, 7049 flow [2022-11-20 12:33:33,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 772 transitions, 6756 flow, removed 138 selfloop flow, removed 8 redundant places. [2022-11-20 12:33:33,038 INFO L231 Difference]: Finished difference. Result has 502 places, 561 transitions, 4436 flow [2022-11-20 12:33:33,039 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=2554, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=4436, PETRI_PLACES=502, PETRI_TRANSITIONS=561} [2022-11-20 12:33:33,040 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 269 predicate places. [2022-11-20 12:33:33,041 INFO L495 AbstractCegarLoop]: Abstraction has has 502 places, 561 transitions, 4436 flow [2022-11-20 12:33:33,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 163.0) internal successors, (13692), 84 states have internal predecessors, (13692), 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-20 12:33:33,043 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:33:33,044 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-20 12:33:33,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:33:33,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:33:33,250 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 12:33:33,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:33:33,251 INFO L85 PathProgramCache]: Analyzing trace with hash -799302290, now seen corresponding path program 2 times [2022-11-20 12:33:33,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:33:33,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994750897] [2022-11-20 12:33:33,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:33,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:33:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:36,932 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-20 12:33:36,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:33:36,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994750897] [2022-11-20 12:33:36,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994750897] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:33:36,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090365758] [2022-11-20 12:33:36,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:33:36,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:33:36,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:33:36,935 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:33:36,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:33:37,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:33:37,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:33:37,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-20 12:33:37,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:33:37,740 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 12:33:37,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2022-11-20 12:33:37,891 INFO L321 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-11-20 12:33:37,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2022-11-20 12:33:38,488 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-20 12:33:38,634 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-20 12:33:40,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-20 12:33:41,459 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:33:41,481 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-11-20 12:33:41,481 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-20 12:33:42,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:42,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:33:42,191 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-20 12:33:42,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-20 12:33:43,222 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-20 12:33:43,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:33:43,445 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-20 12:33:43,904 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-20 12:33:43,904 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-20 12:33:43,991 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-20 12:33:43,999 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-20 12:33:43,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:33:45,011 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_536 Int) (v_ArrVal_534 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|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_534) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 12:33:47,077 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_534)))))) is different from false [2022-11-20 12:33:47,209 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_534) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_531 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-20 12:33:47,343 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_534) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem37#1| 1) v_ArrVal_531) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-20 12:33:47,390 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_534) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_531) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-11-20 12:33:47,479 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_528 Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse3 (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_528)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse1 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_534) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_531))))))) is different from false [2022-11-20 12:33:47,533 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_528 Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse2 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_528)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse4 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_534) (< (+ (select .cse2 .cse3) 1) v_ArrVal_531) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse4 (+ |c_~#queue~0.offset| 1604)))))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse6 .cse1)))))) is different from false [2022-11-20 12:33:47,654 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_528 Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_528)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store .cse3 .cse4 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse1 (select .cse6 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store .cse1 .cse2 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_536) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_534) (< (+ (select .cse3 .cse4) 1) v_ArrVal_531) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse5 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))))))) is different from false [2022-11-20 12:33:47,790 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_528 Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_528)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse3 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_534) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse2 .cse1))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_536) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_531) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse5 .cse1)))))))))) is different from false [2022-11-20 12:33:48,321 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_527 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_528 Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_527))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_528)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 .cse3 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_531) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse4 .cse3))) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_536) .cse1) 2147483647) (< (+ (select .cse5 .cse3) 1) v_ArrVal_534))))))))) is different from false [2022-11-20 12:33:49,216 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_527 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| Int) (v_ArrVal_528 Int) (v_ArrVal_526 Int) (v_ArrVal_536 Int) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_534 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_526)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_527))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_528)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_531)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_532))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_534)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_534) (< (+ (select .cse2 .cse3) 1) v_ArrVal_531) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| (select .cse4 .cse1))) (not (<= v_ArrVal_526 0)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse5 .cse1))) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_33| 4)) v_ArrVal_536) .cse3) 2147483647))))))))) is different from false [2022-11-20 12:33:49,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:33:49,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 408 treesize of output 248 [2022-11-20 12:33:49,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:33:49,277 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 518 treesize of output 514 [2022-11-20 12:33:49,298 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 384 treesize of output 352 [2022-11-20 12:33:49,318 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 339 treesize of output 323 [2022-11-20 12:33:49,344 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 220 treesize of output 208 [2022-11-20 12:33:49,423 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-20 12:33:50,282 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:33:50,283 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 200 treesize of output 216 [2022-11-20 12:33:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-11-20 12:33:53,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090365758] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:33:53,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:33:53,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32, 30] total 88 [2022-11-20 12:33:53,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947269131] [2022-11-20 12:33:53,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:33:53,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-11-20 12:33:53,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:33:53,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-11-20 12:33:53,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=638, Invalid=5384, Unknown=28, NotChecked=1782, Total=7832 [2022-11-20 12:33:53,018 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 251 [2022-11-20 12:33:53,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 561 transitions, 4436 flow. Second operand has 89 states, 89 states have (on average 162.0561797752809) internal successors, (14423), 89 states have internal predecessors, (14423), 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-20 12:33:53,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:33:53,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 251 [2022-11-20 12:33:53,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:34:33,054 WARN L233 SmtUtils]: Spent 8.26s on a formula simplification. DAG size of input: 74 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:34:47,862 INFO L130 PetriNetUnfolder]: 5708/37894 cut-off events. [2022-11-20 12:34:47,863 INFO L131 PetriNetUnfolder]: For 215866/215951 co-relation queries the response was YES. [2022-11-20 12:34:48,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98022 conditions, 37894 events. 5708/37894 cut-off events. For 215866/215951 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 530124 event pairs, 2645 based on Foata normal form. 31/35756 useless extension candidates. Maximal degree in co-relation 97810. Up to 4064 conditions per place. [2022-11-20 12:34:48,889 INFO L137 encePairwiseOnDemand]: 207/251 looper letters, 574 selfloop transitions, 412 changer transitions 0/1154 dead transitions. [2022-11-20 12:34:48,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 1154 transitions, 13290 flow [2022-11-20 12:34:48,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-11-20 12:34:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2022-11-20 12:34:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 13198 transitions. [2022-11-20 12:34:48,912 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6572709163346614 [2022-11-20 12:34:48,912 INFO L72 ComplementDD]: Start complementDD. Operand 80 states and 13198 transitions. [2022-11-20 12:34:48,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 13198 transitions. [2022-11-20 12:34:48,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:34:48,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 80 states and 13198 transitions. [2022-11-20 12:34:48,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 81 states, 80 states have (on average 164.975) internal successors, (13198), 80 states have internal predecessors, (13198), 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-20 12:34:48,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 81 states, 81 states have (on average 251.0) internal successors, (20331), 81 states have internal predecessors, (20331), 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-20 12:34:48,976 INFO L81 ComplementDD]: Finished complementDD. Result has 81 states, 81 states have (on average 251.0) internal successors, (20331), 81 states have internal predecessors, (20331), 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-20 12:34:48,976 INFO L175 Difference]: Start difference. First operand has 502 places, 561 transitions, 4436 flow. Second operand 80 states and 13198 transitions. [2022-11-20 12:34:48,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 1154 transitions, 13290 flow [2022-11-20 12:34:49,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 1154 transitions, 12417 flow, removed 423 selfloop flow, removed 12 redundant places. [2022-11-20 12:34:49,534 INFO L231 Difference]: Finished difference. Result has 604 places, 918 transitions, 9696 flow [2022-11-20 12:34:49,535 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=4045, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=80, PETRI_FLOW=9696, PETRI_PLACES=604, PETRI_TRANSITIONS=918} [2022-11-20 12:34:49,535 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 371 predicate places. [2022-11-20 12:34:49,536 INFO L495 AbstractCegarLoop]: Abstraction has has 604 places, 918 transitions, 9696 flow [2022-11-20 12:34:49,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 162.0561797752809) internal successors, (14423), 89 states have internal predecessors, (14423), 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-20 12:34:49,538 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:34:49,538 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-20 12:34:49,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:34:49,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 12:34:49,739 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 12:34:49,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:34:49,739 INFO L85 PathProgramCache]: Analyzing trace with hash -498325606, now seen corresponding path program 3 times [2022-11-20 12:34:49,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:34:49,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693967172] [2022-11-20 12:34:49,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:34:49,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:34:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:34:54,433 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-20 12:34:54,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:34:54,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693967172] [2022-11-20 12:34:54,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693967172] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:34:54,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090533899] [2022-11-20 12:34:54,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:34:54,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:34:54,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:34:54,435 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:34:54,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bbd501-cefd-4fe8-a616-3da4e9b524b4/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 12:34:54,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 12:34:54,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:34:54,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 12:34:54,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:34:54,814 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 12:34:54,815 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-20 12:34:54,889 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:34:54,890 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-20 12:34:55,247 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-20 12:34:55,341 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-20 12:34:55,940 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-20 12:34:56,615 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:34:56,634 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-11-20 12:34:56,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 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 12:34:57,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:34:57,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:34:57,062 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-20 12:34:57,638 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-20 12:34:57,832 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-20 12:34:58,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:34:58,020 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-20 12:34:58,507 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-20 12:34:58,508 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-20 12:34:58,595 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-20 12:34:58,673 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-20 12:34:58,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:34:59,350 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| 4) |c_~#queue~0.offset|) v_ArrVal_612) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 12:34:59,522 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_609)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| 4) |c_~#queue~0.offset|) v_ArrVal_612) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_609 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)))))) is different from false [2022-11-20 12:35:03,334 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_606 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_606) .cse2 v_ArrVal_609)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem37#1| 1) v_ArrVal_606) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_609) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| 4) |c_~#queue~0.offset|) v_ArrVal_612) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 12:35:03,370 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_606 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_606) .cse3 v_ArrVal_609)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_606) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_609) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| 4) |c_~#queue~0.offset|) v_ArrVal_612) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 12:35:04,162 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_43| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_606 Int) (v_ArrVal_604 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse1 (store .cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_43| 4)) v_ArrVal_604)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_606) .cse3 v_ArrVal_609)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_606) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| 4) |c_~#queue~0.offset|) v_ArrVal_612) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_609))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_43| (select .cse4 .cse3)))))) is different from false [2022-11-20 12:35:23,976 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_609 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_43| Int) (v_ArrVal_606 Int) (v_ArrVal_604 Int) (v_ArrVal_602 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_602)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_603))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_43| 4)) v_ArrVal_604)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_606) .cse1 v_ArrVal_609)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_606) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_43| (select .cse4 .cse1))) (not (<= v_ArrVal_602 0)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_609) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| 4) |c_~#queue~0.offset|) v_ArrVal_612) .cse3) 2147483647))))))) is different from false [2022-11-20 12:35:24,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:35:24,005 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 255 treesize of output 170 [2022-11-20 12:35:24,024 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:35:24,025 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 478 treesize of output 474 [2022-11-20 12:35:24,046 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 187 treesize of output 175 [2022-11-20 12:35:24,061 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 371 treesize of output 339 [2022-11-20 12:35:24,077 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 359 treesize of output 343 [2022-11-20 12:35:24,138 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-20 12:35:24,796 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:35:24,797 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 128 treesize of output 144 [2022-11-20 12:35:26,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:35:26,401 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 85 [2022-11-20 12:35:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-20 12:35:26,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090533899] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:35:26,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:35:26,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 29] total 82 [2022-11-20 12:35:26,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838887498] [2022-11-20 12:35:26,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:35:26,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-11-20 12:35:26,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:35:26,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-11-20 12:35:26,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=616, Invalid=5179, Unknown=81, NotChecked=930, Total=6806 [2022-11-20 12:35:26,631 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 251 [2022-11-20 12:35:26,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 918 transitions, 9696 flow. Second operand has 83 states, 83 states have (on average 163.03614457831324) internal successors, (13532), 83 states have internal predecessors, (13532), 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-20 12:35:26,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:35:26,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 251 [2022-11-20 12:35:26,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:35:54,998 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_606 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_606) .cse2 v_ArrVal_609)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_609) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| 4) |c_~#queue~0.offset|) v_ArrVal_612) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_606 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))) (<= |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) is different from false [2022-11-20 12:35:55,142 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (v_ArrVal_606 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_606) .cse2 v_ArrVal_609)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_609) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| 4) |c_~#queue~0.offset|) v_ArrVal_612) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_606 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))) (<= |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 2147483646)) is different from false [2022-11-20 12:35:57,215 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_609)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_609) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| 4) |c_~#queue~0.offset|) v_ArrVal_612) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| (select .cse0 .cse2)))))) (forall ((v_ArrVal_611 (Array Int Int)) (v_ArrVal_609 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| Int) (v_ArrVal_610 (Array Int Int)) (v_ArrVal_612 Int)) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_609)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_610) |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|))) (or (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| 4) |c_~#queue~0.offset|) v_ArrVal_612) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_40| (select .cse5 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_609)))))) is different from false