./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 b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a --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-b5237d8 [2022-11-21 09:09:46,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 09:09:46,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 09:09:46,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 09:09:46,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 09:09:46,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 09:09:46,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 09:09:46,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 09:09:46,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 09:09:46,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 09:09:46,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 09:09:46,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 09:09:46,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 09:09:46,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 09:09:46,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 09:09:46,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 09:09:46,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 09:09:46,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 09:09:46,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 09:09:46,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 09:09:46,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 09:09:46,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 09:09:46,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 09:09:46,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 09:09:46,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 09:09:46,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 09:09:46,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 09:09:46,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 09:09:46,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 09:09:46,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 09:09:46,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 09:09:46,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 09:09:46,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 09:09:46,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 09:09:46,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 09:09:46,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 09:09:46,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 09:09:46,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 09:09:46,428 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 09:09:46,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 09:09:46,430 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 09:09:46,432 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-21 09:09:46,480 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 09:09:46,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 09:09:46,481 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 09:09:46,482 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 09:09:46,495 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 09:09:46,498 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 09:09:46,499 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 09:09:46,499 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 09:09:46,500 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 09:09:46,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 09:09:46,502 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 09:09:46,502 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 09:09:46,502 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 09:09:46,503 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 09:09:46,503 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 09:09:46,504 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 09:09:46,504 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 09:09:46,504 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 09:09:46,505 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-21 09:09:46,505 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 09:09:46,506 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 09:09:46,506 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 09:09:46,506 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 09:09:46,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 09:09:46,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 09:09:46,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 09:09:46,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 09:09:46,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 09:09:46,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 09:09:46,509 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 09:09:46,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 09:09:46,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 09:09:46,511 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 09:09:46,511 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 09:09:46,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 09:09:46,512 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_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/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_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a 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-21 09:09:46,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 09:09:46,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 09:09:46,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 09:09:46,960 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 09:09:46,961 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 09:09:46,963 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-21 09:09:50,681 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 09:09:51,088 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 09:09:51,089 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-21 09:09:51,107 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/data/7e7bb9aa9/1654bc3f39e14d079749d3f436163abc/FLAG352428785 [2022-11-21 09:09:51,134 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/data/7e7bb9aa9/1654bc3f39e14d079749d3f436163abc [2022-11-21 09:09:51,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 09:09:51,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 09:09:51,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 09:09:51,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 09:09:51,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 09:09:51,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:09:51" (1/1) ... [2022-11-21 09:09:51,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17a0974d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:09:51, skipping insertion in model container [2022-11-21 09:09:51,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:09:51" (1/1) ... [2022-11-21 09:09:51,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 09:09:51,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 09:09:51,972 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_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-21 09:09:51,989 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_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-21 09:09:52,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 09:09:52,022 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 09:09:52,138 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_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-21 09:09:52,147 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_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-21 09:09:52,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 09:09:52,239 INFO L208 MainTranslator]: Completed translation [2022-11-21 09:09:52,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:09:52 WrapperNode [2022-11-21 09:09:52,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 09:09:52,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 09:09:52,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 09:09:52,242 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 09:09:52,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:09:52" (1/1) ... [2022-11-21 09:09:52,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:09:52" (1/1) ... [2022-11-21 09:09:52,355 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-11-21 09:09:52,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 09:09:52,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 09:09:52,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 09:09:52,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 09:09:52,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:09:52" (1/1) ... [2022-11-21 09:09:52,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:09:52" (1/1) ... [2022-11-21 09:09:52,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:09:52" (1/1) ... [2022-11-21 09:09:52,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:09:52" (1/1) ... [2022-11-21 09:09:52,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:09:52" (1/1) ... [2022-11-21 09:09:52,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:09:52" (1/1) ... [2022-11-21 09:09:52,423 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:09:52" (1/1) ... [2022-11-21 09:09:52,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:09:52" (1/1) ... [2022-11-21 09:09:52,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 09:09:52,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 09:09:52,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 09:09:52,430 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 09:09:52,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:09:52" (1/1) ... [2022-11-21 09:09:52,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 09:09:52,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:09:52,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 09:09:52,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 09:09:52,557 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-21 09:09:52,559 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-21 09:09:52,559 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-21 09:09:52,559 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-21 09:09:52,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 09:09:52,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 09:09:52,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 09:09:52,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 09:09:52,560 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-21 09:09:52,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 09:09:52,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 09:09:52,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 09:09:52,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 09:09:52,563 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 09:09:52,762 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 09:09:52,765 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 09:09:53,408 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 09:09:53,420 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 09:09:53,421 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-21 09:09:53,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:09:53 BoogieIcfgContainer [2022-11-21 09:09:53,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 09:09:53,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 09:09:53,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 09:09:53,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 09:09:53,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:09:51" (1/3) ... [2022-11-21 09:09:53,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4136be11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:09:53, skipping insertion in model container [2022-11-21 09:09:53,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:09:52" (2/3) ... [2022-11-21 09:09:53,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4136be11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:09:53, skipping insertion in model container [2022-11-21 09:09:53,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:09:53" (3/3) ... [2022-11-21 09:09:53,437 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-21 09:09:53,448 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 09:09:53,462 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 09:09:53,463 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-21 09:09:53,463 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 09:09:53,594 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-21 09:09:53,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 251 transitions, 518 flow [2022-11-21 09:09:53,886 INFO L130 PetriNetUnfolder]: 13/249 cut-off events. [2022-11-21 09:09:53,886 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-21 09:09:53,898 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-21 09:09:53,899 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 251 transitions, 518 flow [2022-11-21 09:09:53,914 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 239 transitions, 487 flow [2022-11-21 09:09:53,942 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 09:09:53,952 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;@56362105, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 09:09:53,953 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-21 09:09:54,023 INFO L130 PetriNetUnfolder]: 6/139 cut-off events. [2022-11-21 09:09:54,024 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-21 09:09:54,024 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:09:54,025 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-21 09:09:54,026 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-21 09:09:54,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:09:54,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1034587718, now seen corresponding path program 1 times [2022-11-21 09:09:54,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:09:54,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343031210] [2022-11-21 09:09:54,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:09:54,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:09:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:09:55,854 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-21 09:09:55,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:09:55,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343031210] [2022-11-21 09:09:55,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343031210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:09:55,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:09:55,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-21 09:09:55,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473011068] [2022-11-21 09:09:55,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:09:55,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 09:09:55,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:09:55,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 09:09:55,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-21 09:09:55,937 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 251 [2022-11-21 09:09:55,948 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-21 09:09:55,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 09:09:55,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 251 [2022-11-21 09:09:55,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 09:09:57,423 INFO L130 PetriNetUnfolder]: 611/2940 cut-off events. [2022-11-21 09:09:57,424 INFO L131 PetriNetUnfolder]: For 88/91 co-relation queries the response was YES. [2022-11-21 09:09:57,438 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-21 09:09:57,455 INFO L137 encePairwiseOnDemand]: 234/251 looper letters, 42 selfloop transitions, 12 changer transitions 0/227 dead transitions. [2022-11-21 09:09:57,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 227 transitions, 571 flow [2022-11-21 09:09:57,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 09:09:57,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-21 09:09:57,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2477 transitions. [2022-11-21 09:09:57,485 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7591173766472571 [2022-11-21 09:09:57,490 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2477 transitions. [2022-11-21 09:09:57,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2477 transitions. [2022-11-21 09:09:57,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 09:09:57,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2477 transitions. [2022-11-21 09:09:57,511 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-21 09:09:57,525 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-21 09:09:57,528 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-21 09:09:57,531 INFO L175 Difference]: Start difference. First operand has 233 places, 239 transitions, 487 flow. Second operand 13 states and 2477 transitions. [2022-11-21 09:09:57,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 227 transitions, 571 flow [2022-11-21 09:09:57,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 227 transitions, 566 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 09:09:57,544 INFO L231 Difference]: Finished difference. Result has 235 places, 227 transitions, 482 flow [2022-11-21 09:09:57,547 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-21 09:09:57,551 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 2 predicate places. [2022-11-21 09:09:57,552 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 227 transitions, 482 flow [2022-11-21 09:09:57,554 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-21 09:09:57,554 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:09:57,554 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-21 09:09:57,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 09:09:57,555 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-21 09:09:57,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:09:57,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1366298667, now seen corresponding path program 1 times [2022-11-21 09:09:57,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:09:57,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363155125] [2022-11-21 09:09:57,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:09:57,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:09:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:14,544 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-21 09:10:14,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:14,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363155125] [2022-11-21 09:10:14,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363155125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:14,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:14,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-21 09:10:14,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513557136] [2022-11-21 09:10:14,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:14,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-21 09:10:14,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:14,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-21 09:10:14,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-11-21 09:10:14,557 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 251 [2022-11-21 09:10:14,569 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-21 09:10:14,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 09:10:14,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 251 [2022-11-21 09:10:14,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 09:10:20,566 INFO L130 PetriNetUnfolder]: 1342/5185 cut-off events. [2022-11-21 09:10:20,567 INFO L131 PetriNetUnfolder]: For 31/34 co-relation queries the response was YES. [2022-11-21 09:10:20,586 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-21 09:10:20,615 INFO L137 encePairwiseOnDemand]: 230/251 looper letters, 108 selfloop transitions, 27 changer transitions 0/299 dead transitions. [2022-11-21 09:10:20,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 299 transitions, 902 flow [2022-11-21 09:10:20,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 09:10:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-21 09:10:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3699 transitions. [2022-11-21 09:10:20,717 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7368525896414343 [2022-11-21 09:10:20,718 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3699 transitions. [2022-11-21 09:10:20,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3699 transitions. [2022-11-21 09:10:20,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 09:10:20,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3699 transitions. [2022-11-21 09:10:20,736 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-21 09:10:20,746 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-21 09:10:20,750 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-21 09:10:20,750 INFO L175 Difference]: Start difference. First operand has 235 places, 227 transitions, 482 flow. Second operand 20 states and 3699 transitions. [2022-11-21 09:10:20,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 299 transitions, 902 flow [2022-11-21 09:10:20,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 299 transitions, 879 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-11-21 09:10:20,759 INFO L231 Difference]: Finished difference. Result has 252 places, 248 transitions, 616 flow [2022-11-21 09:10:20,760 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-21 09:10:20,761 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 19 predicate places. [2022-11-21 09:10:20,761 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 248 transitions, 616 flow [2022-11-21 09:10:20,763 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-21 09:10:20,763 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:10:20,764 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-21 09:10:20,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 09:10:20,764 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-21 09:10:20,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:20,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1204215650, now seen corresponding path program 1 times [2022-11-21 09:10:20,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:20,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652175951] [2022-11-21 09:10:20,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:20,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:23,370 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-21 09:10:23,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:23,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652175951] [2022-11-21 09:10:23,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652175951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:23,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:23,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-21 09:10:23,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605057958] [2022-11-21 09:10:23,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:23,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-21 09:10:23,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:23,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-21 09:10:23,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-11-21 09:10:23,378 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 251 [2022-11-21 09:10:23,382 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-21 09:10:23,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 09:10:23,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 251 [2022-11-21 09:10:23,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 09:10:27,457 INFO L130 PetriNetUnfolder]: 2220/7783 cut-off events. [2022-11-21 09:10:27,458 INFO L131 PetriNetUnfolder]: For 889/896 co-relation queries the response was YES. [2022-11-21 09:10:27,500 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-21 09:10:27,548 INFO L137 encePairwiseOnDemand]: 229/251 looper letters, 208 selfloop transitions, 44 changer transitions 0/409 dead transitions. [2022-11-21 09:10:27,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 409 transitions, 1501 flow [2022-11-21 09:10:27,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 09:10:27,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-11-21 09:10:27,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3958 transitions. [2022-11-21 09:10:27,564 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7167692864904021 [2022-11-21 09:10:27,564 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3958 transitions. [2022-11-21 09:10:27,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3958 transitions. [2022-11-21 09:10:27,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 09:10:27,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3958 transitions. [2022-11-21 09:10:27,581 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-21 09:10:27,594 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-21 09:10:27,600 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-21 09:10:27,600 INFO L175 Difference]: Start difference. First operand has 252 places, 248 transitions, 616 flow. Second operand 22 states and 3958 transitions. [2022-11-21 09:10:27,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 409 transitions, 1501 flow [2022-11-21 09:10:27,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 409 transitions, 1488 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-21 09:10:27,627 INFO L231 Difference]: Finished difference. Result has 273 places, 277 transitions, 861 flow [2022-11-21 09:10:27,628 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-21 09:10:27,630 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 40 predicate places. [2022-11-21 09:10:27,630 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 277 transitions, 861 flow [2022-11-21 09:10:27,633 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-21 09:10:27,633 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:10:27,633 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-21 09:10:27,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 09:10:27,634 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-21 09:10:27,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:27,635 INFO L85 PathProgramCache]: Analyzing trace with hash -526008184, now seen corresponding path program 1 times [2022-11-21 09:10:27,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:27,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026170468] [2022-11-21 09:10:27,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:27,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:27,752 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-21 09:10:27,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:27,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026170468] [2022-11-21 09:10:27,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026170468] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:27,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:27,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 09:10:27,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582571383] [2022-11-21 09:10:27,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:27,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 09:10:27,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:27,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 09:10:27,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 09:10:27,766 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 251 [2022-11-21 09:10:27,767 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-21 09:10:27,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 09:10:27,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 251 [2022-11-21 09:10:27,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 09:10:28,556 INFO L130 PetriNetUnfolder]: 220/3315 cut-off events. [2022-11-21 09:10:28,556 INFO L131 PetriNetUnfolder]: For 227/229 co-relation queries the response was YES. [2022-11-21 09:10:28,585 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-21 09:10:28,606 INFO L137 encePairwiseOnDemand]: 246/251 looper letters, 15 selfloop transitions, 4 changer transitions 0/284 dead transitions. [2022-11-21 09:10:28,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 284 transitions, 915 flow [2022-11-21 09:10:28,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 09:10:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-21 09:10:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 944 transitions. [2022-11-21 09:10:28,611 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9402390438247012 [2022-11-21 09:10:28,611 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 944 transitions. [2022-11-21 09:10:28,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 944 transitions. [2022-11-21 09:10:28,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 09:10:28,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 944 transitions. [2022-11-21 09:10:28,620 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-21 09:10:28,623 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-21 09:10:28,624 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-21 09:10:28,624 INFO L175 Difference]: Start difference. First operand has 273 places, 277 transitions, 861 flow. Second operand 4 states and 944 transitions. [2022-11-21 09:10:28,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 284 transitions, 915 flow [2022-11-21 09:10:28,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 284 transitions, 882 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-11-21 09:10:28,638 INFO L231 Difference]: Finished difference. Result has 270 places, 280 transitions, 856 flow [2022-11-21 09:10:28,639 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-21 09:10:28,641 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 37 predicate places. [2022-11-21 09:10:28,641 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 280 transitions, 856 flow [2022-11-21 09:10:28,642 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-21 09:10:28,642 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:10:28,643 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-21 09:10:28,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 09:10:28,643 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-21 09:10:28,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:28,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1884600977, now seen corresponding path program 1 times [2022-11-21 09:10:28,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:28,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465877828] [2022-11-21 09:10:28,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:28,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:28,788 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-21 09:10:28,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:28,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465877828] [2022-11-21 09:10:28,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465877828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:28,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:28,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:28,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112834379] [2022-11-21 09:10:28,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:28,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 09:10:28,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:28,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 09:10:28,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 09:10:28,793 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 251 [2022-11-21 09:10:28,795 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-21 09:10:28,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 09:10:28,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 251 [2022-11-21 09:10:28,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 09:10:30,027 INFO L130 PetriNetUnfolder]: 372/4921 cut-off events. [2022-11-21 09:10:30,027 INFO L131 PetriNetUnfolder]: For 323/333 co-relation queries the response was YES. [2022-11-21 09:10:30,060 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-21 09:10:30,072 INFO L137 encePairwiseOnDemand]: 244/251 looper letters, 21 selfloop transitions, 4 changer transitions 0/290 dead transitions. [2022-11-21 09:10:30,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 290 transitions, 929 flow [2022-11-21 09:10:30,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 09:10:30,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 09:10:30,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1168 transitions. [2022-11-21 09:10:30,076 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9306772908366534 [2022-11-21 09:10:30,076 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1168 transitions. [2022-11-21 09:10:30,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1168 transitions. [2022-11-21 09:10:30,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 09:10:30,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1168 transitions. [2022-11-21 09:10:30,080 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-21 09:10:30,083 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-21 09:10:30,084 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-21 09:10:30,084 INFO L175 Difference]: Start difference. First operand has 270 places, 280 transitions, 856 flow. Second operand 5 states and 1168 transitions. [2022-11-21 09:10:30,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 290 transitions, 929 flow [2022-11-21 09:10:30,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 290 transitions, 927 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 09:10:30,093 INFO L231 Difference]: Finished difference. Result has 276 places, 283 transitions, 886 flow [2022-11-21 09:10:30,094 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-21 09:10:30,095 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 43 predicate places. [2022-11-21 09:10:30,095 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 283 transitions, 886 flow [2022-11-21 09:10:30,096 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-21 09:10:30,096 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:10:30,096 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-21 09:10:30,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 09:10:30,097 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-21 09:10:30,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:30,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1942994580, now seen corresponding path program 1 times [2022-11-21 09:10:30,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:30,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349870112] [2022-11-21 09:10:30,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:30,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:34,065 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-21 09:10:34,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:34,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349870112] [2022-11-21 09:10:34,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349870112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:34,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:34,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-21 09:10:34,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174095974] [2022-11-21 09:10:34,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:34,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-21 09:10:34,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:34,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-21 09:10:34,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-11-21 09:10:34,072 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 251 [2022-11-21 09:10:34,085 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-21 09:10:34,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 09:10:34,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 251 [2022-11-21 09:10:34,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 09:10:42,639 INFO L130 PetriNetUnfolder]: 6627/24237 cut-off events. [2022-11-21 09:10:42,640 INFO L131 PetriNetUnfolder]: For 4268/4335 co-relation queries the response was YES. [2022-11-21 09:10:42,825 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-21 09:10:42,929 INFO L137 encePairwiseOnDemand]: 229/251 looper letters, 134 selfloop transitions, 33 changer transitions 0/350 dead transitions. [2022-11-21 09:10:42,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 350 transitions, 1393 flow [2022-11-21 09:10:42,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 09:10:42,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-11-21 09:10:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3703 transitions. [2022-11-21 09:10:42,940 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7376494023904383 [2022-11-21 09:10:42,940 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3703 transitions. [2022-11-21 09:10:42,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3703 transitions. [2022-11-21 09:10:42,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 09:10:42,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3703 transitions. [2022-11-21 09:10:42,953 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-21 09:10:42,964 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-21 09:10:42,966 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-21 09:10:42,967 INFO L175 Difference]: Start difference. First operand has 276 places, 283 transitions, 886 flow. Second operand 20 states and 3703 transitions. [2022-11-21 09:10:42,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 350 transitions, 1393 flow [2022-11-21 09:10:43,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 350 transitions, 1391 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 09:10:43,037 INFO L231 Difference]: Finished difference. Result has 299 places, 293 transitions, 1029 flow [2022-11-21 09:10:43,038 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-21 09:10:43,042 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 66 predicate places. [2022-11-21 09:10:43,042 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 293 transitions, 1029 flow [2022-11-21 09:10:43,043 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-21 09:10:43,044 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:10:43,044 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-21 09:10:43,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 09:10:43,044 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-21 09:10:43,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:43,046 INFO L85 PathProgramCache]: Analyzing trace with hash -531483381, now seen corresponding path program 1 times [2022-11-21 09:10:43,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:43,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088796760] [2022-11-21 09:10:43,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:43,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:44,816 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-21 09:10:44,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:44,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088796760] [2022-11-21 09:10:44,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088796760] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:44,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:44,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-21 09:10:44,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494022089] [2022-11-21 09:10:44,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:44,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-21 09:10:44,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:44,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-21 09:10:44,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-11-21 09:10:44,824 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 251 [2022-11-21 09:10:44,834 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-21 09:10:44,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 09:10:44,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 251 [2022-11-21 09:10:44,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 09:10:51,965 INFO L130 PetriNetUnfolder]: 7210/25781 cut-off events. [2022-11-21 09:10:51,965 INFO L131 PetriNetUnfolder]: For 6052/6112 co-relation queries the response was YES. [2022-11-21 09:10:52,176 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-21 09:10:52,291 INFO L137 encePairwiseOnDemand]: 230/251 looper letters, 193 selfloop transitions, 42 changer transitions 0/411 dead transitions. [2022-11-21 09:10:52,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 411 transitions, 1797 flow [2022-11-21 09:10:52,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-21 09:10:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-21 09:10:52,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3420 transitions. [2022-11-21 09:10:52,304 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7171314741035857 [2022-11-21 09:10:52,305 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3420 transitions. [2022-11-21 09:10:52,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3420 transitions. [2022-11-21 09:10:52,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 09:10:52,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3420 transitions. [2022-11-21 09:10:52,319 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-21 09:10:52,330 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-21 09:10:52,333 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-21 09:10:52,333 INFO L175 Difference]: Start difference. First operand has 299 places, 293 transitions, 1029 flow. Second operand 19 states and 3420 transitions. [2022-11-21 09:10:52,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 411 transitions, 1797 flow [2022-11-21 09:10:52,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 411 transitions, 1765 flow, removed 2 selfloop flow, removed 12 redundant places. [2022-11-21 09:10:52,508 INFO L231 Difference]: Finished difference. Result has 309 places, 301 transitions, 1165 flow [2022-11-21 09:10:52,509 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-21 09:10:52,511 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 76 predicate places. [2022-11-21 09:10:52,511 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 301 transitions, 1165 flow [2022-11-21 09:10:52,512 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-21 09:10:52,513 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:10:52,513 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-21 09:10:52,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 09:10:52,513 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-21 09:10:52,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:52,514 INFO L85 PathProgramCache]: Analyzing trace with hash 99264505, now seen corresponding path program 1 times [2022-11-21 09:10:52,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:52,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33855781] [2022-11-21 09:10:52,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:52,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:52,841 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-21 09:10:52,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:52,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33855781] [2022-11-21 09:10:52,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33855781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:52,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:52,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:52,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333052413] [2022-11-21 09:10:52,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:52,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 09:10:52,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:52,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 09:10:52,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 09:10:52,847 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 251 [2022-11-21 09:10:52,848 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-21 09:10:52,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 09:10:52,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 251 [2022-11-21 09:10:52,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 09:10:54,661 INFO L130 PetriNetUnfolder]: 374/6307 cut-off events. [2022-11-21 09:10:54,661 INFO L131 PetriNetUnfolder]: For 844/892 co-relation queries the response was YES. [2022-11-21 09:10:54,740 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-21 09:10:54,761 INFO L137 encePairwiseOnDemand]: 244/251 looper letters, 21 selfloop transitions, 4 changer transitions 0/311 dead transitions. [2022-11-21 09:10:54,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 311 transitions, 1241 flow [2022-11-21 09:10:54,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 09:10:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-21 09:10:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1168 transitions. [2022-11-21 09:10:54,771 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9306772908366534 [2022-11-21 09:10:54,776 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1168 transitions. [2022-11-21 09:10:54,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1168 transitions. [2022-11-21 09:10:54,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 09:10:54,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1168 transitions. [2022-11-21 09:10:54,786 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-21 09:10:54,791 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-21 09:10:54,792 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-21 09:10:54,792 INFO L175 Difference]: Start difference. First operand has 309 places, 301 transitions, 1165 flow. Second operand 5 states and 1168 transitions. [2022-11-21 09:10:54,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 311 transitions, 1241 flow [2022-11-21 09:10:54,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 311 transitions, 1208 flow, removed 2 selfloop flow, removed 11 redundant places. [2022-11-21 09:10:54,815 INFO L231 Difference]: Finished difference. Result has 305 places, 304 transitions, 1164 flow [2022-11-21 09:10:54,816 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-21 09:10:54,821 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 72 predicate places. [2022-11-21 09:10:54,821 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 304 transitions, 1164 flow [2022-11-21 09:10:54,822 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-21 09:10:54,822 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:10:54,822 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-21 09:10:54,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 09:10:54,823 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-21 09:10:54,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:54,824 INFO L85 PathProgramCache]: Analyzing trace with hash -738274639, now seen corresponding path program 1 times [2022-11-21 09:10:54,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:54,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033834725] [2022-11-21 09:10:54,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:54,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:54,985 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-21 09:10:54,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:54,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033834725] [2022-11-21 09:10:54,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033834725] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:54,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:54,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 09:10:54,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508826346] [2022-11-21 09:10:54,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:54,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 09:10:54,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:54,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 09:10:54,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 09:10:54,990 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 251 [2022-11-21 09:10:54,991 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-21 09:10:54,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 09:10:54,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 251 [2022-11-21 09:10:54,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 09:10:55,178 INFO L130 PetriNetUnfolder]: 48/939 cut-off events. [2022-11-21 09:10:55,179 INFO L131 PetriNetUnfolder]: For 227/228 co-relation queries the response was YES. [2022-11-21 09:10:55,186 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-21 09:10:55,188 INFO L137 encePairwiseOnDemand]: 247/251 looper letters, 7 selfloop transitions, 2 changer transitions 5/285 dead transitions. [2022-11-21 09:10:55,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 285 transitions, 1045 flow [2022-11-21 09:10:55,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 09:10:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 09:10:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2022-11-21 09:10:55,191 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.949535192563081 [2022-11-21 09:10:55,191 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 715 transitions. [2022-11-21 09:10:55,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 715 transitions. [2022-11-21 09:10:55,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 09:10:55,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 715 transitions. [2022-11-21 09:10:55,194 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-21 09:10:55,197 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-21 09:10:55,198 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-21 09:10:55,198 INFO L175 Difference]: Start difference. First operand has 305 places, 304 transitions, 1164 flow. Second operand 3 states and 715 transitions. [2022-11-21 09:10:55,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 285 transitions, 1045 flow [2022-11-21 09:10:55,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 285 transitions, 1033 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-11-21 09:10:55,209 INFO L231 Difference]: Finished difference. Result has 302 places, 279 transitions, 1002 flow [2022-11-21 09:10:55,210 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-21 09:10:55,212 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 69 predicate places. [2022-11-21 09:10:55,212 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 279 transitions, 1002 flow [2022-11-21 09:10:55,212 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-21 09:10:55,213 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:10:55,213 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-21 09:10:55,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 09:10:55,214 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-21 09:10:55,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:55,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1781137955, now seen corresponding path program 1 times [2022-11-21 09:10:55,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:55,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325263023] [2022-11-21 09:10:55,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:55,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:56,595 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-21 09:10:56,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:56,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325263023] [2022-11-21 09:10:56,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325263023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:56,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:56,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-21 09:10:56,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501224674] [2022-11-21 09:10:56,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:56,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-21 09:10:56,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:56,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-21 09:10:56,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-11-21 09:10:56,601 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 251 [2022-11-21 09:10:56,605 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-21 09:10:56,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 09:10:56,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 251 [2022-11-21 09:10:56,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 09:10:58,008 INFO L130 PetriNetUnfolder]: 302/1913 cut-off events. [2022-11-21 09:10:58,009 INFO L131 PetriNetUnfolder]: For 672/677 co-relation queries the response was YES. [2022-11-21 09:10:58,019 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-21 09:10:58,025 INFO L137 encePairwiseOnDemand]: 235/251 looper letters, 71 selfloop transitions, 29 changer transitions 0/287 dead transitions. [2022-11-21 09:10:58,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 287 transitions, 1216 flow [2022-11-21 09:10:58,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 09:10:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-21 09:10:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2799 transitions. [2022-11-21 09:10:58,036 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7434262948207171 [2022-11-21 09:10:58,037 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2799 transitions. [2022-11-21 09:10:58,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2799 transitions. [2022-11-21 09:10:58,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 09:10:58,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2799 transitions. [2022-11-21 09:10:58,046 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-21 09:10:58,054 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-21 09:10:58,056 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-21 09:10:58,057 INFO L175 Difference]: Start difference. First operand has 302 places, 279 transitions, 1002 flow. Second operand 15 states and 2799 transitions. [2022-11-21 09:10:58,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 287 transitions, 1216 flow [2022-11-21 09:10:58,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 287 transitions, 1212 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 09:10:58,071 INFO L231 Difference]: Finished difference. Result has 316 places, 282 transitions, 1086 flow [2022-11-21 09:10:58,072 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-21 09:10:58,072 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 83 predicate places. [2022-11-21 09:10:58,073 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 282 transitions, 1086 flow [2022-11-21 09:10:58,074 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-21 09:10:58,074 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:10:58,075 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-21 09:10:58,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 09:10:58,075 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-21 09:10:58,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:10:58,076 INFO L85 PathProgramCache]: Analyzing trace with hash -404100282, now seen corresponding path program 1 times [2022-11-21 09:10:58,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:10:58,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575005444] [2022-11-21 09:10:58,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:10:58,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:10:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:10:59,927 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-21 09:10:59,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:10:59,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575005444] [2022-11-21 09:10:59,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575005444] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:10:59,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:10:59,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-21 09:10:59,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927986884] [2022-11-21 09:10:59,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:10:59,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-21 09:10:59,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:10:59,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-21 09:10:59,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-11-21 09:10:59,934 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 251 [2022-11-21 09:10:59,938 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-21 09:10:59,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 09:10:59,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 251 [2022-11-21 09:10:59,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 09:11:01,838 INFO L130 PetriNetUnfolder]: 295/1884 cut-off events. [2022-11-21 09:11:01,838 INFO L131 PetriNetUnfolder]: For 752/757 co-relation queries the response was YES. [2022-11-21 09:11:01,845 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-21 09:11:01,849 INFO L137 encePairwiseOnDemand]: 235/251 looper letters, 93 selfloop transitions, 23 changer transitions 0/296 dead transitions. [2022-11-21 09:11:01,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 296 transitions, 1354 flow [2022-11-21 09:11:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 09:11:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-21 09:11:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2676 transitions. [2022-11-21 09:11:01,860 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7107569721115538 [2022-11-21 09:11:01,860 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2676 transitions. [2022-11-21 09:11:01,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2676 transitions. [2022-11-21 09:11:01,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 09:11:01,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2676 transitions. [2022-11-21 09:11:01,868 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-21 09:11:01,876 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-21 09:11:01,877 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-21 09:11:01,878 INFO L175 Difference]: Start difference. First operand has 316 places, 282 transitions, 1086 flow. Second operand 15 states and 2676 transitions. [2022-11-21 09:11:01,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 296 transitions, 1354 flow [2022-11-21 09:11:01,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 296 transitions, 1323 flow, removed 2 selfloop flow, removed 11 redundant places. [2022-11-21 09:11:01,891 INFO L231 Difference]: Finished difference. Result has 321 places, 283 transitions, 1123 flow [2022-11-21 09:11:01,892 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-21 09:11:01,893 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 88 predicate places. [2022-11-21 09:11:01,893 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 283 transitions, 1123 flow [2022-11-21 09:11:01,894 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-21 09:11:01,895 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:11:01,895 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-21 09:11:01,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 09:11:01,896 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-21 09:11:01,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:11:01,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1123022933, now seen corresponding path program 1 times [2022-11-21 09:11:01,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:11:01,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973610328] [2022-11-21 09:11:01,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:11:01,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:11:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:11:05,637 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-21 09:11:05,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:11:05,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973610328] [2022-11-21 09:11:05,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973610328] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:11:05,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48444142] [2022-11-21 09:11:05,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:11:05,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:11:05,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:11:05,645 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:11:05,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 09:11:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:11:05,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-21 09:11:05,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:11:06,208 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 09:11:06,209 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-21 09:11:06,585 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-21 09:11:06,706 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-21 09:11:07,400 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-21 09:11:08,147 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:11:08,175 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-11-21 09:11:08,175 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-21 09:11:08,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:11:08,663 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:11:08,665 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-21 09:11:09,385 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-21 09:11:09,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:11:09,613 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-21 09:11:10,112 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-21 09:11:10,113 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-21 09:11:10,180 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-21 09:11:10,189 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-21 09:11:10,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:11:10,742 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-21 09:11:10,800 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-21 09:11:10,832 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-21 09:11:10,852 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-21 09:11:10,876 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-21 09:11:11,125 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-21 09:11:11,221 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-21 09:11:11,511 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-21 09:11:11,580 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-21 09:11:11,675 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-21 09:11:14,033 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-21 09:11:14,713 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-21 09:11:14,750 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:11:14,750 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-21 09:11:14,773 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:11:14,774 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-21 09:11:14,797 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-21 09:11:14,844 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-21 09:11:14,945 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-21 09:11:15,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:11:15,326 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-21 09:11:17,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:11:17,483 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-21 09:11:17,624 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-21 09:11:17,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48444142] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:11:17,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:11:17,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 29] total 79 [2022-11-21 09:11:17,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100217488] [2022-11-21 09:11:17,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:11:17,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-11-21 09:11:17,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:11:17,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-11-21 09:11:17,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=590, Invalid=3992, Unknown=22, NotChecked=1716, Total=6320 [2022-11-21 09:11:17,644 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 251 [2022-11-21 09:11:17,657 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-21 09:11:17,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 09:11:17,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 251 [2022-11-21 09:11:17,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 09:12:01,794 WARN L233 SmtUtils]: Spent 32.61s on a formula simplification. DAG size of input: 134 DAG size of output: 123 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:12:22,546 WARN L233 SmtUtils]: Spent 16.54s on a formula simplification. DAG size of input: 132 DAG size of output: 116 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:13:03,530 WARN L233 SmtUtils]: Spent 32.70s on a formula simplification. DAG size of input: 130 DAG size of output: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:13:43,383 WARN L233 SmtUtils]: Spent 28.56s on a formula simplification. DAG size of input: 130 DAG size of output: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:13:45,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:13:48,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:13:52,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:14:18,129 WARN L233 SmtUtils]: Spent 24.41s on a formula simplification. DAG size of input: 143 DAG size of output: 132 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:14:20,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:14:45,118 WARN L233 SmtUtils]: Spent 24.42s on a formula simplification. DAG size of input: 143 DAG size of output: 132 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:14:51,368 INFO L130 PetriNetUnfolder]: 511/2466 cut-off events. [2022-11-21 09:14:51,368 INFO L131 PetriNetUnfolder]: For 1617/1621 co-relation queries the response was YES. [2022-11-21 09:14:51,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5252 conditions, 2466 events. 511/2466 cut-off events. For 1617/1621 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 16355 event pairs, 243 based on Foata normal form. 10/2365 useless extension candidates. Maximal degree in co-relation 5106. Up to 717 conditions per place. [2022-11-21 09:14:51,400 INFO L137 encePairwiseOnDemand]: 215/251 looper letters, 165 selfloop transitions, 116 changer transitions 0/432 dead transitions. [2022-11-21 09:14:51,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 432 transitions, 2490 flow [2022-11-21 09:14:51,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-21 09:14:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-11-21 09:14:51,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 9572 transitions. [2022-11-21 09:14:51,427 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6463636977513674 [2022-11-21 09:14:51,428 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 9572 transitions. [2022-11-21 09:14:51,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 9572 transitions. [2022-11-21 09:14:51,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 09:14:51,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 9572 transitions. [2022-11-21 09:14:51,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 162.23728813559322) internal successors, (9572), 59 states have internal predecessors, (9572), 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-21 09:14:51,487 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-21 09:14:51,494 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-21 09:14:51,494 INFO L175 Difference]: Start difference. First operand has 321 places, 283 transitions, 1123 flow. Second operand 59 states and 9572 transitions. [2022-11-21 09:14:51,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 432 transitions, 2490 flow [2022-11-21 09:14:51,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 432 transitions, 2441 flow, removed 9 selfloop flow, removed 13 redundant places. [2022-11-21 09:14:51,523 INFO L231 Difference]: Finished difference. Result has 382 places, 365 transitions, 2031 flow [2022-11-21 09:14:51,525 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=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=2031, PETRI_PLACES=382, PETRI_TRANSITIONS=365} [2022-11-21 09:14:51,526 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 149 predicate places. [2022-11-21 09:14:51,526 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 365 transitions, 2031 flow [2022-11-21 09:14:51,531 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-21 09:14:51,532 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:14:51,532 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-21 09:14:51,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 09:14:51,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-21 09:14:51,740 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-21 09:14:51,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:14:51,741 INFO L85 PathProgramCache]: Analyzing trace with hash 453973176, now seen corresponding path program 1 times [2022-11-21 09:14:51,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:14:51,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532348557] [2022-11-21 09:14:51,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:14:51,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:14:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:14:53,502 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-21 09:14:53,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:14:53,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532348557] [2022-11-21 09:14:53,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532348557] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:14:53,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642362817] [2022-11-21 09:14:53,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:14:53,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:14:53,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:14:53,504 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:14:53,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 09:14:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:14:53,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-21 09:14:53,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:14:54,595 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-21 09:14:54,885 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-21 09:14:55,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:14:55,017 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-21 09:14:55,468 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-21 09:14:55,469 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-21 09:14:55,614 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-21 09:14:55,624 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-21 09:14:55,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:14:56,819 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:14:56,819 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-21 09:14:56,832 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:14:56,833 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-21 09:14:56,843 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-21 09:14:56,864 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-21 09:14:56,884 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:14:56,885 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-21 09:14:57,404 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-21 09:14:57,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642362817] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:14:57,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:14:57,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 49 [2022-11-21 09:14:57,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173681670] [2022-11-21 09:14:57,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:14:57,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-21 09:14:57,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:14:57,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-21 09:14:57,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=2194, Unknown=11, NotChecked=0, Total=2450 [2022-11-21 09:14:57,424 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 251 [2022-11-21 09:14:57,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 365 transitions, 2031 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-21 09:14:57,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 09:14:57,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 251 [2022-11-21 09:14:57,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 09:15:02,572 INFO L130 PetriNetUnfolder]: 710/4314 cut-off events. [2022-11-21 09:15:02,572 INFO L131 PetriNetUnfolder]: For 3078/3080 co-relation queries the response was YES. [2022-11-21 09:15:02,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8566 conditions, 4314 events. 710/4314 cut-off events. For 3078/3080 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 35094 event pairs, 205 based on Foata normal form. 15/4127 useless extension candidates. Maximal degree in co-relation 8416. Up to 622 conditions per place. [2022-11-21 09:15:02,652 INFO L137 encePairwiseOnDemand]: 228/251 looper letters, 189 selfloop transitions, 115 changer transitions 0/488 dead transitions. [2022-11-21 09:15:02,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 488 transitions, 3259 flow [2022-11-21 09:15:02,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-21 09:15:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-11-21 09:15:02,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 5175 transitions. [2022-11-21 09:15:02,664 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7363403528742174 [2022-11-21 09:15:02,664 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 5175 transitions. [2022-11-21 09:15:02,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 5175 transitions. [2022-11-21 09:15:02,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 09:15:02,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 5175 transitions. [2022-11-21 09:15:02,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 184.82142857142858) internal successors, (5175), 28 states have internal predecessors, (5175), 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-21 09:15:02,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 251.0) internal successors, (7279), 29 states have internal predecessors, (7279), 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-21 09:15:02,697 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 251.0) internal successors, (7279), 29 states have internal predecessors, (7279), 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-21 09:15:02,697 INFO L175 Difference]: Start difference. First operand has 382 places, 365 transitions, 2031 flow. Second operand 28 states and 5175 transitions. [2022-11-21 09:15:02,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 488 transitions, 3259 flow [2022-11-21 09:15:02,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 488 transitions, 2783 flow, removed 196 selfloop flow, removed 22 redundant places. [2022-11-21 09:15:02,755 INFO L231 Difference]: Finished difference. Result has 395 places, 402 transitions, 2259 flow [2022-11-21 09:15:02,755 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1598, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=2259, PETRI_PLACES=395, PETRI_TRANSITIONS=402} [2022-11-21 09:15:02,757 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 162 predicate places. [2022-11-21 09:15:02,757 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 402 transitions, 2259 flow [2022-11-21 09:15:02,760 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-21 09:15:02,760 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 09:15:02,760 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-21 09:15:02,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 09:15:02,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-21 09:15:02,967 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-21 09:15:02,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:15:02,968 INFO L85 PathProgramCache]: Analyzing trace with hash -916173708, now seen corresponding path program 1 times [2022-11-21 09:15:02,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:15:02,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83380229] [2022-11-21 09:15:02,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:15:02,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:15:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:15:07,738 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-21 09:15:07,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:15:07,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83380229] [2022-11-21 09:15:07,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83380229] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:15:07,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363658266] [2022-11-21 09:15:07,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:15:07,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:15:07,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:15:07,744 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:15:07,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65aced6-b1d8-4490-92ef-50d5ffaeb19a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 09:15:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:15:07,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-21 09:15:07,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:15:08,147 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 09:15:08,148 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-21 09:15:08,241 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 09:15:08,241 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-21 09:15:08,617 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-21 09:15:08,751 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-21 09:15:09,660 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-21 09:15:09,894 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-21 09:15:10,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:15:10,755 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-11-21 09:15:10,756 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-21 09:15:11,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:15:11,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:15:11,314 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-21 09:15:11,983 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-21 09:15:12,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:15:12,269 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-21 09:15:12,797 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-21 09:15:12,798 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-21 09:15:12,870 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-21 09:15:12,878 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-21 09:15:12,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:15:13,508 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-21 09:15:16,378 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-21 09:15:19,179 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (forall ((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 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_454)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_456) .cse1 v_ArrVal_457)) |c_~#stored_elements~0.base| v_ArrVal_459) |c_~#queue~0.base|))) (or (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_460) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse1) 1) v_ArrVal_457) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_456)))))))) is different from false [2022-11-21 09:15:19,311 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-21 09:15:30,930 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-21 09:15:31,869 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-21 09:15:31,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:15:31,906 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-21 09:15:31,932 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:15:31,933 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-21 09:15:31,955 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-21 09:15:31,982 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-21 09:15:32,009 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:15:32,010 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-21 09:15:32,136 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:15:32,136 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-21 09:15:33,140 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:15:33,141 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-21 09:15:35,219 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:15:35,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 85 [2022-11-21 09:15:35,509 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-21 09:15:35,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363658266] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:15:35,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:15:35,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 29] total 83 [2022-11-21 09:15:35,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290927392] [2022-11-21 09:15:35,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:15:35,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-11-21 09:15:35,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:15:35,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-11-21 09:15:35,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=5320, Unknown=58, NotChecked=942, Total=6972 [2022-11-21 09:15:35,529 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 251 [2022-11-21 09:15:35,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 402 transitions, 2259 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-21 09:15:35,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 09:15:35,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 251 [2022-11-21 09:15:35,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 09:16:11,916 WARN L233 SmtUtils]: Spent 14.86s on a formula simplification. DAG size of input: 155 DAG size of output: 135 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:16:22,211 WARN L233 SmtUtils]: Spent 5.73s on a formula simplification. DAG size of input: 175 DAG size of output: 169 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:16:24,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:16:26,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:16:42,047 WARN L233 SmtUtils]: Spent 5.34s on a formula simplification. DAG size of input: 109 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:17:01,993 WARN L233 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 107 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:17:50,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:17:52,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:18:12,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:19:06,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:19:21,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]