./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:14:32,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:14:32,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:14:32,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:14:32,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:14:32,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:14:32,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:14:32,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:14:32,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:14:32,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:14:32,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:14:32,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:14:32,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:14:32,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:14:32,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:14:32,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:14:32,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:14:32,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:14:32,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:14:32,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:14:32,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:14:32,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:14:32,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:14:32,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:14:32,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:14:32,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:14:32,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:14:32,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:14:32,066 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:14:32,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:14:32,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:14:32,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:14:32,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:14:32,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:14:32,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:14:32,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:14:32,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:14:32,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:14:32,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:14:32,076 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:14:32,077 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:14:32,082 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-18 20:14:32,132 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:14:32,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:14:32,134 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:14:32,134 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:14:32,135 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:14:32,136 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:14:32,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:14:32,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:14:32,137 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:14:32,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:14:32,139 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:14:32,139 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:14:32,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:14:32,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:14:32,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:14:32,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:14:32,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:14:32,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:14:32,141 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 20:14:32,141 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:14:32,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:14:32,142 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:14:32,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:14:32,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:14:32,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:14:32,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:14:32,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:14:32,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:14:32,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:14:32,144 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:14:32,144 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:14:32,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:14:32,145 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:14:32,145 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:14:32,145 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:14:32,145 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_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2022-11-18 20:14:32,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:14:32,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:14:32,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:14:32,524 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:14:32,525 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:14:32,526 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-18 20:14:32,616 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/data/ed6dbcfe3/201e94ff1ed74a84b52ccc977b26c6d5/FLAGa25eefe05 [2022-11-18 20:14:33,373 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:14:33,374 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-18 20:14:33,388 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/data/ed6dbcfe3/201e94ff1ed74a84b52ccc977b26c6d5/FLAGa25eefe05 [2022-11-18 20:14:33,612 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/data/ed6dbcfe3/201e94ff1ed74a84b52ccc977b26c6d5 [2022-11-18 20:14:33,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:14:33,616 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:14:33,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:14:33,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:14:33,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:14:33,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:14:33" (1/1) ... [2022-11-18 20:14:33,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75b05038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:14:33, skipping insertion in model container [2022-11-18 20:14:33,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:14:33" (1/1) ... [2022-11-18 20:14:33,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:14:33,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:14:34,202 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-18 20:14:34,209 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-18 20:14:34,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:14:34,223 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:14:34,265 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-18 20:14:34,273 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-18 20:14:34,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:14:34,331 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:14:34,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:14:34 WrapperNode [2022-11-18 20:14:34,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:14:34,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:14:34,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:14:34,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:14:34,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:14:34" (1/1) ... [2022-11-18 20:14:34,374 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:14:34" (1/1) ... [2022-11-18 20:14:34,410 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-11-18 20:14:34,411 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:14:34,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:14:34,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:14:34,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:14:34,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:14:34" (1/1) ... [2022-11-18 20:14:34,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:14:34" (1/1) ... [2022-11-18 20:14:34,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:14:34" (1/1) ... [2022-11-18 20:14:34,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:14:34" (1/1) ... [2022-11-18 20:14:34,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:14:34" (1/1) ... [2022-11-18 20:14:34,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:14:34" (1/1) ... [2022-11-18 20:14:34,480 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:14:34" (1/1) ... [2022-11-18 20:14:34,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:14:34" (1/1) ... [2022-11-18 20:14:34,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:14:34,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:14:34,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:14:34,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:14:34,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:14:34" (1/1) ... [2022-11-18 20:14:34,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:14:34,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:14:34,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:14:34,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:14:34,580 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-18 20:14:34,580 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-18 20:14:34,580 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-18 20:14:34,581 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-18 20:14:34,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:14:34,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:14:34,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:14:34,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:14:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-18 20:14:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:14:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:14:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:14:34,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:14:34,584 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:14:34,757 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:14:34,759 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:14:35,243 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:14:35,255 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:14:35,256 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 20:14:35,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:14:35 BoogieIcfgContainer [2022-11-18 20:14:35,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:14:35,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:14:35,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:14:35,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:14:35,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:14:33" (1/3) ... [2022-11-18 20:14:35,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4450f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:14:35, skipping insertion in model container [2022-11-18 20:14:35,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:14:34" (2/3) ... [2022-11-18 20:14:35,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4450f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:14:35, skipping insertion in model container [2022-11-18 20:14:35,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:14:35" (3/3) ... [2022-11-18 20:14:35,303 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-11-18 20:14:35,334 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 20:14:35,345 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:14:35,358 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-18 20:14:35,359 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:14:35,503 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-18 20:14:35,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 251 transitions, 518 flow [2022-11-18 20:14:35,685 INFO L130 PetriNetUnfolder]: 13/249 cut-off events. [2022-11-18 20:14:35,686 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-18 20:14:35,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 249 events. 13/249 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 459 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2022-11-18 20:14:35,700 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 251 transitions, 518 flow [2022-11-18 20:14:35,709 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 239 transitions, 487 flow [2022-11-18 20:14:35,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:14:35,730 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;@24038b3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:14:35,731 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-18 20:14:35,801 INFO L130 PetriNetUnfolder]: 6/139 cut-off events. [2022-11-18 20:14:35,801 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-18 20:14:35,802 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:14:35,803 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:14:35,803 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:14:35,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:35,812 INFO L85 PathProgramCache]: Analyzing trace with hash 68024645, now seen corresponding path program 1 times [2022-11-18 20:14:35,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:35,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901066557] [2022-11-18 20:14:35,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:35,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:37,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:14:37,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:14:37,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901066557] [2022-11-18 20:14:37,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901066557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:14:37,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:14:37,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-18 20:14:37,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425599195] [2022-11-18 20:14:37,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:14:37,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 20:14:37,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:14:37,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 20:14:37,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:14:37,534 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 251 [2022-11-18 20:14:37,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 239 transitions, 487 flow. Second operand has 12 states, 12 states have (on average 188.5) internal successors, (2262), 12 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:37,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:14:37,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 251 [2022-11-18 20:14:37,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:14:38,809 INFO L130 PetriNetUnfolder]: 611/2940 cut-off events. [2022-11-18 20:14:38,809 INFO L131 PetriNetUnfolder]: For 88/91 co-relation queries the response was YES. [2022-11-18 20:14:38,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3902 conditions, 2940 events. 611/2940 cut-off events. For 88/91 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 24649 event pairs, 459 based on Foata normal form. 118/2693 useless extension candidates. Maximal degree in co-relation 3504. Up to 882 conditions per place. [2022-11-18 20:14:38,845 INFO L137 encePairwiseOnDemand]: 234/251 looper letters, 42 selfloop transitions, 12 changer transitions 0/227 dead transitions. [2022-11-18 20:14:38,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 227 transitions, 571 flow [2022-11-18 20:14:38,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:14:38,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:14:38,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2477 transitions. [2022-11-18 20:14:38,878 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7591173766472571 [2022-11-18 20:14:38,879 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2477 transitions. [2022-11-18 20:14:38,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2477 transitions. [2022-11-18 20:14:38,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:14:38,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2477 transitions. [2022-11-18 20:14:38,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 190.53846153846155) internal successors, (2477), 13 states have internal predecessors, (2477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:38,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 251.0) internal successors, (3514), 14 states have internal predecessors, (3514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:38,921 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 251.0) internal successors, (3514), 14 states have internal predecessors, (3514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:38,924 INFO L175 Difference]: Start difference. First operand has 233 places, 239 transitions, 487 flow. Second operand 13 states and 2477 transitions. [2022-11-18 20:14:38,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 227 transitions, 571 flow [2022-11-18 20:14:38,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 227 transitions, 566 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 20:14:38,947 INFO L231 Difference]: Finished difference. Result has 235 places, 227 transitions, 482 flow [2022-11-18 20:14:38,949 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=482, PETRI_PLACES=235, PETRI_TRANSITIONS=227} [2022-11-18 20:14:38,956 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 2 predicate places. [2022-11-18 20:14:38,957 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 227 transitions, 482 flow [2022-11-18 20:14:38,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 188.5) internal successors, (2262), 12 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:38,959 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:14:38,960 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:14:38,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:14:38,961 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:14:38,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:38,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1738829715, now seen corresponding path program 1 times [2022-11-18 20:14:38,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:38,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728589053] [2022-11-18 20:14:38,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:38,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:53,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:14:53,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:14:53,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728589053] [2022-11-18 20:14:53,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728589053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:14:53,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:14:53,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-18 20:14:53,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715657688] [2022-11-18 20:14:53,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:14:53,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 20:14:53,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:14:53,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 20:14:53,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:14:53,445 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 251 [2022-11-18 20:14:53,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 227 transitions, 482 flow. Second operand has 20 states, 20 states have (on average 178.75) internal successors, (3575), 20 states have internal predecessors, (3575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:53,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:14:53,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 251 [2022-11-18 20:14:53,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:05,724 INFO L130 PetriNetUnfolder]: 1367/5618 cut-off events. [2022-11-18 20:15:05,725 INFO L131 PetriNetUnfolder]: For 30/33 co-relation queries the response was YES. [2022-11-18 20:15:05,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7805 conditions, 5618 events. 1367/5618 cut-off events. For 30/33 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 51961 event pairs, 952 based on Foata normal form. 1/4851 useless extension candidates. Maximal degree in co-relation 7705. Up to 1675 conditions per place. [2022-11-18 20:15:05,771 INFO L137 encePairwiseOnDemand]: 229/251 looper letters, 108 selfloop transitions, 28 changer transitions 0/299 dead transitions. [2022-11-18 20:15:05,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 299 transitions, 904 flow [2022-11-18 20:15:05,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 20:15:05,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-18 20:15:05,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3857 transitions. [2022-11-18 20:15:05,785 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7317397078353254 [2022-11-18 20:15:05,785 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3857 transitions. [2022-11-18 20:15:05,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3857 transitions. [2022-11-18 20:15:05,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:05,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3857 transitions. [2022-11-18 20:15:05,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 183.66666666666666) internal successors, (3857), 21 states have internal predecessors, (3857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:05,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 251.0) internal successors, (5522), 22 states have internal predecessors, (5522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:05,815 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 251.0) internal successors, (5522), 22 states have internal predecessors, (5522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:05,816 INFO L175 Difference]: Start difference. First operand has 235 places, 227 transitions, 482 flow. Second operand 21 states and 3857 transitions. [2022-11-18 20:15:05,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 299 transitions, 904 flow [2022-11-18 20:15:05,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 299 transitions, 881 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-11-18 20:15:05,826 INFO L231 Difference]: Finished difference. Result has 253 places, 248 transitions, 618 flow [2022-11-18 20:15:05,827 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=618, PETRI_PLACES=253, PETRI_TRANSITIONS=248} [2022-11-18 20:15:05,828 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 20 predicate places. [2022-11-18 20:15:05,829 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 248 transitions, 618 flow [2022-11-18 20:15:05,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 178.75) internal successors, (3575), 20 states have internal predecessors, (3575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:05,831 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:05,831 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:15:05,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:15:05,832 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:15:05,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:05,833 INFO L85 PathProgramCache]: Analyzing trace with hash 689057386, now seen corresponding path program 1 times [2022-11-18 20:15:05,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:05,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583334451] [2022-11-18 20:15:05,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:05,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:08,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:08,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583334451] [2022-11-18 20:15:08,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583334451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:15:08,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:15:08,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-18 20:15:08,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504394281] [2022-11-18 20:15:08,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:15:08,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 20:15:08,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:08,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 20:15:08,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:15:08,293 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 251 [2022-11-18 20:15:08,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 248 transitions, 618 flow. Second operand has 20 states, 20 states have (on average 171.1) internal successors, (3422), 20 states have internal predecessors, (3422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:08,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:15:08,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 251 [2022-11-18 20:15:08,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:12,107 INFO L130 PetriNetUnfolder]: 2220/7783 cut-off events. [2022-11-18 20:15:12,107 INFO L131 PetriNetUnfolder]: For 888/895 co-relation queries the response was YES. [2022-11-18 20:15:12,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12411 conditions, 7783 events. 2220/7783 cut-off events. For 888/895 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 72994 event pairs, 175 based on Foata normal form. 86/7089 useless extension candidates. Maximal degree in co-relation 12298. Up to 1746 conditions per place. [2022-11-18 20:15:12,185 INFO L137 encePairwiseOnDemand]: 229/251 looper letters, 208 selfloop transitions, 44 changer transitions 0/409 dead transitions. [2022-11-18 20:15:12,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 409 transitions, 1503 flow [2022-11-18 20:15:12,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 20:15:12,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-11-18 20:15:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3958 transitions. [2022-11-18 20:15:12,199 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7167692864904021 [2022-11-18 20:15:12,199 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3958 transitions. [2022-11-18 20:15:12,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3958 transitions. [2022-11-18 20:15:12,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:12,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3958 transitions. [2022-11-18 20:15:12,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 179.9090909090909) internal successors, (3958), 22 states have internal predecessors, (3958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:12,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 251.0) internal successors, (5773), 23 states have internal predecessors, (5773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:12,231 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 251.0) internal successors, (5773), 23 states have internal predecessors, (5773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:12,232 INFO L175 Difference]: Start difference. First operand has 253 places, 248 transitions, 618 flow. Second operand 22 states and 3958 transitions. [2022-11-18 20:15:12,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 409 transitions, 1503 flow [2022-11-18 20:15:12,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 409 transitions, 1488 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-18 20:15:12,256 INFO L231 Difference]: Finished difference. Result has 273 places, 277 transitions, 861 flow [2022-11-18 20:15:12,257 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=861, PETRI_PLACES=273, PETRI_TRANSITIONS=277} [2022-11-18 20:15:12,258 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 40 predicate places. [2022-11-18 20:15:12,258 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 277 transitions, 861 flow [2022-11-18 20:15:12,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 171.1) internal successors, (3422), 20 states have internal predecessors, (3422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:12,261 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:12,261 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:15:12,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:15:12,262 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:15:12,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:12,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1840558730, now seen corresponding path program 1 times [2022-11-18 20:15:12,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:12,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921096493] [2022-11-18 20:15:12,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:12,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:12,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:12,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:12,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921096493] [2022-11-18 20:15:12,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921096493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:15:12,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:15:12,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:15:12,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143866329] [2022-11-18 20:15:12,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:15:12,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:15:12,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:12,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:15:12,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:15:12,378 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 251 [2022-11-18 20:15:12,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 277 transitions, 861 flow. Second operand has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:12,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:15:12,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 251 [2022-11-18 20:15:12,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:13,153 INFO L130 PetriNetUnfolder]: 220/3315 cut-off events. [2022-11-18 20:15:13,154 INFO L131 PetriNetUnfolder]: For 227/229 co-relation queries the response was YES. [2022-11-18 20:15:13,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4051 conditions, 3315 events. 220/3315 cut-off events. For 227/229 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 29855 event pairs, 15 based on Foata normal form. 0/2895 useless extension candidates. Maximal degree in co-relation 3961. Up to 224 conditions per place. [2022-11-18 20:15:13,197 INFO L137 encePairwiseOnDemand]: 246/251 looper letters, 15 selfloop transitions, 4 changer transitions 0/284 dead transitions. [2022-11-18 20:15:13,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 284 transitions, 915 flow [2022-11-18 20:15:13,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:15:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-18 20:15:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 944 transitions. [2022-11-18 20:15:13,202 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9402390438247012 [2022-11-18 20:15:13,203 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 944 transitions. [2022-11-18 20:15:13,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 944 transitions. [2022-11-18 20:15:13,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:13,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 944 transitions. [2022-11-18 20:15:13,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:13,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:13,213 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:13,213 INFO L175 Difference]: Start difference. First operand has 273 places, 277 transitions, 861 flow. Second operand 4 states and 944 transitions. [2022-11-18 20:15:13,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 284 transitions, 915 flow [2022-11-18 20:15:13,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 284 transitions, 882 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-11-18 20:15:13,227 INFO L231 Difference]: Finished difference. Result has 270 places, 280 transitions, 856 flow [2022-11-18 20:15:13,232 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=856, PETRI_PLACES=270, PETRI_TRANSITIONS=280} [2022-11-18 20:15:13,234 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 37 predicate places. [2022-11-18 20:15:13,234 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 280 transitions, 856 flow [2022-11-18 20:15:13,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:13,235 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:13,235 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:15:13,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:15:13,236 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:15:13,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:13,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2061236017, now seen corresponding path program 1 times [2022-11-18 20:15:13,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:13,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157785461] [2022-11-18 20:15:13,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:13,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:13,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:13,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157785461] [2022-11-18 20:15:13,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157785461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:15:13,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:15:13,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:15:13,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820486085] [2022-11-18 20:15:13,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:15:13,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:15:13,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:13,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:15:13,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:15:13,337 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 251 [2022-11-18 20:15:13,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 280 transitions, 856 flow. Second operand has 4 states, 4 states have (on average 229.75) internal successors, (919), 4 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:13,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:15:13,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 251 [2022-11-18 20:15:13,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:14,611 INFO L130 PetriNetUnfolder]: 372/4921 cut-off events. [2022-11-18 20:15:14,614 INFO L131 PetriNetUnfolder]: For 323/333 co-relation queries the response was YES. [2022-11-18 20:15:14,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6383 conditions, 4921 events. 372/4921 cut-off events. For 323/333 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 51755 event pairs, 31 based on Foata normal form. 0/4345 useless extension candidates. Maximal degree in co-relation 6298. Up to 486 conditions per place. [2022-11-18 20:15:14,672 INFO L137 encePairwiseOnDemand]: 244/251 looper letters, 21 selfloop transitions, 4 changer transitions 0/290 dead transitions. [2022-11-18 20:15:14,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 290 transitions, 929 flow [2022-11-18 20:15:14,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:15:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 20:15:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1168 transitions. [2022-11-18 20:15:14,677 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9306772908366534 [2022-11-18 20:15:14,677 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1168 transitions. [2022-11-18 20:15:14,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1168 transitions. [2022-11-18 20:15:14,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:14,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1168 transitions. [2022-11-18 20:15:14,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 233.6) internal successors, (1168), 5 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:14,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:14,696 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:14,706 INFO L175 Difference]: Start difference. First operand has 270 places, 280 transitions, 856 flow. Second operand 5 states and 1168 transitions. [2022-11-18 20:15:14,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 290 transitions, 929 flow [2022-11-18 20:15:14,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 290 transitions, 927 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:15:14,719 INFO L231 Difference]: Finished difference. Result has 276 places, 283 transitions, 886 flow [2022-11-18 20:15:14,720 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=886, PETRI_PLACES=276, PETRI_TRANSITIONS=283} [2022-11-18 20:15:14,724 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 43 predicate places. [2022-11-18 20:15:14,724 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 283 transitions, 886 flow [2022-11-18 20:15:14,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 229.75) internal successors, (919), 4 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:14,726 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:14,726 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:15:14,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:15:14,727 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:15:14,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:14,729 INFO L85 PathProgramCache]: Analyzing trace with hash 223433814, now seen corresponding path program 1 times [2022-11-18 20:15:14,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:14,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896028281] [2022-11-18 20:15:14,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:14,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:18,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:18,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896028281] [2022-11-18 20:15:18,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896028281] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:15:18,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:15:18,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-18 20:15:18,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341096439] [2022-11-18 20:15:18,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:15:18,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 20:15:18,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:18,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 20:15:18,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:15:18,566 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 251 [2022-11-18 20:15:18,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 283 transitions, 886 flow. Second operand has 20 states, 20 states have (on average 178.9) internal successors, (3578), 20 states have internal predecessors, (3578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:18,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:15:18,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 251 [2022-11-18 20:15:18,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:26,668 INFO L130 PetriNetUnfolder]: 6682/26255 cut-off events. [2022-11-18 20:15:26,668 INFO L131 PetriNetUnfolder]: For 4451/4518 co-relation queries the response was YES. [2022-11-18 20:15:26,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43974 conditions, 26255 events. 6682/26255 cut-off events. For 4451/4518 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 328684 event pairs, 4290 based on Foata normal form. 11/23509 useless extension candidates. Maximal degree in co-relation 43861. Up to 8780 conditions per place. [2022-11-18 20:15:27,094 INFO L137 encePairwiseOnDemand]: 228/251 looper letters, 134 selfloop transitions, 34 changer transitions 0/350 dead transitions. [2022-11-18 20:15:27,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 350 transitions, 1395 flow [2022-11-18 20:15:27,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 20:15:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-18 20:15:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3861 transitions. [2022-11-18 20:15:27,106 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.732498577120091 [2022-11-18 20:15:27,106 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3861 transitions. [2022-11-18 20:15:27,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3861 transitions. [2022-11-18 20:15:27,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:27,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3861 transitions. [2022-11-18 20:15:27,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 183.85714285714286) internal successors, (3861), 21 states have internal predecessors, (3861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:27,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 251.0) internal successors, (5522), 22 states have internal predecessors, (5522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:27,133 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 251.0) internal successors, (5522), 22 states have internal predecessors, (5522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:27,134 INFO L175 Difference]: Start difference. First operand has 276 places, 283 transitions, 886 flow. Second operand 21 states and 3861 transitions. [2022-11-18 20:15:27,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 350 transitions, 1395 flow [2022-11-18 20:15:27,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 350 transitions, 1393 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:15:27,207 INFO L231 Difference]: Finished difference. Result has 300 places, 293 transitions, 1031 flow [2022-11-18 20:15:27,208 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1031, PETRI_PLACES=300, PETRI_TRANSITIONS=293} [2022-11-18 20:15:27,210 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 67 predicate places. [2022-11-18 20:15:27,211 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 293 transitions, 1031 flow [2022-11-18 20:15:27,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 178.9) internal successors, (3578), 20 states have internal predecessors, (3578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:27,212 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:27,212 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:15:27,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:15:27,213 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:15:27,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:27,214 INFO L85 PathProgramCache]: Analyzing trace with hash 302890185, now seen corresponding path program 1 times [2022-11-18 20:15:27,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:27,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079564558] [2022-11-18 20:15:27,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:27,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:28,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:28,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:28,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079564558] [2022-11-18 20:15:28,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079564558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:15:28,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:15:28,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-18 20:15:28,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707868835] [2022-11-18 20:15:28,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:15:28,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 20:15:28,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:28,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 20:15:28,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:15:28,721 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 251 [2022-11-18 20:15:28,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 293 transitions, 1031 flow. Second operand has 19 states, 19 states have (on average 171.3684210526316) internal successors, (3256), 19 states have internal predecessors, (3256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:28,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:15:28,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 251 [2022-11-18 20:15:28,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:35,450 INFO L130 PetriNetUnfolder]: 8327/30061 cut-off events. [2022-11-18 20:15:35,451 INFO L131 PetriNetUnfolder]: For 7582/7657 co-relation queries the response was YES. [2022-11-18 20:15:35,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54263 conditions, 30061 events. 8327/30061 cut-off events. For 7582/7657 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 376689 event pairs, 1616 based on Foata normal form. 254/28087 useless extension candidates. Maximal degree in co-relation 54130. Up to 8392 conditions per place. [2022-11-18 20:15:35,825 INFO L137 encePairwiseOnDemand]: 228/251 looper letters, 215 selfloop transitions, 59 changer transitions 0/450 dead transitions. [2022-11-18 20:15:35,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 450 transitions, 2035 flow [2022-11-18 20:15:35,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 20:15:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-18 20:15:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3783 transitions. [2022-11-18 20:15:35,839 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7177006260671599 [2022-11-18 20:15:35,839 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3783 transitions. [2022-11-18 20:15:35,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3783 transitions. [2022-11-18 20:15:35,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:35,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3783 transitions. [2022-11-18 20:15:35,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 180.14285714285714) internal successors, (3783), 21 states have internal predecessors, (3783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:35,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 251.0) internal successors, (5522), 22 states have internal predecessors, (5522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:35,869 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 251.0) internal successors, (5522), 22 states have internal predecessors, (5522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:35,870 INFO L175 Difference]: Start difference. First operand has 300 places, 293 transitions, 1031 flow. Second operand 21 states and 3783 transitions. [2022-11-18 20:15:35,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 450 transitions, 2035 flow [2022-11-18 20:15:36,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 450 transitions, 2001 flow, removed 2 selfloop flow, removed 13 redundant places. [2022-11-18 20:15:36,086 INFO L231 Difference]: Finished difference. Result has 314 places, 317 transitions, 1335 flow [2022-11-18 20:15:36,087 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1335, PETRI_PLACES=314, PETRI_TRANSITIONS=317} [2022-11-18 20:15:36,088 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 81 predicate places. [2022-11-18 20:15:36,088 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 317 transitions, 1335 flow [2022-11-18 20:15:36,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 171.3684210526316) internal successors, (3256), 19 states have internal predecessors, (3256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:36,090 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:36,090 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:15:36,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:15:36,090 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:15:36,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:36,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1284739427, now seen corresponding path program 2 times [2022-11-18 20:15:36,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:36,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373217846] [2022-11-18 20:15:36,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:36,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:37,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:37,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373217846] [2022-11-18 20:15:37,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373217846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:15:37,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:15:37,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-18 20:15:37,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348373484] [2022-11-18 20:15:37,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:15:37,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 20:15:37,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:37,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 20:15:37,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:15:37,844 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 251 [2022-11-18 20:15:37,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 317 transitions, 1335 flow. Second operand has 19 states, 19 states have (on average 171.3684210526316) internal successors, (3256), 19 states have internal predecessors, (3256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:37,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:15:37,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 251 [2022-11-18 20:15:37,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:45,778 INFO L130 PetriNetUnfolder]: 8939/31692 cut-off events. [2022-11-18 20:15:45,778 INFO L131 PetriNetUnfolder]: For 16576/16717 co-relation queries the response was YES. [2022-11-18 20:15:46,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60634 conditions, 31692 events. 8939/31692 cut-off events. For 16576/16717 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 398275 event pairs, 1184 based on Foata normal form. 316/29602 useless extension candidates. Maximal degree in co-relation 60494. Up to 6856 conditions per place. [2022-11-18 20:15:46,251 INFO L137 encePairwiseOnDemand]: 230/251 looper letters, 194 selfloop transitions, 64 changer transitions 0/434 dead transitions. [2022-11-18 20:15:46,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 434 transitions, 2170 flow [2022-11-18 20:15:46,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 20:15:46,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-18 20:15:46,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3251 transitions. [2022-11-18 20:15:46,260 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7195661797255423 [2022-11-18 20:15:46,261 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3251 transitions. [2022-11-18 20:15:46,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3251 transitions. [2022-11-18 20:15:46,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:46,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3251 transitions. [2022-11-18 20:15:46,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 180.61111111111111) internal successors, (3251), 18 states have internal predecessors, (3251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:46,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 251.0) internal successors, (4769), 19 states have internal predecessors, (4769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:46,287 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 251.0) internal successors, (4769), 19 states have internal predecessors, (4769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:46,287 INFO L175 Difference]: Start difference. First operand has 314 places, 317 transitions, 1335 flow. Second operand 18 states and 3251 transitions. [2022-11-18 20:15:46,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 434 transitions, 2170 flow [2022-11-18 20:15:46,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 434 transitions, 2125 flow, removed 13 selfloop flow, removed 9 redundant places. [2022-11-18 20:15:46,552 INFO L231 Difference]: Finished difference. Result has 326 places, 325 transitions, 1548 flow [2022-11-18 20:15:46,553 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1548, PETRI_PLACES=326, PETRI_TRANSITIONS=325} [2022-11-18 20:15:46,556 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 93 predicate places. [2022-11-18 20:15:46,556 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 325 transitions, 1548 flow [2022-11-18 20:15:46,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 171.3684210526316) internal successors, (3256), 19 states have internal predecessors, (3256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:46,557 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:46,558 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:15:46,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:15:46,558 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:15:46,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:46,559 INFO L85 PathProgramCache]: Analyzing trace with hash -777952197, now seen corresponding path program 1 times [2022-11-18 20:15:46,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:46,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230766218] [2022-11-18 20:15:46,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:46,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:46,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:46,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230766218] [2022-11-18 20:15:46,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230766218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:15:46,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:15:46,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:15:46,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502241289] [2022-11-18 20:15:46,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:15:46,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:15:46,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:46,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:15:46,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:15:46,671 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 251 [2022-11-18 20:15:46,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 325 transitions, 1548 flow. Second operand has 4 states, 4 states have (on average 229.75) internal successors, (919), 4 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:46,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:15:46,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 251 [2022-11-18 20:15:46,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:48,491 INFO L130 PetriNetUnfolder]: 467/7570 cut-off events. [2022-11-18 20:15:48,492 INFO L131 PetriNetUnfolder]: For 1927/2285 co-relation queries the response was YES. [2022-11-18 20:15:48,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10420 conditions, 7570 events. 467/7570 cut-off events. For 1927/2285 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 86377 event pairs, 23 based on Foata normal form. 44/6948 useless extension candidates. Maximal degree in co-relation 10354. Up to 231 conditions per place. [2022-11-18 20:15:48,603 INFO L137 encePairwiseOnDemand]: 244/251 looper letters, 21 selfloop transitions, 4 changer transitions 0/335 dead transitions. [2022-11-18 20:15:48,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 335 transitions, 1624 flow [2022-11-18 20:15:48,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:15:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 20:15:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1168 transitions. [2022-11-18 20:15:48,608 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9306772908366534 [2022-11-18 20:15:48,608 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1168 transitions. [2022-11-18 20:15:48,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1168 transitions. [2022-11-18 20:15:48,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:48,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1168 transitions. [2022-11-18 20:15:48,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 233.6) internal successors, (1168), 5 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:48,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:48,624 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:48,624 INFO L175 Difference]: Start difference. First operand has 326 places, 325 transitions, 1548 flow. Second operand 5 states and 1168 transitions. [2022-11-18 20:15:48,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 335 transitions, 1624 flow [2022-11-18 20:15:48,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 335 transitions, 1578 flow, removed 7 selfloop flow, removed 10 redundant places. [2022-11-18 20:15:48,653 INFO L231 Difference]: Finished difference. Result has 323 places, 328 transitions, 1534 flow [2022-11-18 20:15:48,653 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1534, PETRI_PLACES=323, PETRI_TRANSITIONS=328} [2022-11-18 20:15:48,654 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 90 predicate places. [2022-11-18 20:15:48,655 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 328 transitions, 1534 flow [2022-11-18 20:15:48,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 229.75) internal successors, (919), 4 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:48,655 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:48,656 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:15:48,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:15:48,656 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:15:48,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:48,657 INFO L85 PathProgramCache]: Analyzing trace with hash -180825677, now seen corresponding path program 1 times [2022-11-18 20:15:48,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:48,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861386242] [2022-11-18 20:15:48,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:48,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:48,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:48,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861386242] [2022-11-18 20:15:48,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861386242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:15:48,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:15:48,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:15:48,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474138689] [2022-11-18 20:15:48,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:15:48,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:15:48,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:48,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:15:48,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:15:48,800 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 251 [2022-11-18 20:15:48,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 328 transitions, 1534 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:48,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:15:48,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 251 [2022-11-18 20:15:48,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:49,109 INFO L130 PetriNetUnfolder]: 49/984 cut-off events. [2022-11-18 20:15:49,110 INFO L131 PetriNetUnfolder]: For 392/393 co-relation queries the response was YES. [2022-11-18 20:15:49,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 984 events. 49/984 cut-off events. For 392/393 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4528 event pairs, 2 based on Foata normal form. 0/922 useless extension candidates. Maximal degree in co-relation 1519. Up to 24 conditions per place. [2022-11-18 20:15:49,121 INFO L137 encePairwiseOnDemand]: 247/251 looper letters, 7 selfloop transitions, 2 changer transitions 5/295 dead transitions. [2022-11-18 20:15:49,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 295 transitions, 1247 flow [2022-11-18 20:15:49,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:15:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:15:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2022-11-18 20:15:49,125 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.949535192563081 [2022-11-18 20:15:49,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 715 transitions. [2022-11-18 20:15:49,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 715 transitions. [2022-11-18 20:15:49,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:49,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 715 transitions. [2022-11-18 20:15:49,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:49,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:49,135 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:49,135 INFO L175 Difference]: Start difference. First operand has 323 places, 328 transitions, 1534 flow. Second operand 3 states and 715 transitions. [2022-11-18 20:15:49,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 295 transitions, 1247 flow [2022-11-18 20:15:49,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 295 transitions, 1222 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-11-18 20:15:49,150 INFO L231 Difference]: Finished difference. Result has 318 places, 289 transitions, 1191 flow [2022-11-18 20:15:49,151 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=318, PETRI_TRANSITIONS=289} [2022-11-18 20:15:49,151 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 85 predicate places. [2022-11-18 20:15:49,152 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 289 transitions, 1191 flow [2022-11-18 20:15:49,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:49,152 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:49,153 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:15:49,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:15:49,153 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:15:49,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:49,154 INFO L85 PathProgramCache]: Analyzing trace with hash -477690277, now seen corresponding path program 1 times [2022-11-18 20:15:49,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:49,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018098795] [2022-11-18 20:15:49,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:49,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:50,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:50,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018098795] [2022-11-18 20:15:50,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018098795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:15:50,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:15:50,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-18 20:15:50,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291486786] [2022-11-18 20:15:50,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:15:50,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 20:15:50,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:50,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 20:15:50,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:15:50,832 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 251 [2022-11-18 20:15:50,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 289 transitions, 1191 flow. Second operand has 17 states, 17 states have (on average 183.64705882352942) internal successors, (3122), 17 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:50,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:15:50,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 251 [2022-11-18 20:15:50,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:52,136 INFO L130 PetriNetUnfolder]: 331/2028 cut-off events. [2022-11-18 20:15:52,136 INFO L131 PetriNetUnfolder]: For 1030/1034 co-relation queries the response was YES. [2022-11-18 20:15:52,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3845 conditions, 2028 events. 331/2028 cut-off events. For 1030/1034 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 12827 event pairs, 237 based on Foata normal form. 2/1909 useless extension candidates. Maximal degree in co-relation 3712. Up to 643 conditions per place. [2022-11-18 20:15:52,153 INFO L137 encePairwiseOnDemand]: 234/251 looper letters, 77 selfloop transitions, 30 changer transitions 0/297 dead transitions. [2022-11-18 20:15:52,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 297 transitions, 1419 flow [2022-11-18 20:15:52,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:15:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-18 20:15:52,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2799 transitions. [2022-11-18 20:15:52,159 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7434262948207171 [2022-11-18 20:15:52,159 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2799 transitions. [2022-11-18 20:15:52,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2799 transitions. [2022-11-18 20:15:52,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:52,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2799 transitions. [2022-11-18 20:15:52,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 186.6) internal successors, (2799), 15 states have internal predecessors, (2799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:52,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 251.0) internal successors, (4016), 16 states have internal predecessors, (4016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:52,176 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 251.0) internal successors, (4016), 16 states have internal predecessors, (4016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:52,176 INFO L175 Difference]: Start difference. First operand has 318 places, 289 transitions, 1191 flow. Second operand 15 states and 2799 transitions. [2022-11-18 20:15:52,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 297 transitions, 1419 flow [2022-11-18 20:15:52,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 297 transitions, 1415 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:15:52,196 INFO L231 Difference]: Finished difference. Result has 332 places, 292 transitions, 1277 flow [2022-11-18 20:15:52,196 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1277, PETRI_PLACES=332, PETRI_TRANSITIONS=292} [2022-11-18 20:15:52,198 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 99 predicate places. [2022-11-18 20:15:52,198 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 292 transitions, 1277 flow [2022-11-18 20:15:52,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 183.64705882352942) internal successors, (3122), 17 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:52,200 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:52,200 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:15:52,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:15:52,201 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:15:52,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:52,201 INFO L85 PathProgramCache]: Analyzing trace with hash 253624126, now seen corresponding path program 1 times [2022-11-18 20:15:52,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:52,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290089671] [2022-11-18 20:15:52,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:52,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:53,926 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:53,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:53,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290089671] [2022-11-18 20:15:53,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290089671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:15:53,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:15:53,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-18 20:15:53,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348181790] [2022-11-18 20:15:53,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:15:53,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 20:15:53,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:53,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 20:15:53,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:15:53,931 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 251 [2022-11-18 20:15:53,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 292 transitions, 1277 flow. Second operand has 18 states, 18 states have (on average 174.94444444444446) internal successors, (3149), 18 states have internal predecessors, (3149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:53,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:15:53,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 251 [2022-11-18 20:15:53,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:15:55,385 INFO L130 PetriNetUnfolder]: 317/1966 cut-off events. [2022-11-18 20:15:55,385 INFO L131 PetriNetUnfolder]: For 1124/1129 co-relation queries the response was YES. [2022-11-18 20:15:55,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3813 conditions, 1966 events. 317/1966 cut-off events. For 1124/1129 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 12407 event pairs, 109 based on Foata normal form. 7/1863 useless extension candidates. Maximal degree in co-relation 3663. Up to 477 conditions per place. [2022-11-18 20:15:55,403 INFO L137 encePairwiseOnDemand]: 235/251 looper letters, 95 selfloop transitions, 26 changer transitions 0/304 dead transitions. [2022-11-18 20:15:55,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 304 transitions, 1536 flow [2022-11-18 20:15:55,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:15:55,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-18 20:15:55,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2676 transitions. [2022-11-18 20:15:55,407 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7107569721115538 [2022-11-18 20:15:55,407 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2676 transitions. [2022-11-18 20:15:55,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2676 transitions. [2022-11-18 20:15:55,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:15:55,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2676 transitions. [2022-11-18 20:15:55,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 178.4) internal successors, (2676), 15 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:55,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 251.0) internal successors, (4016), 16 states have internal predecessors, (4016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:55,419 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 251.0) internal successors, (4016), 16 states have internal predecessors, (4016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:55,419 INFO L175 Difference]: Start difference. First operand has 332 places, 292 transitions, 1277 flow. Second operand 15 states and 2676 transitions. [2022-11-18 20:15:55,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 304 transitions, 1536 flow [2022-11-18 20:15:55,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 304 transitions, 1502 flow, removed 2 selfloop flow, removed 11 redundant places. [2022-11-18 20:15:55,433 INFO L231 Difference]: Finished difference. Result has 337 places, 292 transitions, 1305 flow [2022-11-18 20:15:55,434 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1305, PETRI_PLACES=337, PETRI_TRANSITIONS=292} [2022-11-18 20:15:55,435 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 104 predicate places. [2022-11-18 20:15:55,435 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 292 transitions, 1305 flow [2022-11-18 20:15:55,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 174.94444444444446) internal successors, (3149), 18 states have internal predecessors, (3149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:55,436 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:15:55,437 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:15:55,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:15:55,437 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:15:55,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:55,437 INFO L85 PathProgramCache]: Analyzing trace with hash 51128915, now seen corresponding path program 1 times [2022-11-18 20:15:55,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:55,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348257710] [2022-11-18 20:15:55,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:55,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:58,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:58,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348257710] [2022-11-18 20:15:58,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348257710] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:15:58,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736625906] [2022-11-18 20:15:58,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:58,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:15:58,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:15:58,672 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:15:58,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:15:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:58,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-18 20:15:58,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:15:59,164 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:15:59,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-18 20:15:59,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:15:59,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 20:16:00,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-18 20:16:00,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:16:00,742 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-18 20:16:00,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-18 20:16:01,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:16:01,073 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:16:01,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-18 20:16:01,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-18 20:16:01,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:16:01,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-18 20:16:02,419 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-18 20:16:02,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-18 20:16:02,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-18 20:16:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:16:02,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:16:03,242 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_345 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_344 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_345) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-18 20:16:03,602 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_345 Int) (v_ArrVal_343 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_344 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_343)) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_345) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_343)))) is different from false [2022-11-18 20:16:04,192 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse2 .cse3))) (or (forall ((v_ArrVal_345 Int) (v_ArrVal_343 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_344 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_341) .cse3 v_ArrVal_343)) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ .cse1 1) v_ArrVal_343) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_345) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_341 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))) (= .cse1 800)))) is different from false [2022-11-18 20:16:04,529 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (select .cse0 .cse4))) (or (forall ((v_ArrVal_345 Int) (v_ArrVal_343 Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_344 (Array Int Int))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_341) .cse4 v_ArrVal_343)) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_341) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (+ .cse3 1) v_ArrVal_343) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_345) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) (= .cse3 800)))) is different from false [2022-11-18 20:16:05,367 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_345 Int) (v_ArrVal_343 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_338 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4)) v_ArrVal_338)) (.cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse4 .cse5 v_ArrVal_341) .cse3 v_ArrVal_343)) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|)) (.cse1 (select .cse4 .cse3))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_345) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse1 1) v_ArrVal_343) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse2 .cse3))) (= 800 .cse1) (< (+ (select .cse4 .cse5) 1) v_ArrVal_341)))))) is different from false [2022-11-18 20:16:14,309 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_345 Int) (v_ArrVal_343 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| Int) (v_ArrVal_341 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| Int) (v_ArrVal_344 (Array Int Int)) (v_ArrVal_338 Int) (v_ArrVal_336 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_336)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_337))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| 4) |c_~#queue~0.offset|) v_ArrVal_338)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (select .cse3 .cse1)) (.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_341) .cse1 v_ArrVal_343)) |c_~#stored_elements~0.base| v_ArrVal_344) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| (select .cse0 .cse1))) (not (<= v_ArrVal_336 0)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_15| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_341) (< (+ .cse5 1) v_ArrVal_343) (= .cse5 800) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_12| 4) |c_~#queue~0.offset|) v_ArrVal_345) .cse4) 2147483647))))))) is different from false [2022-11-18 20:16:14,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:16:14,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 283 treesize of output 183 [2022-11-18 20:16:14,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:16:14,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 349 treesize of output 343 [2022-11-18 20:16:14,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 178 [2022-11-18 20:16:14,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 157 [2022-11-18 20:16:14,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-18 20:16:14,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:16:14,780 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 221 treesize of output 233 [2022-11-18 20:16:18,939 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-18 20:16:18,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2022-11-18 20:16:19,010 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-18 20:16:19,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736625906] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:16:19,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:16:19,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 29] total 80 [2022-11-18 20:16:19,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558173285] [2022-11-18 20:16:19,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:16:19,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-18 20:16:19,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:16:19,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-18 20:16:19,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=4885, Unknown=65, NotChecked=906, Total=6480 [2022-11-18 20:16:19,021 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 251 [2022-11-18 20:16:19,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 292 transitions, 1305 flow. Second operand has 81 states, 81 states have (on average 160.14814814814815) internal successors, (12972), 81 states have internal predecessors, (12972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:16:19,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:16:19,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 251 [2022-11-18 20:16:19,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:17:14,993 INFO L130 PetriNetUnfolder]: 809/4038 cut-off events. [2022-11-18 20:17:14,993 INFO L131 PetriNetUnfolder]: For 2452/2456 co-relation queries the response was YES. [2022-11-18 20:17:15,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8193 conditions, 4038 events. 809/4038 cut-off events. For 2452/2456 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 30064 event pairs, 364 based on Foata normal form. 10/3830 useless extension candidates. Maximal degree in co-relation 8040. Up to 755 conditions per place. [2022-11-18 20:17:15,031 INFO L137 encePairwiseOnDemand]: 212/251 looper letters, 210 selfloop transitions, 120 changer transitions 0/481 dead transitions. [2022-11-18 20:17:15,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 481 transitions, 2942 flow [2022-11-18 20:17:15,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-18 20:17:15,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-11-18 20:17:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 9612 transitions. [2022-11-18 20:17:15,044 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6490647579174826 [2022-11-18 20:17:15,044 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 9612 transitions. [2022-11-18 20:17:15,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 9612 transitions. [2022-11-18 20:17:15,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:17:15,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 9612 transitions. [2022-11-18 20:17:15,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 162.91525423728814) internal successors, (9612), 59 states have internal predecessors, (9612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:17:15,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 251.0) internal successors, (15060), 60 states have internal predecessors, (15060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:17:15,081 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 251.0) internal successors, (15060), 60 states have internal predecessors, (15060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:17:15,082 INFO L175 Difference]: Start difference. First operand has 337 places, 292 transitions, 1305 flow. Second operand 59 states and 9612 transitions. [2022-11-18 20:17:15,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 481 transitions, 2942 flow [2022-11-18 20:17:15,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 481 transitions, 2885 flow, removed 12 selfloop flow, removed 13 redundant places. [2022-11-18 20:17:15,103 INFO L231 Difference]: Finished difference. Result has 404 places, 378 transitions, 2315 flow [2022-11-18 20:17:15,104 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1266, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=2315, PETRI_PLACES=404, PETRI_TRANSITIONS=378} [2022-11-18 20:17:15,105 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 171 predicate places. [2022-11-18 20:17:15,105 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 378 transitions, 2315 flow [2022-11-18 20:17:15,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 160.14814814814815) internal successors, (12972), 81 states have internal predecessors, (12972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:17:15,108 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:17:15,108 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:17:15,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-18 20:17:15,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 20:17:15,314 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:17:15,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:17:15,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1584996986, now seen corresponding path program 1 times [2022-11-18 20:17:15,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:17:15,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847578758] [2022-11-18 20:17:15,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:17:15,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:17:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:17:16,765 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:17:16,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:17:16,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847578758] [2022-11-18 20:17:16,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847578758] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:17:16,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412487160] [2022-11-18 20:17:16,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:17:16,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:17:16,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:17:16,767 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:17:16,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:17:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:17:16,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-18 20:17:16,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:17:17,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:17:17,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-18 20:17:18,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:17:18,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-18 20:17:18,603 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-18 20:17:18,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-18 20:17:18,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-18 20:17:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:17:18,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:17:19,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:17:19,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-18 20:17:19,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:17:19,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2022-11-18 20:17:19,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-11-18 20:17:19,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-11-18 20:17:19,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:17:19,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2022-11-18 20:17:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:17:20,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412487160] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:17:20,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:17:20,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 50 [2022-11-18 20:17:20,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383481337] [2022-11-18 20:17:20,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:17:20,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-18 20:17:20,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:17:20,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-18 20:17:20,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2276, Unknown=11, NotChecked=0, Total=2550 [2022-11-18 20:17:20,501 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 251 [2022-11-18 20:17:20,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 378 transitions, 2315 flow. Second operand has 51 states, 51 states have (on average 181.07843137254903) internal successors, (9235), 51 states have internal predecessors, (9235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:17:20,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:17:20,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 251 [2022-11-18 20:17:20,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:17:25,410 INFO L130 PetriNetUnfolder]: 1245/7376 cut-off events. [2022-11-18 20:17:25,410 INFO L131 PetriNetUnfolder]: For 4970/4971 co-relation queries the response was YES. [2022-11-18 20:17:25,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14450 conditions, 7376 events. 1245/7376 cut-off events. For 4970/4971 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 66466 event pairs, 392 based on Foata normal form. 22/7035 useless extension candidates. Maximal degree in co-relation 14284. Up to 1126 conditions per place. [2022-11-18 20:17:25,509 INFO L137 encePairwiseOnDemand]: 229/251 looper letters, 196 selfloop transitions, 125 changer transitions 0/515 dead transitions. [2022-11-18 20:17:25,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 515 transitions, 3715 flow [2022-11-18 20:17:25,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-18 20:17:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-11-18 20:17:25,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4819 transitions. [2022-11-18 20:17:25,517 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.738430891817346 [2022-11-18 20:17:25,517 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4819 transitions. [2022-11-18 20:17:25,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4819 transitions. [2022-11-18 20:17:25,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:17:25,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4819 transitions. [2022-11-18 20:17:25,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 185.34615384615384) internal successors, (4819), 26 states have internal predecessors, (4819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:17:25,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 251.0) internal successors, (6777), 27 states have internal predecessors, (6777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:17:25,536 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 251.0) internal successors, (6777), 27 states have internal predecessors, (6777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:17:25,536 INFO L175 Difference]: Start difference. First operand has 404 places, 378 transitions, 2315 flow. Second operand 26 states and 4819 transitions. [2022-11-18 20:17:25,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 515 transitions, 3715 flow [2022-11-18 20:17:25,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 515 transitions, 3192 flow, removed 217 selfloop flow, removed 23 redundant places. [2022-11-18 20:17:25,599 INFO L231 Difference]: Finished difference. Result has 414 places, 428 transitions, 2651 flow [2022-11-18 20:17:25,599 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1861, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2651, PETRI_PLACES=414, PETRI_TRANSITIONS=428} [2022-11-18 20:17:25,600 INFO L288 CegarLoopForPetriNet]: 233 programPoint places, 181 predicate places. [2022-11-18 20:17:25,600 INFO L495 AbstractCegarLoop]: Abstraction has has 414 places, 428 transitions, 2651 flow [2022-11-18 20:17:25,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 181.07843137254903) internal successors, (9235), 51 states have internal predecessors, (9235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:17:25,602 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:17:25,602 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:17:25,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:17:25,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 20:17:25,808 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-18 20:17:25,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:17:25,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1750094602, now seen corresponding path program 1 times [2022-11-18 20:17:25,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:17:25,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067234624] [2022-11-18 20:17:25,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:17:25,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:17:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:17:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:17:29,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:17:29,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067234624] [2022-11-18 20:17:29,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067234624] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:17:29,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119469517] [2022-11-18 20:17:29,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:17:29,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:17:29,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:17:29,770 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:17:29,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f18fad-93ee-4f12-8252-31fd2f9495b1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:17:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:17:29,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-18 20:17:29,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:17:30,131 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:17:30,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 20:17:30,205 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:17:30,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-18 20:17:30,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:17:30,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 20:17:31,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-18 20:17:31,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-18 20:17:32,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:17:32,027 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-18 20:17:32,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-18 20:17:32,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:17:32,363 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:17:32,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-18 20:17:32,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-18 20:17:33,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:17:33,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-18 20:17:33,546 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-18 20:17:33,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-18 20:17:33,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-18 20:17:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:17:33,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:17:36,402 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_485 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int))) (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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_485) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (not (<= v_ArrVal_481 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)))))) is different from false [2022-11-18 20:17:38,923 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_485 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_479) .cse1 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_481) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_485) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_479 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))) is different from false [2022-11-18 20:17:39,078 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_485 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_479) .cse1 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem37#1| 1) v_ArrVal_479) (< (+ (select .cse0 .cse1) 1) v_ArrVal_481) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_485) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-18 20:17:39,128 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_485 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_479) .cse1 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_481) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_485) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ 1 (select .cse0 .cse3)) v_ArrVal_479))))) is different from false [2022-11-18 20:17:40,729 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (v_ArrVal_477 Int) (v_ArrVal_485 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_477)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 .cse3 v_ArrVal_479) .cse1 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_481) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse2 .cse1))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_479) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse4 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_485) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-18 20:17:48,357 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (v_ArrVal_477 Int) (v_ArrVal_485 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_476 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_476))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_477)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_479) .cse1 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_485) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_479) (< (+ (select .cse4 .cse1) 1) v_ArrVal_481))))))) is different from false [2022-11-18 20:17:48,601 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (v_ArrVal_477 Int) (v_ArrVal_485 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_481 Int) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_476))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_477)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_479) .cse1 v_ArrVal_481)) |c_~#stored_elements~0.base| v_ArrVal_483) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse2 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_485) .cse3) 2147483647) (< (+ (select .cse4 .cse1) 1) v_ArrVal_481) (< (+ (select .cse4 .cse3) 1) v_ArrVal_479))))))) is different from false [2022-11-18 20:17:53,630 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:17:53,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 270 treesize of output 185 [2022-11-18 20:17:53,672 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:17:53,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1320 treesize of output 1308 [2022-11-18 20:17:53,713 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 836 treesize of output 772 [2022-11-18 20:17:53,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:17:53,749 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 1138 treesize of output 1090 [2022-11-18 20:17:53,801 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 627 treesize of output 603 [2022-11-18 20:17:53,874 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:17:53,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2022-11-18 20:17:54,781 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:17:54,782 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 677 treesize of output 689 [2022-11-18 20:18:00,061 INFO L321 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2022-11-18 20:18:00,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 80 [2022-11-18 20:18:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-18 20:18:00,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119469517] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:18:00,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:18:00,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 29] total 84 [2022-11-18 20:18:00,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881642072] [2022-11-18 20:18:00,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:18:00,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-11-18 20:18:00,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:18:00,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-11-18 20:18:00,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=5322, Unknown=63, NotChecked=1106, Total=7140 [2022-11-18 20:18:00,207 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 251 [2022-11-18 20:18:00,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 428 transitions, 2651 flow. Second operand has 85 states, 85 states have (on average 163.01176470588234) internal successors, (13856), 85 states have internal predecessors, (13856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:18:00,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:18:00,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 251 [2022-11-18 20:18:00,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand